./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.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_3.cil+token_ring.14.cil.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 5519dfe0be74dafaa274c71ed936f0e7133f32a3aa7e45c032b5d5b905afa484 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:01:10,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:01:10,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:01:10,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:01:10,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:01:10,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:01:10,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:01:10,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:01:10,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:01:10,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:01:10,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:01:10,800 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:01:10,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:01:10,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:01:10,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:01:10,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:01:10,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:01:10,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:01:10,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:01:10,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:01:10,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:01:10,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:01:10,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:01:10,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:01:10,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:01:10,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:01:10,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:01:10,821 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:01:10,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:01:10,823 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:01:10,823 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:01:10,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:01:10,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:01:10,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:01:10,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:01:10,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:01:10,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:01:10,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:01:10,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:01:10,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:01:10,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:01:10,829 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 20:01:10,865 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:01:10,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:01:10,866 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:01:10,867 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:01:10,867 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:01:10,867 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:01:10,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:01:10,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:01:10,868 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:01:10,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:01:10,869 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:01:10,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:01:10,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:01:10,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:01:10,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:01:10,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:01:10,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:01:10,871 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:01:10,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:01:10,871 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:01:10,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:01:10,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:01:10,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:01:10,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:01:10,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:01:10,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:01:10,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:01:10,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:01:10,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:01:10,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:01:10,873 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:01:10,873 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:01:10,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:01:10,874 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 -> 5519dfe0be74dafaa274c71ed936f0e7133f32a3aa7e45c032b5d5b905afa484 [2022-02-20 20:01:11,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:01:11,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:01:11,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:01:11,115 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:01:11,116 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:01:11,117 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c [2022-02-20 20:01:11,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aa071059/4f34f2be95c649fa9bf323306415ad4f/FLAG01dae05c9 [2022-02-20 20:01:11,552 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:01:11,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c [2022-02-20 20:01:11,575 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aa071059/4f34f2be95c649fa9bf323306415ad4f/FLAG01dae05c9 [2022-02-20 20:01:11,589 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aa071059/4f34f2be95c649fa9bf323306415ad4f [2022-02-20 20:01:11,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:01:11,594 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:01:11,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:01:11,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:01:11,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:01:11,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:01:11" (1/1) ... [2022-02-20 20:01:11,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78b2abc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:11, skipping insertion in model container [2022-02-20 20:01:11,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:01:11" (1/1) ... [2022-02-20 20:01:11,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:01:11,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:01:11,789 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_3.cil+token_ring.14.cil.c[911,924] [2022-02-20 20:01:11,839 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_3.cil+token_ring.14.cil.c[8416,8429] [2022-02-20 20:01:11,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:01:11,935 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:01:11,950 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_3.cil+token_ring.14.cil.c[911,924] [2022-02-20 20:01:11,991 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_3.cil+token_ring.14.cil.c[8416,8429] [2022-02-20 20:01:12,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:01:12,133 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:01:12,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:12 WrapperNode [2022-02-20 20:01:12,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:01:12,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:01:12,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:01:12,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:01:12,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:12" (1/1) ... [2022-02-20 20:01:12,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:12" (1/1) ... [2022-02-20 20:01:12,228 INFO L137 Inliner]: procedures = 79, calls = 98, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1081 [2022-02-20 20:01:12,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:01:12,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:01:12,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:01:12,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:01:12,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:12" (1/1) ... [2022-02-20 20:01:12,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:12" (1/1) ... [2022-02-20 20:01:12,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:12" (1/1) ... [2022-02-20 20:01:12,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:12" (1/1) ... [2022-02-20 20:01:12,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:12" (1/1) ... [2022-02-20 20:01:12,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:12" (1/1) ... [2022-02-20 20:01:12,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:12" (1/1) ... [2022-02-20 20:01:12,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:01:12,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:01:12,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:01:12,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:01:12,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:12" (1/1) ... [2022-02-20 20:01:12,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:01:12,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:01:12,334 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 20:01:12,335 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 20:01:12,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:01:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 20:01:12,369 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 20:01:12,369 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 20:01:12,369 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 20:01:12,371 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 20:01:12,371 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 20:01:12,371 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 20:01:12,372 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 20:01:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 20:01:12,372 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 20:01:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 20:01:12,373 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 20:01:12,373 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 20:01:12,373 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 20:01:12,373 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 20:01:12,373 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 20:01:12,373 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 20:01:12,374 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 20:01:12,374 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 20:01:12,374 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 20:01:12,374 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 20:01:12,374 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 20:01:12,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:01:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 20:01:12,375 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 20:01:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 20:01:12,375 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 20:01:12,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:01:12,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:01:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 20:01:12,376 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 20:01:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 20:01:12,376 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 20:01:12,486 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:01:12,488 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:01:13,404 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 20:01:13,404 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-02-20 20:01:13,477 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:01:13,504 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:01:13,504 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2022-02-20 20:01:13,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:01:13 BoogieIcfgContainer [2022-02-20 20:01:13,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:01:13,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:01:13,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:01:13,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:01:13,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:01:11" (1/3) ... [2022-02-20 20:01:13,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564bb76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:01:13, skipping insertion in model container [2022-02-20 20:01:13,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:12" (2/3) ... [2022-02-20 20:01:13,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564bb76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:01:13, skipping insertion in model container [2022-02-20 20:01:13,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:01:13" (3/3) ... [2022-02-20 20:01:13,516 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.14.cil.c [2022-02-20 20:01:13,520 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:01:13,521 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:01:13,569 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:01:13,576 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 20:01:13,577 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:01:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 505 states, 443 states have (on average 1.6410835214446953) internal successors, (727), 451 states have internal predecessors, (727), 44 states have call successors, (44), 15 states have call predecessors, (44), 15 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-02-20 20:01:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:01:13,636 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:13,637 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 20:01:13,638 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:13,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:13,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1125668429, now seen corresponding path program 1 times [2022-02-20 20:01:13,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:13,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341010172] [2022-02-20 20:01:13,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:13,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:13,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:13,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {548#(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); {508#true} is VALID [2022-02-20 20:01:13,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#true} assume true; {508#true} is VALID [2022-02-20 20:01:13,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {508#true} {510#(= 1 ~c_dr_i~0)} #1962#return; {510#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:13,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:13,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {549#(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; {508#true} is VALID [2022-02-20 20:01:13,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {508#true} is VALID [2022-02-20 20:01:13,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {508#true} assume true; {508#true} is VALID [2022-02-20 20:01:13,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {508#true} {509#false} #1964#return; {509#false} is VALID [2022-02-20 20:01:13,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:13,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {508#true} havoc ~__retres1~0; {508#true} is VALID [2022-02-20 20:01:14,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#true} assume 1 == ~p_dw_pc~0; {508#true} is VALID [2022-02-20 20:01:14,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {508#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {508#true} is VALID [2022-02-20 20:01:14,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {508#true} #res := ~__retres1~0; {508#true} is VALID [2022-02-20 20:01:14,005 INFO L290 TraceCheckUtils]: 4: Hoare triple {508#true} assume true; {508#true} is VALID [2022-02-20 20:01:14,005 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {508#true} {508#true} #1958#return; {508#true} is VALID [2022-02-20 20:01:14,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:01:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {508#true} havoc ~__retres1~1; {508#true} is VALID [2022-02-20 20:01:14,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#true} assume 1 == ~c_dr_pc~0; {508#true} is VALID [2022-02-20 20:01:14,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {508#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {508#true} is VALID [2022-02-20 20:01:14,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {508#true} #res := ~__retres1~1; {508#true} is VALID [2022-02-20 20:01:14,013 INFO L290 TraceCheckUtils]: 4: Hoare triple {508#true} assume true; {508#true} is VALID [2022-02-20 20:01:14,013 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {508#true} {508#true} #1960#return; {508#true} is VALID [2022-02-20 20:01:14,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {550#(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; {508#true} is VALID [2022-02-20 20:01:14,014 INFO L272 TraceCheckUtils]: 1: Hoare triple {508#true} call #t~ret8 := is_do_write_p_triggered(); {508#true} is VALID [2022-02-20 20:01:14,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {508#true} havoc ~__retres1~0; {508#true} is VALID [2022-02-20 20:01:14,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {508#true} assume 1 == ~p_dw_pc~0; {508#true} is VALID [2022-02-20 20:01:14,015 INFO L290 TraceCheckUtils]: 4: Hoare triple {508#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {508#true} is VALID [2022-02-20 20:01:14,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {508#true} #res := ~__retres1~0; {508#true} is VALID [2022-02-20 20:01:14,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {508#true} assume true; {508#true} is VALID [2022-02-20 20:01:14,016 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {508#true} {508#true} #1958#return; {508#true} is VALID [2022-02-20 20:01:14,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {508#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {508#true} is VALID [2022-02-20 20:01:14,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {508#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {508#true} is VALID [2022-02-20 20:01:14,017 INFO L272 TraceCheckUtils]: 10: Hoare triple {508#true} call #t~ret9 := is_do_read_c_triggered(); {508#true} is VALID [2022-02-20 20:01:14,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#true} havoc ~__retres1~1; {508#true} is VALID [2022-02-20 20:01:14,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {508#true} assume 1 == ~c_dr_pc~0; {508#true} is VALID [2022-02-20 20:01:14,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {508#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {508#true} is VALID [2022-02-20 20:01:14,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {508#true} #res := ~__retres1~1; {508#true} is VALID [2022-02-20 20:01:14,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {508#true} assume true; {508#true} is VALID [2022-02-20 20:01:14,018 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {508#true} {508#true} #1960#return; {508#true} is VALID [2022-02-20 20:01:14,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {508#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {508#true} is VALID [2022-02-20 20:01:14,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {508#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {508#true} is VALID [2022-02-20 20:01:14,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {508#true} assume true; {508#true} is VALID [2022-02-20 20:01:14,019 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {508#true} {509#false} #1966#return; {509#false} is VALID [2022-02-20 20:01:14,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:01:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {549#(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; {508#true} is VALID [2022-02-20 20:01:14,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#true} assume !(1 == ~q_write_ev~0); {508#true} is VALID [2022-02-20 20:01:14,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {508#true} assume true; {508#true} is VALID [2022-02-20 20:01:14,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {508#true} {509#false} #1968#return; {509#false} is VALID [2022-02-20 20:01:14,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:01:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {508#true} havoc ~__retres1~2; {508#true} is VALID [2022-02-20 20:01:14,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {508#true} is VALID [2022-02-20 20:01:14,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {508#true} #res := ~__retres1~2; {508#true} is VALID [2022-02-20 20:01:14,037 INFO L290 TraceCheckUtils]: 3: Hoare triple {508#true} assume true; {508#true} is VALID [2022-02-20 20:01:14,041 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {508#true} {509#false} #1970#return; {509#false} is VALID [2022-02-20 20:01:14,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {508#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {508#true} is VALID [2022-02-20 20:01:14,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {508#true} is VALID [2022-02-20 20:01:14,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {508#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {510#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:14,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {510#(= 1 ~c_dr_i~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {510#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:14,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {510#(= 1 ~c_dr_i~0)} call update_channels1(); {548#(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 20:01:14,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {548#(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); {508#true} is VALID [2022-02-20 20:01:14,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {508#true} assume true; {508#true} is VALID [2022-02-20 20:01:14,048 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {508#true} {510#(= 1 ~c_dr_i~0)} #1962#return; {510#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:14,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {510#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {510#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:14,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {510#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {510#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:14,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {510#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {509#false} is VALID [2022-02-20 20:01:14,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {509#false} assume { :end_inline_init_threads1 } true; {509#false} is VALID [2022-02-20 20:01:14,050 INFO L272 TraceCheckUtils]: 12: Hoare triple {509#false} call fire_delta_events1(); {549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:14,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {549#(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; {508#true} is VALID [2022-02-20 20:01:14,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {508#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {508#true} is VALID [2022-02-20 20:01:14,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {508#true} assume true; {508#true} is VALID [2022-02-20 20:01:14,051 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {508#true} {509#false} #1964#return; {509#false} is VALID [2022-02-20 20:01:14,052 INFO L272 TraceCheckUtils]: 17: Hoare triple {509#false} call activate_threads1(); {550#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:14,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {550#(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; {508#true} is VALID [2022-02-20 20:01:14,052 INFO L272 TraceCheckUtils]: 19: Hoare triple {508#true} call #t~ret8 := is_do_write_p_triggered(); {508#true} is VALID [2022-02-20 20:01:14,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {508#true} havoc ~__retres1~0; {508#true} is VALID [2022-02-20 20:01:14,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {508#true} assume 1 == ~p_dw_pc~0; {508#true} is VALID [2022-02-20 20:01:14,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {508#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {508#true} is VALID [2022-02-20 20:01:14,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {508#true} #res := ~__retres1~0; {508#true} is VALID [2022-02-20 20:01:14,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {508#true} assume true; {508#true} is VALID [2022-02-20 20:01:14,054 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {508#true} {508#true} #1958#return; {508#true} is VALID [2022-02-20 20:01:14,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {508#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {508#true} is VALID [2022-02-20 20:01:14,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {508#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {508#true} is VALID [2022-02-20 20:01:14,055 INFO L272 TraceCheckUtils]: 28: Hoare triple {508#true} call #t~ret9 := is_do_read_c_triggered(); {508#true} is VALID [2022-02-20 20:01:14,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {508#true} havoc ~__retres1~1; {508#true} is VALID [2022-02-20 20:01:14,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {508#true} assume 1 == ~c_dr_pc~0; {508#true} is VALID [2022-02-20 20:01:14,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {508#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {508#true} is VALID [2022-02-20 20:01:14,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {508#true} #res := ~__retres1~1; {508#true} is VALID [2022-02-20 20:01:14,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {508#true} assume true; {508#true} is VALID [2022-02-20 20:01:14,057 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {508#true} {508#true} #1960#return; {508#true} is VALID [2022-02-20 20:01:14,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {508#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {508#true} is VALID [2022-02-20 20:01:14,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {508#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {508#true} is VALID [2022-02-20 20:01:14,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {508#true} assume true; {508#true} is VALID [2022-02-20 20:01:14,058 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {508#true} {509#false} #1966#return; {509#false} is VALID [2022-02-20 20:01:14,058 INFO L272 TraceCheckUtils]: 39: Hoare triple {509#false} call reset_delta_events1(); {549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:14,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {549#(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; {508#true} is VALID [2022-02-20 20:01:14,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {508#true} assume !(1 == ~q_write_ev~0); {508#true} is VALID [2022-02-20 20:01:14,059 INFO L290 TraceCheckUtils]: 42: Hoare triple {508#true} assume true; {508#true} is VALID [2022-02-20 20:01:14,059 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {508#true} {509#false} #1968#return; {509#false} is VALID [2022-02-20 20:01:14,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {509#false} assume !false; {509#false} is VALID [2022-02-20 20:01:14,059 INFO L290 TraceCheckUtils]: 45: Hoare triple {509#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; {509#false} is VALID [2022-02-20 20:01:14,060 INFO L290 TraceCheckUtils]: 46: Hoare triple {509#false} assume !false; {509#false} is VALID [2022-02-20 20:01:14,060 INFO L272 TraceCheckUtils]: 47: Hoare triple {509#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {508#true} is VALID [2022-02-20 20:01:14,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {508#true} havoc ~__retres1~2; {508#true} is VALID [2022-02-20 20:01:14,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {508#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {508#true} is VALID [2022-02-20 20:01:14,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {508#true} #res := ~__retres1~2; {508#true} is VALID [2022-02-20 20:01:14,061 INFO L290 TraceCheckUtils]: 51: Hoare triple {508#true} assume true; {508#true} is VALID [2022-02-20 20:01:14,064 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {508#true} {509#false} #1970#return; {509#false} is VALID [2022-02-20 20:01:14,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {509#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; {509#false} is VALID [2022-02-20 20:01:14,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {509#false} assume 0 != eval1_~tmp___1~0#1; {509#false} is VALID [2022-02-20 20:01:14,065 INFO L290 TraceCheckUtils]: 55: Hoare triple {509#false} assume !(0 == ~p_dw_st~0); {509#false} is VALID [2022-02-20 20:01:14,072 INFO L290 TraceCheckUtils]: 56: Hoare triple {509#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; {509#false} is VALID [2022-02-20 20:01:14,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {509#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; {509#false} is VALID [2022-02-20 20:01:14,073 INFO L290 TraceCheckUtils]: 58: Hoare triple {509#false} assume !(0 == ~c_dr_pc~0); {509#false} is VALID [2022-02-20 20:01:14,073 INFO L290 TraceCheckUtils]: 59: Hoare triple {509#false} assume 2 == ~c_dr_pc~0; {509#false} is VALID [2022-02-20 20:01:14,073 INFO L290 TraceCheckUtils]: 60: Hoare triple {509#false} do_read_c_~a~0#1 := ~a_t~0; {509#false} is VALID [2022-02-20 20:01:14,074 INFO L290 TraceCheckUtils]: 61: Hoare triple {509#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; {509#false} is VALID [2022-02-20 20:01:14,075 INFO L290 TraceCheckUtils]: 62: Hoare triple {509#false} assume !(~p_last_write~0 == ~c_last_read~0); {509#false} is VALID [2022-02-20 20:01:14,075 INFO L272 TraceCheckUtils]: 63: Hoare triple {509#false} call error1(); {509#false} is VALID [2022-02-20 20:01:14,076 INFO L290 TraceCheckUtils]: 64: Hoare triple {509#false} assume !false; {509#false} is VALID [2022-02-20 20:01:14,077 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 20:01:14,077 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:14,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341010172] [2022-02-20 20:01:14,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341010172] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:14,078 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:14,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:01:14,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782578714] [2022-02-20 20:01:14,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:14,089 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 20:01:14,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:14,097 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 20:01:14,183 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 20:01:14,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:01:14,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:14,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:01:14,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:01:14,215 INFO L87 Difference]: Start difference. First operand has 505 states, 443 states have (on average 1.6410835214446953) internal successors, (727), 451 states have internal predecessors, (727), 44 states have call successors, (44), 15 states have call predecessors, (44), 15 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) 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 20:01:16,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:17,000 INFO L93 Difference]: Finished difference Result 999 states and 1610 transitions. [2022-02-20 20:01:17,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:01:17,000 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 20:01:17,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:17,002 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 20:01:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1610 transitions. [2022-02-20 20:01:17,034 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 20:01:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1610 transitions. [2022-02-20 20:01:17,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1610 transitions. [2022-02-20 20:01:18,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1610 edges. 1610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:18,348 INFO L225 Difference]: With dead ends: 999 [2022-02-20 20:01:18,348 INFO L226 Difference]: Without dead ends: 512 [2022-02-20 20:01:18,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:01:18,356 INFO L933 BasicCegarLoop]: 768 mSDtfsCounter, 788 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:18,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [800 Valid, 2127 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 20:01:18,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-02-20 20:01:18,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 494. [2022-02-20 20:01:18,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:18,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 512 states. Second operand has 494 states, 435 states have (on average 1.554022988505747) internal successors, (676), 440 states have internal predecessors, (676), 44 states have call successors, (44), 15 states have call predecessors, (44), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-02-20 20:01:18,432 INFO L74 IsIncluded]: Start isIncluded. First operand 512 states. Second operand has 494 states, 435 states have (on average 1.554022988505747) internal successors, (676), 440 states have internal predecessors, (676), 44 states have call successors, (44), 15 states have call predecessors, (44), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-02-20 20:01:18,434 INFO L87 Difference]: Start difference. First operand 512 states. Second operand has 494 states, 435 states have (on average 1.554022988505747) internal successors, (676), 440 states have internal predecessors, (676), 44 states have call successors, (44), 15 states have call predecessors, (44), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-02-20 20:01:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:18,461 INFO L93 Difference]: Finished difference Result 512 states and 789 transitions. [2022-02-20 20:01:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 789 transitions. [2022-02-20 20:01:18,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:18,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:18,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 494 states, 435 states have (on average 1.554022988505747) internal successors, (676), 440 states have internal predecessors, (676), 44 states have call successors, (44), 15 states have call predecessors, (44), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 512 states. [2022-02-20 20:01:18,476 INFO L87 Difference]: Start difference. First operand has 494 states, 435 states have (on average 1.554022988505747) internal successors, (676), 440 states have internal predecessors, (676), 44 states have call successors, (44), 15 states have call predecessors, (44), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 512 states. [2022-02-20 20:01:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:18,513 INFO L93 Difference]: Finished difference Result 512 states and 789 transitions. [2022-02-20 20:01:18,513 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 789 transitions. [2022-02-20 20:01:18,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:18,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:18,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:18,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 435 states have (on average 1.554022988505747) internal successors, (676), 440 states have internal predecessors, (676), 44 states have call successors, (44), 15 states have call predecessors, (44), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-02-20 20:01:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 760 transitions. [2022-02-20 20:01:18,557 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 760 transitions. Word has length 65 [2022-02-20 20:01:18,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:18,557 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 760 transitions. [2022-02-20 20:01:18,558 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 20:01:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 760 transitions. [2022-02-20 20:01:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:01:18,560 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:18,560 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 20:01:18,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:01:18,560 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:18,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:18,561 INFO L85 PathProgramCache]: Analyzing trace with hash -261116981, now seen corresponding path program 1 times [2022-02-20 20:01:18,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:18,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680964265] [2022-02-20 20:01:18,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:18,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:18,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:18,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {3597#(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); {3598#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:18,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {3598#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {3598#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:18,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3598#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {3559#(= ~q_read_ev~0 2)} #1962#return; {3559#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:18,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:18,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {3599#(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; {3600#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:18,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {3600#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3600#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:18,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {3600#(= |old(~q_read_ev~0)| 0)} assume true; {3600#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:18,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3600#(= |old(~q_read_ev~0)| 0)} {3559#(= ~q_read_ev~0 2)} #1964#return; {3558#false} is VALID [2022-02-20 20:01:18,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:18,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:18,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {3557#true} havoc ~__retres1~0; {3557#true} is VALID [2022-02-20 20:01:18,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {3557#true} assume 1 == ~p_dw_pc~0; {3557#true} is VALID [2022-02-20 20:01:18,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {3557#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3557#true} is VALID [2022-02-20 20:01:18,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {3557#true} #res := ~__retres1~0; {3557#true} is VALID [2022-02-20 20:01:18,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-02-20 20:01:18,766 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3557#true} {3557#true} #1958#return; {3557#true} is VALID [2022-02-20 20:01:18,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:01:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:18,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {3557#true} havoc ~__retres1~1; {3557#true} is VALID [2022-02-20 20:01:18,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {3557#true} assume 1 == ~c_dr_pc~0; {3557#true} is VALID [2022-02-20 20:01:18,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {3557#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3557#true} is VALID [2022-02-20 20:01:18,771 INFO L290 TraceCheckUtils]: 3: Hoare triple {3557#true} #res := ~__retres1~1; {3557#true} is VALID [2022-02-20 20:01:18,771 INFO L290 TraceCheckUtils]: 4: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-02-20 20:01:18,772 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3557#true} {3557#true} #1960#return; {3557#true} is VALID [2022-02-20 20:01:18,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {3601#(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; {3557#true} is VALID [2022-02-20 20:01:18,772 INFO L272 TraceCheckUtils]: 1: Hoare triple {3557#true} call #t~ret8 := is_do_write_p_triggered(); {3557#true} is VALID [2022-02-20 20:01:18,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {3557#true} havoc ~__retres1~0; {3557#true} is VALID [2022-02-20 20:01:18,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {3557#true} assume 1 == ~p_dw_pc~0; {3557#true} is VALID [2022-02-20 20:01:18,773 INFO L290 TraceCheckUtils]: 4: Hoare triple {3557#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3557#true} is VALID [2022-02-20 20:01:18,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {3557#true} #res := ~__retres1~0; {3557#true} is VALID [2022-02-20 20:01:18,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-02-20 20:01:18,773 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3557#true} {3557#true} #1958#return; {3557#true} is VALID [2022-02-20 20:01:18,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {3557#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3557#true} is VALID [2022-02-20 20:01:18,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {3557#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3557#true} is VALID [2022-02-20 20:01:18,774 INFO L272 TraceCheckUtils]: 10: Hoare triple {3557#true} call #t~ret9 := is_do_read_c_triggered(); {3557#true} is VALID [2022-02-20 20:01:18,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {3557#true} havoc ~__retres1~1; {3557#true} is VALID [2022-02-20 20:01:18,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {3557#true} assume 1 == ~c_dr_pc~0; {3557#true} is VALID [2022-02-20 20:01:18,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {3557#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3557#true} is VALID [2022-02-20 20:01:18,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {3557#true} #res := ~__retres1~1; {3557#true} is VALID [2022-02-20 20:01:18,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-02-20 20:01:18,775 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3557#true} {3557#true} #1960#return; {3557#true} is VALID [2022-02-20 20:01:18,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {3557#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3557#true} is VALID [2022-02-20 20:01:18,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {3557#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3557#true} is VALID [2022-02-20 20:01:18,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-02-20 20:01:18,775 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3557#true} {3558#false} #1966#return; {3558#false} is VALID [2022-02-20 20:01:18,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:01:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:18,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {3599#(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; {3557#true} is VALID [2022-02-20 20:01:18,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {3557#true} assume !(1 == ~q_write_ev~0); {3557#true} is VALID [2022-02-20 20:01:18,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-02-20 20:01:18,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3557#true} {3558#false} #1968#return; {3558#false} is VALID [2022-02-20 20:01:18,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:01:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:18,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {3557#true} havoc ~__retres1~2; {3557#true} is VALID [2022-02-20 20:01:18,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {3557#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3557#true} is VALID [2022-02-20 20:01:18,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {3557#true} #res := ~__retres1~2; {3557#true} is VALID [2022-02-20 20:01:18,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-02-20 20:01:18,790 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3557#true} {3558#false} #1970#return; {3558#false} is VALID [2022-02-20 20:01:18,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {3557#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {3557#true} is VALID [2022-02-20 20:01:18,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {3557#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {3557#true} is VALID [2022-02-20 20:01:18,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {3557#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {3559#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:18,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {3559#(= ~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_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {3559#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:18,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {3559#(= ~q_read_ev~0 2)} call update_channels1(); {3597#(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 20:01:18,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {3597#(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); {3598#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:18,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {3598#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {3598#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:18,793 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3598#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {3559#(= ~q_read_ev~0 2)} #1962#return; {3559#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:18,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {3559#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {3559#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:18,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {3559#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3559#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:18,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {3559#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3559#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:18,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {3559#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {3559#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:18,796 INFO L272 TraceCheckUtils]: 12: Hoare triple {3559#(= ~q_read_ev~0 2)} call fire_delta_events1(); {3599#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:18,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {3599#(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; {3600#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:18,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {3600#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3600#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:18,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {3600#(= |old(~q_read_ev~0)| 0)} assume true; {3600#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:18,798 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3600#(= |old(~q_read_ev~0)| 0)} {3559#(= ~q_read_ev~0 2)} #1964#return; {3558#false} is VALID [2022-02-20 20:01:18,798 INFO L272 TraceCheckUtils]: 17: Hoare triple {3558#false} call activate_threads1(); {3601#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:18,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {3601#(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; {3557#true} is VALID [2022-02-20 20:01:18,798 INFO L272 TraceCheckUtils]: 19: Hoare triple {3557#true} call #t~ret8 := is_do_write_p_triggered(); {3557#true} is VALID [2022-02-20 20:01:18,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {3557#true} havoc ~__retres1~0; {3557#true} is VALID [2022-02-20 20:01:18,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {3557#true} assume 1 == ~p_dw_pc~0; {3557#true} is VALID [2022-02-20 20:01:18,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {3557#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3557#true} is VALID [2022-02-20 20:01:18,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {3557#true} #res := ~__retres1~0; {3557#true} is VALID [2022-02-20 20:01:18,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-02-20 20:01:18,799 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3557#true} {3557#true} #1958#return; {3557#true} is VALID [2022-02-20 20:01:18,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {3557#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3557#true} is VALID [2022-02-20 20:01:18,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {3557#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3557#true} is VALID [2022-02-20 20:01:18,800 INFO L272 TraceCheckUtils]: 28: Hoare triple {3557#true} call #t~ret9 := is_do_read_c_triggered(); {3557#true} is VALID [2022-02-20 20:01:18,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {3557#true} havoc ~__retres1~1; {3557#true} is VALID [2022-02-20 20:01:18,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {3557#true} assume 1 == ~c_dr_pc~0; {3557#true} is VALID [2022-02-20 20:01:18,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {3557#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3557#true} is VALID [2022-02-20 20:01:18,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {3557#true} #res := ~__retres1~1; {3557#true} is VALID [2022-02-20 20:01:18,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-02-20 20:01:18,804 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3557#true} {3557#true} #1960#return; {3557#true} is VALID [2022-02-20 20:01:18,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {3557#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3557#true} is VALID [2022-02-20 20:01:18,805 INFO L290 TraceCheckUtils]: 36: Hoare triple {3557#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3557#true} is VALID [2022-02-20 20:01:18,805 INFO L290 TraceCheckUtils]: 37: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-02-20 20:01:18,807 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3557#true} {3558#false} #1966#return; {3558#false} is VALID [2022-02-20 20:01:18,807 INFO L272 TraceCheckUtils]: 39: Hoare triple {3558#false} call reset_delta_events1(); {3599#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:18,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {3599#(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; {3557#true} is VALID [2022-02-20 20:01:18,807 INFO L290 TraceCheckUtils]: 41: Hoare triple {3557#true} assume !(1 == ~q_write_ev~0); {3557#true} is VALID [2022-02-20 20:01:18,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-02-20 20:01:18,807 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3557#true} {3558#false} #1968#return; {3558#false} is VALID [2022-02-20 20:01:18,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {3558#false} assume !false; {3558#false} is VALID [2022-02-20 20:01:18,808 INFO L290 TraceCheckUtils]: 45: Hoare triple {3558#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; {3558#false} is VALID [2022-02-20 20:01:18,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {3558#false} assume !false; {3558#false} is VALID [2022-02-20 20:01:18,808 INFO L272 TraceCheckUtils]: 47: Hoare triple {3558#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3557#true} is VALID [2022-02-20 20:01:18,809 INFO L290 TraceCheckUtils]: 48: Hoare triple {3557#true} havoc ~__retres1~2; {3557#true} is VALID [2022-02-20 20:01:18,810 INFO L290 TraceCheckUtils]: 49: Hoare triple {3557#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3557#true} is VALID [2022-02-20 20:01:18,810 INFO L290 TraceCheckUtils]: 50: Hoare triple {3557#true} #res := ~__retres1~2; {3557#true} is VALID [2022-02-20 20:01:18,810 INFO L290 TraceCheckUtils]: 51: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-02-20 20:01:18,811 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3557#true} {3558#false} #1970#return; {3558#false} is VALID [2022-02-20 20:01:18,811 INFO L290 TraceCheckUtils]: 53: Hoare triple {3558#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; {3558#false} is VALID [2022-02-20 20:01:18,811 INFO L290 TraceCheckUtils]: 54: Hoare triple {3558#false} assume 0 != eval1_~tmp___1~0#1; {3558#false} is VALID [2022-02-20 20:01:18,811 INFO L290 TraceCheckUtils]: 55: Hoare triple {3558#false} assume !(0 == ~p_dw_st~0); {3558#false} is VALID [2022-02-20 20:01:18,811 INFO L290 TraceCheckUtils]: 56: Hoare triple {3558#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; {3558#false} is VALID [2022-02-20 20:01:18,812 INFO L290 TraceCheckUtils]: 57: Hoare triple {3558#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; {3558#false} is VALID [2022-02-20 20:01:18,812 INFO L290 TraceCheckUtils]: 58: Hoare triple {3558#false} assume !(0 == ~c_dr_pc~0); {3558#false} is VALID [2022-02-20 20:01:18,812 INFO L290 TraceCheckUtils]: 59: Hoare triple {3558#false} assume 2 == ~c_dr_pc~0; {3558#false} is VALID [2022-02-20 20:01:18,812 INFO L290 TraceCheckUtils]: 60: Hoare triple {3558#false} do_read_c_~a~0#1 := ~a_t~0; {3558#false} is VALID [2022-02-20 20:01:18,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {3558#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; {3558#false} is VALID [2022-02-20 20:01:18,812 INFO L290 TraceCheckUtils]: 62: Hoare triple {3558#false} assume !(~p_last_write~0 == ~c_last_read~0); {3558#false} is VALID [2022-02-20 20:01:18,813 INFO L272 TraceCheckUtils]: 63: Hoare triple {3558#false} call error1(); {3558#false} is VALID [2022-02-20 20:01:18,813 INFO L290 TraceCheckUtils]: 64: Hoare triple {3558#false} assume !false; {3558#false} is VALID [2022-02-20 20:01:18,814 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 20:01:18,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:18,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680964265] [2022-02-20 20:01:18,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680964265] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:18,815 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:18,815 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:01:18,815 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494186155] [2022-02-20 20:01:18,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:18,818 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 20:01:18,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:18,819 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 20:01:18,863 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 20:01:18,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:01:18,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:18,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:01:18,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:01:18,866 INFO L87 Difference]: Start difference. First operand 494 states and 760 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 20:01:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:22,325 INFO L93 Difference]: Finished difference Result 749 states and 1129 transitions. [2022-02-20 20:01:22,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:01:22,325 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 20:01:22,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:22,326 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 20:01:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1129 transitions. [2022-02-20 20:01:22,336 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 20:01:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1129 transitions. [2022-02-20 20:01:22,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1129 transitions. [2022-02-20 20:01:23,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1129 edges. 1129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:23,310 INFO L225 Difference]: With dead ends: 749 [2022-02-20 20:01:23,310 INFO L226 Difference]: Without dead ends: 645 [2022-02-20 20:01:23,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:01:23,312 INFO L933 BasicCegarLoop]: 763 mSDtfsCounter, 1273 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 2180 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:23,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1280 Valid, 2180 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:01:23,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-02-20 20:01:23,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 606. [2022-02-20 20:01:23,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:23,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 645 states. Second operand has 606 states, 525 states have (on average 1.5276190476190477) internal successors, (802), 532 states have internal predecessors, (802), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2022-02-20 20:01:23,349 INFO L74 IsIncluded]: Start isIncluded. First operand 645 states. Second operand has 606 states, 525 states have (on average 1.5276190476190477) internal successors, (802), 532 states have internal predecessors, (802), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2022-02-20 20:01:23,351 INFO L87 Difference]: Start difference. First operand 645 states. Second operand has 606 states, 525 states have (on average 1.5276190476190477) internal successors, (802), 532 states have internal predecessors, (802), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2022-02-20 20:01:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:23,401 INFO L93 Difference]: Finished difference Result 645 states and 973 transitions. [2022-02-20 20:01:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 973 transitions. [2022-02-20 20:01:23,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:23,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:23,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 606 states, 525 states have (on average 1.5276190476190477) internal successors, (802), 532 states have internal predecessors, (802), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) Second operand 645 states. [2022-02-20 20:01:23,407 INFO L87 Difference]: Start difference. First operand has 606 states, 525 states have (on average 1.5276190476190477) internal successors, (802), 532 states have internal predecessors, (802), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) Second operand 645 states. [2022-02-20 20:01:23,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:23,441 INFO L93 Difference]: Finished difference Result 645 states and 973 transitions. [2022-02-20 20:01:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 973 transitions. [2022-02-20 20:01:23,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:23,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:23,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:23,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 525 states have (on average 1.5276190476190477) internal successors, (802), 532 states have internal predecessors, (802), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2022-02-20 20:01:23,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 917 transitions. [2022-02-20 20:01:23,474 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 917 transitions. Word has length 65 [2022-02-20 20:01:23,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:23,475 INFO L470 AbstractCegarLoop]: Abstraction has 606 states and 917 transitions. [2022-02-20 20:01:23,476 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 20:01:23,476 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 917 transitions. [2022-02-20 20:01:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:01:23,477 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:23,477 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:23,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:01:23,477 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:23,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:23,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1417771659, now seen corresponding path program 1 times [2022-02-20 20:01:23,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:23,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148564436] [2022-02-20 20:01:23,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:23,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:23,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:23,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {6758#(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); {6759#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:23,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {6759#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {6759#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:23,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6759#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {6720#(= ~q_write_ev~0 ~q_read_ev~0)} #1962#return; {6720#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:23,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:23,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {6759#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {6760#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:23,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {6760#(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; {6761#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:23,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {6761#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {6761#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:23,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6761#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {6720#(= ~q_write_ev~0 ~q_read_ev~0)} #1964#return; {6719#false} is VALID [2022-02-20 20:01:23,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:23,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:23,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {6718#true} havoc ~__retres1~0; {6718#true} is VALID [2022-02-20 20:01:23,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {6718#true} assume 1 == ~p_dw_pc~0; {6718#true} is VALID [2022-02-20 20:01:23,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {6718#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6718#true} is VALID [2022-02-20 20:01:23,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {6718#true} #res := ~__retres1~0; {6718#true} is VALID [2022-02-20 20:01:23,633 INFO L290 TraceCheckUtils]: 4: Hoare triple {6718#true} assume true; {6718#true} is VALID [2022-02-20 20:01:23,633 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6718#true} {6718#true} #1958#return; {6718#true} is VALID [2022-02-20 20:01:23,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:01:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:23,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {6718#true} havoc ~__retres1~1; {6718#true} is VALID [2022-02-20 20:01:23,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {6718#true} assume 1 == ~c_dr_pc~0; {6718#true} is VALID [2022-02-20 20:01:23,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {6718#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6718#true} is VALID [2022-02-20 20:01:23,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {6718#true} #res := ~__retres1~1; {6718#true} is VALID [2022-02-20 20:01:23,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {6718#true} assume true; {6718#true} is VALID [2022-02-20 20:01:23,642 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6718#true} {6718#true} #1960#return; {6718#true} is VALID [2022-02-20 20:01:23,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {6762#(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; {6718#true} is VALID [2022-02-20 20:01:23,643 INFO L272 TraceCheckUtils]: 1: Hoare triple {6718#true} call #t~ret8 := is_do_write_p_triggered(); {6718#true} is VALID [2022-02-20 20:01:23,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {6718#true} havoc ~__retres1~0; {6718#true} is VALID [2022-02-20 20:01:23,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {6718#true} assume 1 == ~p_dw_pc~0; {6718#true} is VALID [2022-02-20 20:01:23,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {6718#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6718#true} is VALID [2022-02-20 20:01:23,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {6718#true} #res := ~__retres1~0; {6718#true} is VALID [2022-02-20 20:01:23,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {6718#true} assume true; {6718#true} is VALID [2022-02-20 20:01:23,644 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6718#true} {6718#true} #1958#return; {6718#true} is VALID [2022-02-20 20:01:23,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {6718#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6718#true} is VALID [2022-02-20 20:01:23,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {6718#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6718#true} is VALID [2022-02-20 20:01:23,644 INFO L272 TraceCheckUtils]: 10: Hoare triple {6718#true} call #t~ret9 := is_do_read_c_triggered(); {6718#true} is VALID [2022-02-20 20:01:23,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {6718#true} havoc ~__retres1~1; {6718#true} is VALID [2022-02-20 20:01:23,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {6718#true} assume 1 == ~c_dr_pc~0; {6718#true} is VALID [2022-02-20 20:01:23,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {6718#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6718#true} is VALID [2022-02-20 20:01:23,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {6718#true} #res := ~__retres1~1; {6718#true} is VALID [2022-02-20 20:01:23,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {6718#true} assume true; {6718#true} is VALID [2022-02-20 20:01:23,645 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6718#true} {6718#true} #1960#return; {6718#true} is VALID [2022-02-20 20:01:23,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {6718#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6718#true} is VALID [2022-02-20 20:01:23,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {6718#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6718#true} is VALID [2022-02-20 20:01:23,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {6718#true} assume true; {6718#true} is VALID [2022-02-20 20:01:23,647 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6718#true} {6719#false} #1966#return; {6719#false} is VALID [2022-02-20 20:01:23,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:01:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:23,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {6759#(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); {6718#true} is VALID [2022-02-20 20:01:23,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {6718#true} assume !(1 == ~q_write_ev~0); {6718#true} is VALID [2022-02-20 20:01:23,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {6718#true} assume true; {6718#true} is VALID [2022-02-20 20:01:23,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6718#true} {6719#false} #1968#return; {6719#false} is VALID [2022-02-20 20:01:23,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:01:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:23,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {6718#true} havoc ~__retres1~2; {6718#true} is VALID [2022-02-20 20:01:23,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {6718#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6718#true} is VALID [2022-02-20 20:01:23,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {6718#true} #res := ~__retres1~2; {6718#true} is VALID [2022-02-20 20:01:23,656 INFO L290 TraceCheckUtils]: 3: Hoare triple {6718#true} assume true; {6718#true} is VALID [2022-02-20 20:01:23,657 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6718#true} {6719#false} #1970#return; {6719#false} is VALID [2022-02-20 20:01:23,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {6718#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {6718#true} is VALID [2022-02-20 20:01:23,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {6718#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {6718#true} is VALID [2022-02-20 20:01:23,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {6718#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {6720#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:23,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {6720#(= ~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_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {6720#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:23,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {6720#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {6758#(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 20:01:23,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {6758#(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); {6759#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:23,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {6759#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {6759#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:23,661 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6759#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {6720#(= ~q_write_ev~0 ~q_read_ev~0)} #1962#return; {6720#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:23,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {6720#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {6720#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:23,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {6720#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {6720#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:23,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {6720#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {6720#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:23,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {6720#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {6720#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:23,663 INFO L272 TraceCheckUtils]: 12: Hoare triple {6720#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {6759#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:23,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {6759#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {6760#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:23,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {6760#(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; {6761#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:23,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {6761#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {6761#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:23,664 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6761#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {6720#(= ~q_write_ev~0 ~q_read_ev~0)} #1964#return; {6719#false} is VALID [2022-02-20 20:01:23,665 INFO L272 TraceCheckUtils]: 17: Hoare triple {6719#false} call activate_threads1(); {6762#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:23,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {6762#(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; {6718#true} is VALID [2022-02-20 20:01:23,665 INFO L272 TraceCheckUtils]: 19: Hoare triple {6718#true} call #t~ret8 := is_do_write_p_triggered(); {6718#true} is VALID [2022-02-20 20:01:23,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {6718#true} havoc ~__retres1~0; {6718#true} is VALID [2022-02-20 20:01:23,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {6718#true} assume 1 == ~p_dw_pc~0; {6718#true} is VALID [2022-02-20 20:01:23,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {6718#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6718#true} is VALID [2022-02-20 20:01:23,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {6718#true} #res := ~__retres1~0; {6718#true} is VALID [2022-02-20 20:01:23,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {6718#true} assume true; {6718#true} is VALID [2022-02-20 20:01:23,666 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6718#true} {6718#true} #1958#return; {6718#true} is VALID [2022-02-20 20:01:23,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {6718#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6718#true} is VALID [2022-02-20 20:01:23,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {6718#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6718#true} is VALID [2022-02-20 20:01:23,667 INFO L272 TraceCheckUtils]: 28: Hoare triple {6718#true} call #t~ret9 := is_do_read_c_triggered(); {6718#true} is VALID [2022-02-20 20:01:23,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {6718#true} havoc ~__retres1~1; {6718#true} is VALID [2022-02-20 20:01:23,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {6718#true} assume 1 == ~c_dr_pc~0; {6718#true} is VALID [2022-02-20 20:01:23,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {6718#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6718#true} is VALID [2022-02-20 20:01:23,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {6718#true} #res := ~__retres1~1; {6718#true} is VALID [2022-02-20 20:01:23,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {6718#true} assume true; {6718#true} is VALID [2022-02-20 20:01:23,668 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6718#true} {6718#true} #1960#return; {6718#true} is VALID [2022-02-20 20:01:23,668 INFO L290 TraceCheckUtils]: 35: Hoare triple {6718#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6718#true} is VALID [2022-02-20 20:01:23,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {6718#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6718#true} is VALID [2022-02-20 20:01:23,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {6718#true} assume true; {6718#true} is VALID [2022-02-20 20:01:23,669 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6718#true} {6719#false} #1966#return; {6719#false} is VALID [2022-02-20 20:01:23,669 INFO L272 TraceCheckUtils]: 39: Hoare triple {6719#false} call reset_delta_events1(); {6759#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:23,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {6759#(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); {6718#true} is VALID [2022-02-20 20:01:23,669 INFO L290 TraceCheckUtils]: 41: Hoare triple {6718#true} assume !(1 == ~q_write_ev~0); {6718#true} is VALID [2022-02-20 20:01:23,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {6718#true} assume true; {6718#true} is VALID [2022-02-20 20:01:23,670 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6718#true} {6719#false} #1968#return; {6719#false} is VALID [2022-02-20 20:01:23,670 INFO L290 TraceCheckUtils]: 44: Hoare triple {6719#false} assume !false; {6719#false} is VALID [2022-02-20 20:01:23,670 INFO L290 TraceCheckUtils]: 45: Hoare triple {6719#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; {6719#false} is VALID [2022-02-20 20:01:23,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {6719#false} assume !false; {6719#false} is VALID [2022-02-20 20:01:23,670 INFO L272 TraceCheckUtils]: 47: Hoare triple {6719#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {6718#true} is VALID [2022-02-20 20:01:23,670 INFO L290 TraceCheckUtils]: 48: Hoare triple {6718#true} havoc ~__retres1~2; {6718#true} is VALID [2022-02-20 20:01:23,671 INFO L290 TraceCheckUtils]: 49: Hoare triple {6718#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6718#true} is VALID [2022-02-20 20:01:23,671 INFO L290 TraceCheckUtils]: 50: Hoare triple {6718#true} #res := ~__retres1~2; {6718#true} is VALID [2022-02-20 20:01:23,671 INFO L290 TraceCheckUtils]: 51: Hoare triple {6718#true} assume true; {6718#true} is VALID [2022-02-20 20:01:23,671 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6718#true} {6719#false} #1970#return; {6719#false} is VALID [2022-02-20 20:01:23,671 INFO L290 TraceCheckUtils]: 53: Hoare triple {6719#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; {6719#false} is VALID [2022-02-20 20:01:23,672 INFO L290 TraceCheckUtils]: 54: Hoare triple {6719#false} assume 0 != eval1_~tmp___1~0#1; {6719#false} is VALID [2022-02-20 20:01:23,672 INFO L290 TraceCheckUtils]: 55: Hoare triple {6719#false} assume !(0 == ~p_dw_st~0); {6719#false} is VALID [2022-02-20 20:01:23,672 INFO L290 TraceCheckUtils]: 56: Hoare triple {6719#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; {6719#false} is VALID [2022-02-20 20:01:23,672 INFO L290 TraceCheckUtils]: 57: Hoare triple {6719#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; {6719#false} is VALID [2022-02-20 20:01:23,672 INFO L290 TraceCheckUtils]: 58: Hoare triple {6719#false} assume !(0 == ~c_dr_pc~0); {6719#false} is VALID [2022-02-20 20:01:23,672 INFO L290 TraceCheckUtils]: 59: Hoare triple {6719#false} assume 2 == ~c_dr_pc~0; {6719#false} is VALID [2022-02-20 20:01:23,673 INFO L290 TraceCheckUtils]: 60: Hoare triple {6719#false} do_read_c_~a~0#1 := ~a_t~0; {6719#false} is VALID [2022-02-20 20:01:23,673 INFO L290 TraceCheckUtils]: 61: Hoare triple {6719#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; {6719#false} is VALID [2022-02-20 20:01:23,673 INFO L290 TraceCheckUtils]: 62: Hoare triple {6719#false} assume !(~p_last_write~0 == ~c_last_read~0); {6719#false} is VALID [2022-02-20 20:01:23,673 INFO L272 TraceCheckUtils]: 63: Hoare triple {6719#false} call error1(); {6719#false} is VALID [2022-02-20 20:01:23,673 INFO L290 TraceCheckUtils]: 64: Hoare triple {6719#false} assume !false; {6719#false} is VALID [2022-02-20 20:01:23,675 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 20:01:23,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:23,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148564436] [2022-02-20 20:01:23,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148564436] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:23,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:23,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:01:23,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732322758] [2022-02-20 20:01:23,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:23,677 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 20:01:23,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:23,677 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 20:01:23,716 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 20:01:23,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:01:23,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:23,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:01:23,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:01:23,717 INFO L87 Difference]: Start difference. First operand 606 states and 917 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 20:01:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:27,780 INFO L93 Difference]: Finished difference Result 1003 states and 1482 transitions. [2022-02-20 20:01:27,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 20:01:27,781 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 20:01:27,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:27,782 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 20:01:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1159 transitions. [2022-02-20 20:01:27,792 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 20:01:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1159 transitions. [2022-02-20 20:01:27,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1159 transitions. [2022-02-20 20:01:28,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1159 edges. 1159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:28,751 INFO L225 Difference]: With dead ends: 1003 [2022-02-20 20:01:28,751 INFO L226 Difference]: Without dead ends: 794 [2022-02-20 20:01:28,752 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 20:01:28,753 INFO L933 BasicCegarLoop]: 790 mSDtfsCounter, 1855 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1889 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:28,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1889 Valid, 2323 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 20:01:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-02-20 20:01:28,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 718. [2022-02-20 20:01:28,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:28,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 794 states. Second operand has 718 states, 615 states have (on average 1.5073170731707317) internal successors, (927), 624 states have internal predecessors, (927), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2022-02-20 20:01:28,786 INFO L74 IsIncluded]: Start isIncluded. First operand 794 states. Second operand has 718 states, 615 states have (on average 1.5073170731707317) internal successors, (927), 624 states have internal predecessors, (927), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2022-02-20 20:01:28,787 INFO L87 Difference]: Start difference. First operand 794 states. Second operand has 718 states, 615 states have (on average 1.5073170731707317) internal successors, (927), 624 states have internal predecessors, (927), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2022-02-20 20:01:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:28,828 INFO L93 Difference]: Finished difference Result 794 states and 1190 transitions. [2022-02-20 20:01:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1190 transitions. [2022-02-20 20:01:28,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:28,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:28,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 718 states, 615 states have (on average 1.5073170731707317) internal successors, (927), 624 states have internal predecessors, (927), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) Second operand 794 states. [2022-02-20 20:01:28,835 INFO L87 Difference]: Start difference. First operand has 718 states, 615 states have (on average 1.5073170731707317) internal successors, (927), 624 states have internal predecessors, (927), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) Second operand 794 states. [2022-02-20 20:01:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:28,871 INFO L93 Difference]: Finished difference Result 794 states and 1190 transitions. [2022-02-20 20:01:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1190 transitions. [2022-02-20 20:01:28,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:28,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:28,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:28,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 615 states have (on average 1.5073170731707317) internal successors, (927), 624 states have internal predecessors, (927), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2022-02-20 20:01:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1076 transitions. [2022-02-20 20:01:28,909 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1076 transitions. Word has length 65 [2022-02-20 20:01:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:28,909 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 1076 transitions. [2022-02-20 20:01:28,909 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 20:01:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1076 transitions. [2022-02-20 20:01:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:01:28,911 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:28,912 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 20:01:28,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:01:28,912 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:28,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:28,914 INFO L85 PathProgramCache]: Analyzing trace with hash -610814451, now seen corresponding path program 1 times [2022-02-20 20:01:28,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:28,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460704931] [2022-02-20 20:01:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:28,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:28,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:29,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {10713#(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); {10714#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:29,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {10714#(not (= |old(~q_req_up~0)| 1))} assume true; {10714#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:29,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10714#(not (= |old(~q_req_up~0)| 1))} {10674#(= ~q_req_up~0 ~p_dw_pc~0)} #1962#return; {10678#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:29,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:29,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {10715#(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); {10671#true} is VALID [2022-02-20 20:01:29,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {10671#true} assume !(0 == ~q_write_ev~0); {10671#true} is VALID [2022-02-20 20:01:29,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {10671#true} assume true; {10671#true} is VALID [2022-02-20 20:01:29,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10671#true} {10678#(not (= ~p_dw_pc~0 1))} #1964#return; {10678#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:29,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:29,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:29,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {10671#true} havoc ~__retres1~0; {10671#true} is VALID [2022-02-20 20:01:29,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {10671#true} assume 1 == ~p_dw_pc~0; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,057 INFO L290 TraceCheckUtils]: 3: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,057 INFO L290 TraceCheckUtils]: 4: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,058 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} {10671#true} #1958#return; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:01:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:29,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {10671#true} havoc ~__retres1~1; {10671#true} is VALID [2022-02-20 20:01:29,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {10671#true} assume 1 == ~c_dr_pc~0; {10671#true} is VALID [2022-02-20 20:01:29,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {10671#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {10671#true} is VALID [2022-02-20 20:01:29,062 INFO L290 TraceCheckUtils]: 3: Hoare triple {10671#true} #res := ~__retres1~1; {10671#true} is VALID [2022-02-20 20:01:29,062 INFO L290 TraceCheckUtils]: 4: Hoare triple {10671#true} assume true; {10671#true} is VALID [2022-02-20 20:01:29,062 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10671#true} {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} #1960#return; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {10716#(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; {10671#true} is VALID [2022-02-20 20:01:29,063 INFO L272 TraceCheckUtils]: 1: Hoare triple {10671#true} call #t~ret8 := is_do_write_p_triggered(); {10671#true} is VALID [2022-02-20 20:01:29,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {10671#true} havoc ~__retres1~0; {10671#true} is VALID [2022-02-20 20:01:29,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {10671#true} assume 1 == ~p_dw_pc~0; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,064 INFO L290 TraceCheckUtils]: 4: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,066 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} {10671#true} #1958#return; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,071 INFO L272 TraceCheckUtils]: 10: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {10671#true} is VALID [2022-02-20 20:01:29,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {10671#true} havoc ~__retres1~1; {10671#true} is VALID [2022-02-20 20:01:29,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {10671#true} assume 1 == ~c_dr_pc~0; {10671#true} is VALID [2022-02-20 20:01:29,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {10671#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {10671#true} is VALID [2022-02-20 20:01:29,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {10671#true} #res := ~__retres1~1; {10671#true} is VALID [2022-02-20 20:01:29,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {10671#true} assume true; {10671#true} is VALID [2022-02-20 20:01:29,073 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10671#true} {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} #1960#return; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,075 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} {10678#(not (= ~p_dw_pc~0 1))} #1966#return; {10672#false} is VALID [2022-02-20 20:01:29,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:01:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:29,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {10715#(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); {10671#true} is VALID [2022-02-20 20:01:29,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {10671#true} assume !(1 == ~q_write_ev~0); {10671#true} is VALID [2022-02-20 20:01:29,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {10671#true} assume true; {10671#true} is VALID [2022-02-20 20:01:29,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10671#true} {10672#false} #1968#return; {10672#false} is VALID [2022-02-20 20:01:29,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:01:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:29,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {10671#true} havoc ~__retres1~2; {10671#true} is VALID [2022-02-20 20:01:29,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {10671#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10671#true} is VALID [2022-02-20 20:01:29,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {10671#true} #res := ~__retres1~2; {10671#true} is VALID [2022-02-20 20:01:29,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {10671#true} assume true; {10671#true} is VALID [2022-02-20 20:01:29,092 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10671#true} {10672#false} #1970#return; {10672#false} is VALID [2022-02-20 20:01:29,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {10671#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {10673#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:29,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {10673#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {10673#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:29,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {10673#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {10674#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:01:29,095 INFO L290 TraceCheckUtils]: 3: Hoare triple {10674#(= ~q_req_up~0 ~p_dw_pc~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {10674#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:01:29,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {10674#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {10713#(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 20:01:29,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {10713#(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); {10714#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:29,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {10714#(not (= |old(~q_req_up~0)| 1))} assume true; {10714#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:29,096 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10714#(not (= |old(~q_req_up~0)| 1))} {10674#(= ~q_req_up~0 ~p_dw_pc~0)} #1962#return; {10678#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:29,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {10678#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {10678#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:29,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {10678#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10678#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:29,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {10678#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10678#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:29,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {10678#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {10678#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:29,098 INFO L272 TraceCheckUtils]: 12: Hoare triple {10678#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {10715#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:29,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {10715#(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); {10671#true} is VALID [2022-02-20 20:01:29,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {10671#true} assume !(0 == ~q_write_ev~0); {10671#true} is VALID [2022-02-20 20:01:29,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {10671#true} assume true; {10671#true} is VALID [2022-02-20 20:01:29,099 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10671#true} {10678#(not (= ~p_dw_pc~0 1))} #1964#return; {10678#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:29,100 INFO L272 TraceCheckUtils]: 17: Hoare triple {10678#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {10716#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:29,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {10716#(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; {10671#true} is VALID [2022-02-20 20:01:29,100 INFO L272 TraceCheckUtils]: 19: Hoare triple {10671#true} call #t~ret8 := is_do_write_p_triggered(); {10671#true} is VALID [2022-02-20 20:01:29,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {10671#true} havoc ~__retres1~0; {10671#true} is VALID [2022-02-20 20:01:29,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {10671#true} assume 1 == ~p_dw_pc~0; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,102 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} {10671#true} #1958#return; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,103 INFO L272 TraceCheckUtils]: 28: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {10671#true} is VALID [2022-02-20 20:01:29,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {10671#true} havoc ~__retres1~1; {10671#true} is VALID [2022-02-20 20:01:29,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {10671#true} assume 1 == ~c_dr_pc~0; {10671#true} is VALID [2022-02-20 20:01:29,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {10671#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {10671#true} is VALID [2022-02-20 20:01:29,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {10671#true} #res := ~__retres1~1; {10671#true} is VALID [2022-02-20 20:01:29,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {10671#true} assume true; {10671#true} is VALID [2022-02-20 20:01:29,104 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10671#true} {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} #1960#return; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,105 INFO L290 TraceCheckUtils]: 37: Hoare triple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:29,106 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10723#(= (+ (- 1) ~p_dw_pc~0) 0)} {10678#(not (= ~p_dw_pc~0 1))} #1966#return; {10672#false} is VALID [2022-02-20 20:01:29,106 INFO L272 TraceCheckUtils]: 39: Hoare triple {10672#false} call reset_delta_events1(); {10715#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:29,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {10715#(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); {10671#true} is VALID [2022-02-20 20:01:29,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {10671#true} assume !(1 == ~q_write_ev~0); {10671#true} is VALID [2022-02-20 20:01:29,106 INFO L290 TraceCheckUtils]: 42: Hoare triple {10671#true} assume true; {10671#true} is VALID [2022-02-20 20:01:29,107 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10671#true} {10672#false} #1968#return; {10672#false} is VALID [2022-02-20 20:01:29,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {10672#false} assume !false; {10672#false} is VALID [2022-02-20 20:01:29,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {10672#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; {10672#false} is VALID [2022-02-20 20:01:29,107 INFO L290 TraceCheckUtils]: 46: Hoare triple {10672#false} assume !false; {10672#false} is VALID [2022-02-20 20:01:29,107 INFO L272 TraceCheckUtils]: 47: Hoare triple {10672#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10671#true} is VALID [2022-02-20 20:01:29,107 INFO L290 TraceCheckUtils]: 48: Hoare triple {10671#true} havoc ~__retres1~2; {10671#true} is VALID [2022-02-20 20:01:29,107 INFO L290 TraceCheckUtils]: 49: Hoare triple {10671#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10671#true} is VALID [2022-02-20 20:01:29,107 INFO L290 TraceCheckUtils]: 50: Hoare triple {10671#true} #res := ~__retres1~2; {10671#true} is VALID [2022-02-20 20:01:29,108 INFO L290 TraceCheckUtils]: 51: Hoare triple {10671#true} assume true; {10671#true} is VALID [2022-02-20 20:01:29,108 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10671#true} {10672#false} #1970#return; {10672#false} is VALID [2022-02-20 20:01:29,108 INFO L290 TraceCheckUtils]: 53: Hoare triple {10672#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; {10672#false} is VALID [2022-02-20 20:01:29,108 INFO L290 TraceCheckUtils]: 54: Hoare triple {10672#false} assume 0 != eval1_~tmp___1~0#1; {10672#false} is VALID [2022-02-20 20:01:29,108 INFO L290 TraceCheckUtils]: 55: Hoare triple {10672#false} assume !(0 == ~p_dw_st~0); {10672#false} is VALID [2022-02-20 20:01:29,108 INFO L290 TraceCheckUtils]: 56: Hoare triple {10672#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; {10672#false} is VALID [2022-02-20 20:01:29,108 INFO L290 TraceCheckUtils]: 57: Hoare triple {10672#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; {10672#false} is VALID [2022-02-20 20:01:29,108 INFO L290 TraceCheckUtils]: 58: Hoare triple {10672#false} assume !(0 == ~c_dr_pc~0); {10672#false} is VALID [2022-02-20 20:01:29,109 INFO L290 TraceCheckUtils]: 59: Hoare triple {10672#false} assume 2 == ~c_dr_pc~0; {10672#false} is VALID [2022-02-20 20:01:29,109 INFO L290 TraceCheckUtils]: 60: Hoare triple {10672#false} do_read_c_~a~0#1 := ~a_t~0; {10672#false} is VALID [2022-02-20 20:01:29,109 INFO L290 TraceCheckUtils]: 61: Hoare triple {10672#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; {10672#false} is VALID [2022-02-20 20:01:29,109 INFO L290 TraceCheckUtils]: 62: Hoare triple {10672#false} assume !(~p_last_write~0 == ~c_last_read~0); {10672#false} is VALID [2022-02-20 20:01:29,109 INFO L272 TraceCheckUtils]: 63: Hoare triple {10672#false} call error1(); {10672#false} is VALID [2022-02-20 20:01:29,109 INFO L290 TraceCheckUtils]: 64: Hoare triple {10672#false} assume !false; {10672#false} is VALID [2022-02-20 20:01:29,110 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 20:01:29,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:29,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460704931] [2022-02-20 20:01:29,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460704931] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:29,111 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:29,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:01:29,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378527437] [2022-02-20 20:01:29,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:29,112 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:01:29,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:29,113 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:01:29,154 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 20:01:29,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:01:29,154 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:29,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:01:29,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:01:29,156 INFO L87 Difference]: Start difference. First operand 718 states and 1076 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:01:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:35,991 INFO L93 Difference]: Finished difference Result 2264 states and 3273 transitions. [2022-02-20 20:01:35,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:01:35,991 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:01:35,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:35,993 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:01:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1564 transitions. [2022-02-20 20:01:36,008 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:01:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1564 transitions. [2022-02-20 20:01:36,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1564 transitions. [2022-02-20 20:01:37,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1564 edges. 1564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:37,423 INFO L225 Difference]: With dead ends: 2264 [2022-02-20 20:01:37,423 INFO L226 Difference]: Without dead ends: 1931 [2022-02-20 20:01:37,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:01:37,427 INFO L933 BasicCegarLoop]: 880 mSDtfsCounter, 3909 mSDsluCounter, 2380 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3931 SdHoareTripleChecker+Valid, 3260 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:37,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3931 Valid, 3260 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 20:01:37,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-02-20 20:01:37,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1771. [2022-02-20 20:01:37,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:37,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1931 states. Second operand has 1771 states, 1463 states have (on average 1.4169514695830485) internal successors, (2073), 1487 states have internal predecessors, (2073), 180 states have call successors, (180), 112 states have call predecessors, (180), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2022-02-20 20:01:37,508 INFO L74 IsIncluded]: Start isIncluded. First operand 1931 states. Second operand has 1771 states, 1463 states have (on average 1.4169514695830485) internal successors, (2073), 1487 states have internal predecessors, (2073), 180 states have call successors, (180), 112 states have call predecessors, (180), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2022-02-20 20:01:37,513 INFO L87 Difference]: Start difference. First operand 1931 states. Second operand has 1771 states, 1463 states have (on average 1.4169514695830485) internal successors, (2073), 1487 states have internal predecessors, (2073), 180 states have call successors, (180), 112 states have call predecessors, (180), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2022-02-20 20:01:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:37,679 INFO L93 Difference]: Finished difference Result 1931 states and 2677 transitions. [2022-02-20 20:01:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2677 transitions. [2022-02-20 20:01:37,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:37,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:37,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 1771 states, 1463 states have (on average 1.4169514695830485) internal successors, (2073), 1487 states have internal predecessors, (2073), 180 states have call successors, (180), 112 states have call predecessors, (180), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) Second operand 1931 states. [2022-02-20 20:01:37,706 INFO L87 Difference]: Start difference. First operand has 1771 states, 1463 states have (on average 1.4169514695830485) internal successors, (2073), 1487 states have internal predecessors, (2073), 180 states have call successors, (180), 112 states have call predecessors, (180), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) Second operand 1931 states. [2022-02-20 20:01:37,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:37,872 INFO L93 Difference]: Finished difference Result 1931 states and 2677 transitions. [2022-02-20 20:01:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2677 transitions. [2022-02-20 20:01:37,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:37,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:37,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:37,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1463 states have (on average 1.4169514695830485) internal successors, (2073), 1487 states have internal predecessors, (2073), 180 states have call successors, (180), 112 states have call predecessors, (180), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2022-02-20 20:01:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2465 transitions. [2022-02-20 20:01:38,099 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2465 transitions. Word has length 65 [2022-02-20 20:01:38,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:38,099 INFO L470 AbstractCegarLoop]: Abstraction has 1771 states and 2465 transitions. [2022-02-20 20:01:38,100 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:01:38,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2465 transitions. [2022-02-20 20:01:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:01:38,104 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:38,104 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 20:01:38,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:01:38,105 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:38,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2038334069, now seen corresponding path program 1 times [2022-02-20 20:01:38,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:38,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133257856] [2022-02-20 20:01:38,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:38,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:38,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:38,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {20107#(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); {20067#true} is VALID [2022-02-20 20:01:38,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {20067#true} assume true; {20067#true} is VALID [2022-02-20 20:01:38,162 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20067#true} {20067#true} #1962#return; {20067#true} is VALID [2022-02-20 20:01:38,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:38,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {20108#(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); {20067#true} is VALID [2022-02-20 20:01:38,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {20067#true} assume !(0 == ~q_write_ev~0); {20067#true} is VALID [2022-02-20 20:01:38,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {20067#true} assume true; {20067#true} is VALID [2022-02-20 20:01:38,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20067#true} {20067#true} #1964#return; {20067#true} is VALID [2022-02-20 20:01:38,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:38,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:38,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {20067#true} havoc ~__retres1~0; {20067#true} is VALID [2022-02-20 20:01:38,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {20067#true} assume !(1 == ~p_dw_pc~0); {20067#true} is VALID [2022-02-20 20:01:38,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {20067#true} assume !(2 == ~p_dw_pc~0); {20067#true} is VALID [2022-02-20 20:01:38,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {20067#true} ~__retres1~0 := 0; {20125#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:01:38,246 INFO L290 TraceCheckUtils]: 4: Hoare triple {20125#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {20126#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:38,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {20126#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {20126#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:38,247 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {20126#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {20067#true} #1958#return; {20117#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:01:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:38,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {20067#true} havoc ~__retres1~1; {20067#true} is VALID [2022-02-20 20:01:38,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {20067#true} assume 1 == ~c_dr_pc~0; {20067#true} is VALID [2022-02-20 20:01:38,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {20067#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {20067#true} is VALID [2022-02-20 20:01:38,256 INFO L290 TraceCheckUtils]: 3: Hoare triple {20067#true} #res := ~__retres1~1; {20067#true} is VALID [2022-02-20 20:01:38,256 INFO L290 TraceCheckUtils]: 4: Hoare triple {20067#true} assume true; {20067#true} is VALID [2022-02-20 20:01:38,256 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20067#true} {20068#false} #1960#return; {20068#false} is VALID [2022-02-20 20:01:38,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {20109#(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; {20067#true} is VALID [2022-02-20 20:01:38,256 INFO L272 TraceCheckUtils]: 1: Hoare triple {20067#true} call #t~ret8 := is_do_write_p_triggered(); {20067#true} is VALID [2022-02-20 20:01:38,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {20067#true} havoc ~__retres1~0; {20067#true} is VALID [2022-02-20 20:01:38,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {20067#true} assume !(1 == ~p_dw_pc~0); {20067#true} is VALID [2022-02-20 20:01:38,257 INFO L290 TraceCheckUtils]: 4: Hoare triple {20067#true} assume !(2 == ~p_dw_pc~0); {20067#true} is VALID [2022-02-20 20:01:38,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {20067#true} ~__retres1~0 := 0; {20125#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:01:38,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {20125#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {20126#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:38,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {20126#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {20126#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:38,259 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {20126#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {20067#true} #1958#return; {20117#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:01:38,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {20117#(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; {20118#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:01:38,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {20118#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {20068#false} is VALID [2022-02-20 20:01:38,260 INFO L272 TraceCheckUtils]: 11: Hoare triple {20068#false} call #t~ret9 := is_do_read_c_triggered(); {20067#true} is VALID [2022-02-20 20:01:38,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {20067#true} havoc ~__retres1~1; {20067#true} is VALID [2022-02-20 20:01:38,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {20067#true} assume 1 == ~c_dr_pc~0; {20067#true} is VALID [2022-02-20 20:01:38,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {20067#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {20067#true} is VALID [2022-02-20 20:01:38,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {20067#true} #res := ~__retres1~1; {20067#true} is VALID [2022-02-20 20:01:38,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {20067#true} assume true; {20067#true} is VALID [2022-02-20 20:01:38,261 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20067#true} {20068#false} #1960#return; {20068#false} is VALID [2022-02-20 20:01:38,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {20068#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {20068#false} is VALID [2022-02-20 20:01:38,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {20068#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {20068#false} is VALID [2022-02-20 20:01:38,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {20068#false} assume true; {20068#false} is VALID [2022-02-20 20:01:38,262 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20068#false} {20067#true} #1966#return; {20068#false} is VALID [2022-02-20 20:01:38,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:01:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:38,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {20108#(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); {20067#true} is VALID [2022-02-20 20:01:38,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {20067#true} assume !(1 == ~q_write_ev~0); {20067#true} is VALID [2022-02-20 20:01:38,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {20067#true} assume true; {20067#true} is VALID [2022-02-20 20:01:38,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20067#true} {20068#false} #1968#return; {20068#false} is VALID [2022-02-20 20:01:38,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:01:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:38,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {20067#true} havoc ~__retres1~2; {20067#true} is VALID [2022-02-20 20:01:38,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {20067#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20067#true} is VALID [2022-02-20 20:01:38,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {20067#true} #res := ~__retres1~2; {20067#true} is VALID [2022-02-20 20:01:38,273 INFO L290 TraceCheckUtils]: 3: Hoare triple {20067#true} assume true; {20067#true} is VALID [2022-02-20 20:01:38,273 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20067#true} {20068#false} #1970#return; {20068#false} is VALID [2022-02-20 20:01:38,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {20067#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {20067#true} is VALID [2022-02-20 20:01:38,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {20067#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {20067#true} is VALID [2022-02-20 20:01:38,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {20067#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {20067#true} is VALID [2022-02-20 20:01:38,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {20067#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {20067#true} is VALID [2022-02-20 20:01:38,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {20067#true} call update_channels1(); {20107#(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 20:01:38,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {20107#(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); {20067#true} is VALID [2022-02-20 20:01:38,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {20067#true} assume true; {20067#true} is VALID [2022-02-20 20:01:38,275 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20067#true} {20067#true} #1962#return; {20067#true} is VALID [2022-02-20 20:01:38,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {20067#true} assume { :begin_inline_init_threads1 } true; {20067#true} is VALID [2022-02-20 20:01:38,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {20067#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {20067#true} is VALID [2022-02-20 20:01:38,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {20067#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {20067#true} is VALID [2022-02-20 20:01:38,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {20067#true} assume { :end_inline_init_threads1 } true; {20067#true} is VALID [2022-02-20 20:01:38,276 INFO L272 TraceCheckUtils]: 12: Hoare triple {20067#true} call fire_delta_events1(); {20108#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:38,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {20108#(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); {20067#true} is VALID [2022-02-20 20:01:38,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {20067#true} assume !(0 == ~q_write_ev~0); {20067#true} is VALID [2022-02-20 20:01:38,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {20067#true} assume true; {20067#true} is VALID [2022-02-20 20:01:38,276 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20067#true} {20067#true} #1964#return; {20067#true} is VALID [2022-02-20 20:01:38,277 INFO L272 TraceCheckUtils]: 17: Hoare triple {20067#true} call activate_threads1(); {20109#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:38,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {20109#(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; {20067#true} is VALID [2022-02-20 20:01:38,277 INFO L272 TraceCheckUtils]: 19: Hoare triple {20067#true} call #t~ret8 := is_do_write_p_triggered(); {20067#true} is VALID [2022-02-20 20:01:38,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {20067#true} havoc ~__retres1~0; {20067#true} is VALID [2022-02-20 20:01:38,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {20067#true} assume !(1 == ~p_dw_pc~0); {20067#true} is VALID [2022-02-20 20:01:38,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {20067#true} assume !(2 == ~p_dw_pc~0); {20067#true} is VALID [2022-02-20 20:01:38,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {20067#true} ~__retres1~0 := 0; {20125#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:01:38,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {20125#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {20126#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:38,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {20126#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {20126#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:38,279 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20126#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {20067#true} #1958#return; {20117#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:01:38,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {20117#(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; {20118#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:01:38,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {20118#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {20068#false} is VALID [2022-02-20 20:01:38,280 INFO L272 TraceCheckUtils]: 29: Hoare triple {20068#false} call #t~ret9 := is_do_read_c_triggered(); {20067#true} is VALID [2022-02-20 20:01:38,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {20067#true} havoc ~__retres1~1; {20067#true} is VALID [2022-02-20 20:01:38,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {20067#true} assume 1 == ~c_dr_pc~0; {20067#true} is VALID [2022-02-20 20:01:38,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {20067#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {20067#true} is VALID [2022-02-20 20:01:38,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {20067#true} #res := ~__retres1~1; {20067#true} is VALID [2022-02-20 20:01:38,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {20067#true} assume true; {20067#true} is VALID [2022-02-20 20:01:38,281 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {20067#true} {20068#false} #1960#return; {20068#false} is VALID [2022-02-20 20:01:38,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {20068#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {20068#false} is VALID [2022-02-20 20:01:38,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {20068#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {20068#false} is VALID [2022-02-20 20:01:38,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {20068#false} assume true; {20068#false} is VALID [2022-02-20 20:01:38,281 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20068#false} {20067#true} #1966#return; {20068#false} is VALID [2022-02-20 20:01:38,282 INFO L272 TraceCheckUtils]: 40: Hoare triple {20068#false} call reset_delta_events1(); {20108#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:38,282 INFO L290 TraceCheckUtils]: 41: Hoare triple {20108#(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); {20067#true} is VALID [2022-02-20 20:01:38,282 INFO L290 TraceCheckUtils]: 42: Hoare triple {20067#true} assume !(1 == ~q_write_ev~0); {20067#true} is VALID [2022-02-20 20:01:38,282 INFO L290 TraceCheckUtils]: 43: Hoare triple {20067#true} assume true; {20067#true} is VALID [2022-02-20 20:01:38,282 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {20067#true} {20068#false} #1968#return; {20068#false} is VALID [2022-02-20 20:01:38,282 INFO L290 TraceCheckUtils]: 45: Hoare triple {20068#false} assume !false; {20068#false} is VALID [2022-02-20 20:01:38,282 INFO L290 TraceCheckUtils]: 46: Hoare triple {20068#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; {20068#false} is VALID [2022-02-20 20:01:38,282 INFO L290 TraceCheckUtils]: 47: Hoare triple {20068#false} assume !false; {20068#false} is VALID [2022-02-20 20:01:38,283 INFO L272 TraceCheckUtils]: 48: Hoare triple {20068#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {20067#true} is VALID [2022-02-20 20:01:38,283 INFO L290 TraceCheckUtils]: 49: Hoare triple {20067#true} havoc ~__retres1~2; {20067#true} is VALID [2022-02-20 20:01:38,283 INFO L290 TraceCheckUtils]: 50: Hoare triple {20067#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20067#true} is VALID [2022-02-20 20:01:38,283 INFO L290 TraceCheckUtils]: 51: Hoare triple {20067#true} #res := ~__retres1~2; {20067#true} is VALID [2022-02-20 20:01:38,283 INFO L290 TraceCheckUtils]: 52: Hoare triple {20067#true} assume true; {20067#true} is VALID [2022-02-20 20:01:38,283 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {20067#true} {20068#false} #1970#return; {20068#false} is VALID [2022-02-20 20:01:38,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {20068#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; {20068#false} is VALID [2022-02-20 20:01:38,284 INFO L290 TraceCheckUtils]: 55: Hoare triple {20068#false} assume 0 != eval1_~tmp___1~0#1; {20068#false} is VALID [2022-02-20 20:01:38,284 INFO L290 TraceCheckUtils]: 56: Hoare triple {20068#false} assume !(0 == ~p_dw_st~0); {20068#false} is VALID [2022-02-20 20:01:38,284 INFO L290 TraceCheckUtils]: 57: Hoare triple {20068#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; {20068#false} is VALID [2022-02-20 20:01:38,284 INFO L290 TraceCheckUtils]: 58: Hoare triple {20068#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; {20068#false} is VALID [2022-02-20 20:01:38,284 INFO L290 TraceCheckUtils]: 59: Hoare triple {20068#false} assume !(0 == ~c_dr_pc~0); {20068#false} is VALID [2022-02-20 20:01:38,284 INFO L290 TraceCheckUtils]: 60: Hoare triple {20068#false} assume 2 == ~c_dr_pc~0; {20068#false} is VALID [2022-02-20 20:01:38,284 INFO L290 TraceCheckUtils]: 61: Hoare triple {20068#false} do_read_c_~a~0#1 := ~a_t~0; {20068#false} is VALID [2022-02-20 20:01:38,284 INFO L290 TraceCheckUtils]: 62: Hoare triple {20068#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; {20068#false} is VALID [2022-02-20 20:01:38,285 INFO L290 TraceCheckUtils]: 63: Hoare triple {20068#false} assume !(~p_last_write~0 == ~c_last_read~0); {20068#false} is VALID [2022-02-20 20:01:38,285 INFO L272 TraceCheckUtils]: 64: Hoare triple {20068#false} call error1(); {20068#false} is VALID [2022-02-20 20:01:38,285 INFO L290 TraceCheckUtils]: 65: Hoare triple {20068#false} assume !false; {20068#false} is VALID [2022-02-20 20:01:38,285 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 20:01:38,285 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:38,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133257856] [2022-02-20 20:01:38,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133257856] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:38,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:38,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:38,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605321081] [2022-02-20 20:01:38,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:38,288 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2022-02-20 20:01:38,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:38,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 20:01:38,327 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 20:01:38,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:38,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:38,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:38,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:38,329 INFO L87 Difference]: Start difference. First operand 1771 states and 2465 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 20:01:42,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:42,913 INFO L93 Difference]: Finished difference Result 3299 states and 4544 transitions. [2022-02-20 20:01:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:01:42,914 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2022-02-20 20:01:42,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 20:01:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 941 transitions. [2022-02-20 20:01:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 20:01:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 941 transitions. [2022-02-20 20:01:42,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 941 transitions. [2022-02-20 20:01:43,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 941 edges. 941 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:43,754 INFO L225 Difference]: With dead ends: 3299 [2022-02-20 20:01:43,754 INFO L226 Difference]: Without dead ends: 1919 [2022-02-20 20:01:43,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 20:01:43,758 INFO L933 BasicCegarLoop]: 745 mSDtfsCounter, 996 mSDsluCounter, 2237 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 2982 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:43,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [997 Valid, 2982 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 20:01:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2022-02-20 20:01:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1811. [2022-02-20 20:01:43,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:43,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1919 states. Second operand has 1811 states, 1495 states have (on average 1.4040133779264214) internal successors, (2099), 1519 states have internal predecessors, (2099), 180 states have call successors, (180), 112 states have call predecessors, (180), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2022-02-20 20:01:43,854 INFO L74 IsIncluded]: Start isIncluded. First operand 1919 states. Second operand has 1811 states, 1495 states have (on average 1.4040133779264214) internal successors, (2099), 1519 states have internal predecessors, (2099), 180 states have call successors, (180), 112 states have call predecessors, (180), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2022-02-20 20:01:43,856 INFO L87 Difference]: Start difference. First operand 1919 states. Second operand has 1811 states, 1495 states have (on average 1.4040133779264214) internal successors, (2099), 1519 states have internal predecessors, (2099), 180 states have call successors, (180), 112 states have call predecessors, (180), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2022-02-20 20:01:43,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:43,987 INFO L93 Difference]: Finished difference Result 1919 states and 2653 transitions. [2022-02-20 20:01:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 2653 transitions. [2022-02-20 20:01:43,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:43,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:43,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 1811 states, 1495 states have (on average 1.4040133779264214) internal successors, (2099), 1519 states have internal predecessors, (2099), 180 states have call successors, (180), 112 states have call predecessors, (180), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) Second operand 1919 states. [2022-02-20 20:01:43,997 INFO L87 Difference]: Start difference. First operand has 1811 states, 1495 states have (on average 1.4040133779264214) internal successors, (2099), 1519 states have internal predecessors, (2099), 180 states have call successors, (180), 112 states have call predecessors, (180), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) Second operand 1919 states. [2022-02-20 20:01:44,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:44,116 INFO L93 Difference]: Finished difference Result 1919 states and 2653 transitions. [2022-02-20 20:01:44,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 2653 transitions. [2022-02-20 20:01:44,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:44,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:44,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:44,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1495 states have (on average 1.4040133779264214) internal successors, (2099), 1519 states have internal predecessors, (2099), 180 states have call successors, (180), 112 states have call predecessors, (180), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2022-02-20 20:01:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2499 transitions. [2022-02-20 20:01:44,274 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2499 transitions. Word has length 66 [2022-02-20 20:01:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:44,275 INFO L470 AbstractCegarLoop]: Abstraction has 1811 states and 2499 transitions. [2022-02-20 20:01:44,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 20:01:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2499 transitions. [2022-02-20 20:01:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:01:44,276 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:44,276 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 20:01:44,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:01:44,277 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:44,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:44,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1227273929, now seen corresponding path program 1 times [2022-02-20 20:01:44,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:44,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710672015] [2022-02-20 20:01:44,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:44,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:44,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:44,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {30857#(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); {30858#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:44,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {30858#(not (= |old(~q_req_up~0)| 1))} assume true; {30858#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:44,330 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30858#(not (= |old(~q_req_up~0)| 1))} {30817#(= ~c_dr_pc~0 ~q_req_up~0)} #1962#return; {30821#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:44,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:44,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {30859#(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); {30814#true} is VALID [2022-02-20 20:01:44,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {30814#true} assume !(0 == ~q_write_ev~0); {30814#true} is VALID [2022-02-20 20:01:44,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {30814#true} assume true; {30814#true} is VALID [2022-02-20 20:01:44,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30814#true} {30821#(not (= ~c_dr_pc~0 1))} #1964#return; {30821#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:44,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:44,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:44,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {30814#true} havoc ~__retres1~0; {30814#true} is VALID [2022-02-20 20:01:44,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {30814#true} assume !(1 == ~p_dw_pc~0); {30814#true} is VALID [2022-02-20 20:01:44,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {30814#true} assume !(2 == ~p_dw_pc~0); {30814#true} is VALID [2022-02-20 20:01:44,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {30814#true} ~__retres1~0 := 0; {30814#true} is VALID [2022-02-20 20:01:44,364 INFO L290 TraceCheckUtils]: 4: Hoare triple {30814#true} #res := ~__retres1~0; {30814#true} is VALID [2022-02-20 20:01:44,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {30814#true} assume true; {30814#true} is VALID [2022-02-20 20:01:44,365 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {30814#true} {30814#true} #1958#return; {30814#true} is VALID [2022-02-20 20:01:44,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:44,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {30814#true} havoc ~__retres1~1; {30814#true} is VALID [2022-02-20 20:01:44,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {30814#true} assume 1 == ~c_dr_pc~0; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,371 INFO L290 TraceCheckUtils]: 4: Hoare triple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,371 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} {30814#true} #1960#return; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {30860#(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; {30814#true} is VALID [2022-02-20 20:01:44,371 INFO L272 TraceCheckUtils]: 1: Hoare triple {30814#true} call #t~ret8 := is_do_write_p_triggered(); {30814#true} is VALID [2022-02-20 20:01:44,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {30814#true} havoc ~__retres1~0; {30814#true} is VALID [2022-02-20 20:01:44,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {30814#true} assume !(1 == ~p_dw_pc~0); {30814#true} is VALID [2022-02-20 20:01:44,372 INFO L290 TraceCheckUtils]: 4: Hoare triple {30814#true} assume !(2 == ~p_dw_pc~0); {30814#true} is VALID [2022-02-20 20:01:44,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {30814#true} ~__retres1~0 := 0; {30814#true} is VALID [2022-02-20 20:01:44,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {30814#true} #res := ~__retres1~0; {30814#true} is VALID [2022-02-20 20:01:44,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {30814#true} assume true; {30814#true} is VALID [2022-02-20 20:01:44,372 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {30814#true} {30814#true} #1958#return; {30814#true} is VALID [2022-02-20 20:01:44,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {30814#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30814#true} is VALID [2022-02-20 20:01:44,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {30814#true} assume !(0 != ~tmp~1); {30814#true} is VALID [2022-02-20 20:01:44,373 INFO L272 TraceCheckUtils]: 11: Hoare triple {30814#true} call #t~ret9 := is_do_read_c_triggered(); {30814#true} is VALID [2022-02-20 20:01:44,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {30814#true} havoc ~__retres1~1; {30814#true} is VALID [2022-02-20 20:01:44,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {30814#true} assume 1 == ~c_dr_pc~0; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,375 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} {30814#true} #1960#return; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,376 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} {30821#(not (= ~c_dr_pc~0 1))} #1966#return; {30815#false} is VALID [2022-02-20 20:01:44,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:01:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:44,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {30859#(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); {30814#true} is VALID [2022-02-20 20:01:44,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {30814#true} assume !(1 == ~q_write_ev~0); {30814#true} is VALID [2022-02-20 20:01:44,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {30814#true} assume true; {30814#true} is VALID [2022-02-20 20:01:44,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30814#true} {30815#false} #1968#return; {30815#false} is VALID [2022-02-20 20:01:44,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:01:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:44,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {30814#true} havoc ~__retres1~2; {30814#true} is VALID [2022-02-20 20:01:44,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {30814#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30814#true} is VALID [2022-02-20 20:01:44,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {30814#true} #res := ~__retres1~2; {30814#true} is VALID [2022-02-20 20:01:44,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {30814#true} assume true; {30814#true} is VALID [2022-02-20 20:01:44,385 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30814#true} {30815#false} #1970#return; {30815#false} is VALID [2022-02-20 20:01:44,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {30814#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {30816#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:44,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {30816#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {30816#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:44,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {30816#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {30817#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:01:44,387 INFO L290 TraceCheckUtils]: 3: Hoare triple {30817#(= ~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_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {30817#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:01:44,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {30817#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {30857#(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 20:01:44,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {30857#(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); {30858#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:44,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {30858#(not (= |old(~q_req_up~0)| 1))} assume true; {30858#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:44,388 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30858#(not (= |old(~q_req_up~0)| 1))} {30817#(= ~c_dr_pc~0 ~q_req_up~0)} #1962#return; {30821#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:44,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {30821#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {30821#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:44,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {30821#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {30821#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:44,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {30821#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {30821#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:44,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {30821#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {30821#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:44,390 INFO L272 TraceCheckUtils]: 12: Hoare triple {30821#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {30859#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:44,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {30859#(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); {30814#true} is VALID [2022-02-20 20:01:44,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {30814#true} assume !(0 == ~q_write_ev~0); {30814#true} is VALID [2022-02-20 20:01:44,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {30814#true} assume true; {30814#true} is VALID [2022-02-20 20:01:44,391 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30814#true} {30821#(not (= ~c_dr_pc~0 1))} #1964#return; {30821#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:44,391 INFO L272 TraceCheckUtils]: 17: Hoare triple {30821#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {30860#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:44,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {30860#(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; {30814#true} is VALID [2022-02-20 20:01:44,391 INFO L272 TraceCheckUtils]: 19: Hoare triple {30814#true} call #t~ret8 := is_do_write_p_triggered(); {30814#true} is VALID [2022-02-20 20:01:44,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {30814#true} havoc ~__retres1~0; {30814#true} is VALID [2022-02-20 20:01:44,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {30814#true} assume !(1 == ~p_dw_pc~0); {30814#true} is VALID [2022-02-20 20:01:44,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {30814#true} assume !(2 == ~p_dw_pc~0); {30814#true} is VALID [2022-02-20 20:01:44,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {30814#true} ~__retres1~0 := 0; {30814#true} is VALID [2022-02-20 20:01:44,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {30814#true} #res := ~__retres1~0; {30814#true} is VALID [2022-02-20 20:01:44,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {30814#true} assume true; {30814#true} is VALID [2022-02-20 20:01:44,392 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {30814#true} {30814#true} #1958#return; {30814#true} is VALID [2022-02-20 20:01:44,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {30814#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30814#true} is VALID [2022-02-20 20:01:44,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {30814#true} assume !(0 != ~tmp~1); {30814#true} is VALID [2022-02-20 20:01:44,393 INFO L272 TraceCheckUtils]: 29: Hoare triple {30814#true} call #t~ret9 := is_do_read_c_triggered(); {30814#true} is VALID [2022-02-20 20:01:44,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {30814#true} havoc ~__retres1~1; {30814#true} is VALID [2022-02-20 20:01:44,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {30814#true} assume 1 == ~c_dr_pc~0; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,395 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} {30814#true} #1960#return; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,396 INFO L290 TraceCheckUtils]: 38: Hoare triple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:44,396 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {30874#(= (+ (- 1) ~c_dr_pc~0) 0)} {30821#(not (= ~c_dr_pc~0 1))} #1966#return; {30815#false} is VALID [2022-02-20 20:01:44,396 INFO L272 TraceCheckUtils]: 40: Hoare triple {30815#false} call reset_delta_events1(); {30859#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:44,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {30859#(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); {30814#true} is VALID [2022-02-20 20:01:44,396 INFO L290 TraceCheckUtils]: 42: Hoare triple {30814#true} assume !(1 == ~q_write_ev~0); {30814#true} is VALID [2022-02-20 20:01:44,397 INFO L290 TraceCheckUtils]: 43: Hoare triple {30814#true} assume true; {30814#true} is VALID [2022-02-20 20:01:44,397 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {30814#true} {30815#false} #1968#return; {30815#false} is VALID [2022-02-20 20:01:44,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {30815#false} assume !false; {30815#false} is VALID [2022-02-20 20:01:44,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {30815#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; {30815#false} is VALID [2022-02-20 20:01:44,397 INFO L290 TraceCheckUtils]: 47: Hoare triple {30815#false} assume !false; {30815#false} is VALID [2022-02-20 20:01:44,397 INFO L272 TraceCheckUtils]: 48: Hoare triple {30815#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {30814#true} is VALID [2022-02-20 20:01:44,397 INFO L290 TraceCheckUtils]: 49: Hoare triple {30814#true} havoc ~__retres1~2; {30814#true} is VALID [2022-02-20 20:01:44,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {30814#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30814#true} is VALID [2022-02-20 20:01:44,398 INFO L290 TraceCheckUtils]: 51: Hoare triple {30814#true} #res := ~__retres1~2; {30814#true} is VALID [2022-02-20 20:01:44,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {30814#true} assume true; {30814#true} is VALID [2022-02-20 20:01:44,398 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {30814#true} {30815#false} #1970#return; {30815#false} is VALID [2022-02-20 20:01:44,398 INFO L290 TraceCheckUtils]: 54: Hoare triple {30815#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; {30815#false} is VALID [2022-02-20 20:01:44,398 INFO L290 TraceCheckUtils]: 55: Hoare triple {30815#false} assume 0 != eval1_~tmp___1~0#1; {30815#false} is VALID [2022-02-20 20:01:44,398 INFO L290 TraceCheckUtils]: 56: Hoare triple {30815#false} assume !(0 == ~p_dw_st~0); {30815#false} is VALID [2022-02-20 20:01:44,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {30815#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; {30815#false} is VALID [2022-02-20 20:01:44,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {30815#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; {30815#false} is VALID [2022-02-20 20:01:44,399 INFO L290 TraceCheckUtils]: 59: Hoare triple {30815#false} assume !(0 == ~c_dr_pc~0); {30815#false} is VALID [2022-02-20 20:01:44,399 INFO L290 TraceCheckUtils]: 60: Hoare triple {30815#false} assume 2 == ~c_dr_pc~0; {30815#false} is VALID [2022-02-20 20:01:44,399 INFO L290 TraceCheckUtils]: 61: Hoare triple {30815#false} do_read_c_~a~0#1 := ~a_t~0; {30815#false} is VALID [2022-02-20 20:01:44,399 INFO L290 TraceCheckUtils]: 62: Hoare triple {30815#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; {30815#false} is VALID [2022-02-20 20:01:44,399 INFO L290 TraceCheckUtils]: 63: Hoare triple {30815#false} assume !(~p_last_write~0 == ~c_last_read~0); {30815#false} is VALID [2022-02-20 20:01:44,399 INFO L272 TraceCheckUtils]: 64: Hoare triple {30815#false} call error1(); {30815#false} is VALID [2022-02-20 20:01:44,399 INFO L290 TraceCheckUtils]: 65: Hoare triple {30815#false} assume !false; {30815#false} is VALID [2022-02-20 20:01:44,400 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 20:01:44,400 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:44,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710672015] [2022-02-20 20:01:44,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710672015] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:44,400 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:44,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:01:44,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309123820] [2022-02-20 20:01:44,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:44,401 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 66 [2022-02-20 20:01:44,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:44,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 20:01:44,441 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 20:01:44,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:01:44,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:44,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:01:44,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:01:44,442 INFO L87 Difference]: Start difference. First operand 1811 states and 2499 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 20:01:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:52,071 INFO L93 Difference]: Finished difference Result 5383 states and 7373 transitions. [2022-02-20 20:01:52,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:01:52,071 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 66 [2022-02-20 20:01:52,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 20:01:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1554 transitions. [2022-02-20 20:01:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 20:01:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1554 transitions. [2022-02-20 20:01:52,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1554 transitions. [2022-02-20 20:01:53,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1554 edges. 1554 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:53,460 INFO L225 Difference]: With dead ends: 5383 [2022-02-20 20:01:53,460 INFO L226 Difference]: Without dead ends: 2202 [2022-02-20 20:01:53,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:01:53,468 INFO L933 BasicCegarLoop]: 877 mSDtfsCounter, 3939 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 1812 mSolverCounterSat, 697 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3961 SdHoareTripleChecker+Valid, 3306 SdHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 697 IncrementalHoareTripleChecker+Valid, 1812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:53,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3961 Valid, 3306 Invalid, 2509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [697 Valid, 1812 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 20:01:53,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2022-02-20 20:01:53,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2022. [2022-02-20 20:01:53,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:53,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2202 states. Second operand has 2022 states, 1634 states have (on average 1.3616891064871481) internal successors, (2225), 1660 states have internal predecessors, (2225), 220 states have call successors, (220), 140 states have call predecessors, (220), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) [2022-02-20 20:01:53,588 INFO L74 IsIncluded]: Start isIncluded. First operand 2202 states. Second operand has 2022 states, 1634 states have (on average 1.3616891064871481) internal successors, (2225), 1660 states have internal predecessors, (2225), 220 states have call successors, (220), 140 states have call predecessors, (220), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) [2022-02-20 20:01:53,590 INFO L87 Difference]: Start difference. First operand 2202 states. Second operand has 2022 states, 1634 states have (on average 1.3616891064871481) internal successors, (2225), 1660 states have internal predecessors, (2225), 220 states have call successors, (220), 140 states have call predecessors, (220), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) [2022-02-20 20:01:53,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:53,798 INFO L93 Difference]: Finished difference Result 2202 states and 2942 transitions. [2022-02-20 20:01:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2942 transitions. [2022-02-20 20:01:53,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:53,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:53,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 2022 states, 1634 states have (on average 1.3616891064871481) internal successors, (2225), 1660 states have internal predecessors, (2225), 220 states have call successors, (220), 140 states have call predecessors, (220), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) Second operand 2202 states. [2022-02-20 20:01:53,810 INFO L87 Difference]: Start difference. First operand has 2022 states, 1634 states have (on average 1.3616891064871481) internal successors, (2225), 1660 states have internal predecessors, (2225), 220 states have call successors, (220), 140 states have call predecessors, (220), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) Second operand 2202 states. [2022-02-20 20:01:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:53,960 INFO L93 Difference]: Finished difference Result 2202 states and 2942 transitions. [2022-02-20 20:01:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2942 transitions. [2022-02-20 20:01:53,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:53,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:53,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:53,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2022 states, 1634 states have (on average 1.3616891064871481) internal successors, (2225), 1660 states have internal predecessors, (2225), 220 states have call successors, (220), 140 states have call predecessors, (220), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) [2022-02-20 20:01:54,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2711 transitions. [2022-02-20 20:01:54,206 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2711 transitions. Word has length 66 [2022-02-20 20:01:54,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:54,206 INFO L470 AbstractCegarLoop]: Abstraction has 2022 states and 2711 transitions. [2022-02-20 20:01:54,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 20:01:54,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2711 transitions. [2022-02-20 20:01:54,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:54,208 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:54,208 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:54,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:01:54,209 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:54,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:54,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1550661326, now seen corresponding path program 1 times [2022-02-20 20:01:54,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:54,210 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300802752] [2022-02-20 20:01:54,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:54,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:54,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:54,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {45332#(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); {45286#true} is VALID [2022-02-20 20:01:54,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {45286#true} assume true; {45286#true} is VALID [2022-02-20 20:01:54,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45286#true} {45286#true} #1962#return; {45286#true} is VALID [2022-02-20 20:01:54,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:54,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {45333#(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); {45286#true} is VALID [2022-02-20 20:01:54,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {45286#true} assume !(0 == ~q_write_ev~0); {45286#true} is VALID [2022-02-20 20:01:54,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {45286#true} assume true; {45286#true} is VALID [2022-02-20 20:01:54,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45286#true} {45286#true} #1964#return; {45286#true} is VALID [2022-02-20 20:01:54,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:54,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:54,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {45286#true} havoc ~__retres1~0; {45286#true} is VALID [2022-02-20 20:01:54,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {45286#true} assume !(1 == ~p_dw_pc~0); {45286#true} is VALID [2022-02-20 20:01:54,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {45286#true} assume !(2 == ~p_dw_pc~0); {45286#true} is VALID [2022-02-20 20:01:54,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {45286#true} ~__retres1~0 := 0; {45286#true} is VALID [2022-02-20 20:01:54,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {45286#true} #res := ~__retres1~0; {45286#true} is VALID [2022-02-20 20:01:54,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {45286#true} assume true; {45286#true} is VALID [2022-02-20 20:01:54,312 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {45286#true} {45286#true} #1958#return; {45286#true} is VALID [2022-02-20 20:01:54,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:54,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {45286#true} havoc ~__retres1~1; {45286#true} is VALID [2022-02-20 20:01:54,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {45286#true} assume !(1 == ~c_dr_pc~0); {45286#true} is VALID [2022-02-20 20:01:54,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {45286#true} assume !(2 == ~c_dr_pc~0); {45286#true} is VALID [2022-02-20 20:01:54,339 INFO L290 TraceCheckUtils]: 3: Hoare triple {45286#true} ~__retres1~1 := 0; {45351#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:54,340 INFO L290 TraceCheckUtils]: 4: Hoare triple {45351#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {45352#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:54,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {45352#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {45352#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:54,340 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {45352#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {45286#true} #1960#return; {45349#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:54,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {45334#(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; {45286#true} is VALID [2022-02-20 20:01:54,341 INFO L272 TraceCheckUtils]: 1: Hoare triple {45286#true} call #t~ret8 := is_do_write_p_triggered(); {45286#true} is VALID [2022-02-20 20:01:54,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {45286#true} havoc ~__retres1~0; {45286#true} is VALID [2022-02-20 20:01:54,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {45286#true} assume !(1 == ~p_dw_pc~0); {45286#true} is VALID [2022-02-20 20:01:54,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {45286#true} assume !(2 == ~p_dw_pc~0); {45286#true} is VALID [2022-02-20 20:01:54,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {45286#true} ~__retres1~0 := 0; {45286#true} is VALID [2022-02-20 20:01:54,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {45286#true} #res := ~__retres1~0; {45286#true} is VALID [2022-02-20 20:01:54,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {45286#true} assume true; {45286#true} is VALID [2022-02-20 20:01:54,342 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {45286#true} {45286#true} #1958#return; {45286#true} is VALID [2022-02-20 20:01:54,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {45286#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45286#true} is VALID [2022-02-20 20:01:54,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {45286#true} assume !(0 != ~tmp~1); {45286#true} is VALID [2022-02-20 20:01:54,342 INFO L272 TraceCheckUtils]: 11: Hoare triple {45286#true} call #t~ret9 := is_do_read_c_triggered(); {45286#true} is VALID [2022-02-20 20:01:54,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {45286#true} havoc ~__retres1~1; {45286#true} is VALID [2022-02-20 20:01:54,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {45286#true} assume !(1 == ~c_dr_pc~0); {45286#true} is VALID [2022-02-20 20:01:54,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {45286#true} assume !(2 == ~c_dr_pc~0); {45286#true} is VALID [2022-02-20 20:01:54,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {45286#true} ~__retres1~1 := 0; {45351#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:54,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {45351#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {45352#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:54,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {45352#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {45352#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:54,344 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {45352#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {45286#true} #1960#return; {45349#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:54,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {45349#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {45350#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:54,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {45350#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {45287#false} is VALID [2022-02-20 20:01:54,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {45287#false} assume true; {45287#false} is VALID [2022-02-20 20:01:54,345 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {45287#false} {45286#true} #1966#return; {45287#false} is VALID [2022-02-20 20:01:54,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:54,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {45333#(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); {45286#true} is VALID [2022-02-20 20:01:54,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {45286#true} assume !(1 == ~q_write_ev~0); {45286#true} is VALID [2022-02-20 20:01:54,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {45286#true} assume true; {45286#true} is VALID [2022-02-20 20:01:54,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45286#true} {45287#false} #1968#return; {45287#false} is VALID [2022-02-20 20:01:54,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:54,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {45286#true} havoc ~__retres1~2; {45286#true} is VALID [2022-02-20 20:01:54,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {45286#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45286#true} is VALID [2022-02-20 20:01:54,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {45286#true} #res := ~__retres1~2; {45286#true} is VALID [2022-02-20 20:01:54,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {45286#true} assume true; {45286#true} is VALID [2022-02-20 20:01:54,352 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45286#true} {45287#false} #1970#return; {45287#false} is VALID [2022-02-20 20:01:54,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:54,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {45286#true} havoc ~__retres1~2; {45286#true} is VALID [2022-02-20 20:01:54,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {45286#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45286#true} is VALID [2022-02-20 20:01:54,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {45286#true} #res := ~__retres1~2; {45286#true} is VALID [2022-02-20 20:01:54,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {45286#true} assume true; {45286#true} is VALID [2022-02-20 20:01:54,355 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45286#true} {45287#false} #1970#return; {45287#false} is VALID [2022-02-20 20:01:54,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {45286#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {45286#true} is VALID [2022-02-20 20:01:54,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {45286#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {45286#true} is VALID [2022-02-20 20:01:54,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {45286#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {45286#true} is VALID [2022-02-20 20:01:54,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {45286#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {45286#true} is VALID [2022-02-20 20:01:54,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {45286#true} call update_channels1(); {45332#(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 20:01:54,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {45332#(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); {45286#true} is VALID [2022-02-20 20:01:54,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {45286#true} assume true; {45286#true} is VALID [2022-02-20 20:01:54,356 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {45286#true} {45286#true} #1962#return; {45286#true} is VALID [2022-02-20 20:01:54,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {45286#true} assume { :begin_inline_init_threads1 } true; {45286#true} is VALID [2022-02-20 20:01:54,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {45286#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {45286#true} is VALID [2022-02-20 20:01:54,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {45286#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {45286#true} is VALID [2022-02-20 20:01:54,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {45286#true} assume { :end_inline_init_threads1 } true; {45286#true} is VALID [2022-02-20 20:01:54,357 INFO L272 TraceCheckUtils]: 12: Hoare triple {45286#true} call fire_delta_events1(); {45333#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:54,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {45333#(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); {45286#true} is VALID [2022-02-20 20:01:54,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {45286#true} assume !(0 == ~q_write_ev~0); {45286#true} is VALID [2022-02-20 20:01:54,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {45286#true} assume true; {45286#true} is VALID [2022-02-20 20:01:54,357 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45286#true} {45286#true} #1964#return; {45286#true} is VALID [2022-02-20 20:01:54,358 INFO L272 TraceCheckUtils]: 17: Hoare triple {45286#true} call activate_threads1(); {45334#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:54,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {45334#(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; {45286#true} is VALID [2022-02-20 20:01:54,358 INFO L272 TraceCheckUtils]: 19: Hoare triple {45286#true} call #t~ret8 := is_do_write_p_triggered(); {45286#true} is VALID [2022-02-20 20:01:54,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {45286#true} havoc ~__retres1~0; {45286#true} is VALID [2022-02-20 20:01:54,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {45286#true} assume !(1 == ~p_dw_pc~0); {45286#true} is VALID [2022-02-20 20:01:54,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {45286#true} assume !(2 == ~p_dw_pc~0); {45286#true} is VALID [2022-02-20 20:01:54,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {45286#true} ~__retres1~0 := 0; {45286#true} is VALID [2022-02-20 20:01:54,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {45286#true} #res := ~__retres1~0; {45286#true} is VALID [2022-02-20 20:01:54,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {45286#true} assume true; {45286#true} is VALID [2022-02-20 20:01:54,359 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {45286#true} {45286#true} #1958#return; {45286#true} is VALID [2022-02-20 20:01:54,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {45286#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45286#true} is VALID [2022-02-20 20:01:54,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {45286#true} assume !(0 != ~tmp~1); {45286#true} is VALID [2022-02-20 20:01:54,359 INFO L272 TraceCheckUtils]: 29: Hoare triple {45286#true} call #t~ret9 := is_do_read_c_triggered(); {45286#true} is VALID [2022-02-20 20:01:54,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {45286#true} havoc ~__retres1~1; {45286#true} is VALID [2022-02-20 20:01:54,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {45286#true} assume !(1 == ~c_dr_pc~0); {45286#true} is VALID [2022-02-20 20:01:54,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {45286#true} assume !(2 == ~c_dr_pc~0); {45286#true} is VALID [2022-02-20 20:01:54,360 INFO L290 TraceCheckUtils]: 33: Hoare triple {45286#true} ~__retres1~1 := 0; {45351#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:54,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {45351#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {45352#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:54,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {45352#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {45352#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:54,361 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {45352#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {45286#true} #1960#return; {45349#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:54,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {45349#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {45350#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:54,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {45350#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {45287#false} is VALID [2022-02-20 20:01:54,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {45287#false} assume true; {45287#false} is VALID [2022-02-20 20:01:54,363 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {45287#false} {45286#true} #1966#return; {45287#false} is VALID [2022-02-20 20:01:54,363 INFO L272 TraceCheckUtils]: 41: Hoare triple {45287#false} call reset_delta_events1(); {45333#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:54,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {45333#(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); {45286#true} is VALID [2022-02-20 20:01:54,363 INFO L290 TraceCheckUtils]: 43: Hoare triple {45286#true} assume !(1 == ~q_write_ev~0); {45286#true} is VALID [2022-02-20 20:01:54,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {45286#true} assume true; {45286#true} is VALID [2022-02-20 20:01:54,363 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {45286#true} {45287#false} #1968#return; {45287#false} is VALID [2022-02-20 20:01:54,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {45287#false} assume !false; {45287#false} is VALID [2022-02-20 20:01:54,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {45287#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; {45287#false} is VALID [2022-02-20 20:01:54,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {45287#false} assume !false; {45287#false} is VALID [2022-02-20 20:01:54,364 INFO L272 TraceCheckUtils]: 49: Hoare triple {45287#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {45286#true} is VALID [2022-02-20 20:01:54,364 INFO L290 TraceCheckUtils]: 50: Hoare triple {45286#true} havoc ~__retres1~2; {45286#true} is VALID [2022-02-20 20:01:54,364 INFO L290 TraceCheckUtils]: 51: Hoare triple {45286#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45286#true} is VALID [2022-02-20 20:01:54,364 INFO L290 TraceCheckUtils]: 52: Hoare triple {45286#true} #res := ~__retres1~2; {45286#true} is VALID [2022-02-20 20:01:54,364 INFO L290 TraceCheckUtils]: 53: Hoare triple {45286#true} assume true; {45286#true} is VALID [2022-02-20 20:01:54,364 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {45286#true} {45287#false} #1970#return; {45287#false} is VALID [2022-02-20 20:01:54,365 INFO L290 TraceCheckUtils]: 55: Hoare triple {45287#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; {45287#false} is VALID [2022-02-20 20:01:54,365 INFO L290 TraceCheckUtils]: 56: Hoare triple {45287#false} assume 0 != eval1_~tmp___1~0#1; {45287#false} is VALID [2022-02-20 20:01:54,365 INFO L290 TraceCheckUtils]: 57: Hoare triple {45287#false} 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; {45287#false} is VALID [2022-02-20 20:01:54,365 INFO L290 TraceCheckUtils]: 58: Hoare triple {45287#false} 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; {45287#false} is VALID [2022-02-20 20:01:54,365 INFO L290 TraceCheckUtils]: 59: Hoare triple {45287#false} assume 0 == ~p_dw_pc~0; {45287#false} is VALID [2022-02-20 20:01:54,365 INFO L290 TraceCheckUtils]: 60: Hoare triple {45287#false} assume !false; {45287#false} is VALID [2022-02-20 20:01:54,365 INFO L290 TraceCheckUtils]: 61: Hoare triple {45287#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {45287#false} is VALID [2022-02-20 20:01:54,366 INFO L290 TraceCheckUtils]: 62: Hoare triple {45287#false} assume { :end_inline_do_write_p } true; {45287#false} is VALID [2022-02-20 20:01:54,366 INFO L290 TraceCheckUtils]: 63: Hoare triple {45287#false} assume !(0 == ~c_dr_st~0); {45287#false} is VALID [2022-02-20 20:01:54,366 INFO L290 TraceCheckUtils]: 64: Hoare triple {45287#false} assume !false; {45287#false} is VALID [2022-02-20 20:01:54,366 INFO L272 TraceCheckUtils]: 65: Hoare triple {45287#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {45286#true} is VALID [2022-02-20 20:01:54,366 INFO L290 TraceCheckUtils]: 66: Hoare triple {45286#true} havoc ~__retres1~2; {45286#true} is VALID [2022-02-20 20:01:54,366 INFO L290 TraceCheckUtils]: 67: Hoare triple {45286#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45286#true} is VALID [2022-02-20 20:01:54,366 INFO L290 TraceCheckUtils]: 68: Hoare triple {45286#true} #res := ~__retres1~2; {45286#true} is VALID [2022-02-20 20:01:54,367 INFO L290 TraceCheckUtils]: 69: Hoare triple {45286#true} assume true; {45286#true} is VALID [2022-02-20 20:01:54,367 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {45286#true} {45287#false} #1970#return; {45287#false} is VALID [2022-02-20 20:01:54,367 INFO L290 TraceCheckUtils]: 71: Hoare triple {45287#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; {45287#false} is VALID [2022-02-20 20:01:54,367 INFO L290 TraceCheckUtils]: 72: Hoare triple {45287#false} assume 0 != eval1_~tmp___1~0#1; {45287#false} is VALID [2022-02-20 20:01:54,367 INFO L290 TraceCheckUtils]: 73: Hoare triple {45287#false} 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; {45287#false} is VALID [2022-02-20 20:01:54,367 INFO L290 TraceCheckUtils]: 74: Hoare triple {45287#false} 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; {45287#false} is VALID [2022-02-20 20:01:54,367 INFO L290 TraceCheckUtils]: 75: Hoare triple {45287#false} assume !(0 == ~p_dw_pc~0); {45287#false} is VALID [2022-02-20 20:01:54,368 INFO L290 TraceCheckUtils]: 76: Hoare triple {45287#false} assume 1 == ~p_dw_pc~0; {45287#false} is VALID [2022-02-20 20:01:54,368 INFO L290 TraceCheckUtils]: 77: Hoare triple {45287#false} assume !(0 == ~q_free~0); {45287#false} is VALID [2022-02-20 20:01:54,368 INFO L290 TraceCheckUtils]: 78: Hoare triple {45287#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; {45287#false} is VALID [2022-02-20 20:01:54,368 INFO L290 TraceCheckUtils]: 79: Hoare triple {45287#false} assume !false; {45287#false} is VALID [2022-02-20 20:01:54,368 INFO L290 TraceCheckUtils]: 80: Hoare triple {45287#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {45287#false} is VALID [2022-02-20 20:01:54,368 INFO L290 TraceCheckUtils]: 81: Hoare triple {45287#false} assume { :end_inline_do_write_p } true; {45287#false} is VALID [2022-02-20 20:01:54,368 INFO L290 TraceCheckUtils]: 82: Hoare triple {45287#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; {45287#false} is VALID [2022-02-20 20:01:54,368 INFO L290 TraceCheckUtils]: 83: Hoare triple {45287#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; {45287#false} is VALID [2022-02-20 20:01:54,369 INFO L290 TraceCheckUtils]: 84: Hoare triple {45287#false} assume !(0 == ~c_dr_pc~0); {45287#false} is VALID [2022-02-20 20:01:54,369 INFO L290 TraceCheckUtils]: 85: Hoare triple {45287#false} assume 2 == ~c_dr_pc~0; {45287#false} is VALID [2022-02-20 20:01:54,369 INFO L290 TraceCheckUtils]: 86: Hoare triple {45287#false} do_read_c_~a~0#1 := ~a_t~0; {45287#false} is VALID [2022-02-20 20:01:54,369 INFO L290 TraceCheckUtils]: 87: Hoare triple {45287#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; {45287#false} is VALID [2022-02-20 20:01:54,369 INFO L290 TraceCheckUtils]: 88: Hoare triple {45287#false} assume !(~p_last_write~0 == ~c_last_read~0); {45287#false} is VALID [2022-02-20 20:01:54,369 INFO L272 TraceCheckUtils]: 89: Hoare triple {45287#false} call error1(); {45287#false} is VALID [2022-02-20 20:01:54,369 INFO L290 TraceCheckUtils]: 90: Hoare triple {45287#false} assume !false; {45287#false} is VALID [2022-02-20 20:01:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:01:54,370 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:54,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300802752] [2022-02-20 20:01:54,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300802752] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:54,370 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:54,370 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:54,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594727434] [2022-02-20 20:01:54,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:54,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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 91 [2022-02-20 20:01:54,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:54,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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 20:01:54,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:54,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:54,417 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:54,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:54,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:54,418 INFO L87 Difference]: Start difference. First operand 2022 states and 2711 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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 20:01:58,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:58,821 INFO L93 Difference]: Finished difference Result 3847 states and 5113 transitions. [2022-02-20 20:01:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:01:58,821 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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 91 [2022-02-20 20:01:58,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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 20:01:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 926 transitions. [2022-02-20 20:01:58,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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 20:01:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 926 transitions. [2022-02-20 20:01:58,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 926 transitions. [2022-02-20 20:01:59,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 926 edges. 926 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:59,683 INFO L225 Difference]: With dead ends: 3847 [2022-02-20 20:01:59,683 INFO L226 Difference]: Without dead ends: 2216 [2022-02-20 20:01:59,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:01:59,689 INFO L933 BasicCegarLoop]: 734 mSDtfsCounter, 661 mSDsluCounter, 2540 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 3274 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:59,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 3274 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 20:01:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2022-02-20 20:01:59,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2082. [2022-02-20 20:01:59,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:59,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2216 states. Second operand has 2082 states, 1682 states have (on average 1.3478002378121283) internal successors, (2267), 1708 states have internal predecessors, (2267), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-02-20 20:01:59,815 INFO L74 IsIncluded]: Start isIncluded. First operand 2216 states. Second operand has 2082 states, 1682 states have (on average 1.3478002378121283) internal successors, (2267), 1708 states have internal predecessors, (2267), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-02-20 20:01:59,818 INFO L87 Difference]: Start difference. First operand 2216 states. Second operand has 2082 states, 1682 states have (on average 1.3478002378121283) internal successors, (2267), 1708 states have internal predecessors, (2267), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-02-20 20:02:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:02:00,017 INFO L93 Difference]: Finished difference Result 2216 states and 2954 transitions. [2022-02-20 20:02:00,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2954 transitions. [2022-02-20 20:02:00,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:02:00,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:02:00,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 2082 states, 1682 states have (on average 1.3478002378121283) internal successors, (2267), 1708 states have internal predecessors, (2267), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) Second operand 2216 states. [2022-02-20 20:02:00,027 INFO L87 Difference]: Start difference. First operand has 2082 states, 1682 states have (on average 1.3478002378121283) internal successors, (2267), 1708 states have internal predecessors, (2267), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) Second operand 2216 states. [2022-02-20 20:02:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:02:00,226 INFO L93 Difference]: Finished difference Result 2216 states and 2954 transitions. [2022-02-20 20:02:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2954 transitions. [2022-02-20 20:02:00,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:02:00,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:02:00,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:02:00,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:02:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2082 states, 1682 states have (on average 1.3478002378121283) internal successors, (2267), 1708 states have internal predecessors, (2267), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-02-20 20:02:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2765 transitions. [2022-02-20 20:02:00,502 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2765 transitions. Word has length 91 [2022-02-20 20:02:00,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:02:00,502 INFO L470 AbstractCegarLoop]: Abstraction has 2082 states and 2765 transitions. [2022-02-20 20:02:00,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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 20:02:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2765 transitions. [2022-02-20 20:02:00,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:02:00,506 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:02:00,506 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:02:00,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:02:00,506 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:02:00,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:02:00,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1106760652, now seen corresponding path program 1 times [2022-02-20 20:02:00,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:02:00,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783026449] [2022-02-20 20:02:00,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:02:00,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:02:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:00,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:02:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:00,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {57773#(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); {57726#true} is VALID [2022-02-20 20:02:00,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {57726#true} assume true; {57726#true} is VALID [2022-02-20 20:02:00,566 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57726#true} {57726#true} #1962#return; {57726#true} is VALID [2022-02-20 20:02:00,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:02:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:00,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {57774#(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); {57726#true} is VALID [2022-02-20 20:02:00,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {57726#true} assume !(0 == ~q_write_ev~0); {57726#true} is VALID [2022-02-20 20:02:00,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {57726#true} assume true; {57726#true} is VALID [2022-02-20 20:02:00,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57726#true} {57731#(= ~c_dr_st~0 0)} #1964#return; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:02:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:00,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:02:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:00,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {57726#true} havoc ~__retres1~0; {57726#true} is VALID [2022-02-20 20:02:00,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {57726#true} assume !(1 == ~p_dw_pc~0); {57726#true} is VALID [2022-02-20 20:02:00,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {57726#true} assume !(2 == ~p_dw_pc~0); {57726#true} is VALID [2022-02-20 20:02:00,606 INFO L290 TraceCheckUtils]: 3: Hoare triple {57726#true} ~__retres1~0 := 0; {57726#true} is VALID [2022-02-20 20:02:00,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {57726#true} #res := ~__retres1~0; {57726#true} is VALID [2022-02-20 20:02:00,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {57726#true} assume true; {57726#true} is VALID [2022-02-20 20:02:00,606 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {57726#true} {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1958#return; {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:02:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:00,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {57726#true} havoc ~__retres1~1; {57726#true} is VALID [2022-02-20 20:02:00,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {57726#true} assume !(1 == ~c_dr_pc~0); {57726#true} is VALID [2022-02-20 20:02:00,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {57726#true} assume !(2 == ~c_dr_pc~0); {57726#true} is VALID [2022-02-20 20:02:00,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {57726#true} ~__retres1~1 := 0; {57726#true} is VALID [2022-02-20 20:02:00,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {57726#true} #res := ~__retres1~1; {57726#true} is VALID [2022-02-20 20:02:00,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {57726#true} assume true; {57726#true} is VALID [2022-02-20 20:02:00,611 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {57726#true} {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1960#return; {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {57775#(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; {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,611 INFO L272 TraceCheckUtils]: 1: Hoare triple {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {57726#true} is VALID [2022-02-20 20:02:00,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {57726#true} havoc ~__retres1~0; {57726#true} is VALID [2022-02-20 20:02:00,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {57726#true} assume !(1 == ~p_dw_pc~0); {57726#true} is VALID [2022-02-20 20:02:00,612 INFO L290 TraceCheckUtils]: 4: Hoare triple {57726#true} assume !(2 == ~p_dw_pc~0); {57726#true} is VALID [2022-02-20 20:02:00,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {57726#true} ~__retres1~0 := 0; {57726#true} is VALID [2022-02-20 20:02:00,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {57726#true} #res := ~__retres1~0; {57726#true} is VALID [2022-02-20 20:02:00,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {57726#true} assume true; {57726#true} is VALID [2022-02-20 20:02:00,613 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {57726#true} {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1958#return; {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,613 INFO L272 TraceCheckUtils]: 11: Hoare triple {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {57726#true} is VALID [2022-02-20 20:02:00,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {57726#true} havoc ~__retres1~1; {57726#true} is VALID [2022-02-20 20:02:00,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {57726#true} assume !(1 == ~c_dr_pc~0); {57726#true} is VALID [2022-02-20 20:02:00,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {57726#true} assume !(2 == ~c_dr_pc~0); {57726#true} is VALID [2022-02-20 20:02:00,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {57726#true} ~__retres1~1 := 0; {57726#true} is VALID [2022-02-20 20:02:00,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {57726#true} #res := ~__retres1~1; {57726#true} is VALID [2022-02-20 20:02:00,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {57726#true} assume true; {57726#true} is VALID [2022-02-20 20:02:00,615 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {57726#true} {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1960#return; {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,616 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {57731#(= ~c_dr_st~0 0)} #1966#return; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:02:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:00,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {57774#(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); {57726#true} is VALID [2022-02-20 20:02:00,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {57726#true} assume !(1 == ~q_write_ev~0); {57726#true} is VALID [2022-02-20 20:02:00,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {57726#true} assume true; {57726#true} is VALID [2022-02-20 20:02:00,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57726#true} {57731#(= ~c_dr_st~0 0)} #1968#return; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:02:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:00,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {57726#true} havoc ~__retres1~2; {57726#true} is VALID [2022-02-20 20:02:00,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {57726#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {57726#true} is VALID [2022-02-20 20:02:00,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {57726#true} #res := ~__retres1~2; {57726#true} is VALID [2022-02-20 20:02:00,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {57726#true} assume true; {57726#true} is VALID [2022-02-20 20:02:00,626 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {57726#true} {57731#(= ~c_dr_st~0 0)} #1970#return; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:02:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:00,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {57726#true} havoc ~__retres1~2; {57726#true} is VALID [2022-02-20 20:02:00,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {57726#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {57726#true} is VALID [2022-02-20 20:02:00,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {57726#true} #res := ~__retres1~2; {57726#true} is VALID [2022-02-20 20:02:00,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {57726#true} assume true; {57726#true} is VALID [2022-02-20 20:02:00,629 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {57726#true} {57727#false} #1970#return; {57727#false} is VALID [2022-02-20 20:02:00,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {57726#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {57726#true} is VALID [2022-02-20 20:02:00,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {57726#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {57726#true} is VALID [2022-02-20 20:02:00,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {57726#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {57726#true} is VALID [2022-02-20 20:02:00,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {57726#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {57726#true} is VALID [2022-02-20 20:02:00,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {57726#true} call update_channels1(); {57773#(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 20:02:00,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {57773#(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); {57726#true} is VALID [2022-02-20 20:02:00,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {57726#true} assume true; {57726#true} is VALID [2022-02-20 20:02:00,631 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {57726#true} {57726#true} #1962#return; {57726#true} is VALID [2022-02-20 20:02:00,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {57726#true} assume { :begin_inline_init_threads1 } true; {57726#true} is VALID [2022-02-20 20:02:00,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {57726#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {57726#true} is VALID [2022-02-20 20:02:00,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {57726#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {57731#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads1 } true; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,632 INFO L272 TraceCheckUtils]: 12: Hoare triple {57731#(= ~c_dr_st~0 0)} call fire_delta_events1(); {57774#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:02:00,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {57774#(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); {57726#true} is VALID [2022-02-20 20:02:00,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {57726#true} assume !(0 == ~q_write_ev~0); {57726#true} is VALID [2022-02-20 20:02:00,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {57726#true} assume true; {57726#true} is VALID [2022-02-20 20:02:00,633 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {57726#true} {57731#(= ~c_dr_st~0 0)} #1964#return; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,633 INFO L272 TraceCheckUtils]: 17: Hoare triple {57731#(= ~c_dr_st~0 0)} call activate_threads1(); {57775#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:02:00,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {57775#(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; {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,634 INFO L272 TraceCheckUtils]: 19: Hoare triple {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {57726#true} is VALID [2022-02-20 20:02:00,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {57726#true} havoc ~__retres1~0; {57726#true} is VALID [2022-02-20 20:02:00,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {57726#true} assume !(1 == ~p_dw_pc~0); {57726#true} is VALID [2022-02-20 20:02:00,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {57726#true} assume !(2 == ~p_dw_pc~0); {57726#true} is VALID [2022-02-20 20:02:00,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {57726#true} ~__retres1~0 := 0; {57726#true} is VALID [2022-02-20 20:02:00,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {57726#true} #res := ~__retres1~0; {57726#true} is VALID [2022-02-20 20:02:00,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {57726#true} assume true; {57726#true} is VALID [2022-02-20 20:02:00,635 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {57726#true} {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1958#return; {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,636 INFO L272 TraceCheckUtils]: 29: Hoare triple {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {57726#true} is VALID [2022-02-20 20:02:00,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {57726#true} havoc ~__retres1~1; {57726#true} is VALID [2022-02-20 20:02:00,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {57726#true} assume !(1 == ~c_dr_pc~0); {57726#true} is VALID [2022-02-20 20:02:00,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {57726#true} assume !(2 == ~c_dr_pc~0); {57726#true} is VALID [2022-02-20 20:02:00,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {57726#true} ~__retres1~1 := 0; {57726#true} is VALID [2022-02-20 20:02:00,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {57726#true} #res := ~__retres1~1; {57726#true} is VALID [2022-02-20 20:02:00,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {57726#true} assume true; {57726#true} is VALID [2022-02-20 20:02:00,637 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {57726#true} {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1960#return; {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,638 INFO L290 TraceCheckUtils]: 38: Hoare triple {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,638 INFO L290 TraceCheckUtils]: 39: Hoare triple {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:02:00,638 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {57776#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {57731#(= ~c_dr_st~0 0)} #1966#return; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,639 INFO L272 TraceCheckUtils]: 41: Hoare triple {57731#(= ~c_dr_st~0 0)} call reset_delta_events1(); {57774#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:02:00,639 INFO L290 TraceCheckUtils]: 42: Hoare triple {57774#(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); {57726#true} is VALID [2022-02-20 20:02:00,639 INFO L290 TraceCheckUtils]: 43: Hoare triple {57726#true} assume !(1 == ~q_write_ev~0); {57726#true} is VALID [2022-02-20 20:02:00,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {57726#true} assume true; {57726#true} is VALID [2022-02-20 20:02:00,640 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {57726#true} {57731#(= ~c_dr_st~0 0)} #1968#return; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,640 INFO L290 TraceCheckUtils]: 46: Hoare triple {57731#(= ~c_dr_st~0 0)} assume !false; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,640 INFO L290 TraceCheckUtils]: 47: Hoare triple {57731#(= ~c_dr_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; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,641 INFO L290 TraceCheckUtils]: 48: Hoare triple {57731#(= ~c_dr_st~0 0)} assume !false; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,641 INFO L272 TraceCheckUtils]: 49: Hoare triple {57731#(= ~c_dr_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {57726#true} is VALID [2022-02-20 20:02:00,641 INFO L290 TraceCheckUtils]: 50: Hoare triple {57726#true} havoc ~__retres1~2; {57726#true} is VALID [2022-02-20 20:02:00,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {57726#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {57726#true} is VALID [2022-02-20 20:02:00,641 INFO L290 TraceCheckUtils]: 52: Hoare triple {57726#true} #res := ~__retres1~2; {57726#true} is VALID [2022-02-20 20:02:00,641 INFO L290 TraceCheckUtils]: 53: Hoare triple {57726#true} assume true; {57726#true} is VALID [2022-02-20 20:02:00,642 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {57726#true} {57731#(= ~c_dr_st~0 0)} #1970#return; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,642 INFO L290 TraceCheckUtils]: 55: Hoare triple {57731#(= ~c_dr_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; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,642 INFO L290 TraceCheckUtils]: 56: Hoare triple {57731#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,643 INFO L290 TraceCheckUtils]: 57: Hoare triple {57731#(= ~c_dr_st~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; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,643 INFO L290 TraceCheckUtils]: 58: Hoare triple {57731#(= ~c_dr_st~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; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,643 INFO L290 TraceCheckUtils]: 59: Hoare triple {57731#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_pc~0; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,644 INFO L290 TraceCheckUtils]: 60: Hoare triple {57731#(= ~c_dr_st~0 0)} assume !false; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,644 INFO L290 TraceCheckUtils]: 61: Hoare triple {57731#(= ~c_dr_st~0 0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,645 INFO L290 TraceCheckUtils]: 62: Hoare triple {57731#(= ~c_dr_st~0 0)} assume { :end_inline_do_write_p } true; {57731#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:02:00,645 INFO L290 TraceCheckUtils]: 63: Hoare triple {57731#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {57727#false} is VALID [2022-02-20 20:02:00,645 INFO L290 TraceCheckUtils]: 64: Hoare triple {57727#false} assume !false; {57727#false} is VALID [2022-02-20 20:02:00,645 INFO L272 TraceCheckUtils]: 65: Hoare triple {57727#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {57726#true} is VALID [2022-02-20 20:02:00,645 INFO L290 TraceCheckUtils]: 66: Hoare triple {57726#true} havoc ~__retres1~2; {57726#true} is VALID [2022-02-20 20:02:00,645 INFO L290 TraceCheckUtils]: 67: Hoare triple {57726#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {57726#true} is VALID [2022-02-20 20:02:00,646 INFO L290 TraceCheckUtils]: 68: Hoare triple {57726#true} #res := ~__retres1~2; {57726#true} is VALID [2022-02-20 20:02:00,646 INFO L290 TraceCheckUtils]: 69: Hoare triple {57726#true} assume true; {57726#true} is VALID [2022-02-20 20:02:00,646 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {57726#true} {57727#false} #1970#return; {57727#false} is VALID [2022-02-20 20:02:00,646 INFO L290 TraceCheckUtils]: 71: Hoare triple {57727#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; {57727#false} is VALID [2022-02-20 20:02:00,646 INFO L290 TraceCheckUtils]: 72: Hoare triple {57727#false} assume 0 != eval1_~tmp___1~0#1; {57727#false} is VALID [2022-02-20 20:02:00,646 INFO L290 TraceCheckUtils]: 73: Hoare triple {57727#false} 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; {57727#false} is VALID [2022-02-20 20:02:00,647 INFO L290 TraceCheckUtils]: 74: Hoare triple {57727#false} 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; {57727#false} is VALID [2022-02-20 20:02:00,647 INFO L290 TraceCheckUtils]: 75: Hoare triple {57727#false} assume !(0 == ~p_dw_pc~0); {57727#false} is VALID [2022-02-20 20:02:00,647 INFO L290 TraceCheckUtils]: 76: Hoare triple {57727#false} assume 1 == ~p_dw_pc~0; {57727#false} is VALID [2022-02-20 20:02:00,647 INFO L290 TraceCheckUtils]: 77: Hoare triple {57727#false} assume !(0 == ~q_free~0); {57727#false} is VALID [2022-02-20 20:02:00,647 INFO L290 TraceCheckUtils]: 78: Hoare triple {57727#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; {57727#false} is VALID [2022-02-20 20:02:00,647 INFO L290 TraceCheckUtils]: 79: Hoare triple {57727#false} assume !false; {57727#false} is VALID [2022-02-20 20:02:00,647 INFO L290 TraceCheckUtils]: 80: Hoare triple {57727#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {57727#false} is VALID [2022-02-20 20:02:00,647 INFO L290 TraceCheckUtils]: 81: Hoare triple {57727#false} assume { :end_inline_do_write_p } true; {57727#false} is VALID [2022-02-20 20:02:00,648 INFO L290 TraceCheckUtils]: 82: Hoare triple {57727#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; {57727#false} is VALID [2022-02-20 20:02:00,648 INFO L290 TraceCheckUtils]: 83: Hoare triple {57727#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; {57727#false} is VALID [2022-02-20 20:02:00,648 INFO L290 TraceCheckUtils]: 84: Hoare triple {57727#false} assume !(0 == ~c_dr_pc~0); {57727#false} is VALID [2022-02-20 20:02:00,648 INFO L290 TraceCheckUtils]: 85: Hoare triple {57727#false} assume 2 == ~c_dr_pc~0; {57727#false} is VALID [2022-02-20 20:02:00,648 INFO L290 TraceCheckUtils]: 86: Hoare triple {57727#false} do_read_c_~a~0#1 := ~a_t~0; {57727#false} is VALID [2022-02-20 20:02:00,648 INFO L290 TraceCheckUtils]: 87: Hoare triple {57727#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; {57727#false} is VALID [2022-02-20 20:02:00,648 INFO L290 TraceCheckUtils]: 88: Hoare triple {57727#false} assume !(~p_last_write~0 == ~c_last_read~0); {57727#false} is VALID [2022-02-20 20:02:00,649 INFO L272 TraceCheckUtils]: 89: Hoare triple {57727#false} call error1(); {57727#false} is VALID [2022-02-20 20:02:00,649 INFO L290 TraceCheckUtils]: 90: Hoare triple {57727#false} assume !false; {57727#false} is VALID [2022-02-20 20:02:00,649 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 20:02:00,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:02:00,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783026449] [2022-02-20 20:02:00,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783026449] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:02:00,650 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:02:00,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:02:00,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775987061] [2022-02-20 20:02:00,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:02:00,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-02-20 20:02:00,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:02:00,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:02:00,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:02:00,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:02:00,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:02:00,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:02:00,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:02:00,719 INFO L87 Difference]: Start difference. First operand 2082 states and 2765 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:02:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:02:03,065 INFO L93 Difference]: Finished difference Result 3882 states and 5120 transitions. [2022-02-20 20:02:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:02:03,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-02-20 20:02:03,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:02:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:02:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 911 transitions. [2022-02-20 20:02:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:02:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 911 transitions. [2022-02-20 20:02:03,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 911 transitions. [2022-02-20 20:02:03,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 911 edges. 911 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:02:03,884 INFO L225 Difference]: With dead ends: 3882 [2022-02-20 20:02:03,884 INFO L226 Difference]: Without dead ends: 2192 [2022-02-20 20:02:03,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-02-20 20:02:03,888 INFO L933 BasicCegarLoop]: 695 mSDtfsCounter, 1654 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:02:03,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1687 Valid, 1715 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 20:02:03,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2022-02-20 20:02:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2082. [2022-02-20 20:02:04,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:02:04,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2192 states. Second operand has 2082 states, 1682 states have (on average 1.3228299643281807) internal successors, (2225), 1708 states have internal predecessors, (2225), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-02-20 20:02:04,016 INFO L74 IsIncluded]: Start isIncluded. First operand 2192 states. Second operand has 2082 states, 1682 states have (on average 1.3228299643281807) internal successors, (2225), 1708 states have internal predecessors, (2225), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-02-20 20:02:04,020 INFO L87 Difference]: Start difference. First operand 2192 states. Second operand has 2082 states, 1682 states have (on average 1.3228299643281807) internal successors, (2225), 1708 states have internal predecessors, (2225), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-02-20 20:02:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:02:04,169 INFO L93 Difference]: Finished difference Result 2192 states and 2876 transitions. [2022-02-20 20:02:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2876 transitions. [2022-02-20 20:02:04,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:02:04,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:02:04,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 2082 states, 1682 states have (on average 1.3228299643281807) internal successors, (2225), 1708 states have internal predecessors, (2225), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) Second operand 2192 states. [2022-02-20 20:02:04,182 INFO L87 Difference]: Start difference. First operand has 2082 states, 1682 states have (on average 1.3228299643281807) internal successors, (2225), 1708 states have internal predecessors, (2225), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) Second operand 2192 states. [2022-02-20 20:02:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:02:04,377 INFO L93 Difference]: Finished difference Result 2192 states and 2876 transitions. [2022-02-20 20:02:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2876 transitions. [2022-02-20 20:02:04,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:02:04,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:02:04,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:02:04,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:02:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2082 states, 1682 states have (on average 1.3228299643281807) internal successors, (2225), 1708 states have internal predecessors, (2225), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-02-20 20:02:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2723 transitions. [2022-02-20 20:02:04,642 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2723 transitions. Word has length 91 [2022-02-20 20:02:04,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:02:04,643 INFO L470 AbstractCegarLoop]: Abstraction has 2082 states and 2723 transitions. [2022-02-20 20:02:04,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:02:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2723 transitions. [2022-02-20 20:02:04,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 20:02:04,644 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:02:04,644 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:02:04,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:02:04,645 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:02:04,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:02:04,645 INFO L85 PathProgramCache]: Analyzing trace with hash -721573211, now seen corresponding path program 1 times [2022-02-20 20:02:04,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:02:04,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962143890] [2022-02-20 20:02:04,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:02:04,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:02:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:04,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:02:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:04,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {70205#(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); {70206#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:02:04,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {70206#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {70206#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:02:04,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70206#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {70159#(= ~q_read_ev~0 2)} #1962#return; {70159#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:02:04,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:02:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:04,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {70207#(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); {70157#true} is VALID [2022-02-20 20:02:04,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {70157#true} assume !(0 == ~q_write_ev~0); {70157#true} is VALID [2022-02-20 20:02:04,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {70157#true} assume true; {70157#true} is VALID [2022-02-20 20:02:04,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70157#true} {70159#(= ~q_read_ev~0 2)} #1964#return; {70157#true} is VALID [2022-02-20 20:02:04,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:02:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:04,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:02:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:04,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {70157#true} havoc ~__retres1~0; {70157#true} is VALID [2022-02-20 20:02:04,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {70157#true} assume !(1 == ~p_dw_pc~0); {70157#true} is VALID [2022-02-20 20:02:04,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {70157#true} assume !(2 == ~p_dw_pc~0); {70157#true} is VALID [2022-02-20 20:02:04,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {70157#true} ~__retres1~0 := 0; {70157#true} is VALID [2022-02-20 20:02:04,738 INFO L290 TraceCheckUtils]: 4: Hoare triple {70157#true} #res := ~__retres1~0; {70157#true} is VALID [2022-02-20 20:02:04,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {70157#true} assume true; {70157#true} is VALID [2022-02-20 20:02:04,738 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {70157#true} {70157#true} #1958#return; {70157#true} is VALID [2022-02-20 20:02:04,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:02:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:04,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {70157#true} havoc ~__retres1~1; {70157#true} is VALID [2022-02-20 20:02:04,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {70157#true} assume !(1 == ~c_dr_pc~0); {70157#true} is VALID [2022-02-20 20:02:04,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {70157#true} assume !(2 == ~c_dr_pc~0); {70157#true} is VALID [2022-02-20 20:02:04,741 INFO L290 TraceCheckUtils]: 3: Hoare triple {70157#true} ~__retres1~1 := 0; {70157#true} is VALID [2022-02-20 20:02:04,741 INFO L290 TraceCheckUtils]: 4: Hoare triple {70157#true} #res := ~__retres1~1; {70157#true} is VALID [2022-02-20 20:02:04,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {70157#true} assume true; {70157#true} is VALID [2022-02-20 20:02:04,741 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {70157#true} {70157#true} #1960#return; {70157#true} is VALID [2022-02-20 20:02:04,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {70208#(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; {70157#true} is VALID [2022-02-20 20:02:04,742 INFO L272 TraceCheckUtils]: 1: Hoare triple {70157#true} call #t~ret8 := is_do_write_p_triggered(); {70157#true} is VALID [2022-02-20 20:02:04,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {70157#true} havoc ~__retres1~0; {70157#true} is VALID [2022-02-20 20:02:04,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {70157#true} assume !(1 == ~p_dw_pc~0); {70157#true} is VALID [2022-02-20 20:02:04,742 INFO L290 TraceCheckUtils]: 4: Hoare triple {70157#true} assume !(2 == ~p_dw_pc~0); {70157#true} is VALID [2022-02-20 20:02:04,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {70157#true} ~__retres1~0 := 0; {70157#true} is VALID [2022-02-20 20:02:04,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {70157#true} #res := ~__retres1~0; {70157#true} is VALID [2022-02-20 20:02:04,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {70157#true} assume true; {70157#true} is VALID [2022-02-20 20:02:04,743 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {70157#true} {70157#true} #1958#return; {70157#true} is VALID [2022-02-20 20:02:04,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {70157#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {70157#true} is VALID [2022-02-20 20:02:04,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {70157#true} assume !(0 != ~tmp~1); {70157#true} is VALID [2022-02-20 20:02:04,743 INFO L272 TraceCheckUtils]: 11: Hoare triple {70157#true} call #t~ret9 := is_do_read_c_triggered(); {70157#true} is VALID [2022-02-20 20:02:04,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {70157#true} havoc ~__retres1~1; {70157#true} is VALID [2022-02-20 20:02:04,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {70157#true} assume !(1 == ~c_dr_pc~0); {70157#true} is VALID [2022-02-20 20:02:04,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {70157#true} assume !(2 == ~c_dr_pc~0); {70157#true} is VALID [2022-02-20 20:02:04,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {70157#true} ~__retres1~1 := 0; {70157#true} is VALID [2022-02-20 20:02:04,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {70157#true} #res := ~__retres1~1; {70157#true} is VALID [2022-02-20 20:02:04,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {70157#true} assume true; {70157#true} is VALID [2022-02-20 20:02:04,744 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {70157#true} {70157#true} #1960#return; {70157#true} is VALID [2022-02-20 20:02:04,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {70157#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {70157#true} is VALID [2022-02-20 20:02:04,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {70157#true} assume !(0 != ~tmp___0~1); {70157#true} is VALID [2022-02-20 20:02:04,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {70157#true} assume true; {70157#true} is VALID [2022-02-20 20:02:04,744 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {70157#true} {70157#true} #1966#return; {70157#true} is VALID [2022-02-20 20:02:04,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:02:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:04,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {70207#(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); {70157#true} is VALID [2022-02-20 20:02:04,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {70157#true} assume !(1 == ~q_write_ev~0); {70157#true} is VALID [2022-02-20 20:02:04,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {70157#true} assume true; {70157#true} is VALID [2022-02-20 20:02:04,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70157#true} {70157#true} #1968#return; {70157#true} is VALID [2022-02-20 20:02:04,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:02:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:04,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {70157#true} havoc ~__retres1~2; {70157#true} is VALID [2022-02-20 20:02:04,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {70157#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {70157#true} is VALID [2022-02-20 20:02:04,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {70157#true} #res := ~__retres1~2; {70157#true} is VALID [2022-02-20 20:02:04,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {70157#true} assume true; {70157#true} is VALID [2022-02-20 20:02:04,751 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {70157#true} {70157#true} #1970#return; {70157#true} is VALID [2022-02-20 20:02:04,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:02:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:02:04,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {70157#true} havoc ~__retres1~2; {70157#true} is VALID [2022-02-20 20:02:04,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {70157#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {70223#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:02:04,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {70223#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {70223#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:02:04,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {70223#(= ~p_dw_st~0 0)} assume true; {70223#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:02:04,763 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {70223#(= ~p_dw_st~0 0)} {70199#(not (= ~p_dw_st~0 0))} #1970#return; {70158#false} is VALID [2022-02-20 20:02:04,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {70157#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~t11_pc~0 := 0;~t12_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~t11_st~0 := 0;~t12_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~t11_i~0 := 0;~t12_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~T11_E~0 := 2;~T12_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {70157#true} is VALID [2022-02-20 20:02:04,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {70157#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {70157#true} is VALID [2022-02-20 20:02:04,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {70157#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {70159#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:02:04,764 INFO L290 TraceCheckUtils]: 3: Hoare triple {70159#(= ~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_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {70159#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:02:04,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {70159#(= ~q_read_ev~0 2)} call update_channels1(); {70205#(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 20:02:04,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {70205#(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); {70206#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:02:04,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {70206#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {70206#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:02:04,766 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {70206#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {70159#(= ~q_read_ev~0 2)} #1962#return; {70159#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:02:04,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {70159#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {70159#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:02:04,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {70159#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {70159#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:02:04,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {70159#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {70159#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:02:04,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {70159#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {70159#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:02:04,767 INFO L272 TraceCheckUtils]: 12: Hoare triple {70159#(= ~q_read_ev~0 2)} call fire_delta_events1(); {70207#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:02:04,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {70207#(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); {70157#true} is VALID [2022-02-20 20:02:04,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {70157#true} assume !(0 == ~q_write_ev~0); {70157#true} is VALID [2022-02-20 20:02:04,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {70157#true} assume true; {70157#true} is VALID [2022-02-20 20:02:04,768 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {70157#true} {70159#(= ~q_read_ev~0 2)} #1964#return; {70157#true} is VALID [2022-02-20 20:02:04,768 INFO L272 TraceCheckUtils]: 17: Hoare triple {70157#true} call activate_threads1(); {70208#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:02:04,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {70208#(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; {70157#true} is VALID [2022-02-20 20:02:04,769 INFO L272 TraceCheckUtils]: 19: Hoare triple {70157#true} call #t~ret8 := is_do_write_p_triggered(); {70157#true} is VALID [2022-02-20 20:02:04,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {70157#true} havoc ~__retres1~0; {70157#true} is VALID [2022-02-20 20:02:04,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {70157#true} assume !(1 == ~p_dw_pc~0); {70157#true} is VALID [2022-02-20 20:02:04,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {70157#true} assume !(2 == ~p_dw_pc~0); {70157#true} is VALID [2022-02-20 20:02:04,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {70157#true} ~__retres1~0 := 0; {70157#true} is VALID [2022-02-20 20:02:04,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {70157#true} #res := ~__retres1~0; {70157#true} is VALID [2022-02-20 20:02:04,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {70157#true} assume true; {70157#true} is VALID [2022-02-20 20:02:04,769 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {70157#true} {70157#true} #1958#return; {70157#true} is VALID [2022-02-20 20:02:04,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {70157#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {70157#true} is VALID [2022-02-20 20:02:04,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {70157#true} assume !(0 != ~tmp~1); {70157#true} is VALID [2022-02-20 20:02:04,770 INFO L272 TraceCheckUtils]: 29: Hoare triple {70157#true} call #t~ret9 := is_do_read_c_triggered(); {70157#true} is VALID [2022-02-20 20:02:04,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {70157#true} havoc ~__retres1~1; {70157#true} is VALID [2022-02-20 20:02:04,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {70157#true} assume !(1 == ~c_dr_pc~0); {70157#true} is VALID [2022-02-20 20:02:04,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {70157#true} assume !(2 == ~c_dr_pc~0); {70157#true} is VALID [2022-02-20 20:02:04,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {70157#true} ~__retres1~1 := 0; {70157#true} is VALID [2022-02-20 20:02:04,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {70157#true} #res := ~__retres1~1; {70157#true} is VALID [2022-02-20 20:02:04,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {70157#true} assume true; {70157#true} is VALID [2022-02-20 20:02:04,771 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {70157#true} {70157#true} #1960#return; {70157#true} is VALID [2022-02-20 20:02:04,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {70157#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {70157#true} is VALID [2022-02-20 20:02:04,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {70157#true} assume !(0 != ~tmp___0~1); {70157#true} is VALID [2022-02-20 20:02:04,771 INFO L290 TraceCheckUtils]: 39: Hoare triple {70157#true} assume true; {70157#true} is VALID [2022-02-20 20:02:04,771 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {70157#true} {70157#true} #1966#return; {70157#true} is VALID [2022-02-20 20:02:04,772 INFO L272 TraceCheckUtils]: 41: Hoare triple {70157#true} call reset_delta_events1(); {70207#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:02:04,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {70207#(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); {70157#true} is VALID [2022-02-20 20:02:04,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {70157#true} assume !(1 == ~q_write_ev~0); {70157#true} is VALID [2022-02-20 20:02:04,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {70157#true} assume true; {70157#true} is VALID [2022-02-20 20:02:04,772 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {70157#true} {70157#true} #1968#return; {70157#true} is VALID [2022-02-20 20:02:04,772 INFO L290 TraceCheckUtils]: 46: Hoare triple {70157#true} assume !false; {70157#true} is VALID [2022-02-20 20:02:04,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {70157#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; {70157#true} is VALID [2022-02-20 20:02:04,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {70157#true} assume !false; {70157#true} is VALID [2022-02-20 20:02:04,773 INFO L272 TraceCheckUtils]: 49: Hoare triple {70157#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {70157#true} is VALID [2022-02-20 20:02:04,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {70157#true} havoc ~__retres1~2; {70157#true} is VALID [2022-02-20 20:02:04,773 INFO L290 TraceCheckUtils]: 51: Hoare triple {70157#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {70157#true} is VALID [2022-02-20 20:02:04,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {70157#true} #res := ~__retres1~2; {70157#true} is VALID [2022-02-20 20:02:04,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {70157#true} assume true; {70157#true} is VALID [2022-02-20 20:02:04,773 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {70157#true} {70157#true} #1970#return; {70157#true} is VALID [2022-02-20 20:02:04,773 INFO L290 TraceCheckUtils]: 55: Hoare triple {70157#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; {70157#true} is VALID [2022-02-20 20:02:04,773 INFO L290 TraceCheckUtils]: 56: Hoare triple {70157#true} assume 0 != eval1_~tmp___1~0#1; {70157#true} is VALID [2022-02-20 20:02:04,773 INFO L290 TraceCheckUtils]: 57: Hoare triple {70157#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; {70157#true} is VALID [2022-02-20 20:02:04,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {70157#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; {70157#true} is VALID [2022-02-20 20:02:04,774 INFO L290 TraceCheckUtils]: 59: Hoare triple {70157#true} assume 0 == ~p_dw_pc~0; {70157#true} is VALID [2022-02-20 20:02:04,774 INFO L290 TraceCheckUtils]: 60: Hoare triple {70157#true} assume !false; {70157#true} is VALID [2022-02-20 20:02:04,774 INFO L290 TraceCheckUtils]: 61: Hoare triple {70157#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {70199#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:02:04,775 INFO L290 TraceCheckUtils]: 62: Hoare triple {70199#(not (= ~p_dw_st~0 0))} assume { :end_inline_do_write_p } true; {70199#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:02:04,775 INFO L290 TraceCheckUtils]: 63: Hoare triple {70199#(not (= ~p_dw_st~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; {70199#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:02:04,775 INFO L290 TraceCheckUtils]: 64: Hoare triple {70199#(not (= ~p_dw_st~0 0))} assume !(0 != eval1_~tmp___0~2#1); {70199#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:02:04,776 INFO L290 TraceCheckUtils]: 65: Hoare triple {70199#(not (= ~p_dw_st~0 0))} assume !false; {70199#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:02:04,776 INFO L272 TraceCheckUtils]: 66: Hoare triple {70199#(not (= ~p_dw_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {70157#true} is VALID [2022-02-20 20:02:04,776 INFO L290 TraceCheckUtils]: 67: Hoare triple {70157#true} havoc ~__retres1~2; {70157#true} is VALID [2022-02-20 20:02:04,776 INFO L290 TraceCheckUtils]: 68: Hoare triple {70157#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {70223#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:02:04,776 INFO L290 TraceCheckUtils]: 69: Hoare triple {70223#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {70223#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:02:04,777 INFO L290 TraceCheckUtils]: 70: Hoare triple {70223#(= ~p_dw_st~0 0)} assume true; {70223#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:02:04,777 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {70223#(= ~p_dw_st~0 0)} {70199#(not (= ~p_dw_st~0 0))} #1970#return; {70158#false} is VALID [2022-02-20 20:02:04,778 INFO L290 TraceCheckUtils]: 72: Hoare triple {70158#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; {70158#false} is VALID [2022-02-20 20:02:04,778 INFO L290 TraceCheckUtils]: 73: Hoare triple {70158#false} assume 0 != eval1_~tmp___1~0#1; {70158#false} is VALID [2022-02-20 20:02:04,778 INFO L290 TraceCheckUtils]: 74: Hoare triple {70158#false} 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; {70158#false} is VALID [2022-02-20 20:02:04,778 INFO L290 TraceCheckUtils]: 75: Hoare triple {70158#false} 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; {70158#false} is VALID [2022-02-20 20:02:04,778 INFO L290 TraceCheckUtils]: 76: Hoare triple {70158#false} assume !(0 == ~p_dw_pc~0); {70158#false} is VALID [2022-02-20 20:02:04,778 INFO L290 TraceCheckUtils]: 77: Hoare triple {70158#false} assume 1 == ~p_dw_pc~0; {70158#false} is VALID [2022-02-20 20:02:04,778 INFO L290 TraceCheckUtils]: 78: Hoare triple {70158#false} assume !(0 == ~q_free~0); {70158#false} is VALID [2022-02-20 20:02:04,778 INFO L290 TraceCheckUtils]: 79: Hoare triple {70158#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; {70158#false} is VALID [2022-02-20 20:02:04,779 INFO L290 TraceCheckUtils]: 80: Hoare triple {70158#false} assume !false; {70158#false} is VALID [2022-02-20 20:02:04,779 INFO L290 TraceCheckUtils]: 81: Hoare triple {70158#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {70158#false} is VALID [2022-02-20 20:02:04,779 INFO L290 TraceCheckUtils]: 82: Hoare triple {70158#false} assume { :end_inline_do_write_p } true; {70158#false} is VALID [2022-02-20 20:02:04,779 INFO L290 TraceCheckUtils]: 83: Hoare triple {70158#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; {70158#false} is VALID [2022-02-20 20:02:04,779 INFO L290 TraceCheckUtils]: 84: Hoare triple {70158#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; {70158#false} is VALID [2022-02-20 20:02:04,779 INFO L290 TraceCheckUtils]: 85: Hoare triple {70158#false} assume !(0 == ~c_dr_pc~0); {70158#false} is VALID [2022-02-20 20:02:04,779 INFO L290 TraceCheckUtils]: 86: Hoare triple {70158#false} assume 2 == ~c_dr_pc~0; {70158#false} is VALID [2022-02-20 20:02:04,779 INFO L290 TraceCheckUtils]: 87: Hoare triple {70158#false} do_read_c_~a~0#1 := ~a_t~0; {70158#false} is VALID [2022-02-20 20:02:04,780 INFO L290 TraceCheckUtils]: 88: Hoare triple {70158#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; {70158#false} is VALID [2022-02-20 20:02:04,780 INFO L290 TraceCheckUtils]: 89: Hoare triple {70158#false} assume !(~p_last_write~0 == ~c_last_read~0); {70158#false} is VALID [2022-02-20 20:02:04,780 INFO L272 TraceCheckUtils]: 90: Hoare triple {70158#false} call error1(); {70158#false} is VALID [2022-02-20 20:02:04,780 INFO L290 TraceCheckUtils]: 91: Hoare triple {70158#false} assume !false; {70158#false} is VALID [2022-02-20 20:02:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 20:02:04,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:02:04,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962143890] [2022-02-20 20:02:04,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962143890] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:02:04,781 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:02:04,781 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:02:04,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852684069] [2022-02-20 20:02:04,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:02:04,782 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-02-20 20:02:04,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:02:04,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:02:04,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:02:04,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:02:04,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:02:04,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:02:04,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:02:04,839 INFO L87 Difference]: Start difference. First operand 2082 states and 2723 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)