./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.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.07.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 d7b83251f9a608d2befdac3ab06beaba9889f30d8ab1cb865fc88ebdabcb52dd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:57:27,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:57:27,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:57:28,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:57:28,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:57:28,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:57:28,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:57:28,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:57:28,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:57:28,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:57:28,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:57:28,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:57:28,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:57:28,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:57:28,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:57:28,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:57:28,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:57:28,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:57:28,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:57:28,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:57:28,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:57:28,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:57:28,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:57:28,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:57:28,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:57:28,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:57:28,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:57:28,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:57:28,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:57:28,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:57:28,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:57:28,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:57:28,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:57:28,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:57:28,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:57:28,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:57:28,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:57:28,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:57:28,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:57:28,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:57:28,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:57:28,059 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:57:28,076 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:57:28,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:57:28,082 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:57:28,082 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:57:28,083 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:57:28,083 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:57:28,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:57:28,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:57:28,084 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:57:28,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:57:28,085 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:57:28,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:57:28,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:57:28,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:57:28,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:57:28,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:57:28,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:57:28,086 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:57:28,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:57:28,086 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:57:28,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:57:28,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:57:28,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:57:28,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:57:28,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:28,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:57:28,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:57:28,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:57:28,088 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:57:28,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:57:28,088 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:57:28,088 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:57:28,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:57:28,089 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 -> d7b83251f9a608d2befdac3ab06beaba9889f30d8ab1cb865fc88ebdabcb52dd [2022-02-20 19:57:28,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:57:28,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:57:28,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:57:28,345 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:57:28,346 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:57:28,346 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c [2022-02-20 19:57:28,412 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620e38bd7/b756473114a6457ba23751893be9cf60/FLAG6c526bb0e [2022-02-20 19:57:28,803 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:57:28,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c [2022-02-20 19:57:28,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620e38bd7/b756473114a6457ba23751893be9cf60/FLAG6c526bb0e [2022-02-20 19:57:28,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620e38bd7/b756473114a6457ba23751893be9cf60 [2022-02-20 19:57:28,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:57:28,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:57:28,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:28,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:57:28,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:57:28,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:28" (1/1) ... [2022-02-20 19:57:28,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c754a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:28, skipping insertion in model container [2022-02-20 19:57:28,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:28" (1/1) ... [2022-02-20 19:57:28,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:57:28,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:57:28,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c[914,927] [2022-02-20 19:57:29,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c[7115,7128] [2022-02-20 19:57:29,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:29,085 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:57:29,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c[914,927] [2022-02-20 19:57:29,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c[7115,7128] [2022-02-20 19:57:29,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:29,156 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:57:29,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:29 WrapperNode [2022-02-20 19:57:29,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:29,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:29,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:57:29,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:57:29,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:29" (1/1) ... [2022-02-20 19:57:29,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:29" (1/1) ... [2022-02-20 19:57:29,219 INFO L137 Inliner]: procedures = 67, calls = 79, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 755 [2022-02-20 19:57:29,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:29,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:57:29,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:57:29,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:57:29,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:29" (1/1) ... [2022-02-20 19:57:29,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:29" (1/1) ... [2022-02-20 19:57:29,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:29" (1/1) ... [2022-02-20 19:57:29,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:29" (1/1) ... [2022-02-20 19:57:29,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:29" (1/1) ... [2022-02-20 19:57:29,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:29" (1/1) ... [2022-02-20 19:57:29,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:29" (1/1) ... [2022-02-20 19:57:29,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:57:29,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:57:29,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:57:29,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:57:29,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:29" (1/1) ... [2022-02-20 19:57:29,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:29,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:57:29,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:57:29,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:57:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:57:29,447 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:57:29,447 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:57:29,447 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:57:29,447 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:57:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:57:29,450 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:57:29,451 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:57:29,451 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:57:29,451 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:57:29,452 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:57:29,452 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:57:29,452 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:57:29,452 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:57:29,452 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:57:29,452 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:57:29,453 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:57:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:57:29,453 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:57:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:57:29,453 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:57:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:57:29,453 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:57:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:57:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:57:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:57:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:57:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:57:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:57:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:57:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:57:29,455 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:57:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:57:29,455 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:57:29,548 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:57:29,549 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:57:30,276 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:57:30,293 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:57:30,293 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 19:57:30,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:30 BoogieIcfgContainer [2022-02-20 19:57:30,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:57:30,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:57:30,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:57:30,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:57:30,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:57:28" (1/3) ... [2022-02-20 19:57:30,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372db7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:30, skipping insertion in model container [2022-02-20 19:57:30,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:29" (2/3) ... [2022-02-20 19:57:30,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372db7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:30, skipping insertion in model container [2022-02-20 19:57:30,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:30" (3/3) ... [2022-02-20 19:57:30,302 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.07.cil-2.c [2022-02-20 19:57:30,305 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:57:30,305 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:57:30,339 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:57:30,343 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:57:30,344 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:57:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 366 states, 311 states have (on average 1.6205787781350482) internal successors, (504), 319 states have internal predecessors, (504), 37 states have call successors, (37), 15 states have call predecessors, (37), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-20 19:57:30,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:30,370 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:30,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:30,371 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:30,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:30,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1360309696, now seen corresponding path program 1 times [2022-02-20 19:57:30,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:30,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235195557] [2022-02-20 19:57:30,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:30,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {409#(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); {369#true} is VALID [2022-02-20 19:57:30,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#true} assume true; {369#true} is VALID [2022-02-20 19:57:30,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {369#true} {371#(= ~p_dw_i~0 1)} #1353#return; {371#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:57:30,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {410#(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; {369#true} is VALID [2022-02-20 19:57:30,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {369#true} is VALID [2022-02-20 19:57:30,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {369#true} assume true; {369#true} is VALID [2022-02-20 19:57:30,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {369#true} {370#false} #1355#return; {370#false} is VALID [2022-02-20 19:57:30,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {369#true} havoc ~__retres1~0; {369#true} is VALID [2022-02-20 19:57:30,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#true} assume 1 == ~p_dw_pc~0; {369#true} is VALID [2022-02-20 19:57:30,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {369#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {369#true} is VALID [2022-02-20 19:57:30,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {369#true} #res := ~__retres1~0; {369#true} is VALID [2022-02-20 19:57:30,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {369#true} assume true; {369#true} is VALID [2022-02-20 19:57:30,568 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {369#true} {369#true} #1349#return; {369#true} is VALID [2022-02-20 19:57:30,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {369#true} havoc ~__retres1~1; {369#true} is VALID [2022-02-20 19:57:30,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#true} assume 1 == ~c_dr_pc~0; {369#true} is VALID [2022-02-20 19:57:30,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {369#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {369#true} is VALID [2022-02-20 19:57:30,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {369#true} #res := ~__retres1~1; {369#true} is VALID [2022-02-20 19:57:30,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {369#true} assume true; {369#true} is VALID [2022-02-20 19:57:30,572 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {369#true} {369#true} #1351#return; {369#true} is VALID [2022-02-20 19:57:30,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {411#(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; {369#true} is VALID [2022-02-20 19:57:30,573 INFO L272 TraceCheckUtils]: 1: Hoare triple {369#true} call #t~ret8 := is_do_write_p_triggered(); {369#true} is VALID [2022-02-20 19:57:30,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {369#true} havoc ~__retres1~0; {369#true} is VALID [2022-02-20 19:57:30,574 INFO L290 TraceCheckUtils]: 3: Hoare triple {369#true} assume 1 == ~p_dw_pc~0; {369#true} is VALID [2022-02-20 19:57:30,574 INFO L290 TraceCheckUtils]: 4: Hoare triple {369#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {369#true} is VALID [2022-02-20 19:57:30,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {369#true} #res := ~__retres1~0; {369#true} is VALID [2022-02-20 19:57:30,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {369#true} assume true; {369#true} is VALID [2022-02-20 19:57:30,575 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {369#true} {369#true} #1349#return; {369#true} is VALID [2022-02-20 19:57:30,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {369#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {369#true} is VALID [2022-02-20 19:57:30,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {369#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {369#true} is VALID [2022-02-20 19:57:30,576 INFO L272 TraceCheckUtils]: 10: Hoare triple {369#true} call #t~ret9 := is_do_read_c_triggered(); {369#true} is VALID [2022-02-20 19:57:30,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {369#true} havoc ~__retres1~1; {369#true} is VALID [2022-02-20 19:57:30,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {369#true} assume 1 == ~c_dr_pc~0; {369#true} is VALID [2022-02-20 19:57:30,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {369#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {369#true} is VALID [2022-02-20 19:57:30,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {369#true} #res := ~__retres1~1; {369#true} is VALID [2022-02-20 19:57:30,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {369#true} assume true; {369#true} is VALID [2022-02-20 19:57:30,577 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {369#true} {369#true} #1351#return; {369#true} is VALID [2022-02-20 19:57:30,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {369#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {369#true} is VALID [2022-02-20 19:57:30,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {369#true} assume !(0 != ~tmp___0~1); {369#true} is VALID [2022-02-20 19:57:30,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {369#true} assume true; {369#true} is VALID [2022-02-20 19:57:30,580 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {369#true} {370#false} #1357#return; {370#false} is VALID [2022-02-20 19:57:30,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {410#(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; {369#true} is VALID [2022-02-20 19:57:30,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {369#true} is VALID [2022-02-20 19:57:30,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {369#true} assume true; {369#true} is VALID [2022-02-20 19:57:30,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {369#true} {370#false} #1359#return; {370#false} is VALID [2022-02-20 19:57:30,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {369#true} havoc ~__retres1~2; {369#true} is VALID [2022-02-20 19:57:30,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {369#true} is VALID [2022-02-20 19:57:30,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {369#true} #res := ~__retres1~2; {369#true} is VALID [2022-02-20 19:57:30,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {369#true} assume true; {369#true} is VALID [2022-02-20 19:57:30,608 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {369#true} {370#false} #1361#return; {370#false} is VALID [2022-02-20 19:57:30,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {369#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {369#true} is VALID [2022-02-20 19:57:30,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {369#true} is VALID [2022-02-20 19:57:30,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {369#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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; {371#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:57:30,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {371#(= ~p_dw_i~0 1)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {371#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:57:30,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {371#(= ~p_dw_i~0 1)} call update_channels1(); {409#(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:30,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {409#(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); {369#true} is VALID [2022-02-20 19:57:30,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {369#true} assume true; {369#true} is VALID [2022-02-20 19:57:30,612 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {369#true} {371#(= ~p_dw_i~0 1)} #1353#return; {371#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:57:30,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#(= ~p_dw_i~0 1)} assume { :begin_inline_init_threads1 } true; {371#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:57:30,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {371#(= ~p_dw_i~0 1)} assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; {370#false} is VALID [2022-02-20 19:57:30,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {370#false} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {370#false} is VALID [2022-02-20 19:57:30,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {370#false} assume { :end_inline_init_threads1 } true; {370#false} is VALID [2022-02-20 19:57:30,613 INFO L272 TraceCheckUtils]: 12: Hoare triple {370#false} call fire_delta_events1(); {410#(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:30,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {410#(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; {369#true} is VALID [2022-02-20 19:57:30,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {369#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {369#true} is VALID [2022-02-20 19:57:30,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {369#true} assume true; {369#true} is VALID [2022-02-20 19:57:30,614 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {369#true} {370#false} #1355#return; {370#false} is VALID [2022-02-20 19:57:30,614 INFO L272 TraceCheckUtils]: 17: Hoare triple {370#false} call activate_threads1(); {411#(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:30,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {411#(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; {369#true} is VALID [2022-02-20 19:57:30,614 INFO L272 TraceCheckUtils]: 19: Hoare triple {369#true} call #t~ret8 := is_do_write_p_triggered(); {369#true} is VALID [2022-02-20 19:57:30,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {369#true} havoc ~__retres1~0; {369#true} is VALID [2022-02-20 19:57:30,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {369#true} assume 1 == ~p_dw_pc~0; {369#true} is VALID [2022-02-20 19:57:30,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {369#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {369#true} is VALID [2022-02-20 19:57:30,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {369#true} #res := ~__retres1~0; {369#true} is VALID [2022-02-20 19:57:30,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {369#true} assume true; {369#true} is VALID [2022-02-20 19:57:30,616 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {369#true} {369#true} #1349#return; {369#true} is VALID [2022-02-20 19:57:30,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {369#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {369#true} is VALID [2022-02-20 19:57:30,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {369#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {369#true} is VALID [2022-02-20 19:57:30,616 INFO L272 TraceCheckUtils]: 28: Hoare triple {369#true} call #t~ret9 := is_do_read_c_triggered(); {369#true} is VALID [2022-02-20 19:57:30,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {369#true} havoc ~__retres1~1; {369#true} is VALID [2022-02-20 19:57:30,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {369#true} assume 1 == ~c_dr_pc~0; {369#true} is VALID [2022-02-20 19:57:30,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {369#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {369#true} is VALID [2022-02-20 19:57:30,617 INFO L290 TraceCheckUtils]: 32: Hoare triple {369#true} #res := ~__retres1~1; {369#true} is VALID [2022-02-20 19:57:30,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {369#true} assume true; {369#true} is VALID [2022-02-20 19:57:30,617 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {369#true} {369#true} #1351#return; {369#true} is VALID [2022-02-20 19:57:30,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {369#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {369#true} is VALID [2022-02-20 19:57:30,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {369#true} assume !(0 != ~tmp___0~1); {369#true} is VALID [2022-02-20 19:57:30,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {369#true} assume true; {369#true} is VALID [2022-02-20 19:57:30,618 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {369#true} {370#false} #1357#return; {370#false} is VALID [2022-02-20 19:57:30,618 INFO L272 TraceCheckUtils]: 39: Hoare triple {370#false} call reset_delta_events1(); {410#(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:30,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {410#(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; {369#true} is VALID [2022-02-20 19:57:30,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {369#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {369#true} is VALID [2022-02-20 19:57:30,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {369#true} assume true; {369#true} is VALID [2022-02-20 19:57:30,619 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {369#true} {370#false} #1359#return; {370#false} is VALID [2022-02-20 19:57:30,619 INFO L290 TraceCheckUtils]: 44: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-02-20 19:57:30,619 INFO L290 TraceCheckUtils]: 45: Hoare triple {370#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; {370#false} is VALID [2022-02-20 19:57:30,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-02-20 19:57:30,620 INFO L272 TraceCheckUtils]: 47: Hoare triple {370#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {369#true} is VALID [2022-02-20 19:57:30,620 INFO L290 TraceCheckUtils]: 48: Hoare triple {369#true} havoc ~__retres1~2; {369#true} is VALID [2022-02-20 19:57:30,620 INFO L290 TraceCheckUtils]: 49: Hoare triple {369#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {369#true} is VALID [2022-02-20 19:57:30,620 INFO L290 TraceCheckUtils]: 50: Hoare triple {369#true} #res := ~__retres1~2; {369#true} is VALID [2022-02-20 19:57:30,620 INFO L290 TraceCheckUtils]: 51: Hoare triple {369#true} assume true; {369#true} is VALID [2022-02-20 19:57:30,621 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {369#true} {370#false} #1361#return; {370#false} is VALID [2022-02-20 19:57:30,621 INFO L290 TraceCheckUtils]: 53: Hoare triple {370#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; {370#false} is VALID [2022-02-20 19:57:30,621 INFO L290 TraceCheckUtils]: 54: Hoare triple {370#false} assume 0 != eval1_~tmp___1~0#1; {370#false} is VALID [2022-02-20 19:57:30,621 INFO L290 TraceCheckUtils]: 55: Hoare triple {370#false} assume !(0 == ~p_dw_st~0); {370#false} is VALID [2022-02-20 19:57:30,621 INFO L290 TraceCheckUtils]: 56: Hoare triple {370#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; {370#false} is VALID [2022-02-20 19:57:30,622 INFO L290 TraceCheckUtils]: 57: Hoare triple {370#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; {370#false} is VALID [2022-02-20 19:57:30,622 INFO L290 TraceCheckUtils]: 58: Hoare triple {370#false} assume !(0 == ~c_dr_pc~0); {370#false} is VALID [2022-02-20 19:57:30,622 INFO L290 TraceCheckUtils]: 59: Hoare triple {370#false} assume 1 == ~c_dr_pc~0; {370#false} is VALID [2022-02-20 19:57:30,622 INFO L290 TraceCheckUtils]: 60: Hoare triple {370#false} do_read_c_~a~0#1 := ~a_t~0; {370#false} is VALID [2022-02-20 19:57:30,622 INFO L290 TraceCheckUtils]: 61: Hoare triple {370#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; {370#false} is VALID [2022-02-20 19:57:30,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {370#false} assume !(~p_last_write~0 == ~c_last_read~0); {370#false} is VALID [2022-02-20 19:57:30,623 INFO L272 TraceCheckUtils]: 63: Hoare triple {370#false} call error1(); {370#false} is VALID [2022-02-20 19:57:30,623 INFO L290 TraceCheckUtils]: 64: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-02-20 19:57:30,624 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:30,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:30,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235195557] [2022-02-20 19:57:30,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235195557] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:30,625 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:30,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:30,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429617850] [2022-02-20 19:57:30,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:30,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:30,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:30,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:30,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:30,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:30,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:30,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:30,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:30,712 INFO L87 Difference]: Start difference. First operand has 366 states, 311 states have (on average 1.6205787781350482) internal successors, (504), 319 states have internal predecessors, (504), 37 states have call successors, (37), 15 states have call predecessors, (37), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:32,421 INFO L93 Difference]: Finished difference Result 727 states and 1147 transitions. [2022-02-20 19:57:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 19:57:32,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:32,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:32,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1147 transitions. [2022-02-20 19:57:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1147 transitions. [2022-02-20 19:57:32,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1147 transitions. [2022-02-20 19:57:33,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1147 edges. 1147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:33,245 INFO L225 Difference]: With dead ends: 727 [2022-02-20 19:57:33,245 INFO L226 Difference]: Without dead ends: 373 [2022-02-20 19:57:33,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:57:33,250 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 549 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:33,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [559 Valid, 1489 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:57:33,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-02-20 19:57:33,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 355. [2022-02-20 19:57:33,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:33,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 373 states. Second operand has 355 states, 303 states have (on average 1.528052805280528) internal successors, (463), 308 states have internal predecessors, (463), 37 states have call successors, (37), 15 states have call predecessors, (37), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:57:33,290 INFO L74 IsIncluded]: Start isIncluded. First operand 373 states. Second operand has 355 states, 303 states have (on average 1.528052805280528) internal successors, (463), 308 states have internal predecessors, (463), 37 states have call successors, (37), 15 states have call predecessors, (37), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:57:33,292 INFO L87 Difference]: Start difference. First operand 373 states. Second operand has 355 states, 303 states have (on average 1.528052805280528) internal successors, (463), 308 states have internal predecessors, (463), 37 states have call successors, (37), 15 states have call predecessors, (37), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:57:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:33,308 INFO L93 Difference]: Finished difference Result 373 states and 561 transitions. [2022-02-20 19:57:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 561 transitions. [2022-02-20 19:57:33,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:33,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:33,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 303 states have (on average 1.528052805280528) internal successors, (463), 308 states have internal predecessors, (463), 37 states have call successors, (37), 15 states have call predecessors, (37), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 373 states. [2022-02-20 19:57:33,313 INFO L87 Difference]: Start difference. First operand has 355 states, 303 states have (on average 1.528052805280528) internal successors, (463), 308 states have internal predecessors, (463), 37 states have call successors, (37), 15 states have call predecessors, (37), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 373 states. [2022-02-20 19:57:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:33,328 INFO L93 Difference]: Finished difference Result 373 states and 561 transitions. [2022-02-20 19:57:33,328 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 561 transitions. [2022-02-20 19:57:33,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:33,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:33,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:33,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 303 states have (on average 1.528052805280528) internal successors, (463), 308 states have internal predecessors, (463), 37 states have call successors, (37), 15 states have call predecessors, (37), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:57:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 533 transitions. [2022-02-20 19:57:33,346 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 533 transitions. Word has length 65 [2022-02-20 19:57:33,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:33,346 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 533 transitions. [2022-02-20 19:57:33,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:33,347 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 533 transitions. [2022-02-20 19:57:33,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:33,348 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:33,348 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:33,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:57:33,348 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:33,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:33,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1400984446, now seen corresponding path program 1 times [2022-02-20 19:57:33,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:33,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468374193] [2022-02-20 19:57:33,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:33,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {2664#(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); {2665#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:33,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {2665#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {2665#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:33,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2665#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {2626#(= ~q_read_ev~0 2)} #1353#return; {2626#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:33,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {2666#(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; {2667#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:33,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {2667#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2667#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:33,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {2667#(= |old(~q_read_ev~0)| 0)} assume true; {2667#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:33,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2667#(= |old(~q_read_ev~0)| 0)} {2626#(= ~q_read_ev~0 2)} #1355#return; {2625#false} is VALID [2022-02-20 19:57:33,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {2624#true} havoc ~__retres1~0; {2624#true} is VALID [2022-02-20 19:57:33,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {2624#true} assume 1 == ~p_dw_pc~0; {2624#true} is VALID [2022-02-20 19:57:33,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {2624#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {2624#true} is VALID [2022-02-20 19:57:33,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {2624#true} #res := ~__retres1~0; {2624#true} is VALID [2022-02-20 19:57:33,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {2624#true} assume true; {2624#true} is VALID [2022-02-20 19:57:33,440 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2624#true} {2624#true} #1349#return; {2624#true} is VALID [2022-02-20 19:57:33,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {2624#true} havoc ~__retres1~1; {2624#true} is VALID [2022-02-20 19:57:33,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {2624#true} assume 1 == ~c_dr_pc~0; {2624#true} is VALID [2022-02-20 19:57:33,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {2624#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2624#true} is VALID [2022-02-20 19:57:33,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {2624#true} #res := ~__retres1~1; {2624#true} is VALID [2022-02-20 19:57:33,443 INFO L290 TraceCheckUtils]: 4: Hoare triple {2624#true} assume true; {2624#true} is VALID [2022-02-20 19:57:33,443 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2624#true} {2624#true} #1351#return; {2624#true} is VALID [2022-02-20 19:57:33,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {2668#(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; {2624#true} is VALID [2022-02-20 19:57:33,444 INFO L272 TraceCheckUtils]: 1: Hoare triple {2624#true} call #t~ret8 := is_do_write_p_triggered(); {2624#true} is VALID [2022-02-20 19:57:33,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {2624#true} havoc ~__retres1~0; {2624#true} is VALID [2022-02-20 19:57:33,444 INFO L290 TraceCheckUtils]: 3: Hoare triple {2624#true} assume 1 == ~p_dw_pc~0; {2624#true} is VALID [2022-02-20 19:57:33,444 INFO L290 TraceCheckUtils]: 4: Hoare triple {2624#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {2624#true} is VALID [2022-02-20 19:57:33,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {2624#true} #res := ~__retres1~0; {2624#true} is VALID [2022-02-20 19:57:33,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {2624#true} assume true; {2624#true} is VALID [2022-02-20 19:57:33,445 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2624#true} {2624#true} #1349#return; {2624#true} is VALID [2022-02-20 19:57:33,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {2624#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2624#true} is VALID [2022-02-20 19:57:33,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {2624#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2624#true} is VALID [2022-02-20 19:57:33,445 INFO L272 TraceCheckUtils]: 10: Hoare triple {2624#true} call #t~ret9 := is_do_read_c_triggered(); {2624#true} is VALID [2022-02-20 19:57:33,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {2624#true} havoc ~__retres1~1; {2624#true} is VALID [2022-02-20 19:57:33,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {2624#true} assume 1 == ~c_dr_pc~0; {2624#true} is VALID [2022-02-20 19:57:33,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {2624#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2624#true} is VALID [2022-02-20 19:57:33,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {2624#true} #res := ~__retres1~1; {2624#true} is VALID [2022-02-20 19:57:33,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {2624#true} assume true; {2624#true} is VALID [2022-02-20 19:57:33,446 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2624#true} {2624#true} #1351#return; {2624#true} is VALID [2022-02-20 19:57:33,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {2624#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2624#true} is VALID [2022-02-20 19:57:33,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {2624#true} assume !(0 != ~tmp___0~1); {2624#true} is VALID [2022-02-20 19:57:33,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {2624#true} assume true; {2624#true} is VALID [2022-02-20 19:57:33,447 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2624#true} {2625#false} #1357#return; {2625#false} is VALID [2022-02-20 19:57:33,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {2666#(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; {2624#true} is VALID [2022-02-20 19:57:33,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {2624#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2624#true} is VALID [2022-02-20 19:57:33,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {2624#true} assume true; {2624#true} is VALID [2022-02-20 19:57:33,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2624#true} {2625#false} #1359#return; {2625#false} is VALID [2022-02-20 19:57:33,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {2624#true} havoc ~__retres1~2; {2624#true} is VALID [2022-02-20 19:57:33,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {2624#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2624#true} is VALID [2022-02-20 19:57:33,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {2624#true} #res := ~__retres1~2; {2624#true} is VALID [2022-02-20 19:57:33,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {2624#true} assume true; {2624#true} is VALID [2022-02-20 19:57:33,454 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2624#true} {2625#false} #1361#return; {2625#false} is VALID [2022-02-20 19:57:33,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {2624#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {2624#true} is VALID [2022-02-20 19:57:33,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {2624#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {2624#true} is VALID [2022-02-20 19:57:33,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {2624#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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; {2626#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:33,456 INFO L290 TraceCheckUtils]: 3: Hoare triple {2626#(= ~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; {2626#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:33,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {2626#(= ~q_read_ev~0 2)} call update_channels1(); {2664#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:33,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {2664#(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); {2665#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:33,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {2665#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {2665#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:33,457 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2665#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {2626#(= ~q_read_ev~0 2)} #1353#return; {2626#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:33,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {2626#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {2626#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:33,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {2626#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2626#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:33,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {2626#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2626#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:33,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {2626#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {2626#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:33,459 INFO L272 TraceCheckUtils]: 12: Hoare triple {2626#(= ~q_read_ev~0 2)} call fire_delta_events1(); {2666#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:33,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {2666#(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; {2667#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:33,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {2667#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2667#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:33,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {2667#(= |old(~q_read_ev~0)| 0)} assume true; {2667#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:33,461 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2667#(= |old(~q_read_ev~0)| 0)} {2626#(= ~q_read_ev~0 2)} #1355#return; {2625#false} is VALID [2022-02-20 19:57:33,461 INFO L272 TraceCheckUtils]: 17: Hoare triple {2625#false} call activate_threads1(); {2668#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:33,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {2668#(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; {2624#true} is VALID [2022-02-20 19:57:33,461 INFO L272 TraceCheckUtils]: 19: Hoare triple {2624#true} call #t~ret8 := is_do_write_p_triggered(); {2624#true} is VALID [2022-02-20 19:57:33,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {2624#true} havoc ~__retres1~0; {2624#true} is VALID [2022-02-20 19:57:33,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {2624#true} assume 1 == ~p_dw_pc~0; {2624#true} is VALID [2022-02-20 19:57:33,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {2624#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {2624#true} is VALID [2022-02-20 19:57:33,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {2624#true} #res := ~__retres1~0; {2624#true} is VALID [2022-02-20 19:57:33,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {2624#true} assume true; {2624#true} is VALID [2022-02-20 19:57:33,462 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2624#true} {2624#true} #1349#return; {2624#true} is VALID [2022-02-20 19:57:33,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {2624#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2624#true} is VALID [2022-02-20 19:57:33,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {2624#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2624#true} is VALID [2022-02-20 19:57:33,463 INFO L272 TraceCheckUtils]: 28: Hoare triple {2624#true} call #t~ret9 := is_do_read_c_triggered(); {2624#true} is VALID [2022-02-20 19:57:33,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {2624#true} havoc ~__retres1~1; {2624#true} is VALID [2022-02-20 19:57:33,463 INFO L290 TraceCheckUtils]: 30: Hoare triple {2624#true} assume 1 == ~c_dr_pc~0; {2624#true} is VALID [2022-02-20 19:57:33,463 INFO L290 TraceCheckUtils]: 31: Hoare triple {2624#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2624#true} is VALID [2022-02-20 19:57:33,463 INFO L290 TraceCheckUtils]: 32: Hoare triple {2624#true} #res := ~__retres1~1; {2624#true} is VALID [2022-02-20 19:57:33,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {2624#true} assume true; {2624#true} is VALID [2022-02-20 19:57:33,463 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2624#true} {2624#true} #1351#return; {2624#true} is VALID [2022-02-20 19:57:33,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {2624#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2624#true} is VALID [2022-02-20 19:57:33,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {2624#true} assume !(0 != ~tmp___0~1); {2624#true} is VALID [2022-02-20 19:57:33,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {2624#true} assume true; {2624#true} is VALID [2022-02-20 19:57:33,464 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2624#true} {2625#false} #1357#return; {2625#false} is VALID [2022-02-20 19:57:33,464 INFO L272 TraceCheckUtils]: 39: Hoare triple {2625#false} call reset_delta_events1(); {2666#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:33,464 INFO L290 TraceCheckUtils]: 40: Hoare triple {2666#(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; {2624#true} is VALID [2022-02-20 19:57:33,465 INFO L290 TraceCheckUtils]: 41: Hoare triple {2624#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2624#true} is VALID [2022-02-20 19:57:33,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {2624#true} assume true; {2624#true} is VALID [2022-02-20 19:57:33,465 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2624#true} {2625#false} #1359#return; {2625#false} is VALID [2022-02-20 19:57:33,465 INFO L290 TraceCheckUtils]: 44: Hoare triple {2625#false} assume !false; {2625#false} is VALID [2022-02-20 19:57:33,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {2625#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; {2625#false} is VALID [2022-02-20 19:57:33,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {2625#false} assume !false; {2625#false} is VALID [2022-02-20 19:57:33,465 INFO L272 TraceCheckUtils]: 47: Hoare triple {2625#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2624#true} is VALID [2022-02-20 19:57:33,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {2624#true} havoc ~__retres1~2; {2624#true} is VALID [2022-02-20 19:57:33,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {2624#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2624#true} is VALID [2022-02-20 19:57:33,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {2624#true} #res := ~__retres1~2; {2624#true} is VALID [2022-02-20 19:57:33,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {2624#true} assume true; {2624#true} is VALID [2022-02-20 19:57:33,466 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2624#true} {2625#false} #1361#return; {2625#false} is VALID [2022-02-20 19:57:33,466 INFO L290 TraceCheckUtils]: 53: Hoare triple {2625#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; {2625#false} is VALID [2022-02-20 19:57:33,466 INFO L290 TraceCheckUtils]: 54: Hoare triple {2625#false} assume 0 != eval1_~tmp___1~0#1; {2625#false} is VALID [2022-02-20 19:57:33,467 INFO L290 TraceCheckUtils]: 55: Hoare triple {2625#false} assume !(0 == ~p_dw_st~0); {2625#false} is VALID [2022-02-20 19:57:33,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {2625#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; {2625#false} is VALID [2022-02-20 19:57:33,467 INFO L290 TraceCheckUtils]: 57: Hoare triple {2625#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; {2625#false} is VALID [2022-02-20 19:57:33,467 INFO L290 TraceCheckUtils]: 58: Hoare triple {2625#false} assume !(0 == ~c_dr_pc~0); {2625#false} is VALID [2022-02-20 19:57:33,467 INFO L290 TraceCheckUtils]: 59: Hoare triple {2625#false} assume 1 == ~c_dr_pc~0; {2625#false} is VALID [2022-02-20 19:57:33,467 INFO L290 TraceCheckUtils]: 60: Hoare triple {2625#false} do_read_c_~a~0#1 := ~a_t~0; {2625#false} is VALID [2022-02-20 19:57:33,468 INFO L290 TraceCheckUtils]: 61: Hoare triple {2625#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; {2625#false} is VALID [2022-02-20 19:57:33,468 INFO L290 TraceCheckUtils]: 62: Hoare triple {2625#false} assume !(~p_last_write~0 == ~c_last_read~0); {2625#false} is VALID [2022-02-20 19:57:33,468 INFO L272 TraceCheckUtils]: 63: Hoare triple {2625#false} call error1(); {2625#false} is VALID [2022-02-20 19:57:33,468 INFO L290 TraceCheckUtils]: 64: Hoare triple {2625#false} assume !false; {2625#false} is VALID [2022-02-20 19:57:33,468 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:33,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:33,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468374193] [2022-02-20 19:57:33,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468374193] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:33,469 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:33,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:33,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752415091] [2022-02-20 19:57:33,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:33,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:33,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:33,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:33,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:33,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:33,509 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:33,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:33,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:33,510 INFO L87 Difference]: Start difference. First operand 355 states and 533 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:35,827 INFO L93 Difference]: Finished difference Result 578 states and 847 transitions. [2022-02-20 19:57:35,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:57:35,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:35,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 847 transitions. [2022-02-20 19:57:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 847 transitions. [2022-02-20 19:57:35,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 847 transitions. [2022-02-20 19:57:36,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 847 edges. 847 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:36,479 INFO L225 Difference]: With dead ends: 578 [2022-02-20 19:57:36,480 INFO L226 Difference]: Without dead ends: 490 [2022-02-20 19:57:36,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:57:36,481 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 643 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:36,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [648 Valid, 1772 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:36,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-02-20 19:57:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 451. [2022-02-20 19:57:36,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:36,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 490 states. Second operand has 451 states, 379 states have (on average 1.4960422163588392) internal successors, (567), 386 states have internal predecessors, (567), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:57:36,510 INFO L74 IsIncluded]: Start isIncluded. First operand 490 states. Second operand has 451 states, 379 states have (on average 1.4960422163588392) internal successors, (567), 386 states have internal predecessors, (567), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:57:36,511 INFO L87 Difference]: Start difference. First operand 490 states. Second operand has 451 states, 379 states have (on average 1.4960422163588392) internal successors, (567), 386 states have internal predecessors, (567), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:57:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:36,529 INFO L93 Difference]: Finished difference Result 490 states and 718 transitions. [2022-02-20 19:57:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 718 transitions. [2022-02-20 19:57:36,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:36,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:36,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 451 states, 379 states have (on average 1.4960422163588392) internal successors, (567), 386 states have internal predecessors, (567), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) Second operand 490 states. [2022-02-20 19:57:36,533 INFO L87 Difference]: Start difference. First operand has 451 states, 379 states have (on average 1.4960422163588392) internal successors, (567), 386 states have internal predecessors, (567), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) Second operand 490 states. [2022-02-20 19:57:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:36,573 INFO L93 Difference]: Finished difference Result 490 states and 718 transitions. [2022-02-20 19:57:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 718 transitions. [2022-02-20 19:57:36,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:36,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:36,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:36,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 379 states have (on average 1.4960422163588392) internal successors, (567), 386 states have internal predecessors, (567), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:57:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 664 transitions. [2022-02-20 19:57:36,592 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 664 transitions. Word has length 65 [2022-02-20 19:57:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:36,593 INFO L470 AbstractCegarLoop]: Abstraction has 451 states and 664 transitions. [2022-02-20 19:57:36,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 664 transitions. [2022-02-20 19:57:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:36,594 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:36,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:36,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:57:36,595 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:36,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:36,595 INFO L85 PathProgramCache]: Analyzing trace with hash -997198495, now seen corresponding path program 1 times [2022-02-20 19:57:36,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:36,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132111869] [2022-02-20 19:57:36,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:36,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:36,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:36,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {5104#(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); {5105#(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:36,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {5105#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {5105#(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:36,673 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5105#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {5066#(= ~q_write_ev~0 ~q_read_ev~0)} #1353#return; {5066#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:36,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:36,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {5105#(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); {5106#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:36,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {5106#(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; {5107#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:36,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {5107#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {5107#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:36,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5107#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {5066#(= ~q_write_ev~0 ~q_read_ev~0)} #1355#return; {5065#false} is VALID [2022-02-20 19:57:36,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:36,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:36,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {5064#true} havoc ~__retres1~0; {5064#true} is VALID [2022-02-20 19:57:36,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {5064#true} assume !(1 == ~p_dw_pc~0); {5064#true} is VALID [2022-02-20 19:57:36,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {5064#true} ~__retres1~0 := 0; {5064#true} is VALID [2022-02-20 19:57:36,728 INFO L290 TraceCheckUtils]: 3: Hoare triple {5064#true} #res := ~__retres1~0; {5064#true} is VALID [2022-02-20 19:57:36,728 INFO L290 TraceCheckUtils]: 4: Hoare triple {5064#true} assume true; {5064#true} is VALID [2022-02-20 19:57:36,728 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5064#true} {5064#true} #1349#return; {5064#true} is VALID [2022-02-20 19:57:36,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:36,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {5064#true} havoc ~__retres1~1; {5064#true} is VALID [2022-02-20 19:57:36,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {5064#true} assume 1 == ~c_dr_pc~0; {5064#true} is VALID [2022-02-20 19:57:36,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {5064#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {5064#true} is VALID [2022-02-20 19:57:36,731 INFO L290 TraceCheckUtils]: 3: Hoare triple {5064#true} #res := ~__retres1~1; {5064#true} is VALID [2022-02-20 19:57:36,731 INFO L290 TraceCheckUtils]: 4: Hoare triple {5064#true} assume true; {5064#true} is VALID [2022-02-20 19:57:36,731 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5064#true} {5064#true} #1351#return; {5064#true} is VALID [2022-02-20 19:57:36,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {5108#(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; {5064#true} is VALID [2022-02-20 19:57:36,732 INFO L272 TraceCheckUtils]: 1: Hoare triple {5064#true} call #t~ret8 := is_do_write_p_triggered(); {5064#true} is VALID [2022-02-20 19:57:36,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {5064#true} havoc ~__retres1~0; {5064#true} is VALID [2022-02-20 19:57:36,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {5064#true} assume !(1 == ~p_dw_pc~0); {5064#true} is VALID [2022-02-20 19:57:36,732 INFO L290 TraceCheckUtils]: 4: Hoare triple {5064#true} ~__retres1~0 := 0; {5064#true} is VALID [2022-02-20 19:57:36,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {5064#true} #res := ~__retres1~0; {5064#true} is VALID [2022-02-20 19:57:36,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {5064#true} assume true; {5064#true} is VALID [2022-02-20 19:57:36,732 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5064#true} {5064#true} #1349#return; {5064#true} is VALID [2022-02-20 19:57:36,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {5064#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5064#true} is VALID [2022-02-20 19:57:36,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {5064#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5064#true} is VALID [2022-02-20 19:57:36,733 INFO L272 TraceCheckUtils]: 10: Hoare triple {5064#true} call #t~ret9 := is_do_read_c_triggered(); {5064#true} is VALID [2022-02-20 19:57:36,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {5064#true} havoc ~__retres1~1; {5064#true} is VALID [2022-02-20 19:57:36,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {5064#true} assume 1 == ~c_dr_pc~0; {5064#true} is VALID [2022-02-20 19:57:36,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {5064#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {5064#true} is VALID [2022-02-20 19:57:36,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {5064#true} #res := ~__retres1~1; {5064#true} is VALID [2022-02-20 19:57:36,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {5064#true} assume true; {5064#true} is VALID [2022-02-20 19:57:36,734 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5064#true} {5064#true} #1351#return; {5064#true} is VALID [2022-02-20 19:57:36,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {5064#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5064#true} is VALID [2022-02-20 19:57:36,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {5064#true} assume !(0 != ~tmp___0~1); {5064#true} is VALID [2022-02-20 19:57:36,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {5064#true} assume true; {5064#true} is VALID [2022-02-20 19:57:36,734 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5064#true} {5065#false} #1357#return; {5065#false} is VALID [2022-02-20 19:57:36,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:36,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {5105#(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); {5064#true} is VALID [2022-02-20 19:57:36,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {5064#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5064#true} is VALID [2022-02-20 19:57:36,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {5064#true} assume true; {5064#true} is VALID [2022-02-20 19:57:36,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5064#true} {5065#false} #1359#return; {5065#false} is VALID [2022-02-20 19:57:36,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:36,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {5064#true} havoc ~__retres1~2; {5064#true} is VALID [2022-02-20 19:57:36,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {5064#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5064#true} is VALID [2022-02-20 19:57:36,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {5064#true} #res := ~__retres1~2; {5064#true} is VALID [2022-02-20 19:57:36,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {5064#true} assume true; {5064#true} is VALID [2022-02-20 19:57:36,756 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5064#true} {5065#false} #1361#return; {5065#false} is VALID [2022-02-20 19:57:36,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {5064#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {5064#true} is VALID [2022-02-20 19:57:36,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {5064#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {5064#true} is VALID [2022-02-20 19:57:36,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {5064#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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; {5066#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:36,757 INFO L290 TraceCheckUtils]: 3: Hoare triple {5066#(= ~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; {5066#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:36,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {5066#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {5104#(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:36,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {5104#(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); {5105#(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:36,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {5105#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {5105#(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:36,759 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5105#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {5066#(= ~q_write_ev~0 ~q_read_ev~0)} #1353#return; {5066#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:36,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {5066#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {5066#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:36,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {5066#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5066#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:36,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {5066#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5066#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:36,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {5066#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {5066#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:36,761 INFO L272 TraceCheckUtils]: 12: Hoare triple {5066#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {5105#(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:36,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {5105#(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); {5106#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:36,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {5106#(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; {5107#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:36,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {5107#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {5107#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:36,762 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5107#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {5066#(= ~q_write_ev~0 ~q_read_ev~0)} #1355#return; {5065#false} is VALID [2022-02-20 19:57:36,762 INFO L272 TraceCheckUtils]: 17: Hoare triple {5065#false} call activate_threads1(); {5108#(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:36,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {5108#(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; {5064#true} is VALID [2022-02-20 19:57:36,762 INFO L272 TraceCheckUtils]: 19: Hoare triple {5064#true} call #t~ret8 := is_do_write_p_triggered(); {5064#true} is VALID [2022-02-20 19:57:36,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {5064#true} havoc ~__retres1~0; {5064#true} is VALID [2022-02-20 19:57:36,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {5064#true} assume !(1 == ~p_dw_pc~0); {5064#true} is VALID [2022-02-20 19:57:36,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {5064#true} ~__retres1~0 := 0; {5064#true} is VALID [2022-02-20 19:57:36,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {5064#true} #res := ~__retres1~0; {5064#true} is VALID [2022-02-20 19:57:36,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {5064#true} assume true; {5064#true} is VALID [2022-02-20 19:57:36,763 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5064#true} {5064#true} #1349#return; {5064#true} is VALID [2022-02-20 19:57:36,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {5064#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5064#true} is VALID [2022-02-20 19:57:36,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {5064#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5064#true} is VALID [2022-02-20 19:57:36,764 INFO L272 TraceCheckUtils]: 28: Hoare triple {5064#true} call #t~ret9 := is_do_read_c_triggered(); {5064#true} is VALID [2022-02-20 19:57:36,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {5064#true} havoc ~__retres1~1; {5064#true} is VALID [2022-02-20 19:57:36,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {5064#true} assume 1 == ~c_dr_pc~0; {5064#true} is VALID [2022-02-20 19:57:36,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {5064#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {5064#true} is VALID [2022-02-20 19:57:36,764 INFO L290 TraceCheckUtils]: 32: Hoare triple {5064#true} #res := ~__retres1~1; {5064#true} is VALID [2022-02-20 19:57:36,764 INFO L290 TraceCheckUtils]: 33: Hoare triple {5064#true} assume true; {5064#true} is VALID [2022-02-20 19:57:36,765 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5064#true} {5064#true} #1351#return; {5064#true} is VALID [2022-02-20 19:57:36,765 INFO L290 TraceCheckUtils]: 35: Hoare triple {5064#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5064#true} is VALID [2022-02-20 19:57:36,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {5064#true} assume !(0 != ~tmp___0~1); {5064#true} is VALID [2022-02-20 19:57:36,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {5064#true} assume true; {5064#true} is VALID [2022-02-20 19:57:36,765 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5064#true} {5065#false} #1357#return; {5065#false} is VALID [2022-02-20 19:57:36,765 INFO L272 TraceCheckUtils]: 39: Hoare triple {5065#false} call reset_delta_events1(); {5105#(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:36,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {5105#(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); {5064#true} is VALID [2022-02-20 19:57:36,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {5064#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5064#true} is VALID [2022-02-20 19:57:36,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {5064#true} assume true; {5064#true} is VALID [2022-02-20 19:57:36,766 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5064#true} {5065#false} #1359#return; {5065#false} is VALID [2022-02-20 19:57:36,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {5065#false} assume !false; {5065#false} is VALID [2022-02-20 19:57:36,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {5065#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; {5065#false} is VALID [2022-02-20 19:57:36,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {5065#false} assume !false; {5065#false} is VALID [2022-02-20 19:57:36,766 INFO L272 TraceCheckUtils]: 47: Hoare triple {5065#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5064#true} is VALID [2022-02-20 19:57:36,766 INFO L290 TraceCheckUtils]: 48: Hoare triple {5064#true} havoc ~__retres1~2; {5064#true} is VALID [2022-02-20 19:57:36,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {5064#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5064#true} is VALID [2022-02-20 19:57:36,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {5064#true} #res := ~__retres1~2; {5064#true} is VALID [2022-02-20 19:57:36,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {5064#true} assume true; {5064#true} is VALID [2022-02-20 19:57:36,767 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5064#true} {5065#false} #1361#return; {5065#false} is VALID [2022-02-20 19:57:36,767 INFO L290 TraceCheckUtils]: 53: Hoare triple {5065#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; {5065#false} is VALID [2022-02-20 19:57:36,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {5065#false} assume 0 != eval1_~tmp___1~0#1; {5065#false} is VALID [2022-02-20 19:57:36,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {5065#false} assume !(0 == ~p_dw_st~0); {5065#false} is VALID [2022-02-20 19:57:36,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {5065#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; {5065#false} is VALID [2022-02-20 19:57:36,768 INFO L290 TraceCheckUtils]: 57: Hoare triple {5065#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; {5065#false} is VALID [2022-02-20 19:57:36,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {5065#false} assume !(0 == ~c_dr_pc~0); {5065#false} is VALID [2022-02-20 19:57:36,768 INFO L290 TraceCheckUtils]: 59: Hoare triple {5065#false} assume 1 == ~c_dr_pc~0; {5065#false} is VALID [2022-02-20 19:57:36,768 INFO L290 TraceCheckUtils]: 60: Hoare triple {5065#false} do_read_c_~a~0#1 := ~a_t~0; {5065#false} is VALID [2022-02-20 19:57:36,768 INFO L290 TraceCheckUtils]: 61: Hoare triple {5065#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; {5065#false} is VALID [2022-02-20 19:57:36,768 INFO L290 TraceCheckUtils]: 62: Hoare triple {5065#false} assume !(~p_last_write~0 == ~c_last_read~0); {5065#false} is VALID [2022-02-20 19:57:36,768 INFO L272 TraceCheckUtils]: 63: Hoare triple {5065#false} call error1(); {5065#false} is VALID [2022-02-20 19:57:36,769 INFO L290 TraceCheckUtils]: 64: Hoare triple {5065#false} assume !false; {5065#false} is VALID [2022-02-20 19:57:36,769 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:36,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:36,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132111869] [2022-02-20 19:57:36,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132111869] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:36,769 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:36,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:36,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691079353] [2022-02-20 19:57:36,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:36,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:36,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:36,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:36,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:36,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:36,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:36,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:36,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:36,808 INFO L87 Difference]: Start difference. First operand 451 states and 664 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:39,691 INFO L93 Difference]: Finished difference Result 798 states and 1140 transitions. [2022-02-20 19:57:39,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:39,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 870 transitions. [2022-02-20 19:57:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 870 transitions. [2022-02-20 19:57:39,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 870 transitions. [2022-02-20 19:57:40,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 870 edges. 870 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:40,259 INFO L225 Difference]: With dead ends: 798 [2022-02-20 19:57:40,259 INFO L226 Difference]: Without dead ends: 621 [2022-02-20 19:57:40,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:57:40,260 INFO L933 BasicCegarLoop]: 585 mSDtfsCounter, 1067 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:40,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1094 Valid, 2062 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:57:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-02-20 19:57:40,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 547. [2022-02-20 19:57:40,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:40,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 621 states. Second operand has 547 states, 455 states have (on average 1.4725274725274726) internal successors, (670), 464 states have internal predecessors, (670), 59 states have call successors, (59), 29 states have call predecessors, (59), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2022-02-20 19:57:40,297 INFO L74 IsIncluded]: Start isIncluded. First operand 621 states. Second operand has 547 states, 455 states have (on average 1.4725274725274726) internal successors, (670), 464 states have internal predecessors, (670), 59 states have call successors, (59), 29 states have call predecessors, (59), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2022-02-20 19:57:40,298 INFO L87 Difference]: Start difference. First operand 621 states. Second operand has 547 states, 455 states have (on average 1.4725274725274726) internal successors, (670), 464 states have internal predecessors, (670), 59 states have call successors, (59), 29 states have call predecessors, (59), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2022-02-20 19:57:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:40,331 INFO L93 Difference]: Finished difference Result 621 states and 900 transitions. [2022-02-20 19:57:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 900 transitions. [2022-02-20 19:57:40,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:40,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:40,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 547 states, 455 states have (on average 1.4725274725274726) internal successors, (670), 464 states have internal predecessors, (670), 59 states have call successors, (59), 29 states have call predecessors, (59), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) Second operand 621 states. [2022-02-20 19:57:40,350 INFO L87 Difference]: Start difference. First operand has 547 states, 455 states have (on average 1.4725274725274726) internal successors, (670), 464 states have internal predecessors, (670), 59 states have call successors, (59), 29 states have call predecessors, (59), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) Second operand 621 states. [2022-02-20 19:57:40,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:40,392 INFO L93 Difference]: Finished difference Result 621 states and 900 transitions. [2022-02-20 19:57:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 900 transitions. [2022-02-20 19:57:40,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:40,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:40,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:40,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 455 states have (on average 1.4725274725274726) internal successors, (670), 464 states have internal predecessors, (670), 59 states have call successors, (59), 29 states have call predecessors, (59), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2022-02-20 19:57:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 797 transitions. [2022-02-20 19:57:40,429 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 797 transitions. Word has length 65 [2022-02-20 19:57:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:40,429 INFO L470 AbstractCegarLoop]: Abstraction has 547 states and 797 transitions. [2022-02-20 19:57:40,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 797 transitions. [2022-02-20 19:57:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:40,431 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:40,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:40,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:57:40,432 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:40,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:40,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1269182691, now seen corresponding path program 1 times [2022-02-20 19:57:40,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:40,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565895981] [2022-02-20 19:57:40,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:40,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:40,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:40,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {8234#(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); {8195#true} is VALID [2022-02-20 19:57:40,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {8195#true} assume true; {8195#true} is VALID [2022-02-20 19:57:40,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8195#true} {8195#true} #1353#return; {8195#true} is VALID [2022-02-20 19:57:40,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:40,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {8235#(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); {8195#true} is VALID [2022-02-20 19:57:40,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {8195#true} assume !(0 == ~q_write_ev~0); {8195#true} is VALID [2022-02-20 19:57:40,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {8195#true} assume true; {8195#true} is VALID [2022-02-20 19:57:40,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8195#true} {8195#true} #1355#return; {8195#true} is VALID [2022-02-20 19:57:40,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:40,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:40,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {8195#true} havoc ~__retres1~0; {8195#true} is VALID [2022-02-20 19:57:40,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {8195#true} assume !(1 == ~p_dw_pc~0); {8195#true} is VALID [2022-02-20 19:57:40,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {8195#true} ~__retres1~0 := 0; {8195#true} is VALID [2022-02-20 19:57:40,540 INFO L290 TraceCheckUtils]: 3: Hoare triple {8195#true} #res := ~__retres1~0; {8195#true} is VALID [2022-02-20 19:57:40,540 INFO L290 TraceCheckUtils]: 4: Hoare triple {8195#true} assume true; {8195#true} is VALID [2022-02-20 19:57:40,540 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8195#true} {8195#true} #1349#return; {8195#true} is VALID [2022-02-20 19:57:40,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:40,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {8195#true} havoc ~__retres1~1; {8195#true} is VALID [2022-02-20 19:57:40,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {8195#true} assume 1 == ~c_dr_pc~0; {8195#true} is VALID [2022-02-20 19:57:40,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {8195#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {8251#(<= 1 is_do_read_c_triggered_~__retres1~1)} is VALID [2022-02-20 19:57:40,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {8251#(<= 1 is_do_read_c_triggered_~__retres1~1)} #res := ~__retres1~1; {8252#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:57:40,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {8252#(<= 1 |is_do_read_c_triggered_#res|)} assume true; {8252#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:57:40,562 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8252#(<= 1 |is_do_read_c_triggered_#res|)} {8195#true} #1351#return; {8249#(<= 1 |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:57:40,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {8236#(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; {8195#true} is VALID [2022-02-20 19:57:40,562 INFO L272 TraceCheckUtils]: 1: Hoare triple {8195#true} call #t~ret8 := is_do_write_p_triggered(); {8195#true} is VALID [2022-02-20 19:57:40,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {8195#true} havoc ~__retres1~0; {8195#true} is VALID [2022-02-20 19:57:40,562 INFO L290 TraceCheckUtils]: 3: Hoare triple {8195#true} assume !(1 == ~p_dw_pc~0); {8195#true} is VALID [2022-02-20 19:57:40,563 INFO L290 TraceCheckUtils]: 4: Hoare triple {8195#true} ~__retres1~0 := 0; {8195#true} is VALID [2022-02-20 19:57:40,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {8195#true} #res := ~__retres1~0; {8195#true} is VALID [2022-02-20 19:57:40,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {8195#true} assume true; {8195#true} is VALID [2022-02-20 19:57:40,567 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8195#true} {8195#true} #1349#return; {8195#true} is VALID [2022-02-20 19:57:40,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {8195#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {8195#true} is VALID [2022-02-20 19:57:40,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {8195#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8195#true} is VALID [2022-02-20 19:57:40,570 INFO L272 TraceCheckUtils]: 10: Hoare triple {8195#true} call #t~ret9 := is_do_read_c_triggered(); {8195#true} is VALID [2022-02-20 19:57:40,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {8195#true} havoc ~__retres1~1; {8195#true} is VALID [2022-02-20 19:57:40,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {8195#true} assume 1 == ~c_dr_pc~0; {8195#true} is VALID [2022-02-20 19:57:40,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {8195#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {8251#(<= 1 is_do_read_c_triggered_~__retres1~1)} is VALID [2022-02-20 19:57:40,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {8251#(<= 1 is_do_read_c_triggered_~__retres1~1)} #res := ~__retres1~1; {8252#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:57:40,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {8252#(<= 1 |is_do_read_c_triggered_#res|)} assume true; {8252#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:57:40,575 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8252#(<= 1 |is_do_read_c_triggered_#res|)} {8195#true} #1351#return; {8249#(<= 1 |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:57:40,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {8249#(<= 1 |activate_threads1_#t~ret9|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8250#(<= 1 activate_threads1_~tmp___0~1)} is VALID [2022-02-20 19:57:40,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {8250#(<= 1 activate_threads1_~tmp___0~1)} assume !(0 != ~tmp___0~1); {8196#false} is VALID [2022-02-20 19:57:40,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {8196#false} assume true; {8196#false} is VALID [2022-02-20 19:57:40,576 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8196#false} {8195#true} #1357#return; {8196#false} is VALID [2022-02-20 19:57:40,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:40,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {8235#(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); {8195#true} is VALID [2022-02-20 19:57:40,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {8195#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {8195#true} is VALID [2022-02-20 19:57:40,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {8195#true} assume true; {8195#true} is VALID [2022-02-20 19:57:40,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8195#true} {8196#false} #1359#return; {8196#false} is VALID [2022-02-20 19:57:40,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:40,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {8195#true} havoc ~__retres1~2; {8195#true} is VALID [2022-02-20 19:57:40,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {8195#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8195#true} is VALID [2022-02-20 19:57:40,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {8195#true} #res := ~__retres1~2; {8195#true} is VALID [2022-02-20 19:57:40,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {8195#true} assume true; {8195#true} is VALID [2022-02-20 19:57:40,592 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8195#true} {8196#false} #1361#return; {8196#false} is VALID [2022-02-20 19:57:40,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {8195#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {8195#true} is VALID [2022-02-20 19:57:40,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {8195#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {8195#true} is VALID [2022-02-20 19:57:40,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {8195#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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; {8195#true} is VALID [2022-02-20 19:57:40,593 INFO L290 TraceCheckUtils]: 3: Hoare triple {8195#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; {8195#true} is VALID [2022-02-20 19:57:40,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {8195#true} call update_channels1(); {8234#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:40,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {8234#(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); {8195#true} is VALID [2022-02-20 19:57:40,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {8195#true} assume true; {8195#true} is VALID [2022-02-20 19:57:40,593 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8195#true} {8195#true} #1353#return; {8195#true} is VALID [2022-02-20 19:57:40,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {8195#true} assume { :begin_inline_init_threads1 } true; {8195#true} is VALID [2022-02-20 19:57:40,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {8195#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {8195#true} is VALID [2022-02-20 19:57:40,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {8195#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {8195#true} is VALID [2022-02-20 19:57:40,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {8195#true} assume { :end_inline_init_threads1 } true; {8195#true} is VALID [2022-02-20 19:57:40,594 INFO L272 TraceCheckUtils]: 12: Hoare triple {8195#true} call fire_delta_events1(); {8235#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:40,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {8235#(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); {8195#true} is VALID [2022-02-20 19:57:40,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {8195#true} assume !(0 == ~q_write_ev~0); {8195#true} is VALID [2022-02-20 19:57:40,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {8195#true} assume true; {8195#true} is VALID [2022-02-20 19:57:40,595 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8195#true} {8195#true} #1355#return; {8195#true} is VALID [2022-02-20 19:57:40,596 INFO L272 TraceCheckUtils]: 17: Hoare triple {8195#true} call activate_threads1(); {8236#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:40,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {8236#(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; {8195#true} is VALID [2022-02-20 19:57:40,596 INFO L272 TraceCheckUtils]: 19: Hoare triple {8195#true} call #t~ret8 := is_do_write_p_triggered(); {8195#true} is VALID [2022-02-20 19:57:40,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {8195#true} havoc ~__retres1~0; {8195#true} is VALID [2022-02-20 19:57:40,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {8195#true} assume !(1 == ~p_dw_pc~0); {8195#true} is VALID [2022-02-20 19:57:40,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {8195#true} ~__retres1~0 := 0; {8195#true} is VALID [2022-02-20 19:57:40,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {8195#true} #res := ~__retres1~0; {8195#true} is VALID [2022-02-20 19:57:40,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {8195#true} assume true; {8195#true} is VALID [2022-02-20 19:57:40,597 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8195#true} {8195#true} #1349#return; {8195#true} is VALID [2022-02-20 19:57:40,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {8195#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {8195#true} is VALID [2022-02-20 19:57:40,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {8195#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8195#true} is VALID [2022-02-20 19:57:40,597 INFO L272 TraceCheckUtils]: 28: Hoare triple {8195#true} call #t~ret9 := is_do_read_c_triggered(); {8195#true} is VALID [2022-02-20 19:57:40,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {8195#true} havoc ~__retres1~1; {8195#true} is VALID [2022-02-20 19:57:40,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {8195#true} assume 1 == ~c_dr_pc~0; {8195#true} is VALID [2022-02-20 19:57:40,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {8195#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {8251#(<= 1 is_do_read_c_triggered_~__retres1~1)} is VALID [2022-02-20 19:57:40,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {8251#(<= 1 is_do_read_c_triggered_~__retres1~1)} #res := ~__retres1~1; {8252#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:57:40,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {8252#(<= 1 |is_do_read_c_triggered_#res|)} assume true; {8252#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:57:40,601 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8252#(<= 1 |is_do_read_c_triggered_#res|)} {8195#true} #1351#return; {8249#(<= 1 |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:57:40,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {8249#(<= 1 |activate_threads1_#t~ret9|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8250#(<= 1 activate_threads1_~tmp___0~1)} is VALID [2022-02-20 19:57:40,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {8250#(<= 1 activate_threads1_~tmp___0~1)} assume !(0 != ~tmp___0~1); {8196#false} is VALID [2022-02-20 19:57:40,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {8196#false} assume true; {8196#false} is VALID [2022-02-20 19:57:40,602 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8196#false} {8195#true} #1357#return; {8196#false} is VALID [2022-02-20 19:57:40,602 INFO L272 TraceCheckUtils]: 39: Hoare triple {8196#false} call reset_delta_events1(); {8235#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:40,602 INFO L290 TraceCheckUtils]: 40: Hoare triple {8235#(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); {8195#true} is VALID [2022-02-20 19:57:40,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {8195#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {8195#true} is VALID [2022-02-20 19:57:40,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {8195#true} assume true; {8195#true} is VALID [2022-02-20 19:57:40,602 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8195#true} {8196#false} #1359#return; {8196#false} is VALID [2022-02-20 19:57:40,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {8196#false} assume !false; {8196#false} is VALID [2022-02-20 19:57:40,603 INFO L290 TraceCheckUtils]: 45: Hoare triple {8196#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; {8196#false} is VALID [2022-02-20 19:57:40,603 INFO L290 TraceCheckUtils]: 46: Hoare triple {8196#false} assume !false; {8196#false} is VALID [2022-02-20 19:57:40,603 INFO L272 TraceCheckUtils]: 47: Hoare triple {8196#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {8195#true} is VALID [2022-02-20 19:57:40,603 INFO L290 TraceCheckUtils]: 48: Hoare triple {8195#true} havoc ~__retres1~2; {8195#true} is VALID [2022-02-20 19:57:40,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {8195#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8195#true} is VALID [2022-02-20 19:57:40,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {8195#true} #res := ~__retres1~2; {8195#true} is VALID [2022-02-20 19:57:40,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {8195#true} assume true; {8195#true} is VALID [2022-02-20 19:57:40,603 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8195#true} {8196#false} #1361#return; {8196#false} is VALID [2022-02-20 19:57:40,604 INFO L290 TraceCheckUtils]: 53: Hoare triple {8196#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; {8196#false} is VALID [2022-02-20 19:57:40,604 INFO L290 TraceCheckUtils]: 54: Hoare triple {8196#false} assume 0 != eval1_~tmp___1~0#1; {8196#false} is VALID [2022-02-20 19:57:40,604 INFO L290 TraceCheckUtils]: 55: Hoare triple {8196#false} assume !(0 == ~p_dw_st~0); {8196#false} is VALID [2022-02-20 19:57:40,604 INFO L290 TraceCheckUtils]: 56: Hoare triple {8196#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; {8196#false} is VALID [2022-02-20 19:57:40,604 INFO L290 TraceCheckUtils]: 57: Hoare triple {8196#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; {8196#false} is VALID [2022-02-20 19:57:40,604 INFO L290 TraceCheckUtils]: 58: Hoare triple {8196#false} assume !(0 == ~c_dr_pc~0); {8196#false} is VALID [2022-02-20 19:57:40,604 INFO L290 TraceCheckUtils]: 59: Hoare triple {8196#false} assume 1 == ~c_dr_pc~0; {8196#false} is VALID [2022-02-20 19:57:40,604 INFO L290 TraceCheckUtils]: 60: Hoare triple {8196#false} do_read_c_~a~0#1 := ~a_t~0; {8196#false} is VALID [2022-02-20 19:57:40,605 INFO L290 TraceCheckUtils]: 61: Hoare triple {8196#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; {8196#false} is VALID [2022-02-20 19:57:40,605 INFO L290 TraceCheckUtils]: 62: Hoare triple {8196#false} assume !(~p_last_write~0 == ~c_last_read~0); {8196#false} is VALID [2022-02-20 19:57:40,605 INFO L272 TraceCheckUtils]: 63: Hoare triple {8196#false} call error1(); {8196#false} is VALID [2022-02-20 19:57:40,605 INFO L290 TraceCheckUtils]: 64: Hoare triple {8196#false} assume !false; {8196#false} is VALID [2022-02-20 19:57:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:40,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:40,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565895981] [2022-02-20 19:57:40,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565895981] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:40,607 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:40,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:40,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491026184] [2022-02-20 19:57:40,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:40,609 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:57:40,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:40,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:40,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:40,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:40,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:40,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:40,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:40,641 INFO L87 Difference]: Start difference. First operand 547 states and 797 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:43,229 INFO L93 Difference]: Finished difference Result 874 states and 1251 transitions. [2022-02-20 19:57:43,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:43,229 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:57:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 693 transitions. [2022-02-20 19:57:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 693 transitions. [2022-02-20 19:57:43,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 693 transitions. [2022-02-20 19:57:43,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 693 edges. 693 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:43,712 INFO L225 Difference]: With dead ends: 874 [2022-02-20 19:57:43,712 INFO L226 Difference]: Without dead ends: 607 [2022-02-20 19:57:43,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:57:43,721 INFO L933 BasicCegarLoop]: 523 mSDtfsCounter, 445 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:43,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [447 Valid, 2342 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:57:43,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2022-02-20 19:57:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 562. [2022-02-20 19:57:43,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:43,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 607 states. Second operand has 562 states, 467 states have (on average 1.4603854389721627) internal successors, (682), 476 states have internal predecessors, (682), 59 states have call successors, (59), 29 states have call predecessors, (59), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2022-02-20 19:57:43,745 INFO L74 IsIncluded]: Start isIncluded. First operand 607 states. Second operand has 562 states, 467 states have (on average 1.4603854389721627) internal successors, (682), 476 states have internal predecessors, (682), 59 states have call successors, (59), 29 states have call predecessors, (59), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2022-02-20 19:57:43,746 INFO L87 Difference]: Start difference. First operand 607 states. Second operand has 562 states, 467 states have (on average 1.4603854389721627) internal successors, (682), 476 states have internal predecessors, (682), 59 states have call successors, (59), 29 states have call predecessors, (59), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2022-02-20 19:57:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:43,761 INFO L93 Difference]: Finished difference Result 607 states and 878 transitions. [2022-02-20 19:57:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 878 transitions. [2022-02-20 19:57:43,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:43,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:43,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 562 states, 467 states have (on average 1.4603854389721627) internal successors, (682), 476 states have internal predecessors, (682), 59 states have call successors, (59), 29 states have call predecessors, (59), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) Second operand 607 states. [2022-02-20 19:57:43,765 INFO L87 Difference]: Start difference. First operand has 562 states, 467 states have (on average 1.4603854389721627) internal successors, (682), 476 states have internal predecessors, (682), 59 states have call successors, (59), 29 states have call predecessors, (59), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) Second operand 607 states. [2022-02-20 19:57:43,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:43,781 INFO L93 Difference]: Finished difference Result 607 states and 878 transitions. [2022-02-20 19:57:43,781 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 878 transitions. [2022-02-20 19:57:43,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:43,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:43,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:43,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 467 states have (on average 1.4603854389721627) internal successors, (682), 476 states have internal predecessors, (682), 59 states have call successors, (59), 29 states have call predecessors, (59), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2022-02-20 19:57:43,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 812 transitions. [2022-02-20 19:57:43,799 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 812 transitions. Word has length 65 [2022-02-20 19:57:43,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:43,799 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 812 transitions. [2022-02-20 19:57:43,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 812 transitions. [2022-02-20 19:57:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:43,801 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:43,801 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:43,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:57:43,802 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:43,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:43,802 INFO L85 PathProgramCache]: Analyzing trace with hash -117020703, now seen corresponding path program 1 times [2022-02-20 19:57:43,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:43,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198559945] [2022-02-20 19:57:43,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:43,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {11446#(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); {11407#true} is VALID [2022-02-20 19:57:43,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {11407#true} assume true; {11407#true} is VALID [2022-02-20 19:57:43,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11407#true} {11407#true} #1353#return; {11407#true} is VALID [2022-02-20 19:57:43,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {11447#(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); {11407#true} is VALID [2022-02-20 19:57:43,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {11407#true} assume !(0 == ~q_write_ev~0); {11407#true} is VALID [2022-02-20 19:57:43,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {11407#true} assume true; {11407#true} is VALID [2022-02-20 19:57:43,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11407#true} {11407#true} #1355#return; {11407#true} is VALID [2022-02-20 19:57:43,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {11407#true} havoc ~__retres1~0; {11407#true} is VALID [2022-02-20 19:57:43,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {11407#true} assume !(1 == ~p_dw_pc~0); {11407#true} is VALID [2022-02-20 19:57:43,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {11407#true} ~__retres1~0 := 0; {11463#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:43,935 INFO L290 TraceCheckUtils]: 3: Hoare triple {11463#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {11464#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:43,935 INFO L290 TraceCheckUtils]: 4: Hoare triple {11464#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {11464#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:43,935 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11464#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {11407#true} #1349#return; {11455#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:43,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {11407#true} havoc ~__retres1~1; {11407#true} is VALID [2022-02-20 19:57:43,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {11407#true} assume 1 == ~c_dr_pc~0; {11407#true} is VALID [2022-02-20 19:57:43,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {11407#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11407#true} is VALID [2022-02-20 19:57:43,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {11407#true} #res := ~__retres1~1; {11407#true} is VALID [2022-02-20 19:57:43,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {11407#true} assume true; {11407#true} is VALID [2022-02-20 19:57:43,939 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11407#true} {11408#false} #1351#return; {11408#false} is VALID [2022-02-20 19:57:43,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {11448#(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; {11407#true} is VALID [2022-02-20 19:57:43,939 INFO L272 TraceCheckUtils]: 1: Hoare triple {11407#true} call #t~ret8 := is_do_write_p_triggered(); {11407#true} is VALID [2022-02-20 19:57:43,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {11407#true} havoc ~__retres1~0; {11407#true} is VALID [2022-02-20 19:57:43,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {11407#true} assume !(1 == ~p_dw_pc~0); {11407#true} is VALID [2022-02-20 19:57:43,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {11407#true} ~__retres1~0 := 0; {11463#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:43,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {11463#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {11464#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:43,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {11464#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {11464#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:43,941 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11464#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {11407#true} #1349#return; {11455#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:43,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {11455#(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; {11456#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:43,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {11456#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {11408#false} is VALID [2022-02-20 19:57:43,942 INFO L272 TraceCheckUtils]: 10: Hoare triple {11408#false} call #t~ret9 := is_do_read_c_triggered(); {11407#true} is VALID [2022-02-20 19:57:43,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {11407#true} havoc ~__retres1~1; {11407#true} is VALID [2022-02-20 19:57:43,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {11407#true} assume 1 == ~c_dr_pc~0; {11407#true} is VALID [2022-02-20 19:57:43,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {11407#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11407#true} is VALID [2022-02-20 19:57:43,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {11407#true} #res := ~__retres1~1; {11407#true} is VALID [2022-02-20 19:57:43,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {11407#true} assume true; {11407#true} is VALID [2022-02-20 19:57:43,943 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11407#true} {11408#false} #1351#return; {11408#false} is VALID [2022-02-20 19:57:43,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {11408#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {11408#false} is VALID [2022-02-20 19:57:43,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {11408#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {11408#false} is VALID [2022-02-20 19:57:43,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {11408#false} assume true; {11408#false} is VALID [2022-02-20 19:57:43,944 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11408#false} {11407#true} #1357#return; {11408#false} is VALID [2022-02-20 19:57:43,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {11447#(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); {11407#true} is VALID [2022-02-20 19:57:43,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {11407#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {11407#true} is VALID [2022-02-20 19:57:43,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {11407#true} assume true; {11407#true} is VALID [2022-02-20 19:57:43,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11407#true} {11408#false} #1359#return; {11408#false} is VALID [2022-02-20 19:57:43,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {11407#true} havoc ~__retres1~2; {11407#true} is VALID [2022-02-20 19:57:43,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {11407#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {11407#true} is VALID [2022-02-20 19:57:43,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {11407#true} #res := ~__retres1~2; {11407#true} is VALID [2022-02-20 19:57:43,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {11407#true} assume true; {11407#true} is VALID [2022-02-20 19:57:43,953 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11407#true} {11408#false} #1361#return; {11408#false} is VALID [2022-02-20 19:57:43,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {11407#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {11407#true} is VALID [2022-02-20 19:57:43,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {11407#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {11407#true} is VALID [2022-02-20 19:57:43,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {11407#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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; {11407#true} is VALID [2022-02-20 19:57:43,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {11407#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; {11407#true} is VALID [2022-02-20 19:57:43,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {11407#true} call update_channels1(); {11446#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:43,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {11446#(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); {11407#true} is VALID [2022-02-20 19:57:43,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {11407#true} assume true; {11407#true} is VALID [2022-02-20 19:57:43,954 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11407#true} {11407#true} #1353#return; {11407#true} is VALID [2022-02-20 19:57:43,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {11407#true} assume { :begin_inline_init_threads1 } true; {11407#true} is VALID [2022-02-20 19:57:43,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {11407#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {11407#true} is VALID [2022-02-20 19:57:43,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {11407#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {11407#true} is VALID [2022-02-20 19:57:43,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {11407#true} assume { :end_inline_init_threads1 } true; {11407#true} is VALID [2022-02-20 19:57:43,955 INFO L272 TraceCheckUtils]: 12: Hoare triple {11407#true} call fire_delta_events1(); {11447#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:43,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {11447#(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); {11407#true} is VALID [2022-02-20 19:57:43,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {11407#true} assume !(0 == ~q_write_ev~0); {11407#true} is VALID [2022-02-20 19:57:43,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {11407#true} assume true; {11407#true} is VALID [2022-02-20 19:57:43,955 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11407#true} {11407#true} #1355#return; {11407#true} is VALID [2022-02-20 19:57:43,956 INFO L272 TraceCheckUtils]: 17: Hoare triple {11407#true} call activate_threads1(); {11448#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:43,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {11448#(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; {11407#true} is VALID [2022-02-20 19:57:43,956 INFO L272 TraceCheckUtils]: 19: Hoare triple {11407#true} call #t~ret8 := is_do_write_p_triggered(); {11407#true} is VALID [2022-02-20 19:57:43,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {11407#true} havoc ~__retres1~0; {11407#true} is VALID [2022-02-20 19:57:43,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {11407#true} assume !(1 == ~p_dw_pc~0); {11407#true} is VALID [2022-02-20 19:57:43,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {11407#true} ~__retres1~0 := 0; {11463#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:43,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {11463#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {11464#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:43,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {11464#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {11464#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:43,957 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11464#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {11407#true} #1349#return; {11455#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:43,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {11455#(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; {11456#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:43,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {11456#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {11408#false} is VALID [2022-02-20 19:57:43,958 INFO L272 TraceCheckUtils]: 28: Hoare triple {11408#false} call #t~ret9 := is_do_read_c_triggered(); {11407#true} is VALID [2022-02-20 19:57:43,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {11407#true} havoc ~__retres1~1; {11407#true} is VALID [2022-02-20 19:57:43,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {11407#true} assume 1 == ~c_dr_pc~0; {11407#true} is VALID [2022-02-20 19:57:43,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {11407#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11407#true} is VALID [2022-02-20 19:57:43,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {11407#true} #res := ~__retres1~1; {11407#true} is VALID [2022-02-20 19:57:43,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {11407#true} assume true; {11407#true} is VALID [2022-02-20 19:57:43,959 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11407#true} {11408#false} #1351#return; {11408#false} is VALID [2022-02-20 19:57:43,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {11408#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {11408#false} is VALID [2022-02-20 19:57:43,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {11408#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {11408#false} is VALID [2022-02-20 19:57:43,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {11408#false} assume true; {11408#false} is VALID [2022-02-20 19:57:43,959 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11408#false} {11407#true} #1357#return; {11408#false} is VALID [2022-02-20 19:57:43,959 INFO L272 TraceCheckUtils]: 39: Hoare triple {11408#false} call reset_delta_events1(); {11447#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:43,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {11447#(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); {11407#true} is VALID [2022-02-20 19:57:43,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {11407#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {11407#true} is VALID [2022-02-20 19:57:43,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {11407#true} assume true; {11407#true} is VALID [2022-02-20 19:57:43,960 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11407#true} {11408#false} #1359#return; {11408#false} is VALID [2022-02-20 19:57:43,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {11408#false} assume !false; {11408#false} is VALID [2022-02-20 19:57:43,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {11408#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; {11408#false} is VALID [2022-02-20 19:57:43,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {11408#false} assume !false; {11408#false} is VALID [2022-02-20 19:57:43,960 INFO L272 TraceCheckUtils]: 47: Hoare triple {11408#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {11407#true} is VALID [2022-02-20 19:57:43,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {11407#true} havoc ~__retres1~2; {11407#true} is VALID [2022-02-20 19:57:43,960 INFO L290 TraceCheckUtils]: 49: Hoare triple {11407#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {11407#true} is VALID [2022-02-20 19:57:43,960 INFO L290 TraceCheckUtils]: 50: Hoare triple {11407#true} #res := ~__retres1~2; {11407#true} is VALID [2022-02-20 19:57:43,961 INFO L290 TraceCheckUtils]: 51: Hoare triple {11407#true} assume true; {11407#true} is VALID [2022-02-20 19:57:43,961 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11407#true} {11408#false} #1361#return; {11408#false} is VALID [2022-02-20 19:57:43,961 INFO L290 TraceCheckUtils]: 53: Hoare triple {11408#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; {11408#false} is VALID [2022-02-20 19:57:43,961 INFO L290 TraceCheckUtils]: 54: Hoare triple {11408#false} assume 0 != eval1_~tmp___1~0#1; {11408#false} is VALID [2022-02-20 19:57:43,961 INFO L290 TraceCheckUtils]: 55: Hoare triple {11408#false} assume !(0 == ~p_dw_st~0); {11408#false} is VALID [2022-02-20 19:57:43,961 INFO L290 TraceCheckUtils]: 56: Hoare triple {11408#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; {11408#false} is VALID [2022-02-20 19:57:43,961 INFO L290 TraceCheckUtils]: 57: Hoare triple {11408#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; {11408#false} is VALID [2022-02-20 19:57:43,961 INFO L290 TraceCheckUtils]: 58: Hoare triple {11408#false} assume !(0 == ~c_dr_pc~0); {11408#false} is VALID [2022-02-20 19:57:43,961 INFO L290 TraceCheckUtils]: 59: Hoare triple {11408#false} assume 1 == ~c_dr_pc~0; {11408#false} is VALID [2022-02-20 19:57:43,961 INFO L290 TraceCheckUtils]: 60: Hoare triple {11408#false} do_read_c_~a~0#1 := ~a_t~0; {11408#false} is VALID [2022-02-20 19:57:43,962 INFO L290 TraceCheckUtils]: 61: Hoare triple {11408#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; {11408#false} is VALID [2022-02-20 19:57:43,962 INFO L290 TraceCheckUtils]: 62: Hoare triple {11408#false} assume !(~p_last_write~0 == ~c_last_read~0); {11408#false} is VALID [2022-02-20 19:57:43,962 INFO L272 TraceCheckUtils]: 63: Hoare triple {11408#false} call error1(); {11408#false} is VALID [2022-02-20 19:57:43,962 INFO L290 TraceCheckUtils]: 64: Hoare triple {11408#false} assume !false; {11408#false} is VALID [2022-02-20 19:57:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:43,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:43,963 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198559945] [2022-02-20 19:57:43,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198559945] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:43,963 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:43,963 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:43,963 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482288059] [2022-02-20 19:57:43,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:43,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:57:43,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:43,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:43,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:43,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:43,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:43,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:43,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:43,993 INFO L87 Difference]: Start difference. First operand 562 states and 812 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:46,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:46,361 INFO L93 Difference]: Finished difference Result 880 states and 1244 transitions. [2022-02-20 19:57:46,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:46,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:57:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 689 transitions. [2022-02-20 19:57:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 689 transitions. [2022-02-20 19:57:46,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 689 transitions. [2022-02-20 19:57:46,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 689 edges. 689 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:46,839 INFO L225 Difference]: With dead ends: 880 [2022-02-20 19:57:46,839 INFO L226 Difference]: Without dead ends: 598 [2022-02-20 19:57:46,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:57:46,841 INFO L933 BasicCegarLoop]: 520 mSDtfsCounter, 671 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:46,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [672 Valid, 2100 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:46,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-02-20 19:57:46,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 567. [2022-02-20 19:57:46,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:46,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 598 states. Second operand has 567 states, 471 states have (on average 1.4522292993630572) internal successors, (684), 480 states have internal predecessors, (684), 59 states have call successors, (59), 29 states have call predecessors, (59), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2022-02-20 19:57:46,867 INFO L74 IsIncluded]: Start isIncluded. First operand 598 states. Second operand has 567 states, 471 states have (on average 1.4522292993630572) internal successors, (684), 480 states have internal predecessors, (684), 59 states have call successors, (59), 29 states have call predecessors, (59), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2022-02-20 19:57:46,868 INFO L87 Difference]: Start difference. First operand 598 states. Second operand has 567 states, 471 states have (on average 1.4522292993630572) internal successors, (684), 480 states have internal predecessors, (684), 59 states have call successors, (59), 29 states have call predecessors, (59), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2022-02-20 19:57:46,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:46,883 INFO L93 Difference]: Finished difference Result 598 states and 859 transitions. [2022-02-20 19:57:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 859 transitions. [2022-02-20 19:57:46,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:46,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:46,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 567 states, 471 states have (on average 1.4522292993630572) internal successors, (684), 480 states have internal predecessors, (684), 59 states have call successors, (59), 29 states have call predecessors, (59), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) Second operand 598 states. [2022-02-20 19:57:46,886 INFO L87 Difference]: Start difference. First operand has 567 states, 471 states have (on average 1.4522292993630572) internal successors, (684), 480 states have internal predecessors, (684), 59 states have call successors, (59), 29 states have call predecessors, (59), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) Second operand 598 states. [2022-02-20 19:57:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:46,902 INFO L93 Difference]: Finished difference Result 598 states and 859 transitions. [2022-02-20 19:57:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 859 transitions. [2022-02-20 19:57:46,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:46,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:46,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:46,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:46,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 471 states have (on average 1.4522292993630572) internal successors, (684), 480 states have internal predecessors, (684), 59 states have call successors, (59), 29 states have call predecessors, (59), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2022-02-20 19:57:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 815 transitions. [2022-02-20 19:57:46,920 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 815 transitions. Word has length 65 [2022-02-20 19:57:46,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:46,920 INFO L470 AbstractCegarLoop]: Abstraction has 567 states and 815 transitions. [2022-02-20 19:57:46,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 815 transitions. [2022-02-20 19:57:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:46,921 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:46,921 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:46,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:57:46,922 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:46,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:46,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1146380001, now seen corresponding path program 1 times [2022-02-20 19:57:46,922 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:46,922 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338181711] [2022-02-20 19:57:46,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:46,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:46,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:46,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {14655#(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); {14656#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:57:46,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {14656#(not (= |old(~q_req_up~0)| 1))} assume true; {14656#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:57:46,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14656#(not (= |old(~q_req_up~0)| 1))} {14616#(= ~c_dr_pc~0 ~q_req_up~0)} #1353#return; {14620#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:46,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:46,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {14657#(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); {14613#true} is VALID [2022-02-20 19:57:46,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {14613#true} assume !(0 == ~q_write_ev~0); {14613#true} is VALID [2022-02-20 19:57:46,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {14613#true} assume true; {14613#true} is VALID [2022-02-20 19:57:46,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14613#true} {14620#(not (= ~c_dr_pc~0 1))} #1355#return; {14620#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:47,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:47,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:47,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {14613#true} havoc ~__retres1~0; {14613#true} is VALID [2022-02-20 19:57:47,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {14613#true} assume !(1 == ~p_dw_pc~0); {14613#true} is VALID [2022-02-20 19:57:47,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {14613#true} ~__retres1~0 := 0; {14613#true} is VALID [2022-02-20 19:57:47,022 INFO L290 TraceCheckUtils]: 3: Hoare triple {14613#true} #res := ~__retres1~0; {14613#true} is VALID [2022-02-20 19:57:47,022 INFO L290 TraceCheckUtils]: 4: Hoare triple {14613#true} assume true; {14613#true} is VALID [2022-02-20 19:57:47,022 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14613#true} {14613#true} #1349#return; {14613#true} is VALID [2022-02-20 19:57:47,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:47,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {14613#true} havoc ~__retres1~1; {14613#true} is VALID [2022-02-20 19:57:47,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {14613#true} assume 1 == ~c_dr_pc~0; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,028 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} {14613#true} #1351#return; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {14658#(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; {14613#true} is VALID [2022-02-20 19:57:47,028 INFO L272 TraceCheckUtils]: 1: Hoare triple {14613#true} call #t~ret8 := is_do_write_p_triggered(); {14613#true} is VALID [2022-02-20 19:57:47,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {14613#true} havoc ~__retres1~0; {14613#true} is VALID [2022-02-20 19:57:47,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {14613#true} assume !(1 == ~p_dw_pc~0); {14613#true} is VALID [2022-02-20 19:57:47,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {14613#true} ~__retres1~0 := 0; {14613#true} is VALID [2022-02-20 19:57:47,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {14613#true} #res := ~__retres1~0; {14613#true} is VALID [2022-02-20 19:57:47,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {14613#true} assume true; {14613#true} is VALID [2022-02-20 19:57:47,029 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14613#true} {14613#true} #1349#return; {14613#true} is VALID [2022-02-20 19:57:47,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {14613#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14613#true} is VALID [2022-02-20 19:57:47,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {14613#true} assume !(0 != ~tmp~1); {14613#true} is VALID [2022-02-20 19:57:47,029 INFO L272 TraceCheckUtils]: 10: Hoare triple {14613#true} call #t~ret9 := is_do_read_c_triggered(); {14613#true} is VALID [2022-02-20 19:57:47,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {14613#true} havoc ~__retres1~1; {14613#true} is VALID [2022-02-20 19:57:47,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {14613#true} assume 1 == ~c_dr_pc~0; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,031 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} {14613#true} #1351#return; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,032 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} {14620#(not (= ~c_dr_pc~0 1))} #1357#return; {14614#false} is VALID [2022-02-20 19:57:47,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:47,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {14657#(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); {14613#true} is VALID [2022-02-20 19:57:47,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {14613#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14613#true} is VALID [2022-02-20 19:57:47,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {14613#true} assume true; {14613#true} is VALID [2022-02-20 19:57:47,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14613#true} {14614#false} #1359#return; {14614#false} is VALID [2022-02-20 19:57:47,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:47,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {14613#true} havoc ~__retres1~2; {14613#true} is VALID [2022-02-20 19:57:47,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {14613#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14613#true} is VALID [2022-02-20 19:57:47,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {14613#true} #res := ~__retres1~2; {14613#true} is VALID [2022-02-20 19:57:47,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {14613#true} assume true; {14613#true} is VALID [2022-02-20 19:57:47,039 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14613#true} {14614#false} #1361#return; {14614#false} is VALID [2022-02-20 19:57:47,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {14613#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {14615#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:57:47,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {14615#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {14615#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:57:47,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {14615#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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; {14616#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:57:47,041 INFO L290 TraceCheckUtils]: 3: Hoare triple {14616#(= ~c_dr_pc~0 ~q_req_up~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {14616#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:57:47,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {14616#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {14655#(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:47,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {14655#(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); {14656#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:57:47,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {14656#(not (= |old(~q_req_up~0)| 1))} assume true; {14656#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:57:47,042 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14656#(not (= |old(~q_req_up~0)| 1))} {14616#(= ~c_dr_pc~0 ~q_req_up~0)} #1353#return; {14620#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:47,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {14620#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {14620#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:47,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {14620#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {14620#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:47,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {14620#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {14620#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:47,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {14620#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {14620#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:47,056 INFO L272 TraceCheckUtils]: 12: Hoare triple {14620#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {14657#(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:47,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {14657#(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); {14613#true} is VALID [2022-02-20 19:57:47,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {14613#true} assume !(0 == ~q_write_ev~0); {14613#true} is VALID [2022-02-20 19:57:47,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {14613#true} assume true; {14613#true} is VALID [2022-02-20 19:57:47,056 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14613#true} {14620#(not (= ~c_dr_pc~0 1))} #1355#return; {14620#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:47,057 INFO L272 TraceCheckUtils]: 17: Hoare triple {14620#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {14658#(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:47,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {14658#(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; {14613#true} is VALID [2022-02-20 19:57:47,057 INFO L272 TraceCheckUtils]: 19: Hoare triple {14613#true} call #t~ret8 := is_do_write_p_triggered(); {14613#true} is VALID [2022-02-20 19:57:47,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {14613#true} havoc ~__retres1~0; {14613#true} is VALID [2022-02-20 19:57:47,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {14613#true} assume !(1 == ~p_dw_pc~0); {14613#true} is VALID [2022-02-20 19:57:47,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {14613#true} ~__retres1~0 := 0; {14613#true} is VALID [2022-02-20 19:57:47,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {14613#true} #res := ~__retres1~0; {14613#true} is VALID [2022-02-20 19:57:47,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {14613#true} assume true; {14613#true} is VALID [2022-02-20 19:57:47,058 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14613#true} {14613#true} #1349#return; {14613#true} is VALID [2022-02-20 19:57:47,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {14613#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14613#true} is VALID [2022-02-20 19:57:47,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {14613#true} assume !(0 != ~tmp~1); {14613#true} is VALID [2022-02-20 19:57:47,058 INFO L272 TraceCheckUtils]: 28: Hoare triple {14613#true} call #t~ret9 := is_do_read_c_triggered(); {14613#true} is VALID [2022-02-20 19:57:47,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {14613#true} havoc ~__retres1~1; {14613#true} is VALID [2022-02-20 19:57:47,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {14613#true} assume 1 == ~c_dr_pc~0; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,060 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} {14613#true} #1351#return; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,060 INFO L290 TraceCheckUtils]: 35: Hoare triple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,061 INFO L290 TraceCheckUtils]: 37: Hoare triple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:47,061 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14671#(= (+ (- 1) ~c_dr_pc~0) 0)} {14620#(not (= ~c_dr_pc~0 1))} #1357#return; {14614#false} is VALID [2022-02-20 19:57:47,061 INFO L272 TraceCheckUtils]: 39: Hoare triple {14614#false} call reset_delta_events1(); {14657#(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:47,061 INFO L290 TraceCheckUtils]: 40: Hoare triple {14657#(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); {14613#true} is VALID [2022-02-20 19:57:47,062 INFO L290 TraceCheckUtils]: 41: Hoare triple {14613#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14613#true} is VALID [2022-02-20 19:57:47,062 INFO L290 TraceCheckUtils]: 42: Hoare triple {14613#true} assume true; {14613#true} is VALID [2022-02-20 19:57:47,062 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14613#true} {14614#false} #1359#return; {14614#false} is VALID [2022-02-20 19:57:47,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {14614#false} assume !false; {14614#false} is VALID [2022-02-20 19:57:47,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {14614#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; {14614#false} is VALID [2022-02-20 19:57:47,062 INFO L290 TraceCheckUtils]: 46: Hoare triple {14614#false} assume !false; {14614#false} is VALID [2022-02-20 19:57:47,062 INFO L272 TraceCheckUtils]: 47: Hoare triple {14614#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {14613#true} is VALID [2022-02-20 19:57:47,062 INFO L290 TraceCheckUtils]: 48: Hoare triple {14613#true} havoc ~__retres1~2; {14613#true} is VALID [2022-02-20 19:57:47,063 INFO L290 TraceCheckUtils]: 49: Hoare triple {14613#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14613#true} is VALID [2022-02-20 19:57:47,063 INFO L290 TraceCheckUtils]: 50: Hoare triple {14613#true} #res := ~__retres1~2; {14613#true} is VALID [2022-02-20 19:57:47,063 INFO L290 TraceCheckUtils]: 51: Hoare triple {14613#true} assume true; {14613#true} is VALID [2022-02-20 19:57:47,063 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14613#true} {14614#false} #1361#return; {14614#false} is VALID [2022-02-20 19:57:47,063 INFO L290 TraceCheckUtils]: 53: Hoare triple {14614#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; {14614#false} is VALID [2022-02-20 19:57:47,063 INFO L290 TraceCheckUtils]: 54: Hoare triple {14614#false} assume 0 != eval1_~tmp___1~0#1; {14614#false} is VALID [2022-02-20 19:57:47,063 INFO L290 TraceCheckUtils]: 55: Hoare triple {14614#false} assume !(0 == ~p_dw_st~0); {14614#false} is VALID [2022-02-20 19:57:47,063 INFO L290 TraceCheckUtils]: 56: Hoare triple {14614#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; {14614#false} is VALID [2022-02-20 19:57:47,064 INFO L290 TraceCheckUtils]: 57: Hoare triple {14614#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; {14614#false} is VALID [2022-02-20 19:57:47,064 INFO L290 TraceCheckUtils]: 58: Hoare triple {14614#false} assume !(0 == ~c_dr_pc~0); {14614#false} is VALID [2022-02-20 19:57:47,064 INFO L290 TraceCheckUtils]: 59: Hoare triple {14614#false} assume 1 == ~c_dr_pc~0; {14614#false} is VALID [2022-02-20 19:57:47,064 INFO L290 TraceCheckUtils]: 60: Hoare triple {14614#false} do_read_c_~a~0#1 := ~a_t~0; {14614#false} is VALID [2022-02-20 19:57:47,064 INFO L290 TraceCheckUtils]: 61: Hoare triple {14614#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; {14614#false} is VALID [2022-02-20 19:57:47,064 INFO L290 TraceCheckUtils]: 62: Hoare triple {14614#false} assume !(~p_last_write~0 == ~c_last_read~0); {14614#false} is VALID [2022-02-20 19:57:47,064 INFO L272 TraceCheckUtils]: 63: Hoare triple {14614#false} call error1(); {14614#false} is VALID [2022-02-20 19:57:47,064 INFO L290 TraceCheckUtils]: 64: Hoare triple {14614#false} assume !false; {14614#false} is VALID [2022-02-20 19:57:47,065 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:47,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:47,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338181711] [2022-02-20 19:57:47,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338181711] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:47,065 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:47,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:57:47,065 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886486971] [2022-02-20 19:57:47,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:47,066 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:57:47,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:47,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:47,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:47,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:57:47,106 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:47,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:57:47,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:57:47,107 INFO L87 Difference]: Start difference. First operand 567 states and 815 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:51,924 INFO L93 Difference]: Finished difference Result 1923 states and 2656 transitions. [2022-02-20 19:57:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:57:51,924 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:57:51,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:51,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1206 transitions. [2022-02-20 19:57:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1206 transitions. [2022-02-20 19:57:51,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1206 transitions. [2022-02-20 19:57:52,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1206 edges. 1206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:52,986 INFO L225 Difference]: With dead ends: 1923 [2022-02-20 19:57:52,986 INFO L226 Difference]: Without dead ends: 1618 [2022-02-20 19:57:52,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:57:52,988 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 2761 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 597 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2776 SdHoareTripleChecker+Valid, 2341 SdHoareTripleChecker+Invalid, 2135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 597 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:52,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2776 Valid, 2341 Invalid, 2135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [597 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-20 19:57:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2022-02-20 19:57:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1483. [2022-02-20 19:57:53,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:53,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1618 states. Second operand has 1483 states, 1198 states have (on average 1.3664440734557597) internal successors, (1637), 1222 states have internal predecessors, (1637), 147 states have call successors, (147), 112 states have call predecessors, (147), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2022-02-20 19:57:53,061 INFO L74 IsIncluded]: Start isIncluded. First operand 1618 states. Second operand has 1483 states, 1198 states have (on average 1.3664440734557597) internal successors, (1637), 1222 states have internal predecessors, (1637), 147 states have call successors, (147), 112 states have call predecessors, (147), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2022-02-20 19:57:53,075 INFO L87 Difference]: Start difference. First operand 1618 states. Second operand has 1483 states, 1198 states have (on average 1.3664440734557597) internal successors, (1637), 1222 states have internal predecessors, (1637), 147 states have call successors, (147), 112 states have call predecessors, (147), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2022-02-20 19:57:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:53,164 INFO L93 Difference]: Finished difference Result 1618 states and 2128 transitions. [2022-02-20 19:57:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2128 transitions. [2022-02-20 19:57:53,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:53,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:53,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 1483 states, 1198 states have (on average 1.3664440734557597) internal successors, (1637), 1222 states have internal predecessors, (1637), 147 states have call successors, (147), 112 states have call predecessors, (147), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) Second operand 1618 states. [2022-02-20 19:57:53,174 INFO L87 Difference]: Start difference. First operand has 1483 states, 1198 states have (on average 1.3664440734557597) internal successors, (1637), 1222 states have internal predecessors, (1637), 147 states have call successors, (147), 112 states have call predecessors, (147), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) Second operand 1618 states. [2022-02-20 19:57:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:53,258 INFO L93 Difference]: Finished difference Result 1618 states and 2128 transitions. [2022-02-20 19:57:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2128 transitions. [2022-02-20 19:57:53,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:53,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:53,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:53,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:53,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1198 states have (on average 1.3664440734557597) internal successors, (1637), 1222 states have internal predecessors, (1637), 147 states have call successors, (147), 112 states have call predecessors, (147), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2022-02-20 19:57:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1973 transitions. [2022-02-20 19:57:53,351 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1973 transitions. Word has length 65 [2022-02-20 19:57:53,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:53,352 INFO L470 AbstractCegarLoop]: Abstraction has 1483 states and 1973 transitions. [2022-02-20 19:57:53,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1973 transitions. [2022-02-20 19:57:53,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:53,353 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:53,353 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:53,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:57:53,353 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:53,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:53,354 INFO L85 PathProgramCache]: Analyzing trace with hash -166967177, now seen corresponding path program 1 times [2022-02-20 19:57:53,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:53,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217077999] [2022-02-20 19:57:53,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:53,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:53,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:53,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {22585#(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); {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:53,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:53,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22547#(= ~q_write_ev~0 ~q_read_ev~0)} #1353#return; {22547#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:53,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:53,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {22586#(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); {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:53,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:53,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:53,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22547#(= ~q_write_ev~0 ~q_read_ev~0)} #1355#return; {22547#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:53,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:53,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:53,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {22545#true} havoc ~__retres1~0; {22545#true} is VALID [2022-02-20 19:57:53,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {22545#true} assume !(1 == ~p_dw_pc~0); {22545#true} is VALID [2022-02-20 19:57:53,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {22545#true} ~__retres1~0 := 0; {22545#true} is VALID [2022-02-20 19:57:53,430 INFO L290 TraceCheckUtils]: 3: Hoare triple {22545#true} #res := ~__retres1~0; {22545#true} is VALID [2022-02-20 19:57:53,430 INFO L290 TraceCheckUtils]: 4: Hoare triple {22545#true} assume true; {22545#true} is VALID [2022-02-20 19:57:53,430 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22545#true} {22545#true} #1349#return; {22545#true} is VALID [2022-02-20 19:57:53,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:53,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {22545#true} havoc ~__retres1~1; {22545#true} is VALID [2022-02-20 19:57:53,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {22545#true} assume !(1 == ~c_dr_pc~0); {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {22545#true} ~__retres1~1 := 0; {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L290 TraceCheckUtils]: 3: Hoare triple {22545#true} #res := ~__retres1~1; {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L290 TraceCheckUtils]: 4: Hoare triple {22545#true} assume true; {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22545#true} {22545#true} #1351#return; {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {22587#(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; {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L272 TraceCheckUtils]: 1: Hoare triple {22545#true} call #t~ret8 := is_do_write_p_triggered(); {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {22545#true} havoc ~__retres1~0; {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L290 TraceCheckUtils]: 3: Hoare triple {22545#true} assume !(1 == ~p_dw_pc~0); {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L290 TraceCheckUtils]: 4: Hoare triple {22545#true} ~__retres1~0 := 0; {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {22545#true} #res := ~__retres1~0; {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {22545#true} assume true; {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22545#true} {22545#true} #1349#return; {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {22545#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {22545#true} assume !(0 != ~tmp~1); {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L272 TraceCheckUtils]: 10: Hoare triple {22545#true} call #t~ret9 := is_do_read_c_triggered(); {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {22545#true} havoc ~__retres1~1; {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {22545#true} assume !(1 == ~c_dr_pc~0); {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {22545#true} ~__retres1~1 := 0; {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {22545#true} #res := ~__retres1~1; {22545#true} is VALID [2022-02-20 19:57:53,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {22545#true} assume true; {22545#true} is VALID [2022-02-20 19:57:53,433 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22545#true} {22545#true} #1351#return; {22545#true} is VALID [2022-02-20 19:57:53,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {22545#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22545#true} is VALID [2022-02-20 19:57:53,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {22545#true} assume !(0 != ~tmp___0~1); {22545#true} is VALID [2022-02-20 19:57:53,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {22545#true} assume true; {22545#true} is VALID [2022-02-20 19:57:53,439 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {22545#true} {22547#(= ~q_write_ev~0 ~q_read_ev~0)} #1357#return; {22547#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:53,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:53,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {22586#(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); {22600#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:53,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {22600#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {22601#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:53,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {22601#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {22601#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:53,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22601#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {22547#(= ~q_write_ev~0 ~q_read_ev~0)} #1359#return; {22546#false} is VALID [2022-02-20 19:57:53,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:53,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {22545#true} havoc ~__retres1~2; {22545#true} is VALID [2022-02-20 19:57:53,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {22545#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22545#true} is VALID [2022-02-20 19:57:53,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {22545#true} #res := ~__retres1~2; {22545#true} is VALID [2022-02-20 19:57:53,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {22545#true} assume true; {22545#true} is VALID [2022-02-20 19:57:53,471 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22545#true} {22546#false} #1361#return; {22546#false} is VALID [2022-02-20 19:57:53,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {22545#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {22545#true} is VALID [2022-02-20 19:57:53,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {22545#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {22545#true} is VALID [2022-02-20 19:57:53,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {22545#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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; {22547#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:53,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {22547#(= ~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; {22547#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:53,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {22547#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {22585#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:53,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {22585#(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); {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:53,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:53,473 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22547#(= ~q_write_ev~0 ~q_read_ev~0)} #1353#return; {22547#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:53,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {22547#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {22547#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:53,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {22547#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {22547#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:53,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {22547#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {22547#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:53,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {22547#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {22547#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:53,474 INFO L272 TraceCheckUtils]: 12: Hoare triple {22547#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:53,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {22586#(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); {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:53,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:53,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:53,488 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22547#(= ~q_write_ev~0 ~q_read_ev~0)} #1355#return; {22547#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:53,489 INFO L272 TraceCheckUtils]: 17: Hoare triple {22547#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {22587#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:53,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {22587#(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; {22545#true} is VALID [2022-02-20 19:57:53,489 INFO L272 TraceCheckUtils]: 19: Hoare triple {22545#true} call #t~ret8 := is_do_write_p_triggered(); {22545#true} is VALID [2022-02-20 19:57:53,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {22545#true} havoc ~__retres1~0; {22545#true} is VALID [2022-02-20 19:57:53,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {22545#true} assume !(1 == ~p_dw_pc~0); {22545#true} is VALID [2022-02-20 19:57:53,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {22545#true} ~__retres1~0 := 0; {22545#true} is VALID [2022-02-20 19:57:53,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {22545#true} #res := ~__retres1~0; {22545#true} is VALID [2022-02-20 19:57:53,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {22545#true} assume true; {22545#true} is VALID [2022-02-20 19:57:53,489 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22545#true} {22545#true} #1349#return; {22545#true} is VALID [2022-02-20 19:57:53,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {22545#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22545#true} is VALID [2022-02-20 19:57:53,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {22545#true} assume !(0 != ~tmp~1); {22545#true} is VALID [2022-02-20 19:57:53,490 INFO L272 TraceCheckUtils]: 28: Hoare triple {22545#true} call #t~ret9 := is_do_read_c_triggered(); {22545#true} is VALID [2022-02-20 19:57:53,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {22545#true} havoc ~__retres1~1; {22545#true} is VALID [2022-02-20 19:57:53,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {22545#true} assume !(1 == ~c_dr_pc~0); {22545#true} is VALID [2022-02-20 19:57:53,490 INFO L290 TraceCheckUtils]: 31: Hoare triple {22545#true} ~__retres1~1 := 0; {22545#true} is VALID [2022-02-20 19:57:53,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {22545#true} #res := ~__retres1~1; {22545#true} is VALID [2022-02-20 19:57:53,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {22545#true} assume true; {22545#true} is VALID [2022-02-20 19:57:53,490 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {22545#true} {22545#true} #1351#return; {22545#true} is VALID [2022-02-20 19:57:53,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {22545#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22545#true} is VALID [2022-02-20 19:57:53,491 INFO L290 TraceCheckUtils]: 36: Hoare triple {22545#true} assume !(0 != ~tmp___0~1); {22545#true} is VALID [2022-02-20 19:57:53,491 INFO L290 TraceCheckUtils]: 37: Hoare triple {22545#true} assume true; {22545#true} is VALID [2022-02-20 19:57:53,491 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22545#true} {22547#(= ~q_write_ev~0 ~q_read_ev~0)} #1357#return; {22547#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:53,491 INFO L272 TraceCheckUtils]: 39: Hoare triple {22547#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {22586#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:53,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {22586#(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); {22600#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:53,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {22600#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {22601#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:53,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {22601#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {22601#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:53,493 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {22601#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {22547#(= ~q_write_ev~0 ~q_read_ev~0)} #1359#return; {22546#false} is VALID [2022-02-20 19:57:53,493 INFO L290 TraceCheckUtils]: 44: Hoare triple {22546#false} assume !false; {22546#false} is VALID [2022-02-20 19:57:53,493 INFO L290 TraceCheckUtils]: 45: Hoare triple {22546#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; {22546#false} is VALID [2022-02-20 19:57:53,493 INFO L290 TraceCheckUtils]: 46: Hoare triple {22546#false} assume !false; {22546#false} is VALID [2022-02-20 19:57:53,493 INFO L272 TraceCheckUtils]: 47: Hoare triple {22546#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {22545#true} is VALID [2022-02-20 19:57:53,493 INFO L290 TraceCheckUtils]: 48: Hoare triple {22545#true} havoc ~__retres1~2; {22545#true} is VALID [2022-02-20 19:57:53,494 INFO L290 TraceCheckUtils]: 49: Hoare triple {22545#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22545#true} is VALID [2022-02-20 19:57:53,494 INFO L290 TraceCheckUtils]: 50: Hoare triple {22545#true} #res := ~__retres1~2; {22545#true} is VALID [2022-02-20 19:57:53,494 INFO L290 TraceCheckUtils]: 51: Hoare triple {22545#true} assume true; {22545#true} is VALID [2022-02-20 19:57:53,494 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22545#true} {22546#false} #1361#return; {22546#false} is VALID [2022-02-20 19:57:53,494 INFO L290 TraceCheckUtils]: 53: Hoare triple {22546#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; {22546#false} is VALID [2022-02-20 19:57:53,494 INFO L290 TraceCheckUtils]: 54: Hoare triple {22546#false} assume 0 != eval1_~tmp___1~0#1; {22546#false} is VALID [2022-02-20 19:57:53,494 INFO L290 TraceCheckUtils]: 55: Hoare triple {22546#false} assume !(0 == ~p_dw_st~0); {22546#false} is VALID [2022-02-20 19:57:53,494 INFO L290 TraceCheckUtils]: 56: Hoare triple {22546#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; {22546#false} is VALID [2022-02-20 19:57:53,494 INFO L290 TraceCheckUtils]: 57: Hoare triple {22546#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; {22546#false} is VALID [2022-02-20 19:57:53,495 INFO L290 TraceCheckUtils]: 58: Hoare triple {22546#false} assume 0 == ~c_dr_pc~0; {22546#false} is VALID [2022-02-20 19:57:53,495 INFO L290 TraceCheckUtils]: 59: Hoare triple {22546#false} assume !false; {22546#false} is VALID [2022-02-20 19:57:53,495 INFO L290 TraceCheckUtils]: 60: Hoare triple {22546#false} assume !(1 == ~q_free~0); {22546#false} is VALID [2022-02-20 19:57:53,495 INFO L290 TraceCheckUtils]: 61: Hoare triple {22546#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; {22546#false} is VALID [2022-02-20 19:57:53,495 INFO L290 TraceCheckUtils]: 62: Hoare triple {22546#false} assume !(~p_last_write~0 == ~c_last_read~0); {22546#false} is VALID [2022-02-20 19:57:53,495 INFO L272 TraceCheckUtils]: 63: Hoare triple {22546#false} call error1(); {22546#false} is VALID [2022-02-20 19:57:53,495 INFO L290 TraceCheckUtils]: 64: Hoare triple {22546#false} assume !false; {22546#false} is VALID [2022-02-20 19:57:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:53,496 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:53,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217077999] [2022-02-20 19:57:53,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217077999] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:53,496 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:53,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:53,496 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768997098] [2022-02-20 19:57:53,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:53,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:53,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:53,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:53,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:53,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:53,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:53,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:53,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:53,533 INFO L87 Difference]: Start difference. First operand 1483 states and 1973 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:56,519 INFO L93 Difference]: Finished difference Result 2762 states and 3559 transitions. [2022-02-20 19:57:56,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 19:57:56,519 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 851 transitions. [2022-02-20 19:57:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:56,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 851 transitions. [2022-02-20 19:57:56,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 851 transitions. [2022-02-20 19:57:57,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 851 edges. 851 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:57,280 INFO L225 Difference]: With dead ends: 2762 [2022-02-20 19:57:57,281 INFO L226 Difference]: Without dead ends: 1770 [2022-02-20 19:57:57,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-02-20 19:57:57,282 INFO L933 BasicCegarLoop]: 529 mSDtfsCounter, 1043 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:57,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1067 Valid, 1808 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:57:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2022-02-20 19:57:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1425. [2022-02-20 19:57:57,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:57,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1770 states. Second operand has 1425 states, 1156 states have (on average 1.3624567474048443) internal successors, (1575), 1175 states have internal predecessors, (1575), 141 states have call successors, (141), 107 states have call predecessors, (141), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) [2022-02-20 19:57:57,369 INFO L74 IsIncluded]: Start isIncluded. First operand 1770 states. Second operand has 1425 states, 1156 states have (on average 1.3624567474048443) internal successors, (1575), 1175 states have internal predecessors, (1575), 141 states have call successors, (141), 107 states have call predecessors, (141), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) [2022-02-20 19:57:57,370 INFO L87 Difference]: Start difference. First operand 1770 states. Second operand has 1425 states, 1156 states have (on average 1.3624567474048443) internal successors, (1575), 1175 states have internal predecessors, (1575), 141 states have call successors, (141), 107 states have call predecessors, (141), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) [2022-02-20 19:57:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:57,465 INFO L93 Difference]: Finished difference Result 1770 states and 2269 transitions. [2022-02-20 19:57:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2269 transitions. [2022-02-20 19:57:57,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:57,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:57,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 1425 states, 1156 states have (on average 1.3624567474048443) internal successors, (1575), 1175 states have internal predecessors, (1575), 141 states have call successors, (141), 107 states have call predecessors, (141), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) Second operand 1770 states. [2022-02-20 19:57:57,471 INFO L87 Difference]: Start difference. First operand has 1425 states, 1156 states have (on average 1.3624567474048443) internal successors, (1575), 1175 states have internal predecessors, (1575), 141 states have call successors, (141), 107 states have call predecessors, (141), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) Second operand 1770 states. [2022-02-20 19:57:57,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:57,562 INFO L93 Difference]: Finished difference Result 1770 states and 2269 transitions. [2022-02-20 19:57:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2269 transitions. [2022-02-20 19:57:57,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:57,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:57,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:57,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 1156 states have (on average 1.3624567474048443) internal successors, (1575), 1175 states have internal predecessors, (1575), 141 states have call successors, (141), 107 states have call predecessors, (141), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) [2022-02-20 19:57:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1890 transitions. [2022-02-20 19:57:57,642 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1890 transitions. Word has length 65 [2022-02-20 19:57:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:57,642 INFO L470 AbstractCegarLoop]: Abstraction has 1425 states and 1890 transitions. [2022-02-20 19:57:57,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1890 transitions. [2022-02-20 19:57:57,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:57,643 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:57,643 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:57,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:57:57,644 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:57,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:57,644 INFO L85 PathProgramCache]: Analyzing trace with hash -300980683, now seen corresponding path program 1 times [2022-02-20 19:57:57,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:57,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43067258] [2022-02-20 19:57:57,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:57,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {31795#(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); {31755#true} is VALID [2022-02-20 19:57:57,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {31755#true} assume true; {31755#true} is VALID [2022-02-20 19:57:57,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31755#true} {31755#true} #1353#return; {31755#true} is VALID [2022-02-20 19:57:57,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {31796#(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); {31755#true} is VALID [2022-02-20 19:57:57,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {31755#true} assume !(0 == ~q_write_ev~0); {31755#true} is VALID [2022-02-20 19:57:57,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {31755#true} assume true; {31755#true} is VALID [2022-02-20 19:57:57,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31755#true} {31760#(= ~p_dw_st~0 0)} #1355#return; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {31755#true} havoc ~__retres1~0; {31755#true} is VALID [2022-02-20 19:57:57,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {31755#true} assume !(1 == ~p_dw_pc~0); {31755#true} is VALID [2022-02-20 19:57:57,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {31755#true} ~__retres1~0 := 0; {31755#true} is VALID [2022-02-20 19:57:57,703 INFO L290 TraceCheckUtils]: 3: Hoare triple {31755#true} #res := ~__retres1~0; {31755#true} is VALID [2022-02-20 19:57:57,703 INFO L290 TraceCheckUtils]: 4: Hoare triple {31755#true} assume true; {31755#true} is VALID [2022-02-20 19:57:57,704 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {31755#true} {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1349#return; {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {31755#true} havoc ~__retres1~1; {31755#true} is VALID [2022-02-20 19:57:57,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {31755#true} assume !(1 == ~c_dr_pc~0); {31755#true} is VALID [2022-02-20 19:57:57,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {31755#true} ~__retres1~1 := 0; {31755#true} is VALID [2022-02-20 19:57:57,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {31755#true} #res := ~__retres1~1; {31755#true} is VALID [2022-02-20 19:57:57,707 INFO L290 TraceCheckUtils]: 4: Hoare triple {31755#true} assume true; {31755#true} is VALID [2022-02-20 19:57:57,708 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {31755#true} {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1351#return; {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {31797#(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; {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,708 INFO L272 TraceCheckUtils]: 1: Hoare triple {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {31755#true} is VALID [2022-02-20 19:57:57,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {31755#true} havoc ~__retres1~0; {31755#true} is VALID [2022-02-20 19:57:57,708 INFO L290 TraceCheckUtils]: 3: Hoare triple {31755#true} assume !(1 == ~p_dw_pc~0); {31755#true} is VALID [2022-02-20 19:57:57,709 INFO L290 TraceCheckUtils]: 4: Hoare triple {31755#true} ~__retres1~0 := 0; {31755#true} is VALID [2022-02-20 19:57:57,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {31755#true} #res := ~__retres1~0; {31755#true} is VALID [2022-02-20 19:57:57,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {31755#true} assume true; {31755#true} is VALID [2022-02-20 19:57:57,709 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {31755#true} {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1349#return; {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,710 INFO L272 TraceCheckUtils]: 10: Hoare triple {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {31755#true} is VALID [2022-02-20 19:57:57,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {31755#true} havoc ~__retres1~1; {31755#true} is VALID [2022-02-20 19:57:57,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {31755#true} assume !(1 == ~c_dr_pc~0); {31755#true} is VALID [2022-02-20 19:57:57,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {31755#true} ~__retres1~1 := 0; {31755#true} is VALID [2022-02-20 19:57:57,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {31755#true} #res := ~__retres1~1; {31755#true} is VALID [2022-02-20 19:57:57,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {31755#true} assume true; {31755#true} is VALID [2022-02-20 19:57:57,711 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {31755#true} {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1351#return; {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,712 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {31760#(= ~p_dw_st~0 0)} #1357#return; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {31796#(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); {31755#true} is VALID [2022-02-20 19:57:57,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {31755#true} assume !(1 == ~q_write_ev~0); {31755#true} is VALID [2022-02-20 19:57:57,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {31755#true} assume true; {31755#true} is VALID [2022-02-20 19:57:57,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31755#true} {31760#(= ~p_dw_st~0 0)} #1359#return; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {31755#true} havoc ~__retres1~2; {31755#true} is VALID [2022-02-20 19:57:57,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {31755#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {31760#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {31760#(= ~p_dw_st~0 0)} assume true; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,723 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {31760#(= ~p_dw_st~0 0)} {31760#(= ~p_dw_st~0 0)} #1361#return; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {31755#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {31755#true} is VALID [2022-02-20 19:57:57,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {31755#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {31755#true} is VALID [2022-02-20 19:57:57,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {31755#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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; {31755#true} is VALID [2022-02-20 19:57:57,723 INFO L290 TraceCheckUtils]: 3: Hoare triple {31755#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; {31755#true} is VALID [2022-02-20 19:57:57,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {31755#true} call update_channels1(); {31795#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:57,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {31795#(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); {31755#true} is VALID [2022-02-20 19:57:57,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {31755#true} assume true; {31755#true} is VALID [2022-02-20 19:57:57,724 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {31755#true} {31755#true} #1353#return; {31755#true} is VALID [2022-02-20 19:57:57,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {31755#true} assume { :begin_inline_init_threads1 } true; {31755#true} is VALID [2022-02-20 19:57:57,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {31755#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {31760#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {31760#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,725 INFO L272 TraceCheckUtils]: 12: Hoare triple {31760#(= ~p_dw_st~0 0)} call fire_delta_events1(); {31796#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:57,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {31796#(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); {31755#true} is VALID [2022-02-20 19:57:57,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {31755#true} assume !(0 == ~q_write_ev~0); {31755#true} is VALID [2022-02-20 19:57:57,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {31755#true} assume true; {31755#true} is VALID [2022-02-20 19:57:57,726 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {31755#true} {31760#(= ~p_dw_st~0 0)} #1355#return; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,726 INFO L272 TraceCheckUtils]: 17: Hoare triple {31760#(= ~p_dw_st~0 0)} call activate_threads1(); {31797#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:57,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {31797#(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; {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,727 INFO L272 TraceCheckUtils]: 19: Hoare triple {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {31755#true} is VALID [2022-02-20 19:57:57,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {31755#true} havoc ~__retres1~0; {31755#true} is VALID [2022-02-20 19:57:57,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {31755#true} assume !(1 == ~p_dw_pc~0); {31755#true} is VALID [2022-02-20 19:57:57,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {31755#true} ~__retres1~0 := 0; {31755#true} is VALID [2022-02-20 19:57:57,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {31755#true} #res := ~__retres1~0; {31755#true} is VALID [2022-02-20 19:57:57,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {31755#true} assume true; {31755#true} is VALID [2022-02-20 19:57:57,727 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {31755#true} {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1349#return; {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,728 INFO L272 TraceCheckUtils]: 28: Hoare triple {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {31755#true} is VALID [2022-02-20 19:57:57,728 INFO L290 TraceCheckUtils]: 29: Hoare triple {31755#true} havoc ~__retres1~1; {31755#true} is VALID [2022-02-20 19:57:57,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {31755#true} assume !(1 == ~c_dr_pc~0); {31755#true} is VALID [2022-02-20 19:57:57,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {31755#true} ~__retres1~1 := 0; {31755#true} is VALID [2022-02-20 19:57:57,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {31755#true} #res := ~__retres1~1; {31755#true} is VALID [2022-02-20 19:57:57,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {31755#true} assume true; {31755#true} is VALID [2022-02-20 19:57:57,729 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {31755#true} {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1351#return; {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:57,730 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {31798#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {31760#(= ~p_dw_st~0 0)} #1357#return; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,731 INFO L272 TraceCheckUtils]: 39: Hoare triple {31760#(= ~p_dw_st~0 0)} call reset_delta_events1(); {31796#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:57,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {31796#(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); {31755#true} is VALID [2022-02-20 19:57:57,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {31755#true} assume !(1 == ~q_write_ev~0); {31755#true} is VALID [2022-02-20 19:57:57,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {31755#true} assume true; {31755#true} is VALID [2022-02-20 19:57:57,731 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {31755#true} {31760#(= ~p_dw_st~0 0)} #1359#return; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {31760#(= ~p_dw_st~0 0)} assume !false; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {31760#(= ~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; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {31760#(= ~p_dw_st~0 0)} assume !false; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,732 INFO L272 TraceCheckUtils]: 47: Hoare triple {31760#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {31755#true} is VALID [2022-02-20 19:57:57,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {31755#true} havoc ~__retres1~2; {31755#true} is VALID [2022-02-20 19:57:57,732 INFO L290 TraceCheckUtils]: 49: Hoare triple {31755#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {31760#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,733 INFO L290 TraceCheckUtils]: 51: Hoare triple {31760#(= ~p_dw_st~0 0)} assume true; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,733 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {31760#(= ~p_dw_st~0 0)} {31760#(= ~p_dw_st~0 0)} #1361#return; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {31760#(= ~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; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,734 INFO L290 TraceCheckUtils]: 54: Hoare triple {31760#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {31760#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:57,734 INFO L290 TraceCheckUtils]: 55: Hoare triple {31760#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {31756#false} is VALID [2022-02-20 19:57:57,734 INFO L290 TraceCheckUtils]: 56: Hoare triple {31756#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; {31756#false} is VALID [2022-02-20 19:57:57,734 INFO L290 TraceCheckUtils]: 57: Hoare triple {31756#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; {31756#false} is VALID [2022-02-20 19:57:57,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {31756#false} assume 0 == ~c_dr_pc~0; {31756#false} is VALID [2022-02-20 19:57:57,734 INFO L290 TraceCheckUtils]: 59: Hoare triple {31756#false} assume !false; {31756#false} is VALID [2022-02-20 19:57:57,735 INFO L290 TraceCheckUtils]: 60: Hoare triple {31756#false} assume !(1 == ~q_free~0); {31756#false} is VALID [2022-02-20 19:57:57,735 INFO L290 TraceCheckUtils]: 61: Hoare triple {31756#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; {31756#false} is VALID [2022-02-20 19:57:57,735 INFO L290 TraceCheckUtils]: 62: Hoare triple {31756#false} assume !(~p_last_write~0 == ~c_last_read~0); {31756#false} is VALID [2022-02-20 19:57:57,735 INFO L272 TraceCheckUtils]: 63: Hoare triple {31756#false} call error1(); {31756#false} is VALID [2022-02-20 19:57:57,735 INFO L290 TraceCheckUtils]: 64: Hoare triple {31756#false} assume !false; {31756#false} is VALID [2022-02-20 19:57:57,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:57,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:57,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43067258] [2022-02-20 19:57:57,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43067258] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:57,736 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:57,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:57,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390089149] [2022-02-20 19:57:57,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:57,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:57,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:57,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:57,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:57,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:57,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:57,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:57,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:57,768 INFO L87 Difference]: Start difference. First operand 1425 states and 1890 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:59,885 INFO L93 Difference]: Finished difference Result 3787 states and 4887 transitions. [2022-02-20 19:57:59,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:59,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 798 transitions. [2022-02-20 19:57:59,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 798 transitions. [2022-02-20 19:57:59,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 798 transitions. [2022-02-20 19:58:00,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 798 edges. 798 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:00,554 INFO L225 Difference]: With dead ends: 3787 [2022-02-20 19:58:00,555 INFO L226 Difference]: Without dead ends: 2631 [2022-02-20 19:58:00,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:58:00,557 INFO L933 BasicCegarLoop]: 498 mSDtfsCounter, 1272 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:00,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1300 Valid, 1261 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:58:00,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2022-02-20 19:58:00,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2483. [2022-02-20 19:58:00,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:00,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2631 states. Second operand has 2483 states, 1974 states have (on average 1.3034447821681865) internal successors, (2573), 2009 states have internal predecessors, (2573), 257 states have call successors, (257), 206 states have call predecessors, (257), 250 states have return successors, (362), 269 states have call predecessors, (362), 253 states have call successors, (362) [2022-02-20 19:58:00,685 INFO L74 IsIncluded]: Start isIncluded. First operand 2631 states. Second operand has 2483 states, 1974 states have (on average 1.3034447821681865) internal successors, (2573), 2009 states have internal predecessors, (2573), 257 states have call successors, (257), 206 states have call predecessors, (257), 250 states have return successors, (362), 269 states have call predecessors, (362), 253 states have call successors, (362) [2022-02-20 19:58:00,689 INFO L87 Difference]: Start difference. First operand 2631 states. Second operand has 2483 states, 1974 states have (on average 1.3034447821681865) internal successors, (2573), 2009 states have internal predecessors, (2573), 257 states have call successors, (257), 206 states have call predecessors, (257), 250 states have return successors, (362), 269 states have call predecessors, (362), 253 states have call successors, (362) [2022-02-20 19:58:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:00,873 INFO L93 Difference]: Finished difference Result 2631 states and 3354 transitions. [2022-02-20 19:58:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3354 transitions. [2022-02-20 19:58:00,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:00,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:00,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 2483 states, 1974 states have (on average 1.3034447821681865) internal successors, (2573), 2009 states have internal predecessors, (2573), 257 states have call successors, (257), 206 states have call predecessors, (257), 250 states have return successors, (362), 269 states have call predecessors, (362), 253 states have call successors, (362) Second operand 2631 states. [2022-02-20 19:58:00,883 INFO L87 Difference]: Start difference. First operand has 2483 states, 1974 states have (on average 1.3034447821681865) internal successors, (2573), 2009 states have internal predecessors, (2573), 257 states have call successors, (257), 206 states have call predecessors, (257), 250 states have return successors, (362), 269 states have call predecessors, (362), 253 states have call successors, (362) Second operand 2631 states. [2022-02-20 19:58:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:01,074 INFO L93 Difference]: Finished difference Result 2631 states and 3354 transitions. [2022-02-20 19:58:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3354 transitions. [2022-02-20 19:58:01,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:01,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:01,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:01,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 1974 states have (on average 1.3034447821681865) internal successors, (2573), 2009 states have internal predecessors, (2573), 257 states have call successors, (257), 206 states have call predecessors, (257), 250 states have return successors, (362), 269 states have call predecessors, (362), 253 states have call successors, (362) [2022-02-20 19:58:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3192 transitions. [2022-02-20 19:58:01,332 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3192 transitions. Word has length 65 [2022-02-20 19:58:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:01,332 INFO L470 AbstractCegarLoop]: Abstraction has 2483 states and 3192 transitions. [2022-02-20 19:58:01,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3192 transitions. [2022-02-20 19:58:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:58:01,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:01,335 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:01,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:58:01,336 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:01,336 INFO L85 PathProgramCache]: Analyzing trace with hash -57595364, now seen corresponding path program 1 times [2022-02-20 19:58:01,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:01,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094610763] [2022-02-20 19:58:01,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:01,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {45549#(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); {45509#true} is VALID [2022-02-20 19:58:01,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {45509#true} assume true; {45509#true} is VALID [2022-02-20 19:58:01,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45509#true} {45511#(= ~q_free~0 1)} #1353#return; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {45550#(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); {45509#true} is VALID [2022-02-20 19:58:01,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {45509#true} assume !(0 == ~q_write_ev~0); {45509#true} is VALID [2022-02-20 19:58:01,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {45509#true} assume true; {45509#true} is VALID [2022-02-20 19:58:01,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45509#true} {45511#(= ~q_free~0 1)} #1355#return; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {45509#true} havoc ~__retres1~0; {45509#true} is VALID [2022-02-20 19:58:01,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {45509#true} assume !(1 == ~p_dw_pc~0); {45509#true} is VALID [2022-02-20 19:58:01,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {45509#true} ~__retres1~0 := 0; {45509#true} is VALID [2022-02-20 19:58:01,390 INFO L290 TraceCheckUtils]: 3: Hoare triple {45509#true} #res := ~__retres1~0; {45509#true} is VALID [2022-02-20 19:58:01,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {45509#true} assume true; {45509#true} is VALID [2022-02-20 19:58:01,390 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {45509#true} {45509#true} #1349#return; {45509#true} is VALID [2022-02-20 19:58:01,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {45509#true} havoc ~__retres1~1; {45509#true} is VALID [2022-02-20 19:58:01,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {45509#true} assume !(1 == ~c_dr_pc~0); {45509#true} is VALID [2022-02-20 19:58:01,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {45509#true} ~__retres1~1 := 0; {45509#true} is VALID [2022-02-20 19:58:01,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {45509#true} #res := ~__retres1~1; {45509#true} is VALID [2022-02-20 19:58:01,392 INFO L290 TraceCheckUtils]: 4: Hoare triple {45509#true} assume true; {45509#true} is VALID [2022-02-20 19:58:01,392 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {45509#true} {45509#true} #1351#return; {45509#true} is VALID [2022-02-20 19:58:01,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {45551#(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; {45509#true} is VALID [2022-02-20 19:58:01,393 INFO L272 TraceCheckUtils]: 1: Hoare triple {45509#true} call #t~ret8 := is_do_write_p_triggered(); {45509#true} is VALID [2022-02-20 19:58:01,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {45509#true} havoc ~__retres1~0; {45509#true} is VALID [2022-02-20 19:58:01,393 INFO L290 TraceCheckUtils]: 3: Hoare triple {45509#true} assume !(1 == ~p_dw_pc~0); {45509#true} is VALID [2022-02-20 19:58:01,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {45509#true} ~__retres1~0 := 0; {45509#true} is VALID [2022-02-20 19:58:01,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {45509#true} #res := ~__retres1~0; {45509#true} is VALID [2022-02-20 19:58:01,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {45509#true} assume true; {45509#true} is VALID [2022-02-20 19:58:01,393 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {45509#true} {45509#true} #1349#return; {45509#true} is VALID [2022-02-20 19:58:01,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {45509#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45509#true} is VALID [2022-02-20 19:58:01,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {45509#true} assume !(0 != ~tmp~1); {45509#true} is VALID [2022-02-20 19:58:01,394 INFO L272 TraceCheckUtils]: 10: Hoare triple {45509#true} call #t~ret9 := is_do_read_c_triggered(); {45509#true} is VALID [2022-02-20 19:58:01,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {45509#true} havoc ~__retres1~1; {45509#true} is VALID [2022-02-20 19:58:01,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {45509#true} assume !(1 == ~c_dr_pc~0); {45509#true} is VALID [2022-02-20 19:58:01,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {45509#true} ~__retres1~1 := 0; {45509#true} is VALID [2022-02-20 19:58:01,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {45509#true} #res := ~__retres1~1; {45509#true} is VALID [2022-02-20 19:58:01,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {45509#true} assume true; {45509#true} is VALID [2022-02-20 19:58:01,394 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45509#true} {45509#true} #1351#return; {45509#true} is VALID [2022-02-20 19:58:01,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {45509#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {45509#true} is VALID [2022-02-20 19:58:01,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {45509#true} assume !(0 != ~tmp___0~1); {45509#true} is VALID [2022-02-20 19:58:01,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {45509#true} assume true; {45509#true} is VALID [2022-02-20 19:58:01,395 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {45509#true} {45511#(= ~q_free~0 1)} #1357#return; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {45550#(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); {45509#true} is VALID [2022-02-20 19:58:01,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {45509#true} assume !(1 == ~q_write_ev~0); {45509#true} is VALID [2022-02-20 19:58:01,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {45509#true} assume true; {45509#true} is VALID [2022-02-20 19:58:01,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45509#true} {45511#(= ~q_free~0 1)} #1359#return; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {45509#true} havoc ~__retres1~2; {45509#true} is VALID [2022-02-20 19:58:01,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {45509#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45509#true} is VALID [2022-02-20 19:58:01,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {45509#true} #res := ~__retres1~2; {45509#true} is VALID [2022-02-20 19:58:01,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {45509#true} assume true; {45509#true} is VALID [2022-02-20 19:58:01,405 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45509#true} {45511#(= ~q_free~0 1)} #1361#return; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {45509#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {45509#true} is VALID [2022-02-20 19:58:01,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {45509#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {45509#true} is VALID [2022-02-20 19:58:01,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {45509#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {45511#(= ~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; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {45511#(= ~q_free~0 1)} call update_channels1(); {45549#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:01,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {45549#(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); {45509#true} is VALID [2022-02-20 19:58:01,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {45509#true} assume true; {45509#true} is VALID [2022-02-20 19:58:01,407 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {45509#true} {45511#(= ~q_free~0 1)} #1353#return; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {45511#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {45511#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {45511#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {45511#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,408 INFO L272 TraceCheckUtils]: 12: Hoare triple {45511#(= ~q_free~0 1)} call fire_delta_events1(); {45550#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:01,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {45550#(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); {45509#true} is VALID [2022-02-20 19:58:01,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {45509#true} assume !(0 == ~q_write_ev~0); {45509#true} is VALID [2022-02-20 19:58:01,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {45509#true} assume true; {45509#true} is VALID [2022-02-20 19:58:01,408 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45509#true} {45511#(= ~q_free~0 1)} #1355#return; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,409 INFO L272 TraceCheckUtils]: 17: Hoare triple {45511#(= ~q_free~0 1)} call activate_threads1(); {45551#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:01,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {45551#(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; {45509#true} is VALID [2022-02-20 19:58:01,409 INFO L272 TraceCheckUtils]: 19: Hoare triple {45509#true} call #t~ret8 := is_do_write_p_triggered(); {45509#true} is VALID [2022-02-20 19:58:01,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {45509#true} havoc ~__retres1~0; {45509#true} is VALID [2022-02-20 19:58:01,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {45509#true} assume !(1 == ~p_dw_pc~0); {45509#true} is VALID [2022-02-20 19:58:01,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {45509#true} ~__retres1~0 := 0; {45509#true} is VALID [2022-02-20 19:58:01,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {45509#true} #res := ~__retres1~0; {45509#true} is VALID [2022-02-20 19:58:01,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {45509#true} assume true; {45509#true} is VALID [2022-02-20 19:58:01,410 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {45509#true} {45509#true} #1349#return; {45509#true} is VALID [2022-02-20 19:58:01,410 INFO L290 TraceCheckUtils]: 26: Hoare triple {45509#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45509#true} is VALID [2022-02-20 19:58:01,410 INFO L290 TraceCheckUtils]: 27: Hoare triple {45509#true} assume !(0 != ~tmp~1); {45509#true} is VALID [2022-02-20 19:58:01,410 INFO L272 TraceCheckUtils]: 28: Hoare triple {45509#true} call #t~ret9 := is_do_read_c_triggered(); {45509#true} is VALID [2022-02-20 19:58:01,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {45509#true} havoc ~__retres1~1; {45509#true} is VALID [2022-02-20 19:58:01,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {45509#true} assume !(1 == ~c_dr_pc~0); {45509#true} is VALID [2022-02-20 19:58:01,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {45509#true} ~__retres1~1 := 0; {45509#true} is VALID [2022-02-20 19:58:01,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {45509#true} #res := ~__retres1~1; {45509#true} is VALID [2022-02-20 19:58:01,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {45509#true} assume true; {45509#true} is VALID [2022-02-20 19:58:01,411 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {45509#true} {45509#true} #1351#return; {45509#true} is VALID [2022-02-20 19:58:01,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {45509#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {45509#true} is VALID [2022-02-20 19:58:01,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {45509#true} assume !(0 != ~tmp___0~1); {45509#true} is VALID [2022-02-20 19:58:01,411 INFO L290 TraceCheckUtils]: 37: Hoare triple {45509#true} assume true; {45509#true} is VALID [2022-02-20 19:58:01,411 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {45509#true} {45511#(= ~q_free~0 1)} #1357#return; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,412 INFO L272 TraceCheckUtils]: 39: Hoare triple {45511#(= ~q_free~0 1)} call reset_delta_events1(); {45550#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:01,412 INFO L290 TraceCheckUtils]: 40: Hoare triple {45550#(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); {45509#true} is VALID [2022-02-20 19:58:01,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {45509#true} assume !(1 == ~q_write_ev~0); {45509#true} is VALID [2022-02-20 19:58:01,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {45509#true} assume true; {45509#true} is VALID [2022-02-20 19:58:01,412 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {45509#true} {45511#(= ~q_free~0 1)} #1359#return; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,412 INFO L290 TraceCheckUtils]: 44: Hoare triple {45511#(= ~q_free~0 1)} assume !false; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,413 INFO L290 TraceCheckUtils]: 45: Hoare triple {45511#(= ~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; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,413 INFO L290 TraceCheckUtils]: 46: Hoare triple {45511#(= ~q_free~0 1)} assume !false; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,413 INFO L272 TraceCheckUtils]: 47: Hoare triple {45511#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {45509#true} is VALID [2022-02-20 19:58:01,413 INFO L290 TraceCheckUtils]: 48: Hoare triple {45509#true} havoc ~__retres1~2; {45509#true} is VALID [2022-02-20 19:58:01,413 INFO L290 TraceCheckUtils]: 49: Hoare triple {45509#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45509#true} is VALID [2022-02-20 19:58:01,413 INFO L290 TraceCheckUtils]: 50: Hoare triple {45509#true} #res := ~__retres1~2; {45509#true} is VALID [2022-02-20 19:58:01,413 INFO L290 TraceCheckUtils]: 51: Hoare triple {45509#true} assume true; {45509#true} is VALID [2022-02-20 19:58:01,414 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {45509#true} {45511#(= ~q_free~0 1)} #1361#return; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,414 INFO L290 TraceCheckUtils]: 53: Hoare triple {45511#(= ~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; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,414 INFO L290 TraceCheckUtils]: 54: Hoare triple {45511#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,415 INFO L290 TraceCheckUtils]: 55: Hoare triple {45511#(= ~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; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,415 INFO L290 TraceCheckUtils]: 56: Hoare triple {45511#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,415 INFO L290 TraceCheckUtils]: 57: Hoare triple {45511#(= ~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; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,415 INFO L290 TraceCheckUtils]: 58: Hoare triple {45511#(= ~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; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,416 INFO L290 TraceCheckUtils]: 59: Hoare triple {45511#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,416 INFO L290 TraceCheckUtils]: 60: Hoare triple {45511#(= ~q_free~0 1)} assume !false; {45511#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:01,416 INFO L290 TraceCheckUtils]: 61: Hoare triple {45511#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {45510#false} is VALID [2022-02-20 19:58:01,416 INFO L290 TraceCheckUtils]: 62: Hoare triple {45510#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; {45510#false} is VALID [2022-02-20 19:58:01,416 INFO L290 TraceCheckUtils]: 63: Hoare triple {45510#false} assume !(~p_last_write~0 == ~c_last_read~0); {45510#false} is VALID [2022-02-20 19:58:01,416 INFO L272 TraceCheckUtils]: 64: Hoare triple {45510#false} call error1(); {45510#false} is VALID [2022-02-20 19:58:01,416 INFO L290 TraceCheckUtils]: 65: Hoare triple {45510#false} assume !false; {45510#false} is VALID [2022-02-20 19:58:01,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:01,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:01,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094610763] [2022-02-20 19:58:01,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094610763] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:01,417 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:01,417 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:01,417 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44492292] [2022-02-20 19:58:01,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:01,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:01,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:01,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:01,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:01,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:01,449 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:01,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:01,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:01,450 INFO L87 Difference]: Start difference. First operand 2483 states and 3192 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:04,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:04,209 INFO L93 Difference]: Finished difference Result 5763 states and 7313 transitions. [2022-02-20 19:58:04,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:04,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:04,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 797 transitions. [2022-02-20 19:58:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:04,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 797 transitions. [2022-02-20 19:58:04,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 797 transitions. [2022-02-20 19:58:04,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 797 edges. 797 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:05,293 INFO L225 Difference]: With dead ends: 5763 [2022-02-20 19:58:05,293 INFO L226 Difference]: Without dead ends: 3549 [2022-02-20 19:58:05,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:05,297 INFO L933 BasicCegarLoop]: 528 mSDtfsCounter, 877 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:05,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [886 Valid, 1256 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:58:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2022-02-20 19:58:05,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 3253. [2022-02-20 19:58:05,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:05,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3549 states. Second operand has 3253 states, 2573 states have (on average 1.2883793237465992) internal successors, (3315), 2613 states have internal predecessors, (3315), 341 states have call successors, (341), 279 states have call predecessors, (341), 337 states have return successors, (466), 362 states have call predecessors, (466), 337 states have call successors, (466) [2022-02-20 19:58:05,487 INFO L74 IsIncluded]: Start isIncluded. First operand 3549 states. Second operand has 3253 states, 2573 states have (on average 1.2883793237465992) internal successors, (3315), 2613 states have internal predecessors, (3315), 341 states have call successors, (341), 279 states have call predecessors, (341), 337 states have return successors, (466), 362 states have call predecessors, (466), 337 states have call successors, (466) [2022-02-20 19:58:05,490 INFO L87 Difference]: Start difference. First operand 3549 states. Second operand has 3253 states, 2573 states have (on average 1.2883793237465992) internal successors, (3315), 2613 states have internal predecessors, (3315), 341 states have call successors, (341), 279 states have call predecessors, (341), 337 states have return successors, (466), 362 states have call predecessors, (466), 337 states have call successors, (466) [2022-02-20 19:58:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:05,865 INFO L93 Difference]: Finished difference Result 3549 states and 4466 transitions. [2022-02-20 19:58:05,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 4466 transitions. [2022-02-20 19:58:05,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:05,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:05,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 3253 states, 2573 states have (on average 1.2883793237465992) internal successors, (3315), 2613 states have internal predecessors, (3315), 341 states have call successors, (341), 279 states have call predecessors, (341), 337 states have return successors, (466), 362 states have call predecessors, (466), 337 states have call successors, (466) Second operand 3549 states. [2022-02-20 19:58:05,878 INFO L87 Difference]: Start difference. First operand has 3253 states, 2573 states have (on average 1.2883793237465992) internal successors, (3315), 2613 states have internal predecessors, (3315), 341 states have call successors, (341), 279 states have call predecessors, (341), 337 states have return successors, (466), 362 states have call predecessors, (466), 337 states have call successors, (466) Second operand 3549 states. [2022-02-20 19:58:06,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:06,261 INFO L93 Difference]: Finished difference Result 3549 states and 4466 transitions. [2022-02-20 19:58:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 4466 transitions. [2022-02-20 19:58:06,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:06,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:06,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:06,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3253 states, 2573 states have (on average 1.2883793237465992) internal successors, (3315), 2613 states have internal predecessors, (3315), 341 states have call successors, (341), 279 states have call predecessors, (341), 337 states have return successors, (466), 362 states have call predecessors, (466), 337 states have call successors, (466) [2022-02-20 19:58:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3253 states to 3253 states and 4122 transitions. [2022-02-20 19:58:06,762 INFO L78 Accepts]: Start accepts. Automaton has 3253 states and 4122 transitions. Word has length 66 [2022-02-20 19:58:06,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:06,763 INFO L470 AbstractCegarLoop]: Abstraction has 3253 states and 4122 transitions. [2022-02-20 19:58:06,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:06,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3253 states and 4122 transitions. [2022-02-20 19:58:06,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:58:06,764 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:06,764 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:06,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:58:06,764 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:06,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:06,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1644831941, now seen corresponding path program 1 times [2022-02-20 19:58:06,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:06,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401871738] [2022-02-20 19:58:06,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {64810#(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); {64770#true} is VALID [2022-02-20 19:58:06,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {64770#true} assume true; {64770#true} is VALID [2022-02-20 19:58:06,796 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64770#true} {64772#(= ~p_dw_pc~0 0)} #1353#return; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {64811#(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); {64770#true} is VALID [2022-02-20 19:58:06,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {64770#true} assume !(0 == ~q_write_ev~0); {64770#true} is VALID [2022-02-20 19:58:06,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {64770#true} assume true; {64770#true} is VALID [2022-02-20 19:58:06,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64770#true} {64772#(= ~p_dw_pc~0 0)} #1355#return; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {64770#true} havoc ~__retres1~0; {64770#true} is VALID [2022-02-20 19:58:06,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {64770#true} assume !(1 == ~p_dw_pc~0); {64770#true} is VALID [2022-02-20 19:58:06,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {64770#true} ~__retres1~0 := 0; {64770#true} is VALID [2022-02-20 19:58:06,816 INFO L290 TraceCheckUtils]: 3: Hoare triple {64770#true} #res := ~__retres1~0; {64770#true} is VALID [2022-02-20 19:58:06,816 INFO L290 TraceCheckUtils]: 4: Hoare triple {64770#true} assume true; {64770#true} is VALID [2022-02-20 19:58:06,816 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {64770#true} {64770#true} #1349#return; {64770#true} is VALID [2022-02-20 19:58:06,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {64770#true} havoc ~__retres1~1; {64770#true} is VALID [2022-02-20 19:58:06,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {64770#true} assume !(1 == ~c_dr_pc~0); {64770#true} is VALID [2022-02-20 19:58:06,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {64770#true} ~__retres1~1 := 0; {64770#true} is VALID [2022-02-20 19:58:06,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {64770#true} #res := ~__retres1~1; {64770#true} is VALID [2022-02-20 19:58:06,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {64770#true} assume true; {64770#true} is VALID [2022-02-20 19:58:06,819 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {64770#true} {64770#true} #1351#return; {64770#true} is VALID [2022-02-20 19:58:06,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {64812#(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; {64770#true} is VALID [2022-02-20 19:58:06,819 INFO L272 TraceCheckUtils]: 1: Hoare triple {64770#true} call #t~ret8 := is_do_write_p_triggered(); {64770#true} is VALID [2022-02-20 19:58:06,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {64770#true} havoc ~__retres1~0; {64770#true} is VALID [2022-02-20 19:58:06,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {64770#true} assume !(1 == ~p_dw_pc~0); {64770#true} is VALID [2022-02-20 19:58:06,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {64770#true} ~__retres1~0 := 0; {64770#true} is VALID [2022-02-20 19:58:06,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {64770#true} #res := ~__retres1~0; {64770#true} is VALID [2022-02-20 19:58:06,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {64770#true} assume true; {64770#true} is VALID [2022-02-20 19:58:06,820 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {64770#true} {64770#true} #1349#return; {64770#true} is VALID [2022-02-20 19:58:06,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {64770#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {64770#true} is VALID [2022-02-20 19:58:06,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {64770#true} assume !(0 != ~tmp~1); {64770#true} is VALID [2022-02-20 19:58:06,820 INFO L272 TraceCheckUtils]: 10: Hoare triple {64770#true} call #t~ret9 := is_do_read_c_triggered(); {64770#true} is VALID [2022-02-20 19:58:06,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {64770#true} havoc ~__retres1~1; {64770#true} is VALID [2022-02-20 19:58:06,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {64770#true} assume !(1 == ~c_dr_pc~0); {64770#true} is VALID [2022-02-20 19:58:06,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {64770#true} ~__retres1~1 := 0; {64770#true} is VALID [2022-02-20 19:58:06,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {64770#true} #res := ~__retres1~1; {64770#true} is VALID [2022-02-20 19:58:06,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {64770#true} assume true; {64770#true} is VALID [2022-02-20 19:58:06,821 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {64770#true} {64770#true} #1351#return; {64770#true} is VALID [2022-02-20 19:58:06,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {64770#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {64770#true} is VALID [2022-02-20 19:58:06,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {64770#true} assume !(0 != ~tmp___0~1); {64770#true} is VALID [2022-02-20 19:58:06,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {64770#true} assume true; {64770#true} is VALID [2022-02-20 19:58:06,821 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {64770#true} {64772#(= ~p_dw_pc~0 0)} #1357#return; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {64811#(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); {64770#true} is VALID [2022-02-20 19:58:06,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {64770#true} assume !(1 == ~q_write_ev~0); {64770#true} is VALID [2022-02-20 19:58:06,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {64770#true} assume true; {64770#true} is VALID [2022-02-20 19:58:06,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64770#true} {64772#(= ~p_dw_pc~0 0)} #1359#return; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {64770#true} havoc ~__retres1~2; {64770#true} is VALID [2022-02-20 19:58:06,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {64770#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {64770#true} is VALID [2022-02-20 19:58:06,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {64770#true} #res := ~__retres1~2; {64770#true} is VALID [2022-02-20 19:58:06,828 INFO L290 TraceCheckUtils]: 3: Hoare triple {64770#true} assume true; {64770#true} is VALID [2022-02-20 19:58:06,829 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {64770#true} {64772#(= ~p_dw_pc~0 0)} #1361#return; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {64770#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {64770#true} is VALID [2022-02-20 19:58:06,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {64770#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {64770#true} is VALID [2022-02-20 19:58:06,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {64770#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {64772#(= ~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; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {64772#(= ~p_dw_pc~0 0)} call update_channels1(); {64810#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:06,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {64810#(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); {64770#true} is VALID [2022-02-20 19:58:06,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {64770#true} assume true; {64770#true} is VALID [2022-02-20 19:58:06,831 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {64770#true} {64772#(= ~p_dw_pc~0 0)} #1353#return; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {64772#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {64772#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {64772#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {64772#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,832 INFO L272 TraceCheckUtils]: 12: Hoare triple {64772#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {64811#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:06,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {64811#(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); {64770#true} is VALID [2022-02-20 19:58:06,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {64770#true} assume !(0 == ~q_write_ev~0); {64770#true} is VALID [2022-02-20 19:58:06,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {64770#true} assume true; {64770#true} is VALID [2022-02-20 19:58:06,833 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {64770#true} {64772#(= ~p_dw_pc~0 0)} #1355#return; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,833 INFO L272 TraceCheckUtils]: 17: Hoare triple {64772#(= ~p_dw_pc~0 0)} call activate_threads1(); {64812#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:06,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {64812#(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; {64770#true} is VALID [2022-02-20 19:58:06,833 INFO L272 TraceCheckUtils]: 19: Hoare triple {64770#true} call #t~ret8 := is_do_write_p_triggered(); {64770#true} is VALID [2022-02-20 19:58:06,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {64770#true} havoc ~__retres1~0; {64770#true} is VALID [2022-02-20 19:58:06,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {64770#true} assume !(1 == ~p_dw_pc~0); {64770#true} is VALID [2022-02-20 19:58:06,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {64770#true} ~__retres1~0 := 0; {64770#true} is VALID [2022-02-20 19:58:06,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {64770#true} #res := ~__retres1~0; {64770#true} is VALID [2022-02-20 19:58:06,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {64770#true} assume true; {64770#true} is VALID [2022-02-20 19:58:06,834 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {64770#true} {64770#true} #1349#return; {64770#true} is VALID [2022-02-20 19:58:06,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {64770#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {64770#true} is VALID [2022-02-20 19:58:06,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {64770#true} assume !(0 != ~tmp~1); {64770#true} is VALID [2022-02-20 19:58:06,834 INFO L272 TraceCheckUtils]: 28: Hoare triple {64770#true} call #t~ret9 := is_do_read_c_triggered(); {64770#true} is VALID [2022-02-20 19:58:06,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {64770#true} havoc ~__retres1~1; {64770#true} is VALID [2022-02-20 19:58:06,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {64770#true} assume !(1 == ~c_dr_pc~0); {64770#true} is VALID [2022-02-20 19:58:06,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {64770#true} ~__retres1~1 := 0; {64770#true} is VALID [2022-02-20 19:58:06,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {64770#true} #res := ~__retres1~1; {64770#true} is VALID [2022-02-20 19:58:06,835 INFO L290 TraceCheckUtils]: 33: Hoare triple {64770#true} assume true; {64770#true} is VALID [2022-02-20 19:58:06,835 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {64770#true} {64770#true} #1351#return; {64770#true} is VALID [2022-02-20 19:58:06,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {64770#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {64770#true} is VALID [2022-02-20 19:58:06,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {64770#true} assume !(0 != ~tmp___0~1); {64770#true} is VALID [2022-02-20 19:58:06,835 INFO L290 TraceCheckUtils]: 37: Hoare triple {64770#true} assume true; {64770#true} is VALID [2022-02-20 19:58:06,836 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {64770#true} {64772#(= ~p_dw_pc~0 0)} #1357#return; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,836 INFO L272 TraceCheckUtils]: 39: Hoare triple {64772#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {64811#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:06,836 INFO L290 TraceCheckUtils]: 40: Hoare triple {64811#(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); {64770#true} is VALID [2022-02-20 19:58:06,836 INFO L290 TraceCheckUtils]: 41: Hoare triple {64770#true} assume !(1 == ~q_write_ev~0); {64770#true} is VALID [2022-02-20 19:58:06,836 INFO L290 TraceCheckUtils]: 42: Hoare triple {64770#true} assume true; {64770#true} is VALID [2022-02-20 19:58:06,837 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {64770#true} {64772#(= ~p_dw_pc~0 0)} #1359#return; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,837 INFO L290 TraceCheckUtils]: 44: Hoare triple {64772#(= ~p_dw_pc~0 0)} assume !false; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,837 INFO L290 TraceCheckUtils]: 45: Hoare triple {64772#(= ~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; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,838 INFO L290 TraceCheckUtils]: 46: Hoare triple {64772#(= ~p_dw_pc~0 0)} assume !false; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,838 INFO L272 TraceCheckUtils]: 47: Hoare triple {64772#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {64770#true} is VALID [2022-02-20 19:58:06,838 INFO L290 TraceCheckUtils]: 48: Hoare triple {64770#true} havoc ~__retres1~2; {64770#true} is VALID [2022-02-20 19:58:06,838 INFO L290 TraceCheckUtils]: 49: Hoare triple {64770#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {64770#true} is VALID [2022-02-20 19:58:06,838 INFO L290 TraceCheckUtils]: 50: Hoare triple {64770#true} #res := ~__retres1~2; {64770#true} is VALID [2022-02-20 19:58:06,838 INFO L290 TraceCheckUtils]: 51: Hoare triple {64770#true} assume true; {64770#true} is VALID [2022-02-20 19:58:06,838 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {64770#true} {64772#(= ~p_dw_pc~0 0)} #1361#return; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,839 INFO L290 TraceCheckUtils]: 53: Hoare triple {64772#(= ~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; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,839 INFO L290 TraceCheckUtils]: 54: Hoare triple {64772#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,839 INFO L290 TraceCheckUtils]: 55: Hoare triple {64772#(= ~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; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,840 INFO L290 TraceCheckUtils]: 56: Hoare triple {64772#(= ~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; {64772#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:06,840 INFO L290 TraceCheckUtils]: 57: Hoare triple {64772#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {64771#false} is VALID [2022-02-20 19:58:06,840 INFO L290 TraceCheckUtils]: 58: Hoare triple {64771#false} assume 1 == ~p_dw_pc~0; {64771#false} is VALID [2022-02-20 19:58:06,840 INFO L290 TraceCheckUtils]: 59: Hoare triple {64771#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; {64771#false} is VALID [2022-02-20 19:58:06,840 INFO L290 TraceCheckUtils]: 60: Hoare triple {64771#false} assume !false; {64771#false} is VALID [2022-02-20 19:58:06,840 INFO L290 TraceCheckUtils]: 61: Hoare triple {64771#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {64771#false} is VALID [2022-02-20 19:58:06,840 INFO L290 TraceCheckUtils]: 62: Hoare triple {64771#false} assume { :end_inline_do_write_p } true; {64771#false} is VALID [2022-02-20 19:58:06,841 INFO L290 TraceCheckUtils]: 63: Hoare triple {64771#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; {64771#false} is VALID [2022-02-20 19:58:06,841 INFO L290 TraceCheckUtils]: 64: Hoare triple {64771#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; {64771#false} is VALID [2022-02-20 19:58:06,841 INFO L290 TraceCheckUtils]: 65: Hoare triple {64771#false} assume 0 == ~c_dr_pc~0; {64771#false} is VALID [2022-02-20 19:58:06,841 INFO L290 TraceCheckUtils]: 66: Hoare triple {64771#false} assume !false; {64771#false} is VALID [2022-02-20 19:58:06,841 INFO L290 TraceCheckUtils]: 67: Hoare triple {64771#false} assume !(1 == ~q_free~0); {64771#false} is VALID [2022-02-20 19:58:06,841 INFO L290 TraceCheckUtils]: 68: Hoare triple {64771#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; {64771#false} is VALID [2022-02-20 19:58:06,841 INFO L290 TraceCheckUtils]: 69: Hoare triple {64771#false} assume !(~p_last_write~0 == ~c_last_read~0); {64771#false} is VALID [2022-02-20 19:58:06,841 INFO L272 TraceCheckUtils]: 70: Hoare triple {64771#false} call error1(); {64771#false} is VALID [2022-02-20 19:58:06,841 INFO L290 TraceCheckUtils]: 71: Hoare triple {64771#false} assume !false; {64771#false} is VALID [2022-02-20 19:58:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:06,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:06,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401871738] [2022-02-20 19:58:06,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401871738] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:06,842 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:06,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:06,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489824577] [2022-02-20 19:58:06,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:06,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:58:06,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:06,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:06,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:06,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:06,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:06,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:06,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:06,887 INFO L87 Difference]: Start difference. First operand 3253 states and 4122 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:10,276 INFO L93 Difference]: Finished difference Result 6797 states and 8495 transitions. [2022-02-20 19:58:10,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:10,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:58:10,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 790 transitions. [2022-02-20 19:58:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 790 transitions. [2022-02-20 19:58:10,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 790 transitions. [2022-02-20 19:58:10,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 790 edges. 790 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:11,518 INFO L225 Difference]: With dead ends: 6797 [2022-02-20 19:58:11,519 INFO L226 Difference]: Without dead ends: 3812 [2022-02-20 19:58:11,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:11,524 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 1223 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:11,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1252 Valid, 1087 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:58:11,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2022-02-20 19:58:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 3531. [2022-02-20 19:58:11,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:11,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3812 states. Second operand has 3531 states, 2794 states have (on average 1.280959198282033) internal successors, (3579), 2836 states have internal predecessors, (3579), 369 states have call successors, (369), 304 states have call predecessors, (369), 366 states have return successors, (498), 392 states have call predecessors, (498), 365 states have call successors, (498) [2022-02-20 19:58:11,750 INFO L74 IsIncluded]: Start isIncluded. First operand 3812 states. Second operand has 3531 states, 2794 states have (on average 1.280959198282033) internal successors, (3579), 2836 states have internal predecessors, (3579), 369 states have call successors, (369), 304 states have call predecessors, (369), 366 states have return successors, (498), 392 states have call predecessors, (498), 365 states have call successors, (498) [2022-02-20 19:58:11,754 INFO L87 Difference]: Start difference. First operand 3812 states. Second operand has 3531 states, 2794 states have (on average 1.280959198282033) internal successors, (3579), 2836 states have internal predecessors, (3579), 369 states have call successors, (369), 304 states have call predecessors, (369), 366 states have return successors, (498), 392 states have call predecessors, (498), 365 states have call successors, (498) [2022-02-20 19:58:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:12,170 INFO L93 Difference]: Finished difference Result 3812 states and 4771 transitions. [2022-02-20 19:58:12,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3812 states and 4771 transitions. [2022-02-20 19:58:12,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:12,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:12,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 3531 states, 2794 states have (on average 1.280959198282033) internal successors, (3579), 2836 states have internal predecessors, (3579), 369 states have call successors, (369), 304 states have call predecessors, (369), 366 states have return successors, (498), 392 states have call predecessors, (498), 365 states have call successors, (498) Second operand 3812 states. [2022-02-20 19:58:12,184 INFO L87 Difference]: Start difference. First operand has 3531 states, 2794 states have (on average 1.280959198282033) internal successors, (3579), 2836 states have internal predecessors, (3579), 369 states have call successors, (369), 304 states have call predecessors, (369), 366 states have return successors, (498), 392 states have call predecessors, (498), 365 states have call successors, (498) Second operand 3812 states. [2022-02-20 19:58:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:12,613 INFO L93 Difference]: Finished difference Result 3812 states and 4771 transitions. [2022-02-20 19:58:12,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3812 states and 4771 transitions. [2022-02-20 19:58:12,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:12,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:12,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:12,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3531 states, 2794 states have (on average 1.280959198282033) internal successors, (3579), 2836 states have internal predecessors, (3579), 369 states have call successors, (369), 304 states have call predecessors, (369), 366 states have return successors, (498), 392 states have call predecessors, (498), 365 states have call successors, (498) [2022-02-20 19:58:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3531 states to 3531 states and 4446 transitions. [2022-02-20 19:58:13,244 INFO L78 Accepts]: Start accepts. Automaton has 3531 states and 4446 transitions. Word has length 72 [2022-02-20 19:58:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:13,244 INFO L470 AbstractCegarLoop]: Abstraction has 3531 states and 4446 transitions. [2022-02-20 19:58:13,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 3531 states and 4446 transitions. [2022-02-20 19:58:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:58:13,247 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:13,248 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:13,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:58:13,248 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:13,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:13,248 INFO L85 PathProgramCache]: Analyzing trace with hash 33226707, now seen corresponding path program 1 times [2022-02-20 19:58:13,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:13,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433364586] [2022-02-20 19:58:13,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:13,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {86367#(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); {86326#true} is VALID [2022-02-20 19:58:13,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {86326#true} assume true; {86326#true} is VALID [2022-02-20 19:58:13,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86326#true} {86326#true} #1353#return; {86326#true} is VALID [2022-02-20 19:58:13,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {86368#(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); {86326#true} is VALID [2022-02-20 19:58:13,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {86326#true} assume !(0 == ~q_write_ev~0); {86326#true} is VALID [2022-02-20 19:58:13,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {86326#true} assume true; {86326#true} is VALID [2022-02-20 19:58:13,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86326#true} {86326#true} #1355#return; {86326#true} is VALID [2022-02-20 19:58:13,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {86326#true} havoc ~__retres1~0; {86326#true} is VALID [2022-02-20 19:58:13,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {86326#true} assume !(1 == ~p_dw_pc~0); {86326#true} is VALID [2022-02-20 19:58:13,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {86326#true} ~__retres1~0 := 0; {86326#true} is VALID [2022-02-20 19:58:13,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {86326#true} #res := ~__retres1~0; {86326#true} is VALID [2022-02-20 19:58:13,300 INFO L290 TraceCheckUtils]: 4: Hoare triple {86326#true} assume true; {86326#true} is VALID [2022-02-20 19:58:13,300 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {86326#true} {86326#true} #1349#return; {86326#true} is VALID [2022-02-20 19:58:13,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {86326#true} havoc ~__retres1~1; {86326#true} is VALID [2022-02-20 19:58:13,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {86326#true} assume !(1 == ~c_dr_pc~0); {86326#true} is VALID [2022-02-20 19:58:13,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {86326#true} ~__retres1~1 := 0; {86326#true} is VALID [2022-02-20 19:58:13,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {86326#true} #res := ~__retres1~1; {86326#true} is VALID [2022-02-20 19:58:13,303 INFO L290 TraceCheckUtils]: 4: Hoare triple {86326#true} assume true; {86326#true} is VALID [2022-02-20 19:58:13,303 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {86326#true} {86326#true} #1351#return; {86326#true} is VALID [2022-02-20 19:58:13,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {86369#(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; {86326#true} is VALID [2022-02-20 19:58:13,303 INFO L272 TraceCheckUtils]: 1: Hoare triple {86326#true} call #t~ret8 := is_do_write_p_triggered(); {86326#true} is VALID [2022-02-20 19:58:13,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {86326#true} havoc ~__retres1~0; {86326#true} is VALID [2022-02-20 19:58:13,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {86326#true} assume !(1 == ~p_dw_pc~0); {86326#true} is VALID [2022-02-20 19:58:13,304 INFO L290 TraceCheckUtils]: 4: Hoare triple {86326#true} ~__retres1~0 := 0; {86326#true} is VALID [2022-02-20 19:58:13,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {86326#true} #res := ~__retres1~0; {86326#true} is VALID [2022-02-20 19:58:13,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {86326#true} assume true; {86326#true} is VALID [2022-02-20 19:58:13,304 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {86326#true} {86326#true} #1349#return; {86326#true} is VALID [2022-02-20 19:58:13,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {86326#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {86326#true} is VALID [2022-02-20 19:58:13,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {86326#true} assume !(0 != ~tmp~1); {86326#true} is VALID [2022-02-20 19:58:13,304 INFO L272 TraceCheckUtils]: 10: Hoare triple {86326#true} call #t~ret9 := is_do_read_c_triggered(); {86326#true} is VALID [2022-02-20 19:58:13,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {86326#true} havoc ~__retres1~1; {86326#true} is VALID [2022-02-20 19:58:13,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {86326#true} assume !(1 == ~c_dr_pc~0); {86326#true} is VALID [2022-02-20 19:58:13,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {86326#true} ~__retres1~1 := 0; {86326#true} is VALID [2022-02-20 19:58:13,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {86326#true} #res := ~__retres1~1; {86326#true} is VALID [2022-02-20 19:58:13,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {86326#true} assume true; {86326#true} is VALID [2022-02-20 19:58:13,305 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {86326#true} {86326#true} #1351#return; {86326#true} is VALID [2022-02-20 19:58:13,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {86326#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {86326#true} is VALID [2022-02-20 19:58:13,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {86326#true} assume !(0 != ~tmp___0~1); {86326#true} is VALID [2022-02-20 19:58:13,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {86326#true} assume true; {86326#true} is VALID [2022-02-20 19:58:13,305 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {86326#true} {86326#true} #1357#return; {86326#true} is VALID [2022-02-20 19:58:13,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {86368#(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); {86326#true} is VALID [2022-02-20 19:58:13,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {86326#true} assume !(1 == ~q_write_ev~0); {86326#true} is VALID [2022-02-20 19:58:13,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {86326#true} assume true; {86326#true} is VALID [2022-02-20 19:58:13,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86326#true} {86326#true} #1359#return; {86326#true} is VALID [2022-02-20 19:58:13,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {86326#true} havoc ~__retres1~2; {86326#true} is VALID [2022-02-20 19:58:13,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {86326#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {86326#true} is VALID [2022-02-20 19:58:13,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {86326#true} #res := ~__retres1~2; {86326#true} is VALID [2022-02-20 19:58:13,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {86326#true} assume true; {86326#true} is VALID [2022-02-20 19:58:13,313 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {86326#true} {86326#true} #1361#return; {86326#true} is VALID [2022-02-20 19:58:13,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {86326#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {86326#true} is VALID [2022-02-20 19:58:13,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {86326#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {86326#true} is VALID [2022-02-20 19:58:13,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {86326#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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; {86326#true} is VALID [2022-02-20 19:58:13,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {86326#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; {86326#true} is VALID [2022-02-20 19:58:13,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {86326#true} call update_channels1(); {86367#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:13,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {86367#(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); {86326#true} is VALID [2022-02-20 19:58:13,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {86326#true} assume true; {86326#true} is VALID [2022-02-20 19:58:13,314 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {86326#true} {86326#true} #1353#return; {86326#true} is VALID [2022-02-20 19:58:13,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {86326#true} assume { :begin_inline_init_threads1 } true; {86326#true} is VALID [2022-02-20 19:58:13,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {86326#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {86326#true} is VALID [2022-02-20 19:58:13,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {86326#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {86326#true} is VALID [2022-02-20 19:58:13,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {86326#true} assume { :end_inline_init_threads1 } true; {86326#true} is VALID [2022-02-20 19:58:13,315 INFO L272 TraceCheckUtils]: 12: Hoare triple {86326#true} call fire_delta_events1(); {86368#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:13,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {86368#(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); {86326#true} is VALID [2022-02-20 19:58:13,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {86326#true} assume !(0 == ~q_write_ev~0); {86326#true} is VALID [2022-02-20 19:58:13,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {86326#true} assume true; {86326#true} is VALID [2022-02-20 19:58:13,315 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {86326#true} {86326#true} #1355#return; {86326#true} is VALID [2022-02-20 19:58:13,316 INFO L272 TraceCheckUtils]: 17: Hoare triple {86326#true} call activate_threads1(); {86369#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:13,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {86369#(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; {86326#true} is VALID [2022-02-20 19:58:13,316 INFO L272 TraceCheckUtils]: 19: Hoare triple {86326#true} call #t~ret8 := is_do_write_p_triggered(); {86326#true} is VALID [2022-02-20 19:58:13,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {86326#true} havoc ~__retres1~0; {86326#true} is VALID [2022-02-20 19:58:13,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {86326#true} assume !(1 == ~p_dw_pc~0); {86326#true} is VALID [2022-02-20 19:58:13,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {86326#true} ~__retres1~0 := 0; {86326#true} is VALID [2022-02-20 19:58:13,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {86326#true} #res := ~__retres1~0; {86326#true} is VALID [2022-02-20 19:58:13,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {86326#true} assume true; {86326#true} is VALID [2022-02-20 19:58:13,316 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {86326#true} {86326#true} #1349#return; {86326#true} is VALID [2022-02-20 19:58:13,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {86326#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {86326#true} is VALID [2022-02-20 19:58:13,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {86326#true} assume !(0 != ~tmp~1); {86326#true} is VALID [2022-02-20 19:58:13,317 INFO L272 TraceCheckUtils]: 28: Hoare triple {86326#true} call #t~ret9 := is_do_read_c_triggered(); {86326#true} is VALID [2022-02-20 19:58:13,317 INFO L290 TraceCheckUtils]: 29: Hoare triple {86326#true} havoc ~__retres1~1; {86326#true} is VALID [2022-02-20 19:58:13,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {86326#true} assume !(1 == ~c_dr_pc~0); {86326#true} is VALID [2022-02-20 19:58:13,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {86326#true} ~__retres1~1 := 0; {86326#true} is VALID [2022-02-20 19:58:13,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {86326#true} #res := ~__retres1~1; {86326#true} is VALID [2022-02-20 19:58:13,317 INFO L290 TraceCheckUtils]: 33: Hoare triple {86326#true} assume true; {86326#true} is VALID [2022-02-20 19:58:13,317 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {86326#true} {86326#true} #1351#return; {86326#true} is VALID [2022-02-20 19:58:13,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {86326#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {86326#true} is VALID [2022-02-20 19:58:13,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {86326#true} assume !(0 != ~tmp___0~1); {86326#true} is VALID [2022-02-20 19:58:13,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {86326#true} assume true; {86326#true} is VALID [2022-02-20 19:58:13,318 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {86326#true} {86326#true} #1357#return; {86326#true} is VALID [2022-02-20 19:58:13,318 INFO L272 TraceCheckUtils]: 39: Hoare triple {86326#true} call reset_delta_events1(); {86368#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:13,318 INFO L290 TraceCheckUtils]: 40: Hoare triple {86368#(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); {86326#true} is VALID [2022-02-20 19:58:13,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {86326#true} assume !(1 == ~q_write_ev~0); {86326#true} is VALID [2022-02-20 19:58:13,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {86326#true} assume true; {86326#true} is VALID [2022-02-20 19:58:13,319 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {86326#true} {86326#true} #1359#return; {86326#true} is VALID [2022-02-20 19:58:13,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {86326#true} assume !false; {86326#true} is VALID [2022-02-20 19:58:13,319 INFO L290 TraceCheckUtils]: 45: Hoare triple {86326#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; {86326#true} is VALID [2022-02-20 19:58:13,319 INFO L290 TraceCheckUtils]: 46: Hoare triple {86326#true} assume !false; {86326#true} is VALID [2022-02-20 19:58:13,319 INFO L272 TraceCheckUtils]: 47: Hoare triple {86326#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {86326#true} is VALID [2022-02-20 19:58:13,319 INFO L290 TraceCheckUtils]: 48: Hoare triple {86326#true} havoc ~__retres1~2; {86326#true} is VALID [2022-02-20 19:58:13,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {86326#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {86326#true} is VALID [2022-02-20 19:58:13,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {86326#true} #res := ~__retres1~2; {86326#true} is VALID [2022-02-20 19:58:13,319 INFO L290 TraceCheckUtils]: 51: Hoare triple {86326#true} assume true; {86326#true} is VALID [2022-02-20 19:58:13,320 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {86326#true} {86326#true} #1361#return; {86326#true} is VALID [2022-02-20 19:58:13,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {86326#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; {86326#true} is VALID [2022-02-20 19:58:13,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {86326#true} assume 0 != eval1_~tmp___1~0#1; {86326#true} is VALID [2022-02-20 19:58:13,320 INFO L290 TraceCheckUtils]: 55: Hoare triple {86326#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; {86326#true} is VALID [2022-02-20 19:58:13,320 INFO L290 TraceCheckUtils]: 56: Hoare triple {86326#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; {86326#true} is VALID [2022-02-20 19:58:13,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {86326#true} assume 0 == ~p_dw_pc~0; {86326#true} is VALID [2022-02-20 19:58:13,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {86326#true} assume !false; {86326#true} is VALID [2022-02-20 19:58:13,320 INFO L290 TraceCheckUtils]: 59: Hoare triple {86326#true} assume !(0 == ~q_free~0); {86326#true} is VALID [2022-02-20 19:58:13,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {86326#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; {86365#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:13,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {86365#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {86365#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:13,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {86365#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {86365#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:13,322 INFO L290 TraceCheckUtils]: 63: Hoare triple {86365#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {86365#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:13,322 INFO L290 TraceCheckUtils]: 64: Hoare triple {86365#(= ~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; {86365#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:13,322 INFO L290 TraceCheckUtils]: 65: Hoare triple {86365#(= ~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; {86365#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:13,323 INFO L290 TraceCheckUtils]: 66: Hoare triple {86365#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {86365#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:13,323 INFO L290 TraceCheckUtils]: 67: Hoare triple {86365#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {86365#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:13,323 INFO L290 TraceCheckUtils]: 68: Hoare triple {86365#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {86365#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:13,324 INFO L290 TraceCheckUtils]: 69: Hoare triple {86365#(= ~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; {86366#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:58:13,324 INFO L290 TraceCheckUtils]: 70: Hoare triple {86366#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {86327#false} is VALID [2022-02-20 19:58:13,324 INFO L272 TraceCheckUtils]: 71: Hoare triple {86327#false} call error1(); {86327#false} is VALID [2022-02-20 19:58:13,324 INFO L290 TraceCheckUtils]: 72: Hoare triple {86327#false} assume !false; {86327#false} is VALID [2022-02-20 19:58:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:13,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:13,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433364586] [2022-02-20 19:58:13,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433364586] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:13,325 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:13,325 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:13,325 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038845204] [2022-02-20 19:58:13,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:13,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:58:13,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:13,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:13,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:13,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:13,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:13,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:13,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:13,367 INFO L87 Difference]: Start difference. First operand 3531 states and 4446 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:16,112 INFO L93 Difference]: Finished difference Result 4630 states and 5757 transitions. [2022-02-20 19:58:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:16,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:58:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 677 transitions. [2022-02-20 19:58:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 677 transitions. [2022-02-20 19:58:16,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 677 transitions. [2022-02-20 19:58:16,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 677 edges. 677 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:17,481 INFO L225 Difference]: With dead ends: 4630 [2022-02-20 19:58:17,481 INFO L226 Difference]: Without dead ends: 4627 [2022-02-20 19:58:17,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:58:17,483 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 1731 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:17,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1741 Valid, 1067 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:17,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2022-02-20 19:58:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 3993. [2022-02-20 19:58:17,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:17,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4627 states. Second operand has 3993 states, 3149 states have (on average 1.2696093998094633) internal successors, (3998), 3194 states have internal predecessors, (3998), 419 states have call successors, (419), 348 states have call predecessors, (419), 423 states have return successors, (575), 452 states have call predecessors, (575), 416 states have call successors, (575) [2022-02-20 19:58:17,773 INFO L74 IsIncluded]: Start isIncluded. First operand 4627 states. Second operand has 3993 states, 3149 states have (on average 1.2696093998094633) internal successors, (3998), 3194 states have internal predecessors, (3998), 419 states have call successors, (419), 348 states have call predecessors, (419), 423 states have return successors, (575), 452 states have call predecessors, (575), 416 states have call successors, (575) [2022-02-20 19:58:17,776 INFO L87 Difference]: Start difference. First operand 4627 states. Second operand has 3993 states, 3149 states have (on average 1.2696093998094633) internal successors, (3998), 3194 states have internal predecessors, (3998), 419 states have call successors, (419), 348 states have call predecessors, (419), 423 states have return successors, (575), 452 states have call predecessors, (575), 416 states have call successors, (575) [2022-02-20 19:58:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:18,357 INFO L93 Difference]: Finished difference Result 4627 states and 5740 transitions. [2022-02-20 19:58:18,357 INFO L276 IsEmpty]: Start isEmpty. Operand 4627 states and 5740 transitions. [2022-02-20 19:58:18,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:18,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:18,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 3993 states, 3149 states have (on average 1.2696093998094633) internal successors, (3998), 3194 states have internal predecessors, (3998), 419 states have call successors, (419), 348 states have call predecessors, (419), 423 states have return successors, (575), 452 states have call predecessors, (575), 416 states have call successors, (575) Second operand 4627 states. [2022-02-20 19:58:18,371 INFO L87 Difference]: Start difference. First operand has 3993 states, 3149 states have (on average 1.2696093998094633) internal successors, (3998), 3194 states have internal predecessors, (3998), 419 states have call successors, (419), 348 states have call predecessors, (419), 423 states have return successors, (575), 452 states have call predecessors, (575), 416 states have call successors, (575) Second operand 4627 states. [2022-02-20 19:58:18,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:18,966 INFO L93 Difference]: Finished difference Result 4627 states and 5740 transitions. [2022-02-20 19:58:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4627 states and 5740 transitions. [2022-02-20 19:58:18,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:18,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:18,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:18,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3993 states, 3149 states have (on average 1.2696093998094633) internal successors, (3998), 3194 states have internal predecessors, (3998), 419 states have call successors, (419), 348 states have call predecessors, (419), 423 states have return successors, (575), 452 states have call predecessors, (575), 416 states have call successors, (575) [2022-02-20 19:58:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3993 states to 3993 states and 4992 transitions. [2022-02-20 19:58:19,672 INFO L78 Accepts]: Start accepts. Automaton has 3993 states and 4992 transitions. Word has length 73 [2022-02-20 19:58:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:19,672 INFO L470 AbstractCegarLoop]: Abstraction has 3993 states and 4992 transitions. [2022-02-20 19:58:19,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 3993 states and 4992 transitions. [2022-02-20 19:58:19,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:58:19,673 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:19,673 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:19,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 19:58:19,673 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:19,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:19,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1028933253, now seen corresponding path program 1 times [2022-02-20 19:58:19,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:19,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104629645] [2022-02-20 19:58:19,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:19,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {107225#(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); {107183#true} is VALID [2022-02-20 19:58:19,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:19,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107183#true} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1353#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {107226#(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); {107183#true} is VALID [2022-02-20 19:58:19,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {107183#true} assume !(0 == ~q_write_ev~0); {107183#true} is VALID [2022-02-20 19:58:19,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:19,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107183#true} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1355#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {107183#true} havoc ~__retres1~0; {107183#true} is VALID [2022-02-20 19:58:19,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {107183#true} assume !(1 == ~p_dw_pc~0); {107183#true} is VALID [2022-02-20 19:58:19,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {107183#true} ~__retres1~0 := 0; {107183#true} is VALID [2022-02-20 19:58:19,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {107183#true} #res := ~__retres1~0; {107183#true} is VALID [2022-02-20 19:58:19,790 INFO L290 TraceCheckUtils]: 4: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:19,790 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {107183#true} {107183#true} #1349#return; {107183#true} is VALID [2022-02-20 19:58:19,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {107183#true} havoc ~__retres1~1; {107183#true} is VALID [2022-02-20 19:58:19,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {107183#true} assume !(1 == ~c_dr_pc~0); {107183#true} is VALID [2022-02-20 19:58:19,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {107183#true} ~__retres1~1 := 0; {107183#true} is VALID [2022-02-20 19:58:19,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {107183#true} #res := ~__retres1~1; {107183#true} is VALID [2022-02-20 19:58:19,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:19,793 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {107183#true} {107183#true} #1351#return; {107183#true} is VALID [2022-02-20 19:58:19,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {107227#(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; {107183#true} is VALID [2022-02-20 19:58:19,793 INFO L272 TraceCheckUtils]: 1: Hoare triple {107183#true} call #t~ret8 := is_do_write_p_triggered(); {107183#true} is VALID [2022-02-20 19:58:19,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {107183#true} havoc ~__retres1~0; {107183#true} is VALID [2022-02-20 19:58:19,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {107183#true} assume !(1 == ~p_dw_pc~0); {107183#true} is VALID [2022-02-20 19:58:19,794 INFO L290 TraceCheckUtils]: 4: Hoare triple {107183#true} ~__retres1~0 := 0; {107183#true} is VALID [2022-02-20 19:58:19,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {107183#true} #res := ~__retres1~0; {107183#true} is VALID [2022-02-20 19:58:19,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:19,794 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {107183#true} {107183#true} #1349#return; {107183#true} is VALID [2022-02-20 19:58:19,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {107183#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {107183#true} is VALID [2022-02-20 19:58:19,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {107183#true} assume !(0 != ~tmp~1); {107183#true} is VALID [2022-02-20 19:58:19,794 INFO L272 TraceCheckUtils]: 10: Hoare triple {107183#true} call #t~ret9 := is_do_read_c_triggered(); {107183#true} is VALID [2022-02-20 19:58:19,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {107183#true} havoc ~__retres1~1; {107183#true} is VALID [2022-02-20 19:58:19,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {107183#true} assume !(1 == ~c_dr_pc~0); {107183#true} is VALID [2022-02-20 19:58:19,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {107183#true} ~__retres1~1 := 0; {107183#true} is VALID [2022-02-20 19:58:19,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {107183#true} #res := ~__retres1~1; {107183#true} is VALID [2022-02-20 19:58:19,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:19,795 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {107183#true} {107183#true} #1351#return; {107183#true} is VALID [2022-02-20 19:58:19,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {107183#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {107183#true} is VALID [2022-02-20 19:58:19,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {107183#true} assume !(0 != ~tmp___0~1); {107183#true} is VALID [2022-02-20 19:58:19,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:19,796 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {107183#true} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1357#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {107226#(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); {107183#true} is VALID [2022-02-20 19:58:19,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {107183#true} assume !(1 == ~q_write_ev~0); {107183#true} is VALID [2022-02-20 19:58:19,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:19,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107183#true} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1359#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {107183#true} havoc ~__retres1~2; {107183#true} is VALID [2022-02-20 19:58:19,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {107183#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {107183#true} is VALID [2022-02-20 19:58:19,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {107183#true} #res := ~__retres1~2; {107183#true} is VALID [2022-02-20 19:58:19,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:19,803 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {107183#true} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1361#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {107183#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {107183#true} is VALID [2022-02-20 19:58:19,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {107183#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {107183#true} is VALID [2022-02-20 19:58:19,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {107183#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {107185#(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; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {107225#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:19,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {107225#(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); {107183#true} is VALID [2022-02-20 19:58:19,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:19,805 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {107183#true} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1353#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,807 INFO L272 TraceCheckUtils]: 12: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {107226#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:19,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {107226#(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); {107183#true} is VALID [2022-02-20 19:58:19,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {107183#true} assume !(0 == ~q_write_ev~0); {107183#true} is VALID [2022-02-20 19:58:19,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:19,808 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {107183#true} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1355#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,808 INFO L272 TraceCheckUtils]: 17: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {107227#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:19,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {107227#(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; {107183#true} is VALID [2022-02-20 19:58:19,809 INFO L272 TraceCheckUtils]: 19: Hoare triple {107183#true} call #t~ret8 := is_do_write_p_triggered(); {107183#true} is VALID [2022-02-20 19:58:19,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {107183#true} havoc ~__retres1~0; {107183#true} is VALID [2022-02-20 19:58:19,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {107183#true} assume !(1 == ~p_dw_pc~0); {107183#true} is VALID [2022-02-20 19:58:19,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {107183#true} ~__retres1~0 := 0; {107183#true} is VALID [2022-02-20 19:58:19,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {107183#true} #res := ~__retres1~0; {107183#true} is VALID [2022-02-20 19:58:19,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:19,809 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {107183#true} {107183#true} #1349#return; {107183#true} is VALID [2022-02-20 19:58:19,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {107183#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {107183#true} is VALID [2022-02-20 19:58:19,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {107183#true} assume !(0 != ~tmp~1); {107183#true} is VALID [2022-02-20 19:58:19,810 INFO L272 TraceCheckUtils]: 28: Hoare triple {107183#true} call #t~ret9 := is_do_read_c_triggered(); {107183#true} is VALID [2022-02-20 19:58:19,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {107183#true} havoc ~__retres1~1; {107183#true} is VALID [2022-02-20 19:58:19,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {107183#true} assume !(1 == ~c_dr_pc~0); {107183#true} is VALID [2022-02-20 19:58:19,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {107183#true} ~__retres1~1 := 0; {107183#true} is VALID [2022-02-20 19:58:19,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {107183#true} #res := ~__retres1~1; {107183#true} is VALID [2022-02-20 19:58:19,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:19,810 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {107183#true} {107183#true} #1351#return; {107183#true} is VALID [2022-02-20 19:58:19,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {107183#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {107183#true} is VALID [2022-02-20 19:58:19,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {107183#true} assume !(0 != ~tmp___0~1); {107183#true} is VALID [2022-02-20 19:58:19,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:19,811 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {107183#true} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1357#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,812 INFO L272 TraceCheckUtils]: 39: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {107226#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:19,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {107226#(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); {107183#true} is VALID [2022-02-20 19:58:19,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {107183#true} assume !(1 == ~q_write_ev~0); {107183#true} is VALID [2022-02-20 19:58:19,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:19,812 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {107183#true} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1359#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,813 INFO L290 TraceCheckUtils]: 44: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,813 INFO L290 TraceCheckUtils]: 45: Hoare triple {107185#(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; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,813 INFO L290 TraceCheckUtils]: 46: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,814 INFO L272 TraceCheckUtils]: 47: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {107183#true} is VALID [2022-02-20 19:58:19,814 INFO L290 TraceCheckUtils]: 48: Hoare triple {107183#true} havoc ~__retres1~2; {107183#true} is VALID [2022-02-20 19:58:19,814 INFO L290 TraceCheckUtils]: 49: Hoare triple {107183#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {107183#true} is VALID [2022-02-20 19:58:19,814 INFO L290 TraceCheckUtils]: 50: Hoare triple {107183#true} #res := ~__retres1~2; {107183#true} is VALID [2022-02-20 19:58:19,814 INFO L290 TraceCheckUtils]: 51: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:19,814 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {107183#true} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1361#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,815 INFO L290 TraceCheckUtils]: 53: Hoare triple {107185#(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; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,815 INFO L290 TraceCheckUtils]: 54: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,816 INFO L290 TraceCheckUtils]: 55: Hoare triple {107185#(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; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,816 INFO L290 TraceCheckUtils]: 56: Hoare triple {107185#(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; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,816 INFO L290 TraceCheckUtils]: 57: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,817 INFO L290 TraceCheckUtils]: 59: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:19,818 INFO L290 TraceCheckUtils]: 60: Hoare triple {107185#(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; {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:19,818 INFO L290 TraceCheckUtils]: 61: Hoare triple {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:19,818 INFO L290 TraceCheckUtils]: 62: Hoare triple {107223#(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; {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:19,819 INFO L290 TraceCheckUtils]: 63: Hoare triple {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:19,819 INFO L290 TraceCheckUtils]: 64: Hoare triple {107223#(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; {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:19,819 INFO L290 TraceCheckUtils]: 65: Hoare triple {107223#(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; {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:19,820 INFO L290 TraceCheckUtils]: 66: Hoare triple {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:19,820 INFO L290 TraceCheckUtils]: 67: Hoare triple {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:19,821 INFO L290 TraceCheckUtils]: 68: Hoare triple {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:19,821 INFO L290 TraceCheckUtils]: 69: Hoare triple {107223#(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; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:19,822 INFO L290 TraceCheckUtils]: 70: Hoare triple {107224#(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; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:19,822 INFO L290 TraceCheckUtils]: 71: Hoare triple {107224#(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); {107184#false} is VALID [2022-02-20 19:58:19,822 INFO L272 TraceCheckUtils]: 72: Hoare triple {107184#false} call error1(); {107184#false} is VALID [2022-02-20 19:58:19,822 INFO L290 TraceCheckUtils]: 73: Hoare triple {107184#false} assume !false; {107184#false} is VALID [2022-02-20 19:58:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:19,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:19,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104629645] [2022-02-20 19:58:19,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104629645] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:58:19,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019852129] [2022-02-20 19:58:19,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:19,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:58:19,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:19,825 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:58:19,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:58:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:58:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:58:20,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {107183#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {107183#true} is VALID [2022-02-20 19:58:20,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {107183#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {107183#true} is VALID [2022-02-20 19:58:20,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {107183#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {107185#(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; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,626 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1353#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,628 INFO L272 TraceCheckUtils]: 12: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,630 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1355#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,630 INFO L272 TraceCheckUtils]: 17: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,631 INFO L272 TraceCheckUtils]: 19: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,644 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1349#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {107185#(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; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,646 INFO L272 TraceCheckUtils]: 28: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,648 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1351#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {107185#(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; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,649 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1357#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,650 INFO L272 TraceCheckUtils]: 39: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,650 INFO L290 TraceCheckUtils]: 40: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,651 INFO L290 TraceCheckUtils]: 41: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,651 INFO L290 TraceCheckUtils]: 42: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,651 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1359#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,652 INFO L290 TraceCheckUtils]: 44: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,652 INFO L290 TraceCheckUtils]: 45: Hoare triple {107185#(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; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,652 INFO L290 TraceCheckUtils]: 46: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,653 INFO L272 TraceCheckUtils]: 47: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,653 INFO L290 TraceCheckUtils]: 48: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,653 INFO L290 TraceCheckUtils]: 49: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,654 INFO L290 TraceCheckUtils]: 50: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,654 INFO L290 TraceCheckUtils]: 51: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,655 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1361#return; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,655 INFO L290 TraceCheckUtils]: 53: Hoare triple {107185#(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; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,655 INFO L290 TraceCheckUtils]: 54: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,656 INFO L290 TraceCheckUtils]: 55: Hoare triple {107185#(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; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,656 INFO L290 TraceCheckUtils]: 56: Hoare triple {107185#(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; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {107185#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:20,658 INFO L290 TraceCheckUtils]: 60: Hoare triple {107185#(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; {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:20,658 INFO L290 TraceCheckUtils]: 61: Hoare triple {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:20,659 INFO L290 TraceCheckUtils]: 62: Hoare triple {107223#(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; {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:20,659 INFO L290 TraceCheckUtils]: 63: Hoare triple {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:20,659 INFO L290 TraceCheckUtils]: 64: Hoare triple {107223#(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; {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:20,660 INFO L290 TraceCheckUtils]: 65: Hoare triple {107223#(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; {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:20,660 INFO L290 TraceCheckUtils]: 66: Hoare triple {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:20,661 INFO L290 TraceCheckUtils]: 67: Hoare triple {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:20,661 INFO L290 TraceCheckUtils]: 68: Hoare triple {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {107223#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:20,662 INFO L290 TraceCheckUtils]: 69: Hoare triple {107223#(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; {107450#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:20,662 INFO L290 TraceCheckUtils]: 70: Hoare triple {107450#(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; {107450#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:20,662 INFO L290 TraceCheckUtils]: 71: Hoare triple {107450#(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); {107184#false} is VALID [2022-02-20 19:58:20,662 INFO L272 TraceCheckUtils]: 72: Hoare triple {107184#false} call error1(); {107184#false} is VALID [2022-02-20 19:58:20,663 INFO L290 TraceCheckUtils]: 73: Hoare triple {107184#false} assume !false; {107184#false} is VALID [2022-02-20 19:58:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:20,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:58:21,042 INFO L290 TraceCheckUtils]: 73: Hoare triple {107184#false} assume !false; {107184#false} is VALID [2022-02-20 19:58:21,042 INFO L272 TraceCheckUtils]: 72: Hoare triple {107184#false} call error1(); {107184#false} is VALID [2022-02-20 19:58:21,043 INFO L290 TraceCheckUtils]: 71: Hoare triple {107224#(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); {107184#false} is VALID [2022-02-20 19:58:21,043 INFO L290 TraceCheckUtils]: 70: Hoare triple {107224#(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; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,044 INFO L290 TraceCheckUtils]: 69: Hoare triple {107475#(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; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,044 INFO L290 TraceCheckUtils]: 68: Hoare triple {107475#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {107475#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:21,044 INFO L290 TraceCheckUtils]: 67: Hoare triple {107475#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {107475#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:21,045 INFO L290 TraceCheckUtils]: 66: Hoare triple {107475#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {107475#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:21,045 INFO L290 TraceCheckUtils]: 65: Hoare triple {107475#(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; {107475#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:21,046 INFO L290 TraceCheckUtils]: 64: Hoare triple {107475#(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; {107475#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:21,046 INFO L290 TraceCheckUtils]: 63: Hoare triple {107475#(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; {107475#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:21,046 INFO L290 TraceCheckUtils]: 62: Hoare triple {107475#(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; {107475#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:21,047 INFO L290 TraceCheckUtils]: 61: Hoare triple {107475#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {107475#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:21,047 INFO L290 TraceCheckUtils]: 60: Hoare triple {107224#(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; {107475#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:21,048 INFO L290 TraceCheckUtils]: 59: Hoare triple {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,048 INFO L290 TraceCheckUtils]: 58: Hoare triple {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,048 INFO L290 TraceCheckUtils]: 57: Hoare triple {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,049 INFO L290 TraceCheckUtils]: 56: Hoare triple {107224#(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; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,049 INFO L290 TraceCheckUtils]: 55: Hoare triple {107224#(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; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,050 INFO L290 TraceCheckUtils]: 54: Hoare triple {107224#(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; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,050 INFO L290 TraceCheckUtils]: 53: Hoare triple {107224#(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; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,051 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {107183#true} {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1361#return; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,051 INFO L290 TraceCheckUtils]: 51: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:21,051 INFO L290 TraceCheckUtils]: 50: Hoare triple {107183#true} #res := ~__retres1~2; {107183#true} is VALID [2022-02-20 19:58:21,051 INFO L290 TraceCheckUtils]: 49: Hoare triple {107183#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {107183#true} is VALID [2022-02-20 19:58:21,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {107183#true} havoc ~__retres1~2; {107183#true} is VALID [2022-02-20 19:58:21,051 INFO L272 TraceCheckUtils]: 47: Hoare triple {107224#(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(); {107183#true} is VALID [2022-02-20 19:58:21,051 INFO L290 TraceCheckUtils]: 46: Hoare triple {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {107224#(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; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,053 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {107183#true} {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1359#return; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:21,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {107183#true} assume !(1 == ~q_write_ev~0); {107183#true} is VALID [2022-02-20 19:58:21,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {107183#true} assume !(1 == ~q_read_ev~0); {107183#true} is VALID [2022-02-20 19:58:21,053 INFO L272 TraceCheckUtils]: 39: Hoare triple {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {107183#true} is VALID [2022-02-20 19:58:21,053 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {107183#true} {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1357#return; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:21,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {107183#true} assume !(0 != ~tmp___0~1); {107183#true} is VALID [2022-02-20 19:58:21,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {107183#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {107183#true} is VALID [2022-02-20 19:58:21,054 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {107183#true} {107183#true} #1351#return; {107183#true} is VALID [2022-02-20 19:58:21,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:21,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {107183#true} #res := ~__retres1~1; {107183#true} is VALID [2022-02-20 19:58:21,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {107183#true} ~__retres1~1 := 0; {107183#true} is VALID [2022-02-20 19:58:21,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {107183#true} assume !(1 == ~c_dr_pc~0); {107183#true} is VALID [2022-02-20 19:58:21,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {107183#true} havoc ~__retres1~1; {107183#true} is VALID [2022-02-20 19:58:21,054 INFO L272 TraceCheckUtils]: 28: Hoare triple {107183#true} call #t~ret9 := is_do_read_c_triggered(); {107183#true} is VALID [2022-02-20 19:58:21,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {107183#true} assume !(0 != ~tmp~1); {107183#true} is VALID [2022-02-20 19:58:21,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {107183#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {107183#true} is VALID [2022-02-20 19:58:21,055 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {107183#true} {107183#true} #1349#return; {107183#true} is VALID [2022-02-20 19:58:21,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:21,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {107183#true} #res := ~__retres1~0; {107183#true} is VALID [2022-02-20 19:58:21,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {107183#true} ~__retres1~0 := 0; {107183#true} is VALID [2022-02-20 19:58:21,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {107183#true} assume !(1 == ~p_dw_pc~0); {107183#true} is VALID [2022-02-20 19:58:21,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {107183#true} havoc ~__retres1~0; {107183#true} is VALID [2022-02-20 19:58:21,055 INFO L272 TraceCheckUtils]: 19: Hoare triple {107183#true} call #t~ret8 := is_do_write_p_triggered(); {107183#true} is VALID [2022-02-20 19:58:21,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {107183#true} havoc ~tmp~1;havoc ~tmp___0~1; {107183#true} is VALID [2022-02-20 19:58:21,056 INFO L272 TraceCheckUtils]: 17: Hoare triple {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {107183#true} is VALID [2022-02-20 19:58:21,056 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {107183#true} {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1355#return; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:21,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {107183#true} assume !(0 == ~q_write_ev~0); {107183#true} is VALID [2022-02-20 19:58:21,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {107183#true} assume !(0 == ~q_read_ev~0); {107183#true} is VALID [2022-02-20 19:58:21,056 INFO L272 TraceCheckUtils]: 12: Hoare triple {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {107183#true} is VALID [2022-02-20 19:58:21,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {107224#(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; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {107224#(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; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,058 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {107183#true} {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1353#return; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {107183#true} assume true; {107183#true} is VALID [2022-02-20 19:58:21,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {107183#true} assume !(1 == ~q_req_up~0); {107183#true} is VALID [2022-02-20 19:58:21,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {107183#true} is VALID [2022-02-20 19:58:21,059 INFO L290 TraceCheckUtils]: 3: Hoare triple {107224#(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; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {107183#true} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#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; {107224#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:21,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {107183#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {107183#true} is VALID [2022-02-20 19:58:21,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {107183#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~token~0 := 0;~local~0 := 0; {107183#true} is VALID [2022-02-20 19:58:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:21,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019852129] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:58:21,060 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:58:21,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:58:21,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971964295] [2022-02-20 19:58:21,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:58:21,061 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-02-20 19:58:21,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:21,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:58:21,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:21,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:21,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:21,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:21,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:21,169 INFO L87 Difference]: Start difference. First operand 3993 states and 4992 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:58:30,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:30,012 INFO L93 Difference]: Finished difference Result 8338 states and 10243 transitions. [2022-02-20 19:58:30,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-20 19:58:30,013 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-02-20 19:58:30,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:58:30,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1136 transitions. [2022-02-20 19:58:30,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:58:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1136 transitions. [2022-02-20 19:58:30,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 1136 transitions. [2022-02-20 19:58:30,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1136 edges. 1136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:33,693 INFO L225 Difference]: With dead ends: 8338 [2022-02-20 19:58:33,693 INFO L226 Difference]: Without dead ends: 8335 [2022-02-20 19:58:33,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2022-02-20 19:58:33,696 INFO L933 BasicCegarLoop]: 690 mSDtfsCounter, 1493 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 2291 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:33,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1552 Valid, 2291 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 19:58:33,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8335 states.