./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 57a0d461468e871620bb6a0a3de7e8bdfa4741915d12326365887ea97e191d16 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:00:59,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:00:59,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:00:59,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:00:59,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:00:59,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:00:59,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:00:59,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:00:59,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:00:59,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:00:59,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:00:59,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:00:59,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:00:59,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:00:59,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:00:59,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:00:59,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:00:59,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:00:59,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:00:59,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:00:59,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:00:59,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:00:59,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:00:59,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:00:59,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:00:59,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:00:59,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:00:59,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:00:59,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:00:59,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:00:59,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:00:59,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:00:59,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:00:59,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:00:59,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:00:59,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:00:59,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:00:59,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:00:59,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:00:59,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:00:59,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:00:59,862 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:00:59,878 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:00:59,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:00:59,879 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:00:59,879 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:00:59,880 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:00:59,880 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:00:59,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:00:59,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:00:59,880 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:00:59,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:00:59,881 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:00:59,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:00:59,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:00:59,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:00:59,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:00:59,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:00:59,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:00:59,882 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:00:59,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:00:59,882 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:00:59,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:00:59,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:00:59,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:00:59,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:00:59,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:59,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:00:59,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:00:59,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:00:59,884 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:00:59,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:00:59,884 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:00:59,884 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:00:59,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:00:59,885 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 -> 57a0d461468e871620bb6a0a3de7e8bdfa4741915d12326365887ea97e191d16 [2022-02-20 20:01:00,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:01:00,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:01:00,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:01:00,116 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:01:00,118 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:01:00,119 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.12.cil-2.c [2022-02-20 20:01:00,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90ba3dbca/b2ea0bcb5fee4220812f9a1c61e36ddb/FLAG19f7f9d89 [2022-02-20 20:01:00,620 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:01:00,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c [2022-02-20 20:01:00,652 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90ba3dbca/b2ea0bcb5fee4220812f9a1c61e36ddb/FLAG19f7f9d89 [2022-02-20 20:01:01,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90ba3dbca/b2ea0bcb5fee4220812f9a1c61e36ddb [2022-02-20 20:01:01,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:01:01,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:01:01,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:01:01,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:01:01,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:01:01,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:01:01" (1/1) ... [2022-02-20 20:01:01,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a59c705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:01, skipping insertion in model container [2022-02-20 20:01:01,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:01:01" (1/1) ... [2022-02-20 20:01:01,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:01:01,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:01:01,355 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.12.cil-2.c[911,924] [2022-02-20 20:01:01,417 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.12.cil-2.c[8416,8429] [2022-02-20 20:01:01,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:01:01,510 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:01:01,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c[911,924] [2022-02-20 20:01:01,545 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.12.cil-2.c[8416,8429] [2022-02-20 20:01:01,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:01:01,629 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:01:01,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:01 WrapperNode [2022-02-20 20:01:01,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:01:01,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:01:01,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:01:01,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:01:01,637 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:01" (1/1) ... [2022-02-20 20:01:01,657 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:01" (1/1) ... [2022-02-20 20:01:01,731 INFO L137 Inliner]: procedures = 79, calls = 97, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 1078 [2022-02-20 20:01:01,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:01:01,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:01:01,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:01:01,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:01:01,739 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:01" (1/1) ... [2022-02-20 20:01:01,739 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:01" (1/1) ... [2022-02-20 20:01:01,743 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:01" (1/1) ... [2022-02-20 20:01:01,743 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:01" (1/1) ... [2022-02-20 20:01:01,759 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:01" (1/1) ... [2022-02-20 20:01:01,770 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:01" (1/1) ... [2022-02-20 20:01:01,781 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:01" (1/1) ... [2022-02-20 20:01:01,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:01:01,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:01:01,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:01:01,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:01:01,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:01" (1/1) ... [2022-02-20 20:01:01,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:01:01,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:01:01,824 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:01,840 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:01,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:01:01,872 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 20:01:01,873 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 20:01:01,873 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 20:01:01,873 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 20:01:01,874 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 20:01:01,875 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 20:01:01,875 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 20:01:01,875 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 20:01:01,875 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 20:01:01,875 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 20:01:01,875 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 20:01:01,875 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 20:01:01,875 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 20:01:01,876 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 20:01:01,876 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 20:01:01,876 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 20:01:01,876 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 20:01:01,876 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 20:01:01,876 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 20:01:01,876 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 20:01:01,876 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 20:01:01,876 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 20:01:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:01:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 20:01:01,877 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 20:01:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 20:01:01,877 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 20:01:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:01:01,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:01:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 20:01:01,878 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 20:01:02,042 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:01:02,044 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:01:02,864 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 20:01:02,865 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:02,920 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:01:02,935 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:01:02,936 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2022-02-20 20:01:02,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:01:02 BoogieIcfgContainer [2022-02-20 20:01:02,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:01:02,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:01:02,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:01:02,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:01:02,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:01:01" (1/3) ... [2022-02-20 20:01:02,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52900ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:01:02, skipping insertion in model container [2022-02-20 20:01:02,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:01:01" (2/3) ... [2022-02-20 20:01:02,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52900ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:01:02, skipping insertion in model container [2022-02-20 20:01:02,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:01:02" (3/3) ... [2022-02-20 20:01:02,945 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.12.cil-2.c [2022-02-20 20:01:02,950 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:01:02,950 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:01:02,987 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:01:02,994 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:02,994 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:01:03,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 499 states, 440 states have (on average 1.6386363636363637) internal successors, (721), 446 states have internal predecessors, (721), 42 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 20:01:03,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:01:03,053 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:03,053 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:03,054 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:03,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:03,057 INFO L85 PathProgramCache]: Analyzing trace with hash -50409674, now seen corresponding path program 1 times [2022-02-20 20:01:03,063 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:03,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363196997] [2022-02-20 20:01:03,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:03,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {542#(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); {502#true} is VALID [2022-02-20 20:01:03,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 20:01:03,321 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {502#true} {504#(= 1 ~c_dr_i~0)} #1945#return; {504#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:03,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {543#(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; {502#true} is VALID [2022-02-20 20:01:03,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {502#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {502#true} is VALID [2022-02-20 20:01:03,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 20:01:03,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {502#true} {503#false} #1947#return; {503#false} is VALID [2022-02-20 20:01:03,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {502#true} havoc ~__retres1~0; {502#true} is VALID [2022-02-20 20:01:03,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {502#true} assume 1 == ~p_dw_pc~0; {502#true} is VALID [2022-02-20 20:01:03,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {502#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {502#true} is VALID [2022-02-20 20:01:03,377 INFO L290 TraceCheckUtils]: 3: Hoare triple {502#true} #res := ~__retres1~0; {502#true} is VALID [2022-02-20 20:01:03,377 INFO L290 TraceCheckUtils]: 4: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 20:01:03,378 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {502#true} {502#true} #1941#return; {502#true} is VALID [2022-02-20 20:01:03,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:01:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {502#true} havoc ~__retres1~1; {502#true} is VALID [2022-02-20 20:01:03,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {502#true} assume 1 == ~c_dr_pc~0; {502#true} is VALID [2022-02-20 20:01:03,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {502#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {502#true} is VALID [2022-02-20 20:01:03,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {502#true} #res := ~__retres1~1; {502#true} is VALID [2022-02-20 20:01:03,384 INFO L290 TraceCheckUtils]: 4: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 20:01:03,384 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {502#true} {502#true} #1943#return; {502#true} is VALID [2022-02-20 20:01:03,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {544#(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; {502#true} is VALID [2022-02-20 20:01:03,385 INFO L272 TraceCheckUtils]: 1: Hoare triple {502#true} call #t~ret8 := is_do_write_p_triggered(); {502#true} is VALID [2022-02-20 20:01:03,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {502#true} havoc ~__retres1~0; {502#true} is VALID [2022-02-20 20:01:03,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {502#true} assume 1 == ~p_dw_pc~0; {502#true} is VALID [2022-02-20 20:01:03,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {502#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {502#true} is VALID [2022-02-20 20:01:03,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {502#true} #res := ~__retres1~0; {502#true} is VALID [2022-02-20 20:01:03,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 20:01:03,387 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {502#true} {502#true} #1941#return; {502#true} is VALID [2022-02-20 20:01:03,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {502#true} is VALID [2022-02-20 20:01:03,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {502#true} is VALID [2022-02-20 20:01:03,388 INFO L272 TraceCheckUtils]: 10: Hoare triple {502#true} call #t~ret9 := is_do_read_c_triggered(); {502#true} is VALID [2022-02-20 20:01:03,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#true} havoc ~__retres1~1; {502#true} is VALID [2022-02-20 20:01:03,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {502#true} assume 1 == ~c_dr_pc~0; {502#true} is VALID [2022-02-20 20:01:03,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {502#true} is VALID [2022-02-20 20:01:03,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {502#true} #res := ~__retres1~1; {502#true} is VALID [2022-02-20 20:01:03,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 20:01:03,389 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {502#true} {502#true} #1943#return; {502#true} is VALID [2022-02-20 20:01:03,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {502#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {502#true} is VALID [2022-02-20 20:01:03,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {502#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {502#true} is VALID [2022-02-20 20:01:03,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 20:01:03,391 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {502#true} {503#false} #1949#return; {503#false} is VALID [2022-02-20 20:01:03,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:01:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {543#(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; {502#true} is VALID [2022-02-20 20:01:03,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {502#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {502#true} is VALID [2022-02-20 20:01:03,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 20:01:03,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {502#true} {503#false} #1951#return; {503#false} is VALID [2022-02-20 20:01:03,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:01:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:03,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {502#true} havoc ~__retres1~2; {502#true} is VALID [2022-02-20 20:01:03,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {502#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {502#true} is VALID [2022-02-20 20:01:03,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {502#true} #res := ~__retres1~2; {502#true} is VALID [2022-02-20 20:01:03,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 20:01:03,411 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {502#true} {503#false} #1953#return; {503#false} is VALID [2022-02-20 20:01:03,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {502#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; {502#true} is VALID [2022-02-20 20:01:03,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {502#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {502#true} is VALID [2022-02-20 20:01:03,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {502#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {504#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:03,421 INFO L290 TraceCheckUtils]: 3: Hoare triple {504#(= 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; {504#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:03,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {504#(= 1 ~c_dr_i~0)} call update_channels1(); {542#(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:03,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#(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); {502#true} is VALID [2022-02-20 20:01:03,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 20:01:03,423 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {502#true} {504#(= 1 ~c_dr_i~0)} #1945#return; {504#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:03,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {504#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {504#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:03,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {504#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {504#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:03,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {504#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {503#false} is VALID [2022-02-20 20:01:03,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {503#false} assume { :end_inline_init_threads1 } true; {503#false} is VALID [2022-02-20 20:01:03,425 INFO L272 TraceCheckUtils]: 12: Hoare triple {503#false} call fire_delta_events1(); {543#(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:03,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {543#(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; {502#true} is VALID [2022-02-20 20:01:03,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {502#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {502#true} is VALID [2022-02-20 20:01:03,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 20:01:03,425 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {502#true} {503#false} #1947#return; {503#false} is VALID [2022-02-20 20:01:03,425 INFO L272 TraceCheckUtils]: 17: Hoare triple {503#false} call activate_threads1(); {544#(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:03,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {544#(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; {502#true} is VALID [2022-02-20 20:01:03,426 INFO L272 TraceCheckUtils]: 19: Hoare triple {502#true} call #t~ret8 := is_do_write_p_triggered(); {502#true} is VALID [2022-02-20 20:01:03,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {502#true} havoc ~__retres1~0; {502#true} is VALID [2022-02-20 20:01:03,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {502#true} assume 1 == ~p_dw_pc~0; {502#true} is VALID [2022-02-20 20:01:03,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {502#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {502#true} is VALID [2022-02-20 20:01:03,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {502#true} #res := ~__retres1~0; {502#true} is VALID [2022-02-20 20:01:03,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 20:01:03,427 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {502#true} {502#true} #1941#return; {502#true} is VALID [2022-02-20 20:01:03,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {502#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {502#true} is VALID [2022-02-20 20:01:03,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {502#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {502#true} is VALID [2022-02-20 20:01:03,428 INFO L272 TraceCheckUtils]: 28: Hoare triple {502#true} call #t~ret9 := is_do_read_c_triggered(); {502#true} is VALID [2022-02-20 20:01:03,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {502#true} havoc ~__retres1~1; {502#true} is VALID [2022-02-20 20:01:03,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {502#true} assume 1 == ~c_dr_pc~0; {502#true} is VALID [2022-02-20 20:01:03,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {502#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {502#true} is VALID [2022-02-20 20:01:03,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {502#true} #res := ~__retres1~1; {502#true} is VALID [2022-02-20 20:01:03,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 20:01:03,430 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {502#true} {502#true} #1943#return; {502#true} is VALID [2022-02-20 20:01:03,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {502#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {502#true} is VALID [2022-02-20 20:01:03,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {502#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {502#true} is VALID [2022-02-20 20:01:03,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 20:01:03,431 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {502#true} {503#false} #1949#return; {503#false} is VALID [2022-02-20 20:01:03,431 INFO L272 TraceCheckUtils]: 39: Hoare triple {503#false} call reset_delta_events1(); {543#(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:03,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {543#(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; {502#true} is VALID [2022-02-20 20:01:03,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {502#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {502#true} is VALID [2022-02-20 20:01:03,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 20:01:03,432 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {502#true} {503#false} #1951#return; {503#false} is VALID [2022-02-20 20:01:03,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {503#false} assume !false; {503#false} is VALID [2022-02-20 20:01:03,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {503#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; {503#false} is VALID [2022-02-20 20:01:03,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {503#false} assume !false; {503#false} is VALID [2022-02-20 20:01:03,433 INFO L272 TraceCheckUtils]: 47: Hoare triple {503#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {502#true} is VALID [2022-02-20 20:01:03,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {502#true} havoc ~__retres1~2; {502#true} is VALID [2022-02-20 20:01:03,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {502#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {502#true} is VALID [2022-02-20 20:01:03,434 INFO L290 TraceCheckUtils]: 50: Hoare triple {502#true} #res := ~__retres1~2; {502#true} is VALID [2022-02-20 20:01:03,435 INFO L290 TraceCheckUtils]: 51: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 20:01:03,436 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {502#true} {503#false} #1953#return; {503#false} is VALID [2022-02-20 20:01:03,436 INFO L290 TraceCheckUtils]: 53: Hoare triple {503#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; {503#false} is VALID [2022-02-20 20:01:03,436 INFO L290 TraceCheckUtils]: 54: Hoare triple {503#false} assume 0 != eval1_~tmp___1~0#1; {503#false} is VALID [2022-02-20 20:01:03,436 INFO L290 TraceCheckUtils]: 55: Hoare triple {503#false} assume !(0 == ~p_dw_st~0); {503#false} is VALID [2022-02-20 20:01:03,441 INFO L290 TraceCheckUtils]: 56: Hoare triple {503#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; {503#false} is VALID [2022-02-20 20:01:03,441 INFO L290 TraceCheckUtils]: 57: Hoare triple {503#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; {503#false} is VALID [2022-02-20 20:01:03,442 INFO L290 TraceCheckUtils]: 58: Hoare triple {503#false} assume !(0 == ~c_dr_pc~0); {503#false} is VALID [2022-02-20 20:01:03,442 INFO L290 TraceCheckUtils]: 59: Hoare triple {503#false} assume 2 == ~c_dr_pc~0; {503#false} is VALID [2022-02-20 20:01:03,443 INFO L290 TraceCheckUtils]: 60: Hoare triple {503#false} do_read_c_~a~0#1 := ~a_t~0; {503#false} is VALID [2022-02-20 20:01:03,443 INFO L290 TraceCheckUtils]: 61: Hoare triple {503#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; {503#false} is VALID [2022-02-20 20:01:03,443 INFO L290 TraceCheckUtils]: 62: Hoare triple {503#false} assume !(~p_last_write~0 == ~c_last_read~0); {503#false} is VALID [2022-02-20 20:01:03,445 INFO L272 TraceCheckUtils]: 63: Hoare triple {503#false} call error1(); {503#false} is VALID [2022-02-20 20:01:03,445 INFO L290 TraceCheckUtils]: 64: Hoare triple {503#false} assume !false; {503#false} is VALID [2022-02-20 20:01:03,452 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:03,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:03,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363196997] [2022-02-20 20:01:03,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363196997] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:03,453 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:03,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:01:03,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635248943] [2022-02-20 20:01:03,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:03,459 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:03,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:03,468 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:03,522 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:03,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:01:03,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:03,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:01:03,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:01:03,554 INFO L87 Difference]: Start difference. First operand has 499 states, 440 states have (on average 1.6386363636363637) internal successors, (721), 446 states have internal predecessors, (721), 42 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) 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:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:05,707 INFO L93 Difference]: Finished difference Result 988 states and 1590 transitions. [2022-02-20 20:01:05,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:01:05,708 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:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:05,709 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:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1590 transitions. [2022-02-20 20:01:05,732 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:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1590 transitions. [2022-02-20 20:01:05,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1590 transitions. [2022-02-20 20:01:06,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1590 edges. 1590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:06,915 INFO L225 Difference]: With dead ends: 988 [2022-02-20 20:01:06,915 INFO L226 Difference]: Without dead ends: 507 [2022-02-20 20:01:06,923 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:06,926 INFO L933 BasicCegarLoop]: 760 mSDtfsCounter, 1105 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:06,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1117 Valid, 1751 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 20:01:06,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-02-20 20:01:06,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 489. [2022-02-20 20:01:06,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:06,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 507 states. Second operand has 489 states, 432 states have (on average 1.5509259259259258) internal successors, (670), 436 states have internal predecessors, (670), 42 states have call successors, (42), 14 states have call predecessors, (42), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-02-20 20:01:06,992 INFO L74 IsIncluded]: Start isIncluded. First operand 507 states. Second operand has 489 states, 432 states have (on average 1.5509259259259258) internal successors, (670), 436 states have internal predecessors, (670), 42 states have call successors, (42), 14 states have call predecessors, (42), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-02-20 20:01:06,994 INFO L87 Difference]: Start difference. First operand 507 states. Second operand has 489 states, 432 states have (on average 1.5509259259259258) internal successors, (670), 436 states have internal predecessors, (670), 42 states have call successors, (42), 14 states have call predecessors, (42), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-02-20 20:01:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:07,017 INFO L93 Difference]: Finished difference Result 507 states and 781 transitions. [2022-02-20 20:01:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 781 transitions. [2022-02-20 20:01:07,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:07,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:07,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 489 states, 432 states have (on average 1.5509259259259258) internal successors, (670), 436 states have internal predecessors, (670), 42 states have call successors, (42), 14 states have call predecessors, (42), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 507 states. [2022-02-20 20:01:07,032 INFO L87 Difference]: Start difference. First operand has 489 states, 432 states have (on average 1.5509259259259258) internal successors, (670), 436 states have internal predecessors, (670), 42 states have call successors, (42), 14 states have call predecessors, (42), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 507 states. [2022-02-20 20:01:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:07,053 INFO L93 Difference]: Finished difference Result 507 states and 781 transitions. [2022-02-20 20:01:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 781 transitions. [2022-02-20 20:01:07,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:07,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:07,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:07,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 432 states have (on average 1.5509259259259258) internal successors, (670), 436 states have internal predecessors, (670), 42 states have call successors, (42), 14 states have call predecessors, (42), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-02-20 20:01:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 752 transitions. [2022-02-20 20:01:07,089 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 752 transitions. Word has length 65 [2022-02-20 20:01:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:07,089 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 752 transitions. [2022-02-20 20:01:07,090 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:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 752 transitions. [2022-02-20 20:01:07,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:01:07,091 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:07,091 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:07,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:01:07,092 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:07,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:07,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1437195084, now seen corresponding path program 1 times [2022-02-20 20:01:07,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:07,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324415420] [2022-02-20 20:01:07,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:07,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:07,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:07,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {3557#(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); {3558#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:07,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {3558#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {3558#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:07,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3558#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {3519#(= ~q_read_ev~0 2)} #1945#return; {3519#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:07,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:07,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {3559#(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; {3560#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:07,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {3560#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3560#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:07,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {3560#(= |old(~q_read_ev~0)| 0)} assume true; {3560#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:07,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3560#(= |old(~q_read_ev~0)| 0)} {3519#(= ~q_read_ev~0 2)} #1947#return; {3518#false} is VALID [2022-02-20 20:01:07,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:07,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:07,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {3517#true} havoc ~__retres1~0; {3517#true} is VALID [2022-02-20 20:01:07,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {3517#true} assume 1 == ~p_dw_pc~0; {3517#true} is VALID [2022-02-20 20:01:07,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {3517#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3517#true} is VALID [2022-02-20 20:01:07,256 INFO L290 TraceCheckUtils]: 3: Hoare triple {3517#true} #res := ~__retres1~0; {3517#true} is VALID [2022-02-20 20:01:07,256 INFO L290 TraceCheckUtils]: 4: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-02-20 20:01:07,256 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3517#true} {3517#true} #1941#return; {3517#true} is VALID [2022-02-20 20:01:07,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:01:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:07,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {3517#true} havoc ~__retres1~1; {3517#true} is VALID [2022-02-20 20:01:07,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {3517#true} assume 1 == ~c_dr_pc~0; {3517#true} is VALID [2022-02-20 20:01:07,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {3517#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3517#true} is VALID [2022-02-20 20:01:07,261 INFO L290 TraceCheckUtils]: 3: Hoare triple {3517#true} #res := ~__retres1~1; {3517#true} is VALID [2022-02-20 20:01:07,261 INFO L290 TraceCheckUtils]: 4: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-02-20 20:01:07,261 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3517#true} {3517#true} #1943#return; {3517#true} is VALID [2022-02-20 20:01:07,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {3561#(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; {3517#true} is VALID [2022-02-20 20:01:07,261 INFO L272 TraceCheckUtils]: 1: Hoare triple {3517#true} call #t~ret8 := is_do_write_p_triggered(); {3517#true} is VALID [2022-02-20 20:01:07,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {3517#true} havoc ~__retres1~0; {3517#true} is VALID [2022-02-20 20:01:07,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {3517#true} assume 1 == ~p_dw_pc~0; {3517#true} is VALID [2022-02-20 20:01:07,262 INFO L290 TraceCheckUtils]: 4: Hoare triple {3517#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3517#true} is VALID [2022-02-20 20:01:07,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {3517#true} #res := ~__retres1~0; {3517#true} is VALID [2022-02-20 20:01:07,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-02-20 20:01:07,262 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3517#true} {3517#true} #1941#return; {3517#true} is VALID [2022-02-20 20:01:07,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {3517#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3517#true} is VALID [2022-02-20 20:01:07,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {3517#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3517#true} is VALID [2022-02-20 20:01:07,263 INFO L272 TraceCheckUtils]: 10: Hoare triple {3517#true} call #t~ret9 := is_do_read_c_triggered(); {3517#true} is VALID [2022-02-20 20:01:07,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {3517#true} havoc ~__retres1~1; {3517#true} is VALID [2022-02-20 20:01:07,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {3517#true} assume 1 == ~c_dr_pc~0; {3517#true} is VALID [2022-02-20 20:01:07,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {3517#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3517#true} is VALID [2022-02-20 20:01:07,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {3517#true} #res := ~__retres1~1; {3517#true} is VALID [2022-02-20 20:01:07,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-02-20 20:01:07,264 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3517#true} {3517#true} #1943#return; {3517#true} is VALID [2022-02-20 20:01:07,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {3517#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3517#true} is VALID [2022-02-20 20:01:07,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {3517#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3517#true} is VALID [2022-02-20 20:01:07,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-02-20 20:01:07,264 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3517#true} {3518#false} #1949#return; {3518#false} is VALID [2022-02-20 20:01:07,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:01:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:07,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {3559#(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; {3517#true} is VALID [2022-02-20 20:01:07,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {3517#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3517#true} is VALID [2022-02-20 20:01:07,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-02-20 20:01:07,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3517#true} {3518#false} #1951#return; {3518#false} is VALID [2022-02-20 20:01:07,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:01:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:07,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {3517#true} havoc ~__retres1~2; {3517#true} is VALID [2022-02-20 20:01:07,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {3517#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3517#true} is VALID [2022-02-20 20:01:07,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {3517#true} #res := ~__retres1~2; {3517#true} is VALID [2022-02-20 20:01:07,276 INFO L290 TraceCheckUtils]: 3: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-02-20 20:01:07,276 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3517#true} {3518#false} #1953#return; {3518#false} is VALID [2022-02-20 20:01:07,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {3517#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; {3517#true} is VALID [2022-02-20 20:01:07,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {3517#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {3517#true} is VALID [2022-02-20 20:01:07,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {3517#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {3519#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:07,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {3519#(= ~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; {3519#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:07,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {3519#(= ~q_read_ev~0 2)} call update_channels1(); {3557#(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:07,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {3557#(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); {3558#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:07,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {3558#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {3558#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:07,280 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3558#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {3519#(= ~q_read_ev~0 2)} #1945#return; {3519#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:07,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {3519#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {3519#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:07,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {3519#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3519#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:07,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {3519#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3519#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:07,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {3519#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {3519#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:07,282 INFO L272 TraceCheckUtils]: 12: Hoare triple {3519#(= ~q_read_ev~0 2)} call fire_delta_events1(); {3559#(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:07,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {3559#(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; {3560#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:07,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {3560#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3560#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:07,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {3560#(= |old(~q_read_ev~0)| 0)} assume true; {3560#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:01:07,284 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3560#(= |old(~q_read_ev~0)| 0)} {3519#(= ~q_read_ev~0 2)} #1947#return; {3518#false} is VALID [2022-02-20 20:01:07,284 INFO L272 TraceCheckUtils]: 17: Hoare triple {3518#false} call activate_threads1(); {3561#(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:07,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {3561#(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; {3517#true} is VALID [2022-02-20 20:01:07,284 INFO L272 TraceCheckUtils]: 19: Hoare triple {3517#true} call #t~ret8 := is_do_write_p_triggered(); {3517#true} is VALID [2022-02-20 20:01:07,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {3517#true} havoc ~__retres1~0; {3517#true} is VALID [2022-02-20 20:01:07,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {3517#true} assume 1 == ~p_dw_pc~0; {3517#true} is VALID [2022-02-20 20:01:07,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {3517#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3517#true} is VALID [2022-02-20 20:01:07,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {3517#true} #res := ~__retres1~0; {3517#true} is VALID [2022-02-20 20:01:07,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-02-20 20:01:07,285 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3517#true} {3517#true} #1941#return; {3517#true} is VALID [2022-02-20 20:01:07,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {3517#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3517#true} is VALID [2022-02-20 20:01:07,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {3517#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3517#true} is VALID [2022-02-20 20:01:07,286 INFO L272 TraceCheckUtils]: 28: Hoare triple {3517#true} call #t~ret9 := is_do_read_c_triggered(); {3517#true} is VALID [2022-02-20 20:01:07,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {3517#true} havoc ~__retres1~1; {3517#true} is VALID [2022-02-20 20:01:07,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {3517#true} assume 1 == ~c_dr_pc~0; {3517#true} is VALID [2022-02-20 20:01:07,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {3517#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3517#true} is VALID [2022-02-20 20:01:07,286 INFO L290 TraceCheckUtils]: 32: Hoare triple {3517#true} #res := ~__retres1~1; {3517#true} is VALID [2022-02-20 20:01:07,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-02-20 20:01:07,289 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3517#true} {3517#true} #1943#return; {3517#true} is VALID [2022-02-20 20:01:07,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {3517#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3517#true} is VALID [2022-02-20 20:01:07,289 INFO L290 TraceCheckUtils]: 36: Hoare triple {3517#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3517#true} is VALID [2022-02-20 20:01:07,289 INFO L290 TraceCheckUtils]: 37: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-02-20 20:01:07,290 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3517#true} {3518#false} #1949#return; {3518#false} is VALID [2022-02-20 20:01:07,290 INFO L272 TraceCheckUtils]: 39: Hoare triple {3518#false} call reset_delta_events1(); {3559#(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:07,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {3559#(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; {3517#true} is VALID [2022-02-20 20:01:07,291 INFO L290 TraceCheckUtils]: 41: Hoare triple {3517#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3517#true} is VALID [2022-02-20 20:01:07,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-02-20 20:01:07,292 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3517#true} {3518#false} #1951#return; {3518#false} is VALID [2022-02-20 20:01:07,292 INFO L290 TraceCheckUtils]: 44: Hoare triple {3518#false} assume !false; {3518#false} is VALID [2022-02-20 20:01:07,292 INFO L290 TraceCheckUtils]: 45: Hoare triple {3518#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; {3518#false} is VALID [2022-02-20 20:01:07,292 INFO L290 TraceCheckUtils]: 46: Hoare triple {3518#false} assume !false; {3518#false} is VALID [2022-02-20 20:01:07,292 INFO L272 TraceCheckUtils]: 47: Hoare triple {3518#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3517#true} is VALID [2022-02-20 20:01:07,292 INFO L290 TraceCheckUtils]: 48: Hoare triple {3517#true} havoc ~__retres1~2; {3517#true} is VALID [2022-02-20 20:01:07,293 INFO L290 TraceCheckUtils]: 49: Hoare triple {3517#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3517#true} is VALID [2022-02-20 20:01:07,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {3517#true} #res := ~__retres1~2; {3517#true} is VALID [2022-02-20 20:01:07,295 INFO L290 TraceCheckUtils]: 51: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-02-20 20:01:07,295 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3517#true} {3518#false} #1953#return; {3518#false} is VALID [2022-02-20 20:01:07,295 INFO L290 TraceCheckUtils]: 53: Hoare triple {3518#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; {3518#false} is VALID [2022-02-20 20:01:07,295 INFO L290 TraceCheckUtils]: 54: Hoare triple {3518#false} assume 0 != eval1_~tmp___1~0#1; {3518#false} is VALID [2022-02-20 20:01:07,296 INFO L290 TraceCheckUtils]: 55: Hoare triple {3518#false} assume !(0 == ~p_dw_st~0); {3518#false} is VALID [2022-02-20 20:01:07,296 INFO L290 TraceCheckUtils]: 56: Hoare triple {3518#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; {3518#false} is VALID [2022-02-20 20:01:07,296 INFO L290 TraceCheckUtils]: 57: Hoare triple {3518#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; {3518#false} is VALID [2022-02-20 20:01:07,296 INFO L290 TraceCheckUtils]: 58: Hoare triple {3518#false} assume !(0 == ~c_dr_pc~0); {3518#false} is VALID [2022-02-20 20:01:07,296 INFO L290 TraceCheckUtils]: 59: Hoare triple {3518#false} assume 2 == ~c_dr_pc~0; {3518#false} is VALID [2022-02-20 20:01:07,296 INFO L290 TraceCheckUtils]: 60: Hoare triple {3518#false} do_read_c_~a~0#1 := ~a_t~0; {3518#false} is VALID [2022-02-20 20:01:07,297 INFO L290 TraceCheckUtils]: 61: Hoare triple {3518#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; {3518#false} is VALID [2022-02-20 20:01:07,297 INFO L290 TraceCheckUtils]: 62: Hoare triple {3518#false} assume !(~p_last_write~0 == ~c_last_read~0); {3518#false} is VALID [2022-02-20 20:01:07,297 INFO L272 TraceCheckUtils]: 63: Hoare triple {3518#false} call error1(); {3518#false} is VALID [2022-02-20 20:01:07,297 INFO L290 TraceCheckUtils]: 64: Hoare triple {3518#false} assume !false; {3518#false} is VALID [2022-02-20 20:01:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:01:07,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:07,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324415420] [2022-02-20 20:01:07,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324415420] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:07,299 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:07,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:01:07,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441620191] [2022-02-20 20:01:07,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:07,300 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:07,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:07,302 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:07,340 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:07,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:01:07,340 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:07,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:01:07,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:01:07,342 INFO L87 Difference]: Start difference. First operand 489 states and 752 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:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:10,571 INFO L93 Difference]: Finished difference Result 744 states and 1121 transitions. [2022-02-20 20:01:10,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:01:10,572 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:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:10,572 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:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1121 transitions. [2022-02-20 20:01:10,582 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:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1121 transitions. [2022-02-20 20:01:10,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1121 transitions. [2022-02-20 20:01:11,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1121 edges. 1121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:11,379 INFO L225 Difference]: With dead ends: 744 [2022-02-20 20:01:11,379 INFO L226 Difference]: Without dead ends: 640 [2022-02-20 20:01:11,382 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:11,385 INFO L933 BasicCegarLoop]: 758 mSDtfsCounter, 906 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:11,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [913 Valid, 2493 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:01:11,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2022-02-20 20:01:11,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 601. [2022-02-20 20:01:11,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:11,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 640 states. Second operand has 601 states, 522 states have (on average 1.524904214559387) internal successors, (796), 528 states have internal predecessors, (796), 55 states have call successors, (55), 21 states have call predecessors, (55), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2022-02-20 20:01:11,415 INFO L74 IsIncluded]: Start isIncluded. First operand 640 states. Second operand has 601 states, 522 states have (on average 1.524904214559387) internal successors, (796), 528 states have internal predecessors, (796), 55 states have call successors, (55), 21 states have call predecessors, (55), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2022-02-20 20:01:11,416 INFO L87 Difference]: Start difference. First operand 640 states. Second operand has 601 states, 522 states have (on average 1.524904214559387) internal successors, (796), 528 states have internal predecessors, (796), 55 states have call successors, (55), 21 states have call predecessors, (55), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2022-02-20 20:01:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:11,450 INFO L93 Difference]: Finished difference Result 640 states and 965 transitions. [2022-02-20 20:01:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 965 transitions. [2022-02-20 20:01:11,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:11,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:11,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 522 states have (on average 1.524904214559387) internal successors, (796), 528 states have internal predecessors, (796), 55 states have call successors, (55), 21 states have call predecessors, (55), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) Second operand 640 states. [2022-02-20 20:01:11,456 INFO L87 Difference]: Start difference. First operand has 601 states, 522 states have (on average 1.524904214559387) internal successors, (796), 528 states have internal predecessors, (796), 55 states have call successors, (55), 21 states have call predecessors, (55), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) Second operand 640 states. [2022-02-20 20:01:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:11,476 INFO L93 Difference]: Finished difference Result 640 states and 965 transitions. [2022-02-20 20:01:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 965 transitions. [2022-02-20 20:01:11,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:11,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:11,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:11,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 522 states have (on average 1.524904214559387) internal successors, (796), 528 states have internal predecessors, (796), 55 states have call successors, (55), 21 states have call predecessors, (55), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2022-02-20 20:01:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 909 transitions. [2022-02-20 20:01:11,500 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 909 transitions. Word has length 65 [2022-02-20 20:01:11,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:11,501 INFO L470 AbstractCegarLoop]: Abstraction has 601 states and 909 transitions. [2022-02-20 20:01:11,502 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:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 909 transitions. [2022-02-20 20:01:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:01:11,505 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:11,505 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:11,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:01:11,505 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:11,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:11,506 INFO L85 PathProgramCache]: Analyzing trace with hash 241693556, now seen corresponding path program 1 times [2022-02-20 20:01:11,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:11,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268766606] [2022-02-20 20:01:11,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:11,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {6692#(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); {6693#(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:11,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {6693#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {6693#(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:11,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6693#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {6654#(= ~q_write_ev~0 ~q_read_ev~0)} #1945#return; {6654#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:11,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {6693#(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); {6694#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:11,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {6694#(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; {6695#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:11,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {6695#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {6695#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:11,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6695#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {6654#(= ~q_write_ev~0 ~q_read_ev~0)} #1947#return; {6653#false} is VALID [2022-02-20 20:01:11,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {6652#true} havoc ~__retres1~0; {6652#true} is VALID [2022-02-20 20:01:11,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {6652#true} assume 1 == ~p_dw_pc~0; {6652#true} is VALID [2022-02-20 20:01:11,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {6652#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6652#true} is VALID [2022-02-20 20:01:11,613 INFO L290 TraceCheckUtils]: 3: Hoare triple {6652#true} #res := ~__retres1~0; {6652#true} is VALID [2022-02-20 20:01:11,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {6652#true} assume true; {6652#true} is VALID [2022-02-20 20:01:11,614 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6652#true} {6652#true} #1941#return; {6652#true} is VALID [2022-02-20 20:01:11,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:01:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {6652#true} havoc ~__retres1~1; {6652#true} is VALID [2022-02-20 20:01:11,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {6652#true} assume 1 == ~c_dr_pc~0; {6652#true} is VALID [2022-02-20 20:01:11,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {6652#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6652#true} is VALID [2022-02-20 20:01:11,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {6652#true} #res := ~__retres1~1; {6652#true} is VALID [2022-02-20 20:01:11,622 INFO L290 TraceCheckUtils]: 4: Hoare triple {6652#true} assume true; {6652#true} is VALID [2022-02-20 20:01:11,622 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6652#true} {6652#true} #1943#return; {6652#true} is VALID [2022-02-20 20:01:11,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {6696#(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; {6652#true} is VALID [2022-02-20 20:01:11,624 INFO L272 TraceCheckUtils]: 1: Hoare triple {6652#true} call #t~ret8 := is_do_write_p_triggered(); {6652#true} is VALID [2022-02-20 20:01:11,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {6652#true} havoc ~__retres1~0; {6652#true} is VALID [2022-02-20 20:01:11,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {6652#true} assume 1 == ~p_dw_pc~0; {6652#true} is VALID [2022-02-20 20:01:11,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {6652#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6652#true} is VALID [2022-02-20 20:01:11,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {6652#true} #res := ~__retres1~0; {6652#true} is VALID [2022-02-20 20:01:11,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {6652#true} assume true; {6652#true} is VALID [2022-02-20 20:01:11,625 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6652#true} {6652#true} #1941#return; {6652#true} is VALID [2022-02-20 20:01:11,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {6652#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6652#true} is VALID [2022-02-20 20:01:11,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {6652#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6652#true} is VALID [2022-02-20 20:01:11,627 INFO L272 TraceCheckUtils]: 10: Hoare triple {6652#true} call #t~ret9 := is_do_read_c_triggered(); {6652#true} is VALID [2022-02-20 20:01:11,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {6652#true} havoc ~__retres1~1; {6652#true} is VALID [2022-02-20 20:01:11,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {6652#true} assume 1 == ~c_dr_pc~0; {6652#true} is VALID [2022-02-20 20:01:11,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {6652#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6652#true} is VALID [2022-02-20 20:01:11,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {6652#true} #res := ~__retres1~1; {6652#true} is VALID [2022-02-20 20:01:11,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {6652#true} assume true; {6652#true} is VALID [2022-02-20 20:01:11,628 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6652#true} {6652#true} #1943#return; {6652#true} is VALID [2022-02-20 20:01:11,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {6652#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6652#true} is VALID [2022-02-20 20:01:11,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {6652#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6652#true} is VALID [2022-02-20 20:01:11,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {6652#true} assume true; {6652#true} is VALID [2022-02-20 20:01:11,628 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6652#true} {6653#false} #1949#return; {6653#false} is VALID [2022-02-20 20:01:11,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:01:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {6693#(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); {6652#true} is VALID [2022-02-20 20:01:11,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {6652#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6652#true} is VALID [2022-02-20 20:01:11,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {6652#true} assume true; {6652#true} is VALID [2022-02-20 20:01:11,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6652#true} {6653#false} #1951#return; {6653#false} is VALID [2022-02-20 20:01:11,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:01:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:11,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {6652#true} havoc ~__retres1~2; {6652#true} is VALID [2022-02-20 20:01:11,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {6652#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6652#true} is VALID [2022-02-20 20:01:11,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {6652#true} #res := ~__retres1~2; {6652#true} is VALID [2022-02-20 20:01:11,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {6652#true} assume true; {6652#true} is VALID [2022-02-20 20:01:11,642 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6652#true} {6653#false} #1953#return; {6653#false} is VALID [2022-02-20 20:01:11,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {6652#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; {6652#true} is VALID [2022-02-20 20:01:11,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {6652#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {6652#true} is VALID [2022-02-20 20:01:11,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {6652#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {6654#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:11,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {6654#(= ~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; {6654#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:11,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {6654#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {6692#(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:11,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {6692#(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); {6693#(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:11,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {6693#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {6693#(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:11,645 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6693#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {6654#(= ~q_write_ev~0 ~q_read_ev~0)} #1945#return; {6654#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:11,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {6654#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {6654#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:11,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {6654#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {6654#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:11,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {6654#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {6654#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:11,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {6654#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {6654#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:11,647 INFO L272 TraceCheckUtils]: 12: Hoare triple {6654#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {6693#(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:11,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {6693#(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); {6694#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:11,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {6694#(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; {6695#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:11,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {6695#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {6695#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:11,648 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6695#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {6654#(= ~q_write_ev~0 ~q_read_ev~0)} #1947#return; {6653#false} is VALID [2022-02-20 20:01:11,648 INFO L272 TraceCheckUtils]: 17: Hoare triple {6653#false} call activate_threads1(); {6696#(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:11,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {6696#(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; {6652#true} is VALID [2022-02-20 20:01:11,648 INFO L272 TraceCheckUtils]: 19: Hoare triple {6652#true} call #t~ret8 := is_do_write_p_triggered(); {6652#true} is VALID [2022-02-20 20:01:11,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {6652#true} havoc ~__retres1~0; {6652#true} is VALID [2022-02-20 20:01:11,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {6652#true} assume 1 == ~p_dw_pc~0; {6652#true} is VALID [2022-02-20 20:01:11,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {6652#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6652#true} is VALID [2022-02-20 20:01:11,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {6652#true} #res := ~__retres1~0; {6652#true} is VALID [2022-02-20 20:01:11,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {6652#true} assume true; {6652#true} is VALID [2022-02-20 20:01:11,649 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6652#true} {6652#true} #1941#return; {6652#true} is VALID [2022-02-20 20:01:11,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {6652#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6652#true} is VALID [2022-02-20 20:01:11,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {6652#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6652#true} is VALID [2022-02-20 20:01:11,650 INFO L272 TraceCheckUtils]: 28: Hoare triple {6652#true} call #t~ret9 := is_do_read_c_triggered(); {6652#true} is VALID [2022-02-20 20:01:11,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {6652#true} havoc ~__retres1~1; {6652#true} is VALID [2022-02-20 20:01:11,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {6652#true} assume 1 == ~c_dr_pc~0; {6652#true} is VALID [2022-02-20 20:01:11,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {6652#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6652#true} is VALID [2022-02-20 20:01:11,650 INFO L290 TraceCheckUtils]: 32: Hoare triple {6652#true} #res := ~__retres1~1; {6652#true} is VALID [2022-02-20 20:01:11,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {6652#true} assume true; {6652#true} is VALID [2022-02-20 20:01:11,650 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6652#true} {6652#true} #1943#return; {6652#true} is VALID [2022-02-20 20:01:11,651 INFO L290 TraceCheckUtils]: 35: Hoare triple {6652#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6652#true} is VALID [2022-02-20 20:01:11,651 INFO L290 TraceCheckUtils]: 36: Hoare triple {6652#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6652#true} is VALID [2022-02-20 20:01:11,651 INFO L290 TraceCheckUtils]: 37: Hoare triple {6652#true} assume true; {6652#true} is VALID [2022-02-20 20:01:11,651 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6652#true} {6653#false} #1949#return; {6653#false} is VALID [2022-02-20 20:01:11,651 INFO L272 TraceCheckUtils]: 39: Hoare triple {6653#false} call reset_delta_events1(); {6693#(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:11,651 INFO L290 TraceCheckUtils]: 40: Hoare triple {6693#(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); {6652#true} is VALID [2022-02-20 20:01:11,651 INFO L290 TraceCheckUtils]: 41: Hoare triple {6652#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6652#true} is VALID [2022-02-20 20:01:11,651 INFO L290 TraceCheckUtils]: 42: Hoare triple {6652#true} assume true; {6652#true} is VALID [2022-02-20 20:01:11,651 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6652#true} {6653#false} #1951#return; {6653#false} is VALID [2022-02-20 20:01:11,651 INFO L290 TraceCheckUtils]: 44: Hoare triple {6653#false} assume !false; {6653#false} is VALID [2022-02-20 20:01:11,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {6653#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; {6653#false} is VALID [2022-02-20 20:01:11,651 INFO L290 TraceCheckUtils]: 46: Hoare triple {6653#false} assume !false; {6653#false} is VALID [2022-02-20 20:01:11,651 INFO L272 TraceCheckUtils]: 47: Hoare triple {6653#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {6652#true} is VALID [2022-02-20 20:01:11,651 INFO L290 TraceCheckUtils]: 48: Hoare triple {6652#true} havoc ~__retres1~2; {6652#true} is VALID [2022-02-20 20:01:11,656 INFO L290 TraceCheckUtils]: 49: Hoare triple {6652#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6652#true} is VALID [2022-02-20 20:01:11,656 INFO L290 TraceCheckUtils]: 50: Hoare triple {6652#true} #res := ~__retres1~2; {6652#true} is VALID [2022-02-20 20:01:11,656 INFO L290 TraceCheckUtils]: 51: Hoare triple {6652#true} assume true; {6652#true} is VALID [2022-02-20 20:01:11,656 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6652#true} {6653#false} #1953#return; {6653#false} is VALID [2022-02-20 20:01:11,656 INFO L290 TraceCheckUtils]: 53: Hoare triple {6653#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; {6653#false} is VALID [2022-02-20 20:01:11,656 INFO L290 TraceCheckUtils]: 54: Hoare triple {6653#false} assume 0 != eval1_~tmp___1~0#1; {6653#false} is VALID [2022-02-20 20:01:11,656 INFO L290 TraceCheckUtils]: 55: Hoare triple {6653#false} assume !(0 == ~p_dw_st~0); {6653#false} is VALID [2022-02-20 20:01:11,657 INFO L290 TraceCheckUtils]: 56: Hoare triple {6653#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; {6653#false} is VALID [2022-02-20 20:01:11,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {6653#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; {6653#false} is VALID [2022-02-20 20:01:11,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {6653#false} assume !(0 == ~c_dr_pc~0); {6653#false} is VALID [2022-02-20 20:01:11,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {6653#false} assume 2 == ~c_dr_pc~0; {6653#false} is VALID [2022-02-20 20:01:11,657 INFO L290 TraceCheckUtils]: 60: Hoare triple {6653#false} do_read_c_~a~0#1 := ~a_t~0; {6653#false} is VALID [2022-02-20 20:01:11,657 INFO L290 TraceCheckUtils]: 61: Hoare triple {6653#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; {6653#false} is VALID [2022-02-20 20:01:11,657 INFO L290 TraceCheckUtils]: 62: Hoare triple {6653#false} assume !(~p_last_write~0 == ~c_last_read~0); {6653#false} is VALID [2022-02-20 20:01:11,657 INFO L272 TraceCheckUtils]: 63: Hoare triple {6653#false} call error1(); {6653#false} is VALID [2022-02-20 20:01:11,657 INFO L290 TraceCheckUtils]: 64: Hoare triple {6653#false} assume !false; {6653#false} is VALID [2022-02-20 20:01:11,657 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:11,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:11,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268766606] [2022-02-20 20:01:11,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268766606] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:11,658 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:11,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:01:11,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972087624] [2022-02-20 20:01:11,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:11,658 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:11,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:11,659 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:11,693 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:11,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:01:11,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:11,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:01:11,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:01:11,694 INFO L87 Difference]: Start difference. First operand 601 states and 909 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:15,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:15,605 INFO L93 Difference]: Finished difference Result 998 states and 1474 transitions. [2022-02-20 20:01:15,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 20:01:15,605 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:15,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:15,606 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:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1151 transitions. [2022-02-20 20:01:15,624 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:15,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1151 transitions. [2022-02-20 20:01:15,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1151 transitions. [2022-02-20 20:01:16,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1151 edges. 1151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:16,508 INFO L225 Difference]: With dead ends: 998 [2022-02-20 20:01:16,508 INFO L226 Difference]: Without dead ends: 789 [2022-02-20 20:01:16,511 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:16,514 INFO L933 BasicCegarLoop]: 829 mSDtfsCounter, 1468 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:16,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1500 Valid, 2890 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 20:01:16,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-02-20 20:01:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 713. [2022-02-20 20:01:16,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:16,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 789 states. Second operand has 713 states, 612 states have (on average 1.5049019607843137) internal successors, (921), 620 states have internal predecessors, (921), 68 states have call successors, (68), 28 states have call predecessors, (68), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2022-02-20 20:01:16,552 INFO L74 IsIncluded]: Start isIncluded. First operand 789 states. Second operand has 713 states, 612 states have (on average 1.5049019607843137) internal successors, (921), 620 states have internal predecessors, (921), 68 states have call successors, (68), 28 states have call predecessors, (68), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2022-02-20 20:01:16,553 INFO L87 Difference]: Start difference. First operand 789 states. Second operand has 713 states, 612 states have (on average 1.5049019607843137) internal successors, (921), 620 states have internal predecessors, (921), 68 states have call successors, (68), 28 states have call predecessors, (68), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2022-02-20 20:01:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:16,582 INFO L93 Difference]: Finished difference Result 789 states and 1182 transitions. [2022-02-20 20:01:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1182 transitions. [2022-02-20 20:01:16,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:16,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:16,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 713 states, 612 states have (on average 1.5049019607843137) internal successors, (921), 620 states have internal predecessors, (921), 68 states have call successors, (68), 28 states have call predecessors, (68), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) Second operand 789 states. [2022-02-20 20:01:16,586 INFO L87 Difference]: Start difference. First operand has 713 states, 612 states have (on average 1.5049019607843137) internal successors, (921), 620 states have internal predecessors, (921), 68 states have call successors, (68), 28 states have call predecessors, (68), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) Second operand 789 states. [2022-02-20 20:01:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:16,615 INFO L93 Difference]: Finished difference Result 789 states and 1182 transitions. [2022-02-20 20:01:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1182 transitions. [2022-02-20 20:01:16,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:16,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:16,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:16,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 612 states have (on average 1.5049019607843137) internal successors, (921), 620 states have internal predecessors, (921), 68 states have call successors, (68), 28 states have call predecessors, (68), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2022-02-20 20:01:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1068 transitions. [2022-02-20 20:01:16,647 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1068 transitions. Word has length 65 [2022-02-20 20:01:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:16,648 INFO L470 AbstractCegarLoop]: Abstraction has 713 states and 1068 transitions. [2022-02-20 20:01:16,648 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:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1068 transitions. [2022-02-20 20:01:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:01:16,651 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:16,651 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:16,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:01:16,652 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:16,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:16,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1786892554, now seen corresponding path program 1 times [2022-02-20 20:01:16,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:16,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619304367] [2022-02-20 20:01:16,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:16,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:16,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:16,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {10621#(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); {10622#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:16,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {10622#(not (= |old(~q_req_up~0)| 1))} assume true; {10622#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:16,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10622#(not (= |old(~q_req_up~0)| 1))} {10582#(= ~q_req_up~0 ~p_dw_pc~0)} #1945#return; {10586#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:16,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:16,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {10623#(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); {10579#true} is VALID [2022-02-20 20:01:16,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {10579#true} assume !(0 == ~q_write_ev~0); {10579#true} is VALID [2022-02-20 20:01:16,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {10579#true} assume true; {10579#true} is VALID [2022-02-20 20:01:16,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10579#true} {10586#(not (= ~p_dw_pc~0 1))} #1947#return; {10586#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:16,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:16,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:16,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {10579#true} havoc ~__retres1~0; {10579#true} is VALID [2022-02-20 20:01:16,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {10579#true} assume 1 == ~p_dw_pc~0; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,759 INFO L290 TraceCheckUtils]: 3: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,760 INFO L290 TraceCheckUtils]: 4: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,760 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} {10579#true} #1941#return; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:01:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:16,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {10579#true} havoc ~__retres1~1; {10579#true} is VALID [2022-02-20 20:01:16,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {10579#true} assume 1 == ~c_dr_pc~0; {10579#true} is VALID [2022-02-20 20:01:16,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {10579#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {10579#true} is VALID [2022-02-20 20:01:16,764 INFO L290 TraceCheckUtils]: 3: Hoare triple {10579#true} #res := ~__retres1~1; {10579#true} is VALID [2022-02-20 20:01:16,765 INFO L290 TraceCheckUtils]: 4: Hoare triple {10579#true} assume true; {10579#true} is VALID [2022-02-20 20:01:16,765 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10579#true} {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} #1943#return; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {10624#(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; {10579#true} is VALID [2022-02-20 20:01:16,765 INFO L272 TraceCheckUtils]: 1: Hoare triple {10579#true} call #t~ret8 := is_do_write_p_triggered(); {10579#true} is VALID [2022-02-20 20:01:16,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {10579#true} havoc ~__retres1~0; {10579#true} is VALID [2022-02-20 20:01:16,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {10579#true} assume 1 == ~p_dw_pc~0; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,767 INFO L290 TraceCheckUtils]: 4: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,771 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} {10579#true} #1941#return; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,774 INFO L272 TraceCheckUtils]: 10: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {10579#true} is VALID [2022-02-20 20:01:16,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {10579#true} havoc ~__retres1~1; {10579#true} is VALID [2022-02-20 20:01:16,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {10579#true} assume 1 == ~c_dr_pc~0; {10579#true} is VALID [2022-02-20 20:01:16,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {10579#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {10579#true} is VALID [2022-02-20 20:01:16,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {10579#true} #res := ~__retres1~1; {10579#true} is VALID [2022-02-20 20:01:16,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {10579#true} assume true; {10579#true} is VALID [2022-02-20 20:01:16,776 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10579#true} {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} #1943#return; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,777 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} {10586#(not (= ~p_dw_pc~0 1))} #1949#return; {10580#false} is VALID [2022-02-20 20:01:16,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:01:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:16,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {10623#(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); {10579#true} is VALID [2022-02-20 20:01:16,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {10579#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10579#true} is VALID [2022-02-20 20:01:16,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {10579#true} assume true; {10579#true} is VALID [2022-02-20 20:01:16,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10579#true} {10580#false} #1951#return; {10580#false} is VALID [2022-02-20 20:01:16,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:01:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:16,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {10579#true} havoc ~__retres1~2; {10579#true} is VALID [2022-02-20 20:01:16,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {10579#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10579#true} is VALID [2022-02-20 20:01:16,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {10579#true} #res := ~__retres1~2; {10579#true} is VALID [2022-02-20 20:01:16,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {10579#true} assume true; {10579#true} is VALID [2022-02-20 20:01:16,792 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10579#true} {10580#false} #1953#return; {10580#false} is VALID [2022-02-20 20:01:16,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {10579#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; {10581#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:16,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {10581#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {10581#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:16,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {10581#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {10582#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:01:16,794 INFO L290 TraceCheckUtils]: 3: Hoare triple {10582#(= ~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; {10582#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:01:16,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {10582#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {10621#(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:16,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {10621#(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); {10622#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:16,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {10622#(not (= |old(~q_req_up~0)| 1))} assume true; {10622#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:16,796 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10622#(not (= |old(~q_req_up~0)| 1))} {10582#(= ~q_req_up~0 ~p_dw_pc~0)} #1945#return; {10586#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:16,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {10586#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {10586#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:16,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {10586#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10586#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:16,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {10586#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10586#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:16,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {10586#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {10586#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:16,797 INFO L272 TraceCheckUtils]: 12: Hoare triple {10586#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {10623#(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:16,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {10623#(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); {10579#true} is VALID [2022-02-20 20:01:16,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {10579#true} assume !(0 == ~q_write_ev~0); {10579#true} is VALID [2022-02-20 20:01:16,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {10579#true} assume true; {10579#true} is VALID [2022-02-20 20:01:16,798 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10579#true} {10586#(not (= ~p_dw_pc~0 1))} #1947#return; {10586#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:01:16,798 INFO L272 TraceCheckUtils]: 17: Hoare triple {10586#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {10624#(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:16,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {10624#(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; {10579#true} is VALID [2022-02-20 20:01:16,799 INFO L272 TraceCheckUtils]: 19: Hoare triple {10579#true} call #t~ret8 := is_do_write_p_triggered(); {10579#true} is VALID [2022-02-20 20:01:16,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {10579#true} havoc ~__retres1~0; {10579#true} is VALID [2022-02-20 20:01:16,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {10579#true} assume 1 == ~p_dw_pc~0; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,800 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} {10579#true} #1941#return; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,801 INFO L272 TraceCheckUtils]: 28: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {10579#true} is VALID [2022-02-20 20:01:16,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {10579#true} havoc ~__retres1~1; {10579#true} is VALID [2022-02-20 20:01:16,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {10579#true} assume 1 == ~c_dr_pc~0; {10579#true} is VALID [2022-02-20 20:01:16,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {10579#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {10579#true} is VALID [2022-02-20 20:01:16,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {10579#true} #res := ~__retres1~1; {10579#true} is VALID [2022-02-20 20:01:16,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {10579#true} assume true; {10579#true} is VALID [2022-02-20 20:01:16,802 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10579#true} {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} #1943#return; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:01:16,804 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10631#(= (+ (- 1) ~p_dw_pc~0) 0)} {10586#(not (= ~p_dw_pc~0 1))} #1949#return; {10580#false} is VALID [2022-02-20 20:01:16,804 INFO L272 TraceCheckUtils]: 39: Hoare triple {10580#false} call reset_delta_events1(); {10623#(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:16,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {10623#(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); {10579#true} is VALID [2022-02-20 20:01:16,804 INFO L290 TraceCheckUtils]: 41: Hoare triple {10579#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10579#true} is VALID [2022-02-20 20:01:16,804 INFO L290 TraceCheckUtils]: 42: Hoare triple {10579#true} assume true; {10579#true} is VALID [2022-02-20 20:01:16,804 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10579#true} {10580#false} #1951#return; {10580#false} is VALID [2022-02-20 20:01:16,805 INFO L290 TraceCheckUtils]: 44: Hoare triple {10580#false} assume !false; {10580#false} is VALID [2022-02-20 20:01:16,805 INFO L290 TraceCheckUtils]: 45: Hoare triple {10580#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; {10580#false} is VALID [2022-02-20 20:01:16,805 INFO L290 TraceCheckUtils]: 46: Hoare triple {10580#false} assume !false; {10580#false} is VALID [2022-02-20 20:01:16,805 INFO L272 TraceCheckUtils]: 47: Hoare triple {10580#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10579#true} is VALID [2022-02-20 20:01:16,805 INFO L290 TraceCheckUtils]: 48: Hoare triple {10579#true} havoc ~__retres1~2; {10579#true} is VALID [2022-02-20 20:01:16,805 INFO L290 TraceCheckUtils]: 49: Hoare triple {10579#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10579#true} is VALID [2022-02-20 20:01:16,805 INFO L290 TraceCheckUtils]: 50: Hoare triple {10579#true} #res := ~__retres1~2; {10579#true} is VALID [2022-02-20 20:01:16,805 INFO L290 TraceCheckUtils]: 51: Hoare triple {10579#true} assume true; {10579#true} is VALID [2022-02-20 20:01:16,806 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10579#true} {10580#false} #1953#return; {10580#false} is VALID [2022-02-20 20:01:16,806 INFO L290 TraceCheckUtils]: 53: Hoare triple {10580#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; {10580#false} is VALID [2022-02-20 20:01:16,806 INFO L290 TraceCheckUtils]: 54: Hoare triple {10580#false} assume 0 != eval1_~tmp___1~0#1; {10580#false} is VALID [2022-02-20 20:01:16,806 INFO L290 TraceCheckUtils]: 55: Hoare triple {10580#false} assume !(0 == ~p_dw_st~0); {10580#false} is VALID [2022-02-20 20:01:16,806 INFO L290 TraceCheckUtils]: 56: Hoare triple {10580#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; {10580#false} is VALID [2022-02-20 20:01:16,806 INFO L290 TraceCheckUtils]: 57: Hoare triple {10580#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; {10580#false} is VALID [2022-02-20 20:01:16,806 INFO L290 TraceCheckUtils]: 58: Hoare triple {10580#false} assume !(0 == ~c_dr_pc~0); {10580#false} is VALID [2022-02-20 20:01:16,806 INFO L290 TraceCheckUtils]: 59: Hoare triple {10580#false} assume 2 == ~c_dr_pc~0; {10580#false} is VALID [2022-02-20 20:01:16,807 INFO L290 TraceCheckUtils]: 60: Hoare triple {10580#false} do_read_c_~a~0#1 := ~a_t~0; {10580#false} is VALID [2022-02-20 20:01:16,807 INFO L290 TraceCheckUtils]: 61: Hoare triple {10580#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; {10580#false} is VALID [2022-02-20 20:01:16,807 INFO L290 TraceCheckUtils]: 62: Hoare triple {10580#false} assume !(~p_last_write~0 == ~c_last_read~0); {10580#false} is VALID [2022-02-20 20:01:16,807 INFO L272 TraceCheckUtils]: 63: Hoare triple {10580#false} call error1(); {10580#false} is VALID [2022-02-20 20:01:16,807 INFO L290 TraceCheckUtils]: 64: Hoare triple {10580#false} assume !false; {10580#false} is VALID [2022-02-20 20:01:16,809 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:16,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:16,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619304367] [2022-02-20 20:01:16,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619304367] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:16,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:16,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:01:16,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675704217] [2022-02-20 20:01:16,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:16,811 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:16,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:16,811 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:16,844 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:16,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:01:16,845 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:16,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:01:16,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:01:16,846 INFO L87 Difference]: Start difference. First operand 713 states and 1068 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:23,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:23,202 INFO L93 Difference]: Finished difference Result 2259 states and 3265 transitions. [2022-02-20 20:01:23,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:01:23,202 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:23,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:23,204 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:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1556 transitions. [2022-02-20 20:01:23,216 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:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1556 transitions. [2022-02-20 20:01:23,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1556 transitions. [2022-02-20 20:01:24,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1556 edges. 1556 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:24,529 INFO L225 Difference]: With dead ends: 2259 [2022-02-20 20:01:24,529 INFO L226 Difference]: Without dead ends: 1926 [2022-02-20 20:01:24,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:01:24,531 INFO L933 BasicCegarLoop]: 879 mSDtfsCounter, 4332 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 759 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4350 SdHoareTripleChecker+Valid, 2808 SdHoareTripleChecker+Invalid, 2529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 759 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:24,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4350 Valid, 2808 Invalid, 2529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [759 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 20:01:24,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2022-02-20 20:01:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1766. [2022-02-20 20:01:24,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:24,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1926 states. Second operand has 1766 states, 1460 states have (on average 1.4157534246575343) internal successors, (2067), 1483 states have internal predecessors, (2067), 178 states have call successors, (178), 111 states have call predecessors, (178), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2022-02-20 20:01:24,602 INFO L74 IsIncluded]: Start isIncluded. First operand 1926 states. Second operand has 1766 states, 1460 states have (on average 1.4157534246575343) internal successors, (2067), 1483 states have internal predecessors, (2067), 178 states have call successors, (178), 111 states have call predecessors, (178), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2022-02-20 20:01:24,605 INFO L87 Difference]: Start difference. First operand 1926 states. Second operand has 1766 states, 1460 states have (on average 1.4157534246575343) internal successors, (2067), 1483 states have internal predecessors, (2067), 178 states have call successors, (178), 111 states have call predecessors, (178), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2022-02-20 20:01:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:24,746 INFO L93 Difference]: Finished difference Result 1926 states and 2669 transitions. [2022-02-20 20:01:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2669 transitions. [2022-02-20 20:01:24,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:24,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:24,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 1766 states, 1460 states have (on average 1.4157534246575343) internal successors, (2067), 1483 states have internal predecessors, (2067), 178 states have call successors, (178), 111 states have call predecessors, (178), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) Second operand 1926 states. [2022-02-20 20:01:24,756 INFO L87 Difference]: Start difference. First operand has 1766 states, 1460 states have (on average 1.4157534246575343) internal successors, (2067), 1483 states have internal predecessors, (2067), 178 states have call successors, (178), 111 states have call predecessors, (178), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) Second operand 1926 states. [2022-02-20 20:01:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:24,879 INFO L93 Difference]: Finished difference Result 1926 states and 2669 transitions. [2022-02-20 20:01:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2669 transitions. [2022-02-20 20:01:24,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:24,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:24,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:24,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1460 states have (on average 1.4157534246575343) internal successors, (2067), 1483 states have internal predecessors, (2067), 178 states have call successors, (178), 111 states have call predecessors, (178), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2022-02-20 20:01:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2457 transitions. [2022-02-20 20:01:25,040 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2457 transitions. Word has length 65 [2022-02-20 20:01:25,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:25,041 INFO L470 AbstractCegarLoop]: Abstraction has 1766 states and 2457 transitions. [2022-02-20 20:01:25,041 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:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2457 transitions. [2022-02-20 20:01:25,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:01:25,044 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:25,044 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:25,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:01:25,044 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:25,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash -666149630, now seen corresponding path program 1 times [2022-02-20 20:01:25,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:25,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217348943] [2022-02-20 20:01:25,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:25,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {19989#(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); {19949#true} is VALID [2022-02-20 20:01:25,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {19949#true} assume true; {19949#true} is VALID [2022-02-20 20:01:25,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19949#true} {19949#true} #1945#return; {19949#true} is VALID [2022-02-20 20:01:25,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {19990#(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); {19949#true} is VALID [2022-02-20 20:01:25,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {19949#true} assume !(0 == ~q_write_ev~0); {19949#true} is VALID [2022-02-20 20:01:25,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {19949#true} assume true; {19949#true} is VALID [2022-02-20 20:01:25,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19949#true} {19949#true} #1947#return; {19949#true} is VALID [2022-02-20 20:01:25,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {19949#true} havoc ~__retres1~0; {19949#true} is VALID [2022-02-20 20:01:25,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {19949#true} assume !(1 == ~p_dw_pc~0); {19949#true} is VALID [2022-02-20 20:01:25,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {19949#true} assume !(2 == ~p_dw_pc~0); {19949#true} is VALID [2022-02-20 20:01:25,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {19949#true} ~__retres1~0 := 0; {20007#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:01:25,169 INFO L290 TraceCheckUtils]: 4: Hoare triple {20007#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {20008#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:25,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {20008#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {20008#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:25,170 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {20008#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {19949#true} #1941#return; {19999#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:01:25,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {19949#true} havoc ~__retres1~1; {19949#true} is VALID [2022-02-20 20:01:25,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {19949#true} assume 1 == ~c_dr_pc~0; {19949#true} is VALID [2022-02-20 20:01:25,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {19949#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {19949#true} is VALID [2022-02-20 20:01:25,188 INFO L290 TraceCheckUtils]: 3: Hoare triple {19949#true} #res := ~__retres1~1; {19949#true} is VALID [2022-02-20 20:01:25,188 INFO L290 TraceCheckUtils]: 4: Hoare triple {19949#true} assume true; {19949#true} is VALID [2022-02-20 20:01:25,188 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19949#true} {19950#false} #1943#return; {19950#false} is VALID [2022-02-20 20:01:25,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {19991#(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; {19949#true} is VALID [2022-02-20 20:01:25,188 INFO L272 TraceCheckUtils]: 1: Hoare triple {19949#true} call #t~ret8 := is_do_write_p_triggered(); {19949#true} is VALID [2022-02-20 20:01:25,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {19949#true} havoc ~__retres1~0; {19949#true} is VALID [2022-02-20 20:01:25,188 INFO L290 TraceCheckUtils]: 3: Hoare triple {19949#true} assume !(1 == ~p_dw_pc~0); {19949#true} is VALID [2022-02-20 20:01:25,188 INFO L290 TraceCheckUtils]: 4: Hoare triple {19949#true} assume !(2 == ~p_dw_pc~0); {19949#true} is VALID [2022-02-20 20:01:25,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {19949#true} ~__retres1~0 := 0; {20007#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:01:25,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {20007#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {20008#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:25,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {20008#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {20008#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:25,190 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {20008#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {19949#true} #1941#return; {19999#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:01:25,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {19999#(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; {20000#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:01:25,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {20000#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {19950#false} is VALID [2022-02-20 20:01:25,192 INFO L272 TraceCheckUtils]: 11: Hoare triple {19950#false} call #t~ret9 := is_do_read_c_triggered(); {19949#true} is VALID [2022-02-20 20:01:25,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {19949#true} havoc ~__retres1~1; {19949#true} is VALID [2022-02-20 20:01:25,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {19949#true} assume 1 == ~c_dr_pc~0; {19949#true} is VALID [2022-02-20 20:01:25,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {19949#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {19949#true} is VALID [2022-02-20 20:01:25,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {19949#true} #res := ~__retres1~1; {19949#true} is VALID [2022-02-20 20:01:25,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {19949#true} assume true; {19949#true} is VALID [2022-02-20 20:01:25,192 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19949#true} {19950#false} #1943#return; {19950#false} is VALID [2022-02-20 20:01:25,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {19950#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {19950#false} is VALID [2022-02-20 20:01:25,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {19950#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19950#false} is VALID [2022-02-20 20:01:25,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {19950#false} assume true; {19950#false} is VALID [2022-02-20 20:01:25,192 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {19950#false} {19949#true} #1949#return; {19950#false} is VALID [2022-02-20 20:01:25,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:01:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {19990#(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); {19949#true} is VALID [2022-02-20 20:01:25,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {19949#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19949#true} is VALID [2022-02-20 20:01:25,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {19949#true} assume true; {19949#true} is VALID [2022-02-20 20:01:25,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19949#true} {19950#false} #1951#return; {19950#false} is VALID [2022-02-20 20:01:25,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:01:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {19949#true} havoc ~__retres1~2; {19949#true} is VALID [2022-02-20 20:01:25,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {19949#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19949#true} is VALID [2022-02-20 20:01:25,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {19949#true} #res := ~__retres1~2; {19949#true} is VALID [2022-02-20 20:01:25,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {19949#true} assume true; {19949#true} is VALID [2022-02-20 20:01:25,201 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19949#true} {19950#false} #1953#return; {19950#false} is VALID [2022-02-20 20:01:25,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {19949#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; {19949#true} is VALID [2022-02-20 20:01:25,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {19949#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {19949#true} is VALID [2022-02-20 20:01:25,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {19949#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {19949#true} is VALID [2022-02-20 20:01:25,202 INFO L290 TraceCheckUtils]: 3: Hoare triple {19949#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; {19949#true} is VALID [2022-02-20 20:01:25,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {19949#true} call update_channels1(); {19989#(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:25,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {19989#(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); {19949#true} is VALID [2022-02-20 20:01:25,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {19949#true} assume true; {19949#true} is VALID [2022-02-20 20:01:25,202 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19949#true} {19949#true} #1945#return; {19949#true} is VALID [2022-02-20 20:01:25,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {19949#true} assume { :begin_inline_init_threads1 } true; {19949#true} is VALID [2022-02-20 20:01:25,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {19949#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {19949#true} is VALID [2022-02-20 20:01:25,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {19949#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {19949#true} is VALID [2022-02-20 20:01:25,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {19949#true} assume { :end_inline_init_threads1 } true; {19949#true} is VALID [2022-02-20 20:01:25,203 INFO L272 TraceCheckUtils]: 12: Hoare triple {19949#true} call fire_delta_events1(); {19990#(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:25,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {19990#(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); {19949#true} is VALID [2022-02-20 20:01:25,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {19949#true} assume !(0 == ~q_write_ev~0); {19949#true} is VALID [2022-02-20 20:01:25,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {19949#true} assume true; {19949#true} is VALID [2022-02-20 20:01:25,203 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19949#true} {19949#true} #1947#return; {19949#true} is VALID [2022-02-20 20:01:25,204 INFO L272 TraceCheckUtils]: 17: Hoare triple {19949#true} call activate_threads1(); {19991#(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:25,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {19991#(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; {19949#true} is VALID [2022-02-20 20:01:25,204 INFO L272 TraceCheckUtils]: 19: Hoare triple {19949#true} call #t~ret8 := is_do_write_p_triggered(); {19949#true} is VALID [2022-02-20 20:01:25,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {19949#true} havoc ~__retres1~0; {19949#true} is VALID [2022-02-20 20:01:25,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {19949#true} assume !(1 == ~p_dw_pc~0); {19949#true} is VALID [2022-02-20 20:01:25,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {19949#true} assume !(2 == ~p_dw_pc~0); {19949#true} is VALID [2022-02-20 20:01:25,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {19949#true} ~__retres1~0 := 0; {20007#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:01:25,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {20007#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {20008#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:25,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {20008#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {20008#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:01:25,205 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20008#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {19949#true} #1941#return; {19999#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:01:25,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {19999#(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; {20000#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:01:25,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {20000#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {19950#false} is VALID [2022-02-20 20:01:25,206 INFO L272 TraceCheckUtils]: 29: Hoare triple {19950#false} call #t~ret9 := is_do_read_c_triggered(); {19949#true} is VALID [2022-02-20 20:01:25,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {19949#true} havoc ~__retres1~1; {19949#true} is VALID [2022-02-20 20:01:25,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {19949#true} assume 1 == ~c_dr_pc~0; {19949#true} is VALID [2022-02-20 20:01:25,206 INFO L290 TraceCheckUtils]: 32: Hoare triple {19949#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {19949#true} is VALID [2022-02-20 20:01:25,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {19949#true} #res := ~__retres1~1; {19949#true} is VALID [2022-02-20 20:01:25,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {19949#true} assume true; {19949#true} is VALID [2022-02-20 20:01:25,207 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {19949#true} {19950#false} #1943#return; {19950#false} is VALID [2022-02-20 20:01:25,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {19950#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {19950#false} is VALID [2022-02-20 20:01:25,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {19950#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19950#false} is VALID [2022-02-20 20:01:25,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {19950#false} assume true; {19950#false} is VALID [2022-02-20 20:01:25,207 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {19950#false} {19949#true} #1949#return; {19950#false} is VALID [2022-02-20 20:01:25,207 INFO L272 TraceCheckUtils]: 40: Hoare triple {19950#false} call reset_delta_events1(); {19990#(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:25,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {19990#(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); {19949#true} is VALID [2022-02-20 20:01:25,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {19949#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19949#true} is VALID [2022-02-20 20:01:25,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {19949#true} assume true; {19949#true} is VALID [2022-02-20 20:01:25,207 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19949#true} {19950#false} #1951#return; {19950#false} is VALID [2022-02-20 20:01:25,207 INFO L290 TraceCheckUtils]: 45: Hoare triple {19950#false} assume !false; {19950#false} is VALID [2022-02-20 20:01:25,207 INFO L290 TraceCheckUtils]: 46: Hoare triple {19950#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; {19950#false} is VALID [2022-02-20 20:01:25,207 INFO L290 TraceCheckUtils]: 47: Hoare triple {19950#false} assume !false; {19950#false} is VALID [2022-02-20 20:01:25,207 INFO L272 TraceCheckUtils]: 48: Hoare triple {19950#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {19949#true} is VALID [2022-02-20 20:01:25,208 INFO L290 TraceCheckUtils]: 49: Hoare triple {19949#true} havoc ~__retres1~2; {19949#true} is VALID [2022-02-20 20:01:25,208 INFO L290 TraceCheckUtils]: 50: Hoare triple {19949#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19949#true} is VALID [2022-02-20 20:01:25,208 INFO L290 TraceCheckUtils]: 51: Hoare triple {19949#true} #res := ~__retres1~2; {19949#true} is VALID [2022-02-20 20:01:25,208 INFO L290 TraceCheckUtils]: 52: Hoare triple {19949#true} assume true; {19949#true} is VALID [2022-02-20 20:01:25,208 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {19949#true} {19950#false} #1953#return; {19950#false} is VALID [2022-02-20 20:01:25,208 INFO L290 TraceCheckUtils]: 54: Hoare triple {19950#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; {19950#false} is VALID [2022-02-20 20:01:25,208 INFO L290 TraceCheckUtils]: 55: Hoare triple {19950#false} assume 0 != eval1_~tmp___1~0#1; {19950#false} is VALID [2022-02-20 20:01:25,208 INFO L290 TraceCheckUtils]: 56: Hoare triple {19950#false} assume !(0 == ~p_dw_st~0); {19950#false} is VALID [2022-02-20 20:01:25,208 INFO L290 TraceCheckUtils]: 57: Hoare triple {19950#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; {19950#false} is VALID [2022-02-20 20:01:25,208 INFO L290 TraceCheckUtils]: 58: Hoare triple {19950#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; {19950#false} is VALID [2022-02-20 20:01:25,208 INFO L290 TraceCheckUtils]: 59: Hoare triple {19950#false} assume !(0 == ~c_dr_pc~0); {19950#false} is VALID [2022-02-20 20:01:25,208 INFO L290 TraceCheckUtils]: 60: Hoare triple {19950#false} assume 2 == ~c_dr_pc~0; {19950#false} is VALID [2022-02-20 20:01:25,208 INFO L290 TraceCheckUtils]: 61: Hoare triple {19950#false} do_read_c_~a~0#1 := ~a_t~0; {19950#false} is VALID [2022-02-20 20:01:25,208 INFO L290 TraceCheckUtils]: 62: Hoare triple {19950#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; {19950#false} is VALID [2022-02-20 20:01:25,208 INFO L290 TraceCheckUtils]: 63: Hoare triple {19950#false} assume !(~p_last_write~0 == ~c_last_read~0); {19950#false} is VALID [2022-02-20 20:01:25,208 INFO L272 TraceCheckUtils]: 64: Hoare triple {19950#false} call error1(); {19950#false} is VALID [2022-02-20 20:01:25,209 INFO L290 TraceCheckUtils]: 65: Hoare triple {19950#false} assume !false; {19950#false} is VALID [2022-02-20 20:01:25,209 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:25,210 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:25,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217348943] [2022-02-20 20:01:25,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217348943] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:25,211 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:25,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:25,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154760942] [2022-02-20 20:01:25,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:25,211 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:25,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:25,212 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:25,246 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:25,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:25,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:25,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:25,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:25,248 INFO L87 Difference]: Start difference. First operand 1766 states and 2457 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:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:29,577 INFO L93 Difference]: Finished difference Result 3294 states and 4536 transitions. [2022-02-20 20:01:29,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:01:29,578 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:29,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:29,578 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:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 933 transitions. [2022-02-20 20:01:29,585 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:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 933 transitions. [2022-02-20 20:01:29,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 933 transitions. [2022-02-20 20:01:30,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 933 edges. 933 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:30,415 INFO L225 Difference]: With dead ends: 3294 [2022-02-20 20:01:30,415 INFO L226 Difference]: Without dead ends: 1914 [2022-02-20 20:01:30,418 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:30,419 INFO L933 BasicCegarLoop]: 740 mSDtfsCounter, 992 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:30,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [993 Valid, 2939 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1678 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 20:01:30,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2022-02-20 20:01:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1806. [2022-02-20 20:01:30,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:30,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1914 states. Second operand has 1806 states, 1492 states have (on average 1.4028150134048258) internal successors, (2093), 1515 states have internal predecessors, (2093), 178 states have call successors, (178), 111 states have call predecessors, (178), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2022-02-20 20:01:30,508 INFO L74 IsIncluded]: Start isIncluded. First operand 1914 states. Second operand has 1806 states, 1492 states have (on average 1.4028150134048258) internal successors, (2093), 1515 states have internal predecessors, (2093), 178 states have call successors, (178), 111 states have call predecessors, (178), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2022-02-20 20:01:30,512 INFO L87 Difference]: Start difference. First operand 1914 states. Second operand has 1806 states, 1492 states have (on average 1.4028150134048258) internal successors, (2093), 1515 states have internal predecessors, (2093), 178 states have call successors, (178), 111 states have call predecessors, (178), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2022-02-20 20:01:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:30,636 INFO L93 Difference]: Finished difference Result 1914 states and 2645 transitions. [2022-02-20 20:01:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2645 transitions. [2022-02-20 20:01:30,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:30,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:30,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 1806 states, 1492 states have (on average 1.4028150134048258) internal successors, (2093), 1515 states have internal predecessors, (2093), 178 states have call successors, (178), 111 states have call predecessors, (178), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) Second operand 1914 states. [2022-02-20 20:01:30,647 INFO L87 Difference]: Start difference. First operand has 1806 states, 1492 states have (on average 1.4028150134048258) internal successors, (2093), 1515 states have internal predecessors, (2093), 178 states have call successors, (178), 111 states have call predecessors, (178), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) Second operand 1914 states. [2022-02-20 20:01:30,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:30,792 INFO L93 Difference]: Finished difference Result 1914 states and 2645 transitions. [2022-02-20 20:01:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2645 transitions. [2022-02-20 20:01:30,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:30,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:30,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:30,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1492 states have (on average 1.4028150134048258) internal successors, (2093), 1515 states have internal predecessors, (2093), 178 states have call successors, (178), 111 states have call predecessors, (178), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2022-02-20 20:01:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2491 transitions. [2022-02-20 20:01:30,962 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2491 transitions. Word has length 66 [2022-02-20 20:01:30,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:30,963 INFO L470 AbstractCegarLoop]: Abstraction has 1806 states and 2491 transitions. [2022-02-20 20:01:30,964 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:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2491 transitions. [2022-02-20 20:01:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:01:30,964 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:30,965 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:30,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:01:30,965 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:30,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1695508928, now seen corresponding path program 1 times [2022-02-20 20:01:30,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:30,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025647155] [2022-02-20 20:01:30,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:30,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {30713#(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); {30714#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:31,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {30714#(not (= |old(~q_req_up~0)| 1))} assume true; {30714#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:31,019 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30714#(not (= |old(~q_req_up~0)| 1))} {30673#(= ~c_dr_pc~0 ~q_req_up~0)} #1945#return; {30677#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:31,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {30715#(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); {30670#true} is VALID [2022-02-20 20:01:31,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {30670#true} assume !(0 == ~q_write_ev~0); {30670#true} is VALID [2022-02-20 20:01:31,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {30670#true} assume true; {30670#true} is VALID [2022-02-20 20:01:31,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30670#true} {30677#(not (= ~c_dr_pc~0 1))} #1947#return; {30677#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:31,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {30670#true} havoc ~__retres1~0; {30670#true} is VALID [2022-02-20 20:01:31,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {30670#true} assume !(1 == ~p_dw_pc~0); {30670#true} is VALID [2022-02-20 20:01:31,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {30670#true} assume !(2 == ~p_dw_pc~0); {30670#true} is VALID [2022-02-20 20:01:31,057 INFO L290 TraceCheckUtils]: 3: Hoare triple {30670#true} ~__retres1~0 := 0; {30670#true} is VALID [2022-02-20 20:01:31,057 INFO L290 TraceCheckUtils]: 4: Hoare triple {30670#true} #res := ~__retres1~0; {30670#true} is VALID [2022-02-20 20:01:31,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {30670#true} assume true; {30670#true} is VALID [2022-02-20 20:01:31,058 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {30670#true} {30670#true} #1941#return; {30670#true} is VALID [2022-02-20 20:01:31,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {30670#true} havoc ~__retres1~1; {30670#true} is VALID [2022-02-20 20:01:31,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {30670#true} assume 1 == ~c_dr_pc~0; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,065 INFO L290 TraceCheckUtils]: 3: Hoare triple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,065 INFO L290 TraceCheckUtils]: 4: Hoare triple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,065 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} {30670#true} #1943#return; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {30716#(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; {30670#true} is VALID [2022-02-20 20:01:31,065 INFO L272 TraceCheckUtils]: 1: Hoare triple {30670#true} call #t~ret8 := is_do_write_p_triggered(); {30670#true} is VALID [2022-02-20 20:01:31,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {30670#true} havoc ~__retres1~0; {30670#true} is VALID [2022-02-20 20:01:31,066 INFO L290 TraceCheckUtils]: 3: Hoare triple {30670#true} assume !(1 == ~p_dw_pc~0); {30670#true} is VALID [2022-02-20 20:01:31,066 INFO L290 TraceCheckUtils]: 4: Hoare triple {30670#true} assume !(2 == ~p_dw_pc~0); {30670#true} is VALID [2022-02-20 20:01:31,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {30670#true} ~__retres1~0 := 0; {30670#true} is VALID [2022-02-20 20:01:31,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {30670#true} #res := ~__retres1~0; {30670#true} is VALID [2022-02-20 20:01:31,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {30670#true} assume true; {30670#true} is VALID [2022-02-20 20:01:31,066 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {30670#true} {30670#true} #1941#return; {30670#true} is VALID [2022-02-20 20:01:31,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {30670#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30670#true} is VALID [2022-02-20 20:01:31,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {30670#true} assume !(0 != ~tmp~1); {30670#true} is VALID [2022-02-20 20:01:31,067 INFO L272 TraceCheckUtils]: 11: Hoare triple {30670#true} call #t~ret9 := is_do_read_c_triggered(); {30670#true} is VALID [2022-02-20 20:01:31,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {30670#true} havoc ~__retres1~1; {30670#true} is VALID [2022-02-20 20:01:31,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {30670#true} assume 1 == ~c_dr_pc~0; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,069 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} {30670#true} #1943#return; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,070 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} {30677#(not (= ~c_dr_pc~0 1))} #1949#return; {30671#false} is VALID [2022-02-20 20:01:31,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:01:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {30715#(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); {30670#true} is VALID [2022-02-20 20:01:31,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {30670#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {30670#true} is VALID [2022-02-20 20:01:31,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {30670#true} assume true; {30670#true} is VALID [2022-02-20 20:01:31,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30670#true} {30671#false} #1951#return; {30671#false} is VALID [2022-02-20 20:01:31,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:01:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {30670#true} havoc ~__retres1~2; {30670#true} is VALID [2022-02-20 20:01:31,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {30670#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30670#true} is VALID [2022-02-20 20:01:31,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {30670#true} #res := ~__retres1~2; {30670#true} is VALID [2022-02-20 20:01:31,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {30670#true} assume true; {30670#true} is VALID [2022-02-20 20:01:31,084 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30670#true} {30671#false} #1953#return; {30671#false} is VALID [2022-02-20 20:01:31,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {30670#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; {30672#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:31,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {30672#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {30672#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:31,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {30672#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {30673#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:01:31,086 INFO L290 TraceCheckUtils]: 3: Hoare triple {30673#(= ~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; {30673#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:01:31,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {30673#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {30713#(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:31,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {30713#(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); {30714#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:31,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {30714#(not (= |old(~q_req_up~0)| 1))} assume true; {30714#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:31,087 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30714#(not (= |old(~q_req_up~0)| 1))} {30673#(= ~c_dr_pc~0 ~q_req_up~0)} #1945#return; {30677#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:31,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {30677#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {30677#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:31,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {30677#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {30677#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:31,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {30677#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {30677#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:31,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {30677#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {30677#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:31,089 INFO L272 TraceCheckUtils]: 12: Hoare triple {30677#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {30715#(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:31,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {30715#(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); {30670#true} is VALID [2022-02-20 20:01:31,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {30670#true} assume !(0 == ~q_write_ev~0); {30670#true} is VALID [2022-02-20 20:01:31,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {30670#true} assume true; {30670#true} is VALID [2022-02-20 20:01:31,090 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30670#true} {30677#(not (= ~c_dr_pc~0 1))} #1947#return; {30677#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:31,090 INFO L272 TraceCheckUtils]: 17: Hoare triple {30677#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {30716#(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:31,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {30716#(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; {30670#true} is VALID [2022-02-20 20:01:31,090 INFO L272 TraceCheckUtils]: 19: Hoare triple {30670#true} call #t~ret8 := is_do_write_p_triggered(); {30670#true} is VALID [2022-02-20 20:01:31,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {30670#true} havoc ~__retres1~0; {30670#true} is VALID [2022-02-20 20:01:31,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {30670#true} assume !(1 == ~p_dw_pc~0); {30670#true} is VALID [2022-02-20 20:01:31,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {30670#true} assume !(2 == ~p_dw_pc~0); {30670#true} is VALID [2022-02-20 20:01:31,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {30670#true} ~__retres1~0 := 0; {30670#true} is VALID [2022-02-20 20:01:31,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {30670#true} #res := ~__retres1~0; {30670#true} is VALID [2022-02-20 20:01:31,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {30670#true} assume true; {30670#true} is VALID [2022-02-20 20:01:31,091 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {30670#true} {30670#true} #1941#return; {30670#true} is VALID [2022-02-20 20:01:31,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {30670#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30670#true} is VALID [2022-02-20 20:01:31,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {30670#true} assume !(0 != ~tmp~1); {30670#true} is VALID [2022-02-20 20:01:31,092 INFO L272 TraceCheckUtils]: 29: Hoare triple {30670#true} call #t~ret9 := is_do_read_c_triggered(); {30670#true} is VALID [2022-02-20 20:01:31,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {30670#true} havoc ~__retres1~1; {30670#true} is VALID [2022-02-20 20:01:31,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {30670#true} assume 1 == ~c_dr_pc~0; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,093 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} {30670#true} #1943#return; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,094 INFO L290 TraceCheckUtils]: 37: Hoare triple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,094 INFO L290 TraceCheckUtils]: 38: Hoare triple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:31,095 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {30730#(= (+ (- 1) ~c_dr_pc~0) 0)} {30677#(not (= ~c_dr_pc~0 1))} #1949#return; {30671#false} is VALID [2022-02-20 20:01:31,095 INFO L272 TraceCheckUtils]: 40: Hoare triple {30671#false} call reset_delta_events1(); {30715#(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:31,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {30715#(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); {30670#true} is VALID [2022-02-20 20:01:31,095 INFO L290 TraceCheckUtils]: 42: Hoare triple {30670#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {30670#true} is VALID [2022-02-20 20:01:31,095 INFO L290 TraceCheckUtils]: 43: Hoare triple {30670#true} assume true; {30670#true} is VALID [2022-02-20 20:01:31,095 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {30670#true} {30671#false} #1951#return; {30671#false} is VALID [2022-02-20 20:01:31,095 INFO L290 TraceCheckUtils]: 45: Hoare triple {30671#false} assume !false; {30671#false} is VALID [2022-02-20 20:01:31,095 INFO L290 TraceCheckUtils]: 46: Hoare triple {30671#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; {30671#false} is VALID [2022-02-20 20:01:31,096 INFO L290 TraceCheckUtils]: 47: Hoare triple {30671#false} assume !false; {30671#false} is VALID [2022-02-20 20:01:31,096 INFO L272 TraceCheckUtils]: 48: Hoare triple {30671#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {30670#true} is VALID [2022-02-20 20:01:31,096 INFO L290 TraceCheckUtils]: 49: Hoare triple {30670#true} havoc ~__retres1~2; {30670#true} is VALID [2022-02-20 20:01:31,096 INFO L290 TraceCheckUtils]: 50: Hoare triple {30670#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30670#true} is VALID [2022-02-20 20:01:31,096 INFO L290 TraceCheckUtils]: 51: Hoare triple {30670#true} #res := ~__retres1~2; {30670#true} is VALID [2022-02-20 20:01:31,096 INFO L290 TraceCheckUtils]: 52: Hoare triple {30670#true} assume true; {30670#true} is VALID [2022-02-20 20:01:31,096 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {30670#true} {30671#false} #1953#return; {30671#false} is VALID [2022-02-20 20:01:31,096 INFO L290 TraceCheckUtils]: 54: Hoare triple {30671#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; {30671#false} is VALID [2022-02-20 20:01:31,097 INFO L290 TraceCheckUtils]: 55: Hoare triple {30671#false} assume 0 != eval1_~tmp___1~0#1; {30671#false} is VALID [2022-02-20 20:01:31,097 INFO L290 TraceCheckUtils]: 56: Hoare triple {30671#false} assume !(0 == ~p_dw_st~0); {30671#false} is VALID [2022-02-20 20:01:31,097 INFO L290 TraceCheckUtils]: 57: Hoare triple {30671#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; {30671#false} is VALID [2022-02-20 20:01:31,097 INFO L290 TraceCheckUtils]: 58: Hoare triple {30671#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; {30671#false} is VALID [2022-02-20 20:01:31,097 INFO L290 TraceCheckUtils]: 59: Hoare triple {30671#false} assume !(0 == ~c_dr_pc~0); {30671#false} is VALID [2022-02-20 20:01:31,097 INFO L290 TraceCheckUtils]: 60: Hoare triple {30671#false} assume 2 == ~c_dr_pc~0; {30671#false} is VALID [2022-02-20 20:01:31,097 INFO L290 TraceCheckUtils]: 61: Hoare triple {30671#false} do_read_c_~a~0#1 := ~a_t~0; {30671#false} is VALID [2022-02-20 20:01:31,097 INFO L290 TraceCheckUtils]: 62: Hoare triple {30671#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; {30671#false} is VALID [2022-02-20 20:01:31,098 INFO L290 TraceCheckUtils]: 63: Hoare triple {30671#false} assume !(~p_last_write~0 == ~c_last_read~0); {30671#false} is VALID [2022-02-20 20:01:31,098 INFO L272 TraceCheckUtils]: 64: Hoare triple {30671#false} call error1(); {30671#false} is VALID [2022-02-20 20:01:31,098 INFO L290 TraceCheckUtils]: 65: Hoare triple {30671#false} assume !false; {30671#false} is VALID [2022-02-20 20:01:31,098 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:31,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:31,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025647155] [2022-02-20 20:01:31,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025647155] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:31,099 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:31,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:01:31,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414507403] [2022-02-20 20:01:31,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:31,100 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:31,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:31,100 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:31,134 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:31,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:01:31,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:31,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:01:31,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:01:31,135 INFO L87 Difference]: Start difference. First operand 1806 states and 2491 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:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:38,588 INFO L93 Difference]: Finished difference Result 5378 states and 7365 transitions. [2022-02-20 20:01:38,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:01:38,588 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:38,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:38,589 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:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1546 transitions. [2022-02-20 20:01:38,599 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:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1546 transitions. [2022-02-20 20:01:38,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1546 transitions. [2022-02-20 20:01:39,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1546 edges. 1546 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:39,946 INFO L225 Difference]: With dead ends: 5378 [2022-02-20 20:01:39,946 INFO L226 Difference]: Without dead ends: 2197 [2022-02-20 20:01:39,952 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:39,954 INFO L933 BasicCegarLoop]: 876 mSDtfsCounter, 4380 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4398 SdHoareTripleChecker+Valid, 2850 SdHoareTripleChecker+Invalid, 2497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:39,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4398 Valid, 2850 Invalid, 2497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 20:01:39,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2022-02-20 20:01:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 2017. [2022-02-20 20:01:40,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:40,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2197 states. Second operand has 2017 states, 1631 states have (on average 1.3605150214592274) internal successors, (2219), 1656 states have internal predecessors, (2219), 218 states have call successors, (218), 139 states have call predecessors, (218), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) [2022-02-20 20:01:40,061 INFO L74 IsIncluded]: Start isIncluded. First operand 2197 states. Second operand has 2017 states, 1631 states have (on average 1.3605150214592274) internal successors, (2219), 1656 states have internal predecessors, (2219), 218 states have call successors, (218), 139 states have call predecessors, (218), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) [2022-02-20 20:01:40,063 INFO L87 Difference]: Start difference. First operand 2197 states. Second operand has 2017 states, 1631 states have (on average 1.3605150214592274) internal successors, (2219), 1656 states have internal predecessors, (2219), 218 states have call successors, (218), 139 states have call predecessors, (218), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) [2022-02-20 20:01:40,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:40,259 INFO L93 Difference]: Finished difference Result 2197 states and 2934 transitions. [2022-02-20 20:01:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2197 states and 2934 transitions. [2022-02-20 20:01:40,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:40,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:40,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 2017 states, 1631 states have (on average 1.3605150214592274) internal successors, (2219), 1656 states have internal predecessors, (2219), 218 states have call successors, (218), 139 states have call predecessors, (218), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) Second operand 2197 states. [2022-02-20 20:01:40,270 INFO L87 Difference]: Start difference. First operand has 2017 states, 1631 states have (on average 1.3605150214592274) internal successors, (2219), 1656 states have internal predecessors, (2219), 218 states have call successors, (218), 139 states have call predecessors, (218), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) Second operand 2197 states. [2022-02-20 20:01:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:40,441 INFO L93 Difference]: Finished difference Result 2197 states and 2934 transitions. [2022-02-20 20:01:40,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2197 states and 2934 transitions. [2022-02-20 20:01:40,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:40,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:40,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:40,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1631 states have (on average 1.3605150214592274) internal successors, (2219), 1656 states have internal predecessors, (2219), 218 states have call successors, (218), 139 states have call predecessors, (218), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) [2022-02-20 20:01:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2703 transitions. [2022-02-20 20:01:40,630 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2703 transitions. Word has length 66 [2022-02-20 20:01:40,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:40,630 INFO L470 AbstractCegarLoop]: Abstraction has 2017 states and 2703 transitions. [2022-02-20 20:01:40,630 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:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2703 transitions. [2022-02-20 20:01:40,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:40,631 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:40,631 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:40,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:01:40,632 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:40,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:40,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2019341431, now seen corresponding path program 1 times [2022-02-20 20:01:40,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:40,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328462768] [2022-02-20 20:01:40,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:40,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:40,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:40,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {45162#(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); {45116#true} is VALID [2022-02-20 20:01:40,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {45116#true} assume true; {45116#true} is VALID [2022-02-20 20:01:40,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45116#true} {45116#true} #1945#return; {45116#true} is VALID [2022-02-20 20:01:40,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:40,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {45163#(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); {45116#true} is VALID [2022-02-20 20:01:40,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {45116#true} assume !(0 == ~q_write_ev~0); {45116#true} is VALID [2022-02-20 20:01:40,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {45116#true} assume true; {45116#true} is VALID [2022-02-20 20:01:40,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45116#true} {45116#true} #1947#return; {45116#true} is VALID [2022-02-20 20:01:40,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:40,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:40,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {45116#true} havoc ~__retres1~0; {45116#true} is VALID [2022-02-20 20:01:40,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {45116#true} assume !(1 == ~p_dw_pc~0); {45116#true} is VALID [2022-02-20 20:01:40,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {45116#true} assume !(2 == ~p_dw_pc~0); {45116#true} is VALID [2022-02-20 20:01:40,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {45116#true} ~__retres1~0 := 0; {45116#true} is VALID [2022-02-20 20:01:40,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {45116#true} #res := ~__retres1~0; {45116#true} is VALID [2022-02-20 20:01:40,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {45116#true} assume true; {45116#true} is VALID [2022-02-20 20:01:40,719 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {45116#true} {45116#true} #1941#return; {45116#true} is VALID [2022-02-20 20:01:40,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:40,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {45116#true} havoc ~__retres1~1; {45116#true} is VALID [2022-02-20 20:01:40,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {45116#true} assume !(1 == ~c_dr_pc~0); {45116#true} is VALID [2022-02-20 20:01:40,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {45116#true} assume !(2 == ~c_dr_pc~0); {45116#true} is VALID [2022-02-20 20:01:40,743 INFO L290 TraceCheckUtils]: 3: Hoare triple {45116#true} ~__retres1~1 := 0; {45181#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:40,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {45181#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {45182#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:40,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {45182#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {45182#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:40,744 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {45182#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {45116#true} #1943#return; {45179#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:40,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {45164#(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; {45116#true} is VALID [2022-02-20 20:01:40,745 INFO L272 TraceCheckUtils]: 1: Hoare triple {45116#true} call #t~ret8 := is_do_write_p_triggered(); {45116#true} is VALID [2022-02-20 20:01:40,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {45116#true} havoc ~__retres1~0; {45116#true} is VALID [2022-02-20 20:01:40,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {45116#true} assume !(1 == ~p_dw_pc~0); {45116#true} is VALID [2022-02-20 20:01:40,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {45116#true} assume !(2 == ~p_dw_pc~0); {45116#true} is VALID [2022-02-20 20:01:40,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {45116#true} ~__retres1~0 := 0; {45116#true} is VALID [2022-02-20 20:01:40,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {45116#true} #res := ~__retres1~0; {45116#true} is VALID [2022-02-20 20:01:40,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {45116#true} assume true; {45116#true} is VALID [2022-02-20 20:01:40,745 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {45116#true} {45116#true} #1941#return; {45116#true} is VALID [2022-02-20 20:01:40,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {45116#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45116#true} is VALID [2022-02-20 20:01:40,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {45116#true} assume !(0 != ~tmp~1); {45116#true} is VALID [2022-02-20 20:01:40,746 INFO L272 TraceCheckUtils]: 11: Hoare triple {45116#true} call #t~ret9 := is_do_read_c_triggered(); {45116#true} is VALID [2022-02-20 20:01:40,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {45116#true} havoc ~__retres1~1; {45116#true} is VALID [2022-02-20 20:01:40,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {45116#true} assume !(1 == ~c_dr_pc~0); {45116#true} is VALID [2022-02-20 20:01:40,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {45116#true} assume !(2 == ~c_dr_pc~0); {45116#true} is VALID [2022-02-20 20:01:40,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {45116#true} ~__retres1~1 := 0; {45181#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:40,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {45181#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {45182#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:40,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {45182#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {45182#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:40,747 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {45182#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {45116#true} #1943#return; {45179#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:40,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {45179#(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; {45180#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:40,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {45180#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {45117#false} is VALID [2022-02-20 20:01:40,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {45117#false} assume true; {45117#false} is VALID [2022-02-20 20:01:40,749 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {45117#false} {45116#true} #1949#return; {45117#false} is VALID [2022-02-20 20:01:40,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:40,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {45163#(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); {45116#true} is VALID [2022-02-20 20:01:40,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {45116#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {45116#true} is VALID [2022-02-20 20:01:40,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {45116#true} assume true; {45116#true} is VALID [2022-02-20 20:01:40,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45116#true} {45117#false} #1951#return; {45117#false} is VALID [2022-02-20 20:01:40,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:40,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {45116#true} havoc ~__retres1~2; {45116#true} is VALID [2022-02-20 20:01:40,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {45116#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45116#true} is VALID [2022-02-20 20:01:40,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {45116#true} #res := ~__retres1~2; {45116#true} is VALID [2022-02-20 20:01:40,757 INFO L290 TraceCheckUtils]: 3: Hoare triple {45116#true} assume true; {45116#true} is VALID [2022-02-20 20:01:40,758 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45116#true} {45117#false} #1953#return; {45117#false} is VALID [2022-02-20 20:01:40,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:40,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {45116#true} havoc ~__retres1~2; {45116#true} is VALID [2022-02-20 20:01:40,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {45116#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45116#true} is VALID [2022-02-20 20:01:40,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {45116#true} #res := ~__retres1~2; {45116#true} is VALID [2022-02-20 20:01:40,760 INFO L290 TraceCheckUtils]: 3: Hoare triple {45116#true} assume true; {45116#true} is VALID [2022-02-20 20:01:40,760 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45116#true} {45117#false} #1953#return; {45117#false} is VALID [2022-02-20 20:01:40,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {45116#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; {45116#true} is VALID [2022-02-20 20:01:40,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {45116#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {45116#true} is VALID [2022-02-20 20:01:40,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {45116#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {45116#true} is VALID [2022-02-20 20:01:40,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {45116#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; {45116#true} is VALID [2022-02-20 20:01:40,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {45116#true} call update_channels1(); {45162#(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:40,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {45162#(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); {45116#true} is VALID [2022-02-20 20:01:40,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {45116#true} assume true; {45116#true} is VALID [2022-02-20 20:01:40,761 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {45116#true} {45116#true} #1945#return; {45116#true} is VALID [2022-02-20 20:01:40,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {45116#true} assume { :begin_inline_init_threads1 } true; {45116#true} is VALID [2022-02-20 20:01:40,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {45116#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {45116#true} is VALID [2022-02-20 20:01:40,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {45116#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {45116#true} is VALID [2022-02-20 20:01:40,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {45116#true} assume { :end_inline_init_threads1 } true; {45116#true} is VALID [2022-02-20 20:01:40,762 INFO L272 TraceCheckUtils]: 12: Hoare triple {45116#true} call fire_delta_events1(); {45163#(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:40,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {45163#(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); {45116#true} is VALID [2022-02-20 20:01:40,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {45116#true} assume !(0 == ~q_write_ev~0); {45116#true} is VALID [2022-02-20 20:01:40,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {45116#true} assume true; {45116#true} is VALID [2022-02-20 20:01:40,763 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {45116#true} {45116#true} #1947#return; {45116#true} is VALID [2022-02-20 20:01:40,763 INFO L272 TraceCheckUtils]: 17: Hoare triple {45116#true} call activate_threads1(); {45164#(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:40,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {45164#(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; {45116#true} is VALID [2022-02-20 20:01:40,763 INFO L272 TraceCheckUtils]: 19: Hoare triple {45116#true} call #t~ret8 := is_do_write_p_triggered(); {45116#true} is VALID [2022-02-20 20:01:40,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {45116#true} havoc ~__retres1~0; {45116#true} is VALID [2022-02-20 20:01:40,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {45116#true} assume !(1 == ~p_dw_pc~0); {45116#true} is VALID [2022-02-20 20:01:40,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {45116#true} assume !(2 == ~p_dw_pc~0); {45116#true} is VALID [2022-02-20 20:01:40,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {45116#true} ~__retres1~0 := 0; {45116#true} is VALID [2022-02-20 20:01:40,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {45116#true} #res := ~__retres1~0; {45116#true} is VALID [2022-02-20 20:01:40,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {45116#true} assume true; {45116#true} is VALID [2022-02-20 20:01:40,764 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {45116#true} {45116#true} #1941#return; {45116#true} is VALID [2022-02-20 20:01:40,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {45116#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {45116#true} is VALID [2022-02-20 20:01:40,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {45116#true} assume !(0 != ~tmp~1); {45116#true} is VALID [2022-02-20 20:01:40,764 INFO L272 TraceCheckUtils]: 29: Hoare triple {45116#true} call #t~ret9 := is_do_read_c_triggered(); {45116#true} is VALID [2022-02-20 20:01:40,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {45116#true} havoc ~__retres1~1; {45116#true} is VALID [2022-02-20 20:01:40,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {45116#true} assume !(1 == ~c_dr_pc~0); {45116#true} is VALID [2022-02-20 20:01:40,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {45116#true} assume !(2 == ~c_dr_pc~0); {45116#true} is VALID [2022-02-20 20:01:40,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {45116#true} ~__retres1~1 := 0; {45181#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:40,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {45181#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {45182#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:40,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {45182#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {45182#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:40,766 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {45182#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {45116#true} #1943#return; {45179#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:40,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {45179#(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; {45180#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:40,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {45180#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {45117#false} is VALID [2022-02-20 20:01:40,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {45117#false} assume true; {45117#false} is VALID [2022-02-20 20:01:40,767 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {45117#false} {45116#true} #1949#return; {45117#false} is VALID [2022-02-20 20:01:40,767 INFO L272 TraceCheckUtils]: 41: Hoare triple {45117#false} call reset_delta_events1(); {45163#(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:40,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {45163#(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); {45116#true} is VALID [2022-02-20 20:01:40,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {45116#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {45116#true} is VALID [2022-02-20 20:01:40,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {45116#true} assume true; {45116#true} is VALID [2022-02-20 20:01:40,768 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {45116#true} {45117#false} #1951#return; {45117#false} is VALID [2022-02-20 20:01:40,768 INFO L290 TraceCheckUtils]: 46: Hoare triple {45117#false} assume !false; {45117#false} is VALID [2022-02-20 20:01:40,768 INFO L290 TraceCheckUtils]: 47: Hoare triple {45117#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; {45117#false} is VALID [2022-02-20 20:01:40,768 INFO L290 TraceCheckUtils]: 48: Hoare triple {45117#false} assume !false; {45117#false} is VALID [2022-02-20 20:01:40,768 INFO L272 TraceCheckUtils]: 49: Hoare triple {45117#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {45116#true} is VALID [2022-02-20 20:01:40,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {45116#true} havoc ~__retres1~2; {45116#true} is VALID [2022-02-20 20:01:40,769 INFO L290 TraceCheckUtils]: 51: Hoare triple {45116#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45116#true} is VALID [2022-02-20 20:01:40,769 INFO L290 TraceCheckUtils]: 52: Hoare triple {45116#true} #res := ~__retres1~2; {45116#true} is VALID [2022-02-20 20:01:40,769 INFO L290 TraceCheckUtils]: 53: Hoare triple {45116#true} assume true; {45116#true} is VALID [2022-02-20 20:01:40,769 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {45116#true} {45117#false} #1953#return; {45117#false} is VALID [2022-02-20 20:01:40,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {45117#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; {45117#false} is VALID [2022-02-20 20:01:40,769 INFO L290 TraceCheckUtils]: 56: Hoare triple {45117#false} assume 0 != eval1_~tmp___1~0#1; {45117#false} is VALID [2022-02-20 20:01:40,769 INFO L290 TraceCheckUtils]: 57: Hoare triple {45117#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; {45117#false} is VALID [2022-02-20 20:01:40,769 INFO L290 TraceCheckUtils]: 58: Hoare triple {45117#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; {45117#false} is VALID [2022-02-20 20:01:40,770 INFO L290 TraceCheckUtils]: 59: Hoare triple {45117#false} assume 0 == ~p_dw_pc~0; {45117#false} is VALID [2022-02-20 20:01:40,770 INFO L290 TraceCheckUtils]: 60: Hoare triple {45117#false} assume !false; {45117#false} is VALID [2022-02-20 20:01:40,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {45117#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {45117#false} is VALID [2022-02-20 20:01:40,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {45117#false} assume { :end_inline_do_write_p } true; {45117#false} is VALID [2022-02-20 20:01:40,770 INFO L290 TraceCheckUtils]: 63: Hoare triple {45117#false} assume !(0 == ~c_dr_st~0); {45117#false} is VALID [2022-02-20 20:01:40,770 INFO L290 TraceCheckUtils]: 64: Hoare triple {45117#false} assume !false; {45117#false} is VALID [2022-02-20 20:01:40,770 INFO L272 TraceCheckUtils]: 65: Hoare triple {45117#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {45116#true} is VALID [2022-02-20 20:01:40,770 INFO L290 TraceCheckUtils]: 66: Hoare triple {45116#true} havoc ~__retres1~2; {45116#true} is VALID [2022-02-20 20:01:40,771 INFO L290 TraceCheckUtils]: 67: Hoare triple {45116#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {45116#true} is VALID [2022-02-20 20:01:40,771 INFO L290 TraceCheckUtils]: 68: Hoare triple {45116#true} #res := ~__retres1~2; {45116#true} is VALID [2022-02-20 20:01:40,771 INFO L290 TraceCheckUtils]: 69: Hoare triple {45116#true} assume true; {45116#true} is VALID [2022-02-20 20:01:40,771 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {45116#true} {45117#false} #1953#return; {45117#false} is VALID [2022-02-20 20:01:40,771 INFO L290 TraceCheckUtils]: 71: Hoare triple {45117#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; {45117#false} is VALID [2022-02-20 20:01:40,771 INFO L290 TraceCheckUtils]: 72: Hoare triple {45117#false} assume 0 != eval1_~tmp___1~0#1; {45117#false} is VALID [2022-02-20 20:01:40,771 INFO L290 TraceCheckUtils]: 73: Hoare triple {45117#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; {45117#false} is VALID [2022-02-20 20:01:40,771 INFO L290 TraceCheckUtils]: 74: Hoare triple {45117#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; {45117#false} is VALID [2022-02-20 20:01:40,771 INFO L290 TraceCheckUtils]: 75: Hoare triple {45117#false} assume !(0 == ~p_dw_pc~0); {45117#false} is VALID [2022-02-20 20:01:40,772 INFO L290 TraceCheckUtils]: 76: Hoare triple {45117#false} assume 1 == ~p_dw_pc~0; {45117#false} is VALID [2022-02-20 20:01:40,772 INFO L290 TraceCheckUtils]: 77: Hoare triple {45117#false} assume !(0 == ~q_free~0); {45117#false} is VALID [2022-02-20 20:01:40,772 INFO L290 TraceCheckUtils]: 78: Hoare triple {45117#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; {45117#false} is VALID [2022-02-20 20:01:40,772 INFO L290 TraceCheckUtils]: 79: Hoare triple {45117#false} assume !false; {45117#false} is VALID [2022-02-20 20:01:40,772 INFO L290 TraceCheckUtils]: 80: Hoare triple {45117#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {45117#false} is VALID [2022-02-20 20:01:40,772 INFO L290 TraceCheckUtils]: 81: Hoare triple {45117#false} assume { :end_inline_do_write_p } true; {45117#false} is VALID [2022-02-20 20:01:40,773 INFO L290 TraceCheckUtils]: 82: Hoare triple {45117#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; {45117#false} is VALID [2022-02-20 20:01:40,773 INFO L290 TraceCheckUtils]: 83: Hoare triple {45117#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; {45117#false} is VALID [2022-02-20 20:01:40,773 INFO L290 TraceCheckUtils]: 84: Hoare triple {45117#false} assume !(0 == ~c_dr_pc~0); {45117#false} is VALID [2022-02-20 20:01:40,773 INFO L290 TraceCheckUtils]: 85: Hoare triple {45117#false} assume 2 == ~c_dr_pc~0; {45117#false} is VALID [2022-02-20 20:01:40,773 INFO L290 TraceCheckUtils]: 86: Hoare triple {45117#false} do_read_c_~a~0#1 := ~a_t~0; {45117#false} is VALID [2022-02-20 20:01:40,773 INFO L290 TraceCheckUtils]: 87: Hoare triple {45117#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; {45117#false} is VALID [2022-02-20 20:01:40,773 INFO L290 TraceCheckUtils]: 88: Hoare triple {45117#false} assume !(~p_last_write~0 == ~c_last_read~0); {45117#false} is VALID [2022-02-20 20:01:40,773 INFO L272 TraceCheckUtils]: 89: Hoare triple {45117#false} call error1(); {45117#false} is VALID [2022-02-20 20:01:40,773 INFO L290 TraceCheckUtils]: 90: Hoare triple {45117#false} assume !false; {45117#false} is VALID [2022-02-20 20:01:40,774 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:40,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:40,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328462768] [2022-02-20 20:01:40,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328462768] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:40,774 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:40,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:40,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955688917] [2022-02-20 20:01:40,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:40,776 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:40,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:40,776 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:40,812 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:40,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:40,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:40,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:40,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:40,813 INFO L87 Difference]: Start difference. First operand 2017 states and 2703 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:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:45,156 INFO L93 Difference]: Finished difference Result 3842 states and 5105 transitions. [2022-02-20 20:01:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:01:45,156 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:45,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:45,156 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:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 918 transitions. [2022-02-20 20:01:45,161 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:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 918 transitions. [2022-02-20 20:01:45,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 918 transitions. [2022-02-20 20:01:45,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 918 edges. 918 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:45,946 INFO L225 Difference]: With dead ends: 3842 [2022-02-20 20:01:45,946 INFO L226 Difference]: Without dead ends: 2211 [2022-02-20 20:01:45,948 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:45,951 INFO L933 BasicCegarLoop]: 728 mSDtfsCounter, 980 mSDsluCounter, 2164 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 2892 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:45,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [982 Valid, 2892 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 20:01:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2022-02-20 20:01:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2077. [2022-02-20 20:01:46,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:46,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2211 states. Second operand has 2077 states, 1679 states have (on average 1.3466349017272186) internal successors, (2261), 1704 states have internal predecessors, (2261), 218 states have call successors, (218), 139 states have call predecessors, (218), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-02-20 20:01:46,053 INFO L74 IsIncluded]: Start isIncluded. First operand 2211 states. Second operand has 2077 states, 1679 states have (on average 1.3466349017272186) internal successors, (2261), 1704 states have internal predecessors, (2261), 218 states have call successors, (218), 139 states have call predecessors, (218), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-02-20 20:01:46,054 INFO L87 Difference]: Start difference. First operand 2211 states. Second operand has 2077 states, 1679 states have (on average 1.3466349017272186) internal successors, (2261), 1704 states have internal predecessors, (2261), 218 states have call successors, (218), 139 states have call predecessors, (218), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-02-20 20:01:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:46,216 INFO L93 Difference]: Finished difference Result 2211 states and 2946 transitions. [2022-02-20 20:01:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 2946 transitions. [2022-02-20 20:01:46,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:46,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:46,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 2077 states, 1679 states have (on average 1.3466349017272186) internal successors, (2261), 1704 states have internal predecessors, (2261), 218 states have call successors, (218), 139 states have call predecessors, (218), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) Second operand 2211 states. [2022-02-20 20:01:46,226 INFO L87 Difference]: Start difference. First operand has 2077 states, 1679 states have (on average 1.3466349017272186) internal successors, (2261), 1704 states have internal predecessors, (2261), 218 states have call successors, (218), 139 states have call predecessors, (218), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) Second operand 2211 states. [2022-02-20 20:01:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:46,376 INFO L93 Difference]: Finished difference Result 2211 states and 2946 transitions. [2022-02-20 20:01:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 2946 transitions. [2022-02-20 20:01:46,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:46,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:46,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:46,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2077 states, 1679 states have (on average 1.3466349017272186) internal successors, (2261), 1704 states have internal predecessors, (2261), 218 states have call successors, (218), 139 states have call predecessors, (218), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-02-20 20:01:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 2757 transitions. [2022-02-20 20:01:46,582 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 2757 transitions. Word has length 91 [2022-02-20 20:01:46,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:46,582 INFO L470 AbstractCegarLoop]: Abstraction has 2077 states and 2757 transitions. [2022-02-20 20:01:46,582 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:01:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 2757 transitions. [2022-02-20 20:01:46,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:46,584 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:46,584 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:46,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:01:46,585 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:46,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:46,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1575440757, now seen corresponding path program 1 times [2022-02-20 20:01:46,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:46,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222397326] [2022-02-20 20:01:46,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:46,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:46,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:46,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {57577#(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); {57578#(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:46,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {57578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {57578#(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:46,638 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {57532#(= ~q_write_ev~0 ~q_read_ev~0)} #1945#return; {57532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:46,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:46,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {57578#(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); {57578#(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:46,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {57578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {57578#(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:46,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {57578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {57578#(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:46,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {57532#(= ~q_write_ev~0 ~q_read_ev~0)} #1947#return; {57532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:46,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:46,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:46,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {57530#true} havoc ~__retres1~0; {57530#true} is VALID [2022-02-20 20:01:46,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {57530#true} assume !(1 == ~p_dw_pc~0); {57530#true} is VALID [2022-02-20 20:01:46,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {57530#true} assume !(2 == ~p_dw_pc~0); {57530#true} is VALID [2022-02-20 20:01:46,663 INFO L290 TraceCheckUtils]: 3: Hoare triple {57530#true} ~__retres1~0 := 0; {57530#true} is VALID [2022-02-20 20:01:46,663 INFO L290 TraceCheckUtils]: 4: Hoare triple {57530#true} #res := ~__retres1~0; {57530#true} is VALID [2022-02-20 20:01:46,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {57530#true} assume true; {57530#true} is VALID [2022-02-20 20:01:46,664 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {57530#true} {57530#true} #1941#return; {57530#true} is VALID [2022-02-20 20:01:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:46,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {57530#true} havoc ~__retres1~1; {57530#true} is VALID [2022-02-20 20:01:46,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {57530#true} assume !(1 == ~c_dr_pc~0); {57530#true} is VALID [2022-02-20 20:01:46,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {57530#true} assume !(2 == ~c_dr_pc~0); {57530#true} is VALID [2022-02-20 20:01:46,676 INFO L290 TraceCheckUtils]: 3: Hoare triple {57530#true} ~__retres1~1 := 0; {57530#true} is VALID [2022-02-20 20:01:46,676 INFO L290 TraceCheckUtils]: 4: Hoare triple {57530#true} #res := ~__retres1~1; {57530#true} is VALID [2022-02-20 20:01:46,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {57530#true} assume true; {57530#true} is VALID [2022-02-20 20:01:46,676 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {57530#true} {57530#true} #1943#return; {57530#true} is VALID [2022-02-20 20:01:46,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {57579#(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; {57530#true} is VALID [2022-02-20 20:01:46,677 INFO L272 TraceCheckUtils]: 1: Hoare triple {57530#true} call #t~ret8 := is_do_write_p_triggered(); {57530#true} is VALID [2022-02-20 20:01:46,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {57530#true} havoc ~__retres1~0; {57530#true} is VALID [2022-02-20 20:01:46,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {57530#true} assume !(1 == ~p_dw_pc~0); {57530#true} is VALID [2022-02-20 20:01:46,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {57530#true} assume !(2 == ~p_dw_pc~0); {57530#true} is VALID [2022-02-20 20:01:46,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {57530#true} ~__retres1~0 := 0; {57530#true} is VALID [2022-02-20 20:01:46,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {57530#true} #res := ~__retres1~0; {57530#true} is VALID [2022-02-20 20:01:46,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {57530#true} assume true; {57530#true} is VALID [2022-02-20 20:01:46,677 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {57530#true} {57530#true} #1941#return; {57530#true} is VALID [2022-02-20 20:01:46,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {57530#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {57530#true} is VALID [2022-02-20 20:01:46,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {57530#true} assume !(0 != ~tmp~1); {57530#true} is VALID [2022-02-20 20:01:46,677 INFO L272 TraceCheckUtils]: 11: Hoare triple {57530#true} call #t~ret9 := is_do_read_c_triggered(); {57530#true} is VALID [2022-02-20 20:01:46,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {57530#true} havoc ~__retres1~1; {57530#true} is VALID [2022-02-20 20:01:46,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {57530#true} assume !(1 == ~c_dr_pc~0); {57530#true} is VALID [2022-02-20 20:01:46,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {57530#true} assume !(2 == ~c_dr_pc~0); {57530#true} is VALID [2022-02-20 20:01:46,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {57530#true} ~__retres1~1 := 0; {57530#true} is VALID [2022-02-20 20:01:46,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {57530#true} #res := ~__retres1~1; {57530#true} is VALID [2022-02-20 20:01:46,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {57530#true} assume true; {57530#true} is VALID [2022-02-20 20:01:46,678 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {57530#true} {57530#true} #1943#return; {57530#true} is VALID [2022-02-20 20:01:46,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {57530#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {57530#true} is VALID [2022-02-20 20:01:46,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {57530#true} assume !(0 != ~tmp___0~1); {57530#true} is VALID [2022-02-20 20:01:46,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {57530#true} assume true; {57530#true} is VALID [2022-02-20 20:01:46,679 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {57530#true} {57532#(= ~q_write_ev~0 ~q_read_ev~0)} #1949#return; {57532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:46,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:46,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {57578#(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); {57594#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:01:46,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {57594#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {57595#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:46,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {57595#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {57595#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:46,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57595#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {57532#(= ~q_write_ev~0 ~q_read_ev~0)} #1951#return; {57531#false} is VALID [2022-02-20 20:01:46,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:46,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {57530#true} havoc ~__retres1~2; {57530#true} is VALID [2022-02-20 20:01:46,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {57530#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {57530#true} is VALID [2022-02-20 20:01:46,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {57530#true} #res := ~__retres1~2; {57530#true} is VALID [2022-02-20 20:01:46,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {57530#true} assume true; {57530#true} is VALID [2022-02-20 20:01:46,701 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {57530#true} {57531#false} #1953#return; {57531#false} is VALID [2022-02-20 20:01:46,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:46,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {57530#true} havoc ~__retres1~2; {57530#true} is VALID [2022-02-20 20:01:46,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {57530#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {57530#true} is VALID [2022-02-20 20:01:46,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {57530#true} #res := ~__retres1~2; {57530#true} is VALID [2022-02-20 20:01:46,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {57530#true} assume true; {57530#true} is VALID [2022-02-20 20:01:46,705 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {57530#true} {57531#false} #1953#return; {57531#false} is VALID [2022-02-20 20:01:46,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {57530#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; {57530#true} is VALID [2022-02-20 20:01:46,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {57530#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {57530#true} is VALID [2022-02-20 20:01:46,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {57530#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {57532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:46,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {57532#(= ~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; {57532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:46,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {57532#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {57577#(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:46,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {57577#(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); {57578#(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:46,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {57578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {57578#(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:46,708 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {57578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {57532#(= ~q_write_ev~0 ~q_read_ev~0)} #1945#return; {57532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:46,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {57532#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {57532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:46,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {57532#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {57532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:46,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {57532#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {57532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:46,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {57532#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {57532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:46,710 INFO L272 TraceCheckUtils]: 12: Hoare triple {57532#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {57578#(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:46,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {57578#(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); {57578#(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:46,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {57578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {57578#(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:46,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {57578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {57578#(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:46,711 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {57578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {57532#(= ~q_write_ev~0 ~q_read_ev~0)} #1947#return; {57532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:46,712 INFO L272 TraceCheckUtils]: 17: Hoare triple {57532#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {57579#(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:46,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {57579#(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; {57530#true} is VALID [2022-02-20 20:01:46,712 INFO L272 TraceCheckUtils]: 19: Hoare triple {57530#true} call #t~ret8 := is_do_write_p_triggered(); {57530#true} is VALID [2022-02-20 20:01:46,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {57530#true} havoc ~__retres1~0; {57530#true} is VALID [2022-02-20 20:01:46,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {57530#true} assume !(1 == ~p_dw_pc~0); {57530#true} is VALID [2022-02-20 20:01:46,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {57530#true} assume !(2 == ~p_dw_pc~0); {57530#true} is VALID [2022-02-20 20:01:46,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {57530#true} ~__retres1~0 := 0; {57530#true} is VALID [2022-02-20 20:01:46,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {57530#true} #res := ~__retres1~0; {57530#true} is VALID [2022-02-20 20:01:46,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {57530#true} assume true; {57530#true} is VALID [2022-02-20 20:01:46,713 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {57530#true} {57530#true} #1941#return; {57530#true} is VALID [2022-02-20 20:01:46,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {57530#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {57530#true} is VALID [2022-02-20 20:01:46,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {57530#true} assume !(0 != ~tmp~1); {57530#true} is VALID [2022-02-20 20:01:46,713 INFO L272 TraceCheckUtils]: 29: Hoare triple {57530#true} call #t~ret9 := is_do_read_c_triggered(); {57530#true} is VALID [2022-02-20 20:01:46,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {57530#true} havoc ~__retres1~1; {57530#true} is VALID [2022-02-20 20:01:46,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {57530#true} assume !(1 == ~c_dr_pc~0); {57530#true} is VALID [2022-02-20 20:01:46,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {57530#true} assume !(2 == ~c_dr_pc~0); {57530#true} is VALID [2022-02-20 20:01:46,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {57530#true} ~__retres1~1 := 0; {57530#true} is VALID [2022-02-20 20:01:46,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {57530#true} #res := ~__retres1~1; {57530#true} is VALID [2022-02-20 20:01:46,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {57530#true} assume true; {57530#true} is VALID [2022-02-20 20:01:46,714 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {57530#true} {57530#true} #1943#return; {57530#true} is VALID [2022-02-20 20:01:46,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {57530#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {57530#true} is VALID [2022-02-20 20:01:46,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {57530#true} assume !(0 != ~tmp___0~1); {57530#true} is VALID [2022-02-20 20:01:46,715 INFO L290 TraceCheckUtils]: 39: Hoare triple {57530#true} assume true; {57530#true} is VALID [2022-02-20 20:01:46,715 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {57530#true} {57532#(= ~q_write_ev~0 ~q_read_ev~0)} #1949#return; {57532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:46,715 INFO L272 TraceCheckUtils]: 41: Hoare triple {57532#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {57578#(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:46,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {57578#(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); {57594#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:01:46,716 INFO L290 TraceCheckUtils]: 43: Hoare triple {57594#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {57595#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:46,716 INFO L290 TraceCheckUtils]: 44: Hoare triple {57595#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {57595#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:46,717 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {57595#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {57532#(= ~q_write_ev~0 ~q_read_ev~0)} #1951#return; {57531#false} is VALID [2022-02-20 20:01:46,717 INFO L290 TraceCheckUtils]: 46: Hoare triple {57531#false} assume !false; {57531#false} is VALID [2022-02-20 20:01:46,717 INFO L290 TraceCheckUtils]: 47: Hoare triple {57531#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; {57531#false} is VALID [2022-02-20 20:01:46,717 INFO L290 TraceCheckUtils]: 48: Hoare triple {57531#false} assume !false; {57531#false} is VALID [2022-02-20 20:01:46,717 INFO L272 TraceCheckUtils]: 49: Hoare triple {57531#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {57530#true} is VALID [2022-02-20 20:01:46,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {57530#true} havoc ~__retres1~2; {57530#true} is VALID [2022-02-20 20:01:46,717 INFO L290 TraceCheckUtils]: 51: Hoare triple {57530#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {57530#true} is VALID [2022-02-20 20:01:46,718 INFO L290 TraceCheckUtils]: 52: Hoare triple {57530#true} #res := ~__retres1~2; {57530#true} is VALID [2022-02-20 20:01:46,718 INFO L290 TraceCheckUtils]: 53: Hoare triple {57530#true} assume true; {57530#true} is VALID [2022-02-20 20:01:46,718 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {57530#true} {57531#false} #1953#return; {57531#false} is VALID [2022-02-20 20:01:46,718 INFO L290 TraceCheckUtils]: 55: Hoare triple {57531#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; {57531#false} is VALID [2022-02-20 20:01:46,718 INFO L290 TraceCheckUtils]: 56: Hoare triple {57531#false} assume 0 != eval1_~tmp___1~0#1; {57531#false} is VALID [2022-02-20 20:01:46,718 INFO L290 TraceCheckUtils]: 57: Hoare triple {57531#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; {57531#false} is VALID [2022-02-20 20:01:46,718 INFO L290 TraceCheckUtils]: 58: Hoare triple {57531#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; {57531#false} is VALID [2022-02-20 20:01:46,718 INFO L290 TraceCheckUtils]: 59: Hoare triple {57531#false} assume 0 == ~p_dw_pc~0; {57531#false} is VALID [2022-02-20 20:01:46,719 INFO L290 TraceCheckUtils]: 60: Hoare triple {57531#false} assume !false; {57531#false} is VALID [2022-02-20 20:01:46,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {57531#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {57531#false} is VALID [2022-02-20 20:01:46,719 INFO L290 TraceCheckUtils]: 62: Hoare triple {57531#false} assume { :end_inline_do_write_p } true; {57531#false} is VALID [2022-02-20 20:01:46,719 INFO L290 TraceCheckUtils]: 63: Hoare triple {57531#false} assume !(0 == ~c_dr_st~0); {57531#false} is VALID [2022-02-20 20:01:46,719 INFO L290 TraceCheckUtils]: 64: Hoare triple {57531#false} assume !false; {57531#false} is VALID [2022-02-20 20:01:46,719 INFO L272 TraceCheckUtils]: 65: Hoare triple {57531#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {57530#true} is VALID [2022-02-20 20:01:46,719 INFO L290 TraceCheckUtils]: 66: Hoare triple {57530#true} havoc ~__retres1~2; {57530#true} is VALID [2022-02-20 20:01:46,720 INFO L290 TraceCheckUtils]: 67: Hoare triple {57530#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {57530#true} is VALID [2022-02-20 20:01:46,720 INFO L290 TraceCheckUtils]: 68: Hoare triple {57530#true} #res := ~__retres1~2; {57530#true} is VALID [2022-02-20 20:01:46,720 INFO L290 TraceCheckUtils]: 69: Hoare triple {57530#true} assume true; {57530#true} is VALID [2022-02-20 20:01:46,720 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {57530#true} {57531#false} #1953#return; {57531#false} is VALID [2022-02-20 20:01:46,720 INFO L290 TraceCheckUtils]: 71: Hoare triple {57531#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; {57531#false} is VALID [2022-02-20 20:01:46,720 INFO L290 TraceCheckUtils]: 72: Hoare triple {57531#false} assume 0 != eval1_~tmp___1~0#1; {57531#false} is VALID [2022-02-20 20:01:46,720 INFO L290 TraceCheckUtils]: 73: Hoare triple {57531#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; {57531#false} is VALID [2022-02-20 20:01:46,720 INFO L290 TraceCheckUtils]: 74: Hoare triple {57531#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; {57531#false} is VALID [2022-02-20 20:01:46,720 INFO L290 TraceCheckUtils]: 75: Hoare triple {57531#false} assume !(0 == ~p_dw_pc~0); {57531#false} is VALID [2022-02-20 20:01:46,721 INFO L290 TraceCheckUtils]: 76: Hoare triple {57531#false} assume 1 == ~p_dw_pc~0; {57531#false} is VALID [2022-02-20 20:01:46,721 INFO L290 TraceCheckUtils]: 77: Hoare triple {57531#false} assume !(0 == ~q_free~0); {57531#false} is VALID [2022-02-20 20:01:46,721 INFO L290 TraceCheckUtils]: 78: Hoare triple {57531#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; {57531#false} is VALID [2022-02-20 20:01:46,721 INFO L290 TraceCheckUtils]: 79: Hoare triple {57531#false} assume !false; {57531#false} is VALID [2022-02-20 20:01:46,721 INFO L290 TraceCheckUtils]: 80: Hoare triple {57531#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {57531#false} is VALID [2022-02-20 20:01:46,721 INFO L290 TraceCheckUtils]: 81: Hoare triple {57531#false} assume { :end_inline_do_write_p } true; {57531#false} is VALID [2022-02-20 20:01:46,721 INFO L290 TraceCheckUtils]: 82: Hoare triple {57531#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; {57531#false} is VALID [2022-02-20 20:01:46,721 INFO L290 TraceCheckUtils]: 83: Hoare triple {57531#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; {57531#false} is VALID [2022-02-20 20:01:46,722 INFO L290 TraceCheckUtils]: 84: Hoare triple {57531#false} assume !(0 == ~c_dr_pc~0); {57531#false} is VALID [2022-02-20 20:01:46,722 INFO L290 TraceCheckUtils]: 85: Hoare triple {57531#false} assume 2 == ~c_dr_pc~0; {57531#false} is VALID [2022-02-20 20:01:46,722 INFO L290 TraceCheckUtils]: 86: Hoare triple {57531#false} do_read_c_~a~0#1 := ~a_t~0; {57531#false} is VALID [2022-02-20 20:01:46,722 INFO L290 TraceCheckUtils]: 87: Hoare triple {57531#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; {57531#false} is VALID [2022-02-20 20:01:46,722 INFO L290 TraceCheckUtils]: 88: Hoare triple {57531#false} assume !(~p_last_write~0 == ~c_last_read~0); {57531#false} is VALID [2022-02-20 20:01:46,722 INFO L272 TraceCheckUtils]: 89: Hoare triple {57531#false} call error1(); {57531#false} is VALID [2022-02-20 20:01:46,722 INFO L290 TraceCheckUtils]: 90: Hoare triple {57531#false} assume !false; {57531#false} is VALID [2022-02-20 20:01:46,722 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:46,723 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:46,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222397326] [2022-02-20 20:01:46,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222397326] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:46,723 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:46,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:01:46,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561201992] [2022-02-20 20:01:46,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:46,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 91 [2022-02-20 20:01:46,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:46,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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:46,770 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:46,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:01:46,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:46,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:01:46,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:01:46,772 INFO L87 Difference]: Start difference. First operand 2077 states and 2757 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:50,843 INFO L93 Difference]: Finished difference Result 3604 states and 4721 transitions. [2022-02-20 20:01:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 20:01:50,844 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 91 [2022-02-20 20:01:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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:50,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1110 transitions. [2022-02-20 20:01:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1110 transitions. [2022-02-20 20:01:50,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 1110 transitions. [2022-02-20 20:01:51,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1110 edges. 1110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:51,781 INFO L225 Difference]: With dead ends: 3604 [2022-02-20 20:01:51,781 INFO L226 Difference]: Without dead ends: 2151 [2022-02-20 20:01:51,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-02-20 20:01:51,783 INFO L933 BasicCegarLoop]: 759 mSDtfsCounter, 1467 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 2583 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:51,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1500 Valid, 2583 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:01:51,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2022-02-20 20:01:51,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 1856. [2022-02-20 20:01:51,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:51,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2151 states. Second operand has 1856 states, 1511 states have (on average 1.3520847121111847) internal successors, (2043), 1531 states have internal predecessors, (2043), 190 states have call successors, (190), 120 states have call predecessors, (190), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-02-20 20:01:51,889 INFO L74 IsIncluded]: Start isIncluded. First operand 2151 states. Second operand has 1856 states, 1511 states have (on average 1.3520847121111847) internal successors, (2043), 1531 states have internal predecessors, (2043), 190 states have call successors, (190), 120 states have call predecessors, (190), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-02-20 20:01:51,891 INFO L87 Difference]: Start difference. First operand 2151 states. Second operand has 1856 states, 1511 states have (on average 1.3520847121111847) internal successors, (2043), 1531 states have internal predecessors, (2043), 190 states have call successors, (190), 120 states have call predecessors, (190), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-02-20 20:01:52,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:52,047 INFO L93 Difference]: Finished difference Result 2151 states and 2844 transitions. [2022-02-20 20:01:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 2844 transitions. [2022-02-20 20:01:52,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:52,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:52,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 1856 states, 1511 states have (on average 1.3520847121111847) internal successors, (2043), 1531 states have internal predecessors, (2043), 190 states have call successors, (190), 120 states have call predecessors, (190), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) Second operand 2151 states. [2022-02-20 20:01:52,055 INFO L87 Difference]: Start difference. First operand has 1856 states, 1511 states have (on average 1.3520847121111847) internal successors, (2043), 1531 states have internal predecessors, (2043), 190 states have call successors, (190), 120 states have call predecessors, (190), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) Second operand 2151 states. [2022-02-20 20:01:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:52,204 INFO L93 Difference]: Finished difference Result 2151 states and 2844 transitions. [2022-02-20 20:01:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 2844 transitions. [2022-02-20 20:01:52,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:52,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:52,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:52,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:52,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1511 states have (on average 1.3520847121111847) internal successors, (2043), 1531 states have internal predecessors, (2043), 190 states have call successors, (190), 120 states have call predecessors, (190), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-02-20 20:01:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2471 transitions. [2022-02-20 20:01:52,352 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2471 transitions. Word has length 91 [2022-02-20 20:01:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:52,353 INFO L470 AbstractCegarLoop]: Abstraction has 1856 states and 2471 transitions. [2022-02-20 20:01:52,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2471 transitions. [2022-02-20 20:01:52,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:52,354 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:52,354 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:52,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:01:52,354 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:52,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:52,355 INFO L85 PathProgramCache]: Analyzing trace with hash 363721289, now seen corresponding path program 1 times [2022-02-20 20:01:52,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:52,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978085529] [2022-02-20 20:01:52,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:52,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:52,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:52,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {69222#(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); {69175#true} is VALID [2022-02-20 20:01:52,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {69175#true} assume true; {69175#true} is VALID [2022-02-20 20:01:52,395 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69175#true} {69175#true} #1945#return; {69175#true} is VALID [2022-02-20 20:01:52,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:52,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {69223#(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); {69175#true} is VALID [2022-02-20 20:01:52,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {69175#true} assume !(0 == ~q_write_ev~0); {69175#true} is VALID [2022-02-20 20:01:52,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {69175#true} assume true; {69175#true} is VALID [2022-02-20 20:01:52,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69175#true} {69180#(= ~c_dr_st~0 0)} #1947#return; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:52,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:52,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {69175#true} havoc ~__retres1~0; {69175#true} is VALID [2022-02-20 20:01:52,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {69175#true} assume !(1 == ~p_dw_pc~0); {69175#true} is VALID [2022-02-20 20:01:52,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {69175#true} assume !(2 == ~p_dw_pc~0); {69175#true} is VALID [2022-02-20 20:01:52,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {69175#true} ~__retres1~0 := 0; {69175#true} is VALID [2022-02-20 20:01:52,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {69175#true} #res := ~__retres1~0; {69175#true} is VALID [2022-02-20 20:01:52,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {69175#true} assume true; {69175#true} is VALID [2022-02-20 20:01:52,420 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {69175#true} {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1941#return; {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:52,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {69175#true} havoc ~__retres1~1; {69175#true} is VALID [2022-02-20 20:01:52,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {69175#true} assume !(1 == ~c_dr_pc~0); {69175#true} is VALID [2022-02-20 20:01:52,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {69175#true} assume !(2 == ~c_dr_pc~0); {69175#true} is VALID [2022-02-20 20:01:52,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {69175#true} ~__retres1~1 := 0; {69175#true} is VALID [2022-02-20 20:01:52,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {69175#true} #res := ~__retres1~1; {69175#true} is VALID [2022-02-20 20:01:52,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {69175#true} assume true; {69175#true} is VALID [2022-02-20 20:01:52,423 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {69175#true} {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1943#return; {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {69224#(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; {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,424 INFO L272 TraceCheckUtils]: 1: Hoare triple {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {69175#true} is VALID [2022-02-20 20:01:52,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {69175#true} havoc ~__retres1~0; {69175#true} is VALID [2022-02-20 20:01:52,424 INFO L290 TraceCheckUtils]: 3: Hoare triple {69175#true} assume !(1 == ~p_dw_pc~0); {69175#true} is VALID [2022-02-20 20:01:52,424 INFO L290 TraceCheckUtils]: 4: Hoare triple {69175#true} assume !(2 == ~p_dw_pc~0); {69175#true} is VALID [2022-02-20 20:01:52,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {69175#true} ~__retres1~0 := 0; {69175#true} is VALID [2022-02-20 20:01:52,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {69175#true} #res := ~__retres1~0; {69175#true} is VALID [2022-02-20 20:01:52,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {69175#true} assume true; {69175#true} is VALID [2022-02-20 20:01:52,425 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {69175#true} {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1941#return; {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,426 INFO L272 TraceCheckUtils]: 11: Hoare triple {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {69175#true} is VALID [2022-02-20 20:01:52,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {69175#true} havoc ~__retres1~1; {69175#true} is VALID [2022-02-20 20:01:52,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {69175#true} assume !(1 == ~c_dr_pc~0); {69175#true} is VALID [2022-02-20 20:01:52,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {69175#true} assume !(2 == ~c_dr_pc~0); {69175#true} is VALID [2022-02-20 20:01:52,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {69175#true} ~__retres1~1 := 0; {69175#true} is VALID [2022-02-20 20:01:52,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {69175#true} #res := ~__retres1~1; {69175#true} is VALID [2022-02-20 20:01:52,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {69175#true} assume true; {69175#true} is VALID [2022-02-20 20:01:52,427 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {69175#true} {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1943#return; {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,428 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {69180#(= ~c_dr_st~0 0)} #1949#return; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:52,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {69223#(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); {69175#true} is VALID [2022-02-20 20:01:52,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {69175#true} assume !(1 == ~q_write_ev~0); {69175#true} is VALID [2022-02-20 20:01:52,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {69175#true} assume true; {69175#true} is VALID [2022-02-20 20:01:52,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69175#true} {69180#(= ~c_dr_st~0 0)} #1951#return; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:52,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {69175#true} havoc ~__retres1~2; {69175#true} is VALID [2022-02-20 20:01:52,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {69175#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {69175#true} is VALID [2022-02-20 20:01:52,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {69175#true} #res := ~__retres1~2; {69175#true} is VALID [2022-02-20 20:01:52,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {69175#true} assume true; {69175#true} is VALID [2022-02-20 20:01:52,435 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {69175#true} {69180#(= ~c_dr_st~0 0)} #1953#return; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:52,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {69175#true} havoc ~__retres1~2; {69175#true} is VALID [2022-02-20 20:01:52,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {69175#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {69175#true} is VALID [2022-02-20 20:01:52,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {69175#true} #res := ~__retres1~2; {69175#true} is VALID [2022-02-20 20:01:52,438 INFO L290 TraceCheckUtils]: 3: Hoare triple {69175#true} assume true; {69175#true} is VALID [2022-02-20 20:01:52,438 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {69175#true} {69176#false} #1953#return; {69176#false} is VALID [2022-02-20 20:01:52,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {69175#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; {69175#true} is VALID [2022-02-20 20:01:52,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {69175#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {69175#true} is VALID [2022-02-20 20:01:52,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {69175#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {69175#true} is VALID [2022-02-20 20:01:52,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {69175#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; {69175#true} is VALID [2022-02-20 20:01:52,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {69175#true} call update_channels1(); {69222#(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:52,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {69222#(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); {69175#true} is VALID [2022-02-20 20:01:52,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {69175#true} assume true; {69175#true} is VALID [2022-02-20 20:01:52,440 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {69175#true} {69175#true} #1945#return; {69175#true} is VALID [2022-02-20 20:01:52,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {69175#true} assume { :begin_inline_init_threads1 } true; {69175#true} is VALID [2022-02-20 20:01:52,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {69175#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {69175#true} is VALID [2022-02-20 20:01:52,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {69175#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {69180#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads1 } true; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,441 INFO L272 TraceCheckUtils]: 12: Hoare triple {69180#(= ~c_dr_st~0 0)} call fire_delta_events1(); {69223#(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:52,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {69223#(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); {69175#true} is VALID [2022-02-20 20:01:52,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {69175#true} assume !(0 == ~q_write_ev~0); {69175#true} is VALID [2022-02-20 20:01:52,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {69175#true} assume true; {69175#true} is VALID [2022-02-20 20:01:52,442 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {69175#true} {69180#(= ~c_dr_st~0 0)} #1947#return; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,442 INFO L272 TraceCheckUtils]: 17: Hoare triple {69180#(= ~c_dr_st~0 0)} call activate_threads1(); {69224#(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:52,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {69224#(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; {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,443 INFO L272 TraceCheckUtils]: 19: Hoare triple {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {69175#true} is VALID [2022-02-20 20:01:52,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {69175#true} havoc ~__retres1~0; {69175#true} is VALID [2022-02-20 20:01:52,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {69175#true} assume !(1 == ~p_dw_pc~0); {69175#true} is VALID [2022-02-20 20:01:52,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {69175#true} assume !(2 == ~p_dw_pc~0); {69175#true} is VALID [2022-02-20 20:01:52,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {69175#true} ~__retres1~0 := 0; {69175#true} is VALID [2022-02-20 20:01:52,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {69175#true} #res := ~__retres1~0; {69175#true} is VALID [2022-02-20 20:01:52,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {69175#true} assume true; {69175#true} is VALID [2022-02-20 20:01:52,444 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {69175#true} {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1941#return; {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,445 INFO L272 TraceCheckUtils]: 29: Hoare triple {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {69175#true} is VALID [2022-02-20 20:01:52,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {69175#true} havoc ~__retres1~1; {69175#true} is VALID [2022-02-20 20:01:52,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {69175#true} assume !(1 == ~c_dr_pc~0); {69175#true} is VALID [2022-02-20 20:01:52,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {69175#true} assume !(2 == ~c_dr_pc~0); {69175#true} is VALID [2022-02-20 20:01:52,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {69175#true} ~__retres1~1 := 0; {69175#true} is VALID [2022-02-20 20:01:52,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {69175#true} #res := ~__retres1~1; {69175#true} is VALID [2022-02-20 20:01:52,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {69175#true} assume true; {69175#true} is VALID [2022-02-20 20:01:52,446 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {69175#true} {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1943#return; {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,447 INFO L290 TraceCheckUtils]: 39: Hoare triple {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:52,447 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {69225#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {69180#(= ~c_dr_st~0 0)} #1949#return; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,448 INFO L272 TraceCheckUtils]: 41: Hoare triple {69180#(= ~c_dr_st~0 0)} call reset_delta_events1(); {69223#(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:52,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {69223#(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); {69175#true} is VALID [2022-02-20 20:01:52,448 INFO L290 TraceCheckUtils]: 43: Hoare triple {69175#true} assume !(1 == ~q_write_ev~0); {69175#true} is VALID [2022-02-20 20:01:52,448 INFO L290 TraceCheckUtils]: 44: Hoare triple {69175#true} assume true; {69175#true} is VALID [2022-02-20 20:01:52,448 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {69175#true} {69180#(= ~c_dr_st~0 0)} #1951#return; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,449 INFO L290 TraceCheckUtils]: 46: Hoare triple {69180#(= ~c_dr_st~0 0)} assume !false; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,449 INFO L290 TraceCheckUtils]: 47: Hoare triple {69180#(= ~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; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,449 INFO L290 TraceCheckUtils]: 48: Hoare triple {69180#(= ~c_dr_st~0 0)} assume !false; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,449 INFO L272 TraceCheckUtils]: 49: Hoare triple {69180#(= ~c_dr_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {69175#true} is VALID [2022-02-20 20:01:52,450 INFO L290 TraceCheckUtils]: 50: Hoare triple {69175#true} havoc ~__retres1~2; {69175#true} is VALID [2022-02-20 20:01:52,450 INFO L290 TraceCheckUtils]: 51: Hoare triple {69175#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {69175#true} is VALID [2022-02-20 20:01:52,450 INFO L290 TraceCheckUtils]: 52: Hoare triple {69175#true} #res := ~__retres1~2; {69175#true} is VALID [2022-02-20 20:01:52,450 INFO L290 TraceCheckUtils]: 53: Hoare triple {69175#true} assume true; {69175#true} is VALID [2022-02-20 20:01:52,450 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {69175#true} {69180#(= ~c_dr_st~0 0)} #1953#return; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,451 INFO L290 TraceCheckUtils]: 55: Hoare triple {69180#(= ~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; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,451 INFO L290 TraceCheckUtils]: 56: Hoare triple {69180#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,451 INFO L290 TraceCheckUtils]: 57: Hoare triple {69180#(= ~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; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,452 INFO L290 TraceCheckUtils]: 58: Hoare triple {69180#(= ~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; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,452 INFO L290 TraceCheckUtils]: 59: Hoare triple {69180#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_pc~0; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,452 INFO L290 TraceCheckUtils]: 60: Hoare triple {69180#(= ~c_dr_st~0 0)} assume !false; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,452 INFO L290 TraceCheckUtils]: 61: Hoare triple {69180#(= ~c_dr_st~0 0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,453 INFO L290 TraceCheckUtils]: 62: Hoare triple {69180#(= ~c_dr_st~0 0)} assume { :end_inline_do_write_p } true; {69180#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:52,453 INFO L290 TraceCheckUtils]: 63: Hoare triple {69180#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {69176#false} is VALID [2022-02-20 20:01:52,453 INFO L290 TraceCheckUtils]: 64: Hoare triple {69176#false} assume !false; {69176#false} is VALID [2022-02-20 20:01:52,453 INFO L272 TraceCheckUtils]: 65: Hoare triple {69176#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {69175#true} is VALID [2022-02-20 20:01:52,453 INFO L290 TraceCheckUtils]: 66: Hoare triple {69175#true} havoc ~__retres1~2; {69175#true} is VALID [2022-02-20 20:01:52,454 INFO L290 TraceCheckUtils]: 67: Hoare triple {69175#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {69175#true} is VALID [2022-02-20 20:01:52,454 INFO L290 TraceCheckUtils]: 68: Hoare triple {69175#true} #res := ~__retres1~2; {69175#true} is VALID [2022-02-20 20:01:52,454 INFO L290 TraceCheckUtils]: 69: Hoare triple {69175#true} assume true; {69175#true} is VALID [2022-02-20 20:01:52,454 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {69175#true} {69176#false} #1953#return; {69176#false} is VALID [2022-02-20 20:01:52,454 INFO L290 TraceCheckUtils]: 71: Hoare triple {69176#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; {69176#false} is VALID [2022-02-20 20:01:52,454 INFO L290 TraceCheckUtils]: 72: Hoare triple {69176#false} assume 0 != eval1_~tmp___1~0#1; {69176#false} is VALID [2022-02-20 20:01:52,454 INFO L290 TraceCheckUtils]: 73: Hoare triple {69176#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; {69176#false} is VALID [2022-02-20 20:01:52,455 INFO L290 TraceCheckUtils]: 74: Hoare triple {69176#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; {69176#false} is VALID [2022-02-20 20:01:52,455 INFO L290 TraceCheckUtils]: 75: Hoare triple {69176#false} assume !(0 == ~p_dw_pc~0); {69176#false} is VALID [2022-02-20 20:01:52,455 INFO L290 TraceCheckUtils]: 76: Hoare triple {69176#false} assume 1 == ~p_dw_pc~0; {69176#false} is VALID [2022-02-20 20:01:52,455 INFO L290 TraceCheckUtils]: 77: Hoare triple {69176#false} assume !(0 == ~q_free~0); {69176#false} is VALID [2022-02-20 20:01:52,455 INFO L290 TraceCheckUtils]: 78: Hoare triple {69176#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; {69176#false} is VALID [2022-02-20 20:01:52,455 INFO L290 TraceCheckUtils]: 79: Hoare triple {69176#false} assume !false; {69176#false} is VALID [2022-02-20 20:01:52,455 INFO L290 TraceCheckUtils]: 80: Hoare triple {69176#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {69176#false} is VALID [2022-02-20 20:01:52,456 INFO L290 TraceCheckUtils]: 81: Hoare triple {69176#false} assume { :end_inline_do_write_p } true; {69176#false} is VALID [2022-02-20 20:01:52,456 INFO L290 TraceCheckUtils]: 82: Hoare triple {69176#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; {69176#false} is VALID [2022-02-20 20:01:52,456 INFO L290 TraceCheckUtils]: 83: Hoare triple {69176#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; {69176#false} is VALID [2022-02-20 20:01:52,456 INFO L290 TraceCheckUtils]: 84: Hoare triple {69176#false} assume !(0 == ~c_dr_pc~0); {69176#false} is VALID [2022-02-20 20:01:52,456 INFO L290 TraceCheckUtils]: 85: Hoare triple {69176#false} assume 2 == ~c_dr_pc~0; {69176#false} is VALID [2022-02-20 20:01:52,456 INFO L290 TraceCheckUtils]: 86: Hoare triple {69176#false} do_read_c_~a~0#1 := ~a_t~0; {69176#false} is VALID [2022-02-20 20:01:52,456 INFO L290 TraceCheckUtils]: 87: Hoare triple {69176#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; {69176#false} is VALID [2022-02-20 20:01:52,457 INFO L290 TraceCheckUtils]: 88: Hoare triple {69176#false} assume !(~p_last_write~0 == ~c_last_read~0); {69176#false} is VALID [2022-02-20 20:01:52,457 INFO L272 TraceCheckUtils]: 89: Hoare triple {69176#false} call error1(); {69176#false} is VALID [2022-02-20 20:01:52,457 INFO L290 TraceCheckUtils]: 90: Hoare triple {69176#false} assume !false; {69176#false} is VALID [2022-02-20 20:01:52,457 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:01:52,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:52,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978085529] [2022-02-20 20:01:52,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978085529] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:52,458 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:52,458 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:01:52,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227409510] [2022-02-20 20:01:52,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:52,459 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:01:52,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:52,460 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:01:52,510 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:01:52,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:01:52,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:52,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:01:52,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:01:52,511 INFO L87 Difference]: Start difference. First operand 1856 states and 2471 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:01:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:54,680 INFO L93 Difference]: Finished difference Result 3432 states and 4527 transitions. [2022-02-20 20:01:54,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:01:54,680 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:01:54,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:54,681 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:01:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 902 transitions. [2022-02-20 20:01:54,685 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:01:54,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 902 transitions. [2022-02-20 20:01:54,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 902 transitions. [2022-02-20 20:01:55,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 902 edges. 902 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:55,449 INFO L225 Difference]: With dead ends: 3432 [2022-02-20 20:01:55,449 INFO L226 Difference]: Without dead ends: 1963 [2022-02-20 20:01:55,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-02-20 20:01:55,452 INFO L933 BasicCegarLoop]: 689 mSDtfsCounter, 1644 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:55,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1678 Valid, 1688 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 20:01:55,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2022-02-20 20:01:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1856. [2022-02-20 20:01:55,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:55,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1963 states. Second operand has 1856 states, 1511 states have (on average 1.328259430840503) internal successors, (2007), 1531 states have internal predecessors, (2007), 190 states have call successors, (190), 120 states have call predecessors, (190), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-02-20 20:01:55,547 INFO L74 IsIncluded]: Start isIncluded. First operand 1963 states. Second operand has 1856 states, 1511 states have (on average 1.328259430840503) internal successors, (2007), 1531 states have internal predecessors, (2007), 190 states have call successors, (190), 120 states have call predecessors, (190), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-02-20 20:01:55,549 INFO L87 Difference]: Start difference. First operand 1963 states. Second operand has 1856 states, 1511 states have (on average 1.328259430840503) internal successors, (2007), 1531 states have internal predecessors, (2007), 190 states have call successors, (190), 120 states have call predecessors, (190), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-02-20 20:01:55,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:55,672 INFO L93 Difference]: Finished difference Result 1963 states and 2583 transitions. [2022-02-20 20:01:55,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2583 transitions. [2022-02-20 20:01:55,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:55,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:55,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 1856 states, 1511 states have (on average 1.328259430840503) internal successors, (2007), 1531 states have internal predecessors, (2007), 190 states have call successors, (190), 120 states have call predecessors, (190), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) Second operand 1963 states. [2022-02-20 20:01:55,682 INFO L87 Difference]: Start difference. First operand has 1856 states, 1511 states have (on average 1.328259430840503) internal successors, (2007), 1531 states have internal predecessors, (2007), 190 states have call successors, (190), 120 states have call predecessors, (190), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) Second operand 1963 states. [2022-02-20 20:01:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:55,793 INFO L93 Difference]: Finished difference Result 1963 states and 2583 transitions. [2022-02-20 20:01:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2583 transitions. [2022-02-20 20:01:55,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:55,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:55,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:55,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1511 states have (on average 1.328259430840503) internal successors, (2007), 1531 states have internal predecessors, (2007), 190 states have call successors, (190), 120 states have call predecessors, (190), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-02-20 20:01:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2435 transitions. [2022-02-20 20:01:55,959 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2435 transitions. Word has length 91 [2022-02-20 20:01:55,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:55,960 INFO L470 AbstractCegarLoop]: Abstraction has 1856 states and 2435 transitions. [2022-02-20 20:01:55,960 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:01:55,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2435 transitions. [2022-02-20 20:01:55,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 20:01:55,961 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:55,961 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:01:55,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:01:55,961 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:55,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:55,962 INFO L85 PathProgramCache]: Analyzing trace with hash -128979882, now seen corresponding path program 1 times [2022-02-20 20:01:55,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:55,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354606059] [2022-02-20 20:01:55,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:55,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:56,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:56,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {80279#(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); {80280#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:56,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {80280#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {80280#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:56,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80280#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {80233#(= ~q_read_ev~0 2)} #1945#return; {80233#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:56,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:56,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {80281#(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); {80231#true} is VALID [2022-02-20 20:01:56,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {80231#true} assume !(0 == ~q_write_ev~0); {80231#true} is VALID [2022-02-20 20:01:56,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {80231#true} assume true; {80231#true} is VALID [2022-02-20 20:01:56,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80231#true} {80233#(= ~q_read_ev~0 2)} #1947#return; {80231#true} is VALID [2022-02-20 20:01:56,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:56,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:56,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {80231#true} havoc ~__retres1~0; {80231#true} is VALID [2022-02-20 20:01:56,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {80231#true} assume !(1 == ~p_dw_pc~0); {80231#true} is VALID [2022-02-20 20:01:56,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {80231#true} assume !(2 == ~p_dw_pc~0); {80231#true} is VALID [2022-02-20 20:01:56,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {80231#true} ~__retres1~0 := 0; {80231#true} is VALID [2022-02-20 20:01:56,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {80231#true} #res := ~__retres1~0; {80231#true} is VALID [2022-02-20 20:01:56,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {80231#true} assume true; {80231#true} is VALID [2022-02-20 20:01:56,028 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {80231#true} {80231#true} #1941#return; {80231#true} is VALID [2022-02-20 20:01:56,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:56,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {80231#true} havoc ~__retres1~1; {80231#true} is VALID [2022-02-20 20:01:56,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {80231#true} assume !(1 == ~c_dr_pc~0); {80231#true} is VALID [2022-02-20 20:01:56,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {80231#true} assume !(2 == ~c_dr_pc~0); {80231#true} is VALID [2022-02-20 20:01:56,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {80231#true} ~__retres1~1 := 0; {80231#true} is VALID [2022-02-20 20:01:56,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {80231#true} #res := ~__retres1~1; {80231#true} is VALID [2022-02-20 20:01:56,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {80231#true} assume true; {80231#true} is VALID [2022-02-20 20:01:56,031 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {80231#true} {80231#true} #1943#return; {80231#true} is VALID [2022-02-20 20:01:56,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {80282#(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; {80231#true} is VALID [2022-02-20 20:01:56,031 INFO L272 TraceCheckUtils]: 1: Hoare triple {80231#true} call #t~ret8 := is_do_write_p_triggered(); {80231#true} is VALID [2022-02-20 20:01:56,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {80231#true} havoc ~__retres1~0; {80231#true} is VALID [2022-02-20 20:01:56,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {80231#true} assume !(1 == ~p_dw_pc~0); {80231#true} is VALID [2022-02-20 20:01:56,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {80231#true} assume !(2 == ~p_dw_pc~0); {80231#true} is VALID [2022-02-20 20:01:56,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {80231#true} ~__retres1~0 := 0; {80231#true} is VALID [2022-02-20 20:01:56,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {80231#true} #res := ~__retres1~0; {80231#true} is VALID [2022-02-20 20:01:56,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {80231#true} assume true; {80231#true} is VALID [2022-02-20 20:01:56,032 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {80231#true} {80231#true} #1941#return; {80231#true} is VALID [2022-02-20 20:01:56,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {80231#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {80231#true} is VALID [2022-02-20 20:01:56,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {80231#true} assume !(0 != ~tmp~1); {80231#true} is VALID [2022-02-20 20:01:56,032 INFO L272 TraceCheckUtils]: 11: Hoare triple {80231#true} call #t~ret9 := is_do_read_c_triggered(); {80231#true} is VALID [2022-02-20 20:01:56,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {80231#true} havoc ~__retres1~1; {80231#true} is VALID [2022-02-20 20:01:56,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {80231#true} assume !(1 == ~c_dr_pc~0); {80231#true} is VALID [2022-02-20 20:01:56,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {80231#true} assume !(2 == ~c_dr_pc~0); {80231#true} is VALID [2022-02-20 20:01:56,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {80231#true} ~__retres1~1 := 0; {80231#true} is VALID [2022-02-20 20:01:56,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {80231#true} #res := ~__retres1~1; {80231#true} is VALID [2022-02-20 20:01:56,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {80231#true} assume true; {80231#true} is VALID [2022-02-20 20:01:56,033 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {80231#true} {80231#true} #1943#return; {80231#true} is VALID [2022-02-20 20:01:56,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {80231#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {80231#true} is VALID [2022-02-20 20:01:56,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {80231#true} assume !(0 != ~tmp___0~1); {80231#true} is VALID [2022-02-20 20:01:56,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {80231#true} assume true; {80231#true} is VALID [2022-02-20 20:01:56,034 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {80231#true} {80231#true} #1949#return; {80231#true} is VALID [2022-02-20 20:01:56,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:56,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {80281#(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); {80231#true} is VALID [2022-02-20 20:01:56,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {80231#true} assume !(1 == ~q_write_ev~0); {80231#true} is VALID [2022-02-20 20:01:56,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {80231#true} assume true; {80231#true} is VALID [2022-02-20 20:01:56,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80231#true} {80231#true} #1951#return; {80231#true} is VALID [2022-02-20 20:01:56,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:56,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {80231#true} havoc ~__retres1~2; {80231#true} is VALID [2022-02-20 20:01:56,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {80231#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {80231#true} is VALID [2022-02-20 20:01:56,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {80231#true} #res := ~__retres1~2; {80231#true} is VALID [2022-02-20 20:01:56,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {80231#true} assume true; {80231#true} is VALID [2022-02-20 20:01:56,039 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {80231#true} {80231#true} #1953#return; {80231#true} is VALID [2022-02-20 20:01:56,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:01:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:56,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {80231#true} havoc ~__retres1~2; {80231#true} is VALID [2022-02-20 20:01:56,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {80231#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {80297#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:56,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {80297#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {80297#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:56,048 INFO L290 TraceCheckUtils]: 3: Hoare triple {80297#(= ~p_dw_st~0 0)} assume true; {80297#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:56,048 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {80297#(= ~p_dw_st~0 0)} {80273#(not (= ~p_dw_st~0 0))} #1953#return; {80232#false} is VALID [2022-02-20 20:01:56,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {80231#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; {80231#true} is VALID [2022-02-20 20:01:56,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {80231#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {80231#true} is VALID [2022-02-20 20:01:56,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {80231#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {80233#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:56,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {80233#(= ~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; {80233#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:56,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {80233#(= ~q_read_ev~0 2)} call update_channels1(); {80279#(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:56,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {80279#(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); {80280#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:56,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {80280#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {80280#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:56,051 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {80280#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {80233#(= ~q_read_ev~0 2)} #1945#return; {80233#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:56,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {80233#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {80233#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:56,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {80233#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {80233#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:56,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {80233#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {80233#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:56,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {80233#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {80233#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:56,053 INFO L272 TraceCheckUtils]: 12: Hoare triple {80233#(= ~q_read_ev~0 2)} call fire_delta_events1(); {80281#(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:56,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {80281#(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); {80231#true} is VALID [2022-02-20 20:01:56,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {80231#true} assume !(0 == ~q_write_ev~0); {80231#true} is VALID [2022-02-20 20:01:56,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {80231#true} assume true; {80231#true} is VALID [2022-02-20 20:01:56,053 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {80231#true} {80233#(= ~q_read_ev~0 2)} #1947#return; {80231#true} is VALID [2022-02-20 20:01:56,054 INFO L272 TraceCheckUtils]: 17: Hoare triple {80231#true} call activate_threads1(); {80282#(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:56,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {80282#(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; {80231#true} is VALID [2022-02-20 20:01:56,054 INFO L272 TraceCheckUtils]: 19: Hoare triple {80231#true} call #t~ret8 := is_do_write_p_triggered(); {80231#true} is VALID [2022-02-20 20:01:56,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {80231#true} havoc ~__retres1~0; {80231#true} is VALID [2022-02-20 20:01:56,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {80231#true} assume !(1 == ~p_dw_pc~0); {80231#true} is VALID [2022-02-20 20:01:56,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {80231#true} assume !(2 == ~p_dw_pc~0); {80231#true} is VALID [2022-02-20 20:01:56,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {80231#true} ~__retres1~0 := 0; {80231#true} is VALID [2022-02-20 20:01:56,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {80231#true} #res := ~__retres1~0; {80231#true} is VALID [2022-02-20 20:01:56,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {80231#true} assume true; {80231#true} is VALID [2022-02-20 20:01:56,055 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {80231#true} {80231#true} #1941#return; {80231#true} is VALID [2022-02-20 20:01:56,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {80231#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {80231#true} is VALID [2022-02-20 20:01:56,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {80231#true} assume !(0 != ~tmp~1); {80231#true} is VALID [2022-02-20 20:01:56,055 INFO L272 TraceCheckUtils]: 29: Hoare triple {80231#true} call #t~ret9 := is_do_read_c_triggered(); {80231#true} is VALID [2022-02-20 20:01:56,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {80231#true} havoc ~__retres1~1; {80231#true} is VALID [2022-02-20 20:01:56,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {80231#true} assume !(1 == ~c_dr_pc~0); {80231#true} is VALID [2022-02-20 20:01:56,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {80231#true} assume !(2 == ~c_dr_pc~0); {80231#true} is VALID [2022-02-20 20:01:56,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {80231#true} ~__retres1~1 := 0; {80231#true} is VALID [2022-02-20 20:01:56,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {80231#true} #res := ~__retres1~1; {80231#true} is VALID [2022-02-20 20:01:56,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {80231#true} assume true; {80231#true} is VALID [2022-02-20 20:01:56,056 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {80231#true} {80231#true} #1943#return; {80231#true} is VALID [2022-02-20 20:01:56,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {80231#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {80231#true} is VALID [2022-02-20 20:01:56,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {80231#true} assume !(0 != ~tmp___0~1); {80231#true} is VALID [2022-02-20 20:01:56,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {80231#true} assume true; {80231#true} is VALID [2022-02-20 20:01:56,057 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {80231#true} {80231#true} #1949#return; {80231#true} is VALID [2022-02-20 20:01:56,057 INFO L272 TraceCheckUtils]: 41: Hoare triple {80231#true} call reset_delta_events1(); {80281#(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:56,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {80281#(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); {80231#true} is VALID [2022-02-20 20:01:56,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {80231#true} assume !(1 == ~q_write_ev~0); {80231#true} is VALID [2022-02-20 20:01:56,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {80231#true} assume true; {80231#true} is VALID [2022-02-20 20:01:56,058 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {80231#true} {80231#true} #1951#return; {80231#true} is VALID [2022-02-20 20:01:56,059 INFO L290 TraceCheckUtils]: 46: Hoare triple {80231#true} assume !false; {80231#true} is VALID [2022-02-20 20:01:56,059 INFO L290 TraceCheckUtils]: 47: Hoare triple {80231#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; {80231#true} is VALID [2022-02-20 20:01:56,059 INFO L290 TraceCheckUtils]: 48: Hoare triple {80231#true} assume !false; {80231#true} is VALID [2022-02-20 20:01:56,059 INFO L272 TraceCheckUtils]: 49: Hoare triple {80231#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {80231#true} is VALID [2022-02-20 20:01:56,059 INFO L290 TraceCheckUtils]: 50: Hoare triple {80231#true} havoc ~__retres1~2; {80231#true} is VALID [2022-02-20 20:01:56,059 INFO L290 TraceCheckUtils]: 51: Hoare triple {80231#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {80231#true} is VALID [2022-02-20 20:01:56,059 INFO L290 TraceCheckUtils]: 52: Hoare triple {80231#true} #res := ~__retres1~2; {80231#true} is VALID [2022-02-20 20:01:56,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {80231#true} assume true; {80231#true} is VALID [2022-02-20 20:01:56,060 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {80231#true} {80231#true} #1953#return; {80231#true} is VALID [2022-02-20 20:01:56,060 INFO L290 TraceCheckUtils]: 55: Hoare triple {80231#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; {80231#true} is VALID [2022-02-20 20:01:56,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {80231#true} assume 0 != eval1_~tmp___1~0#1; {80231#true} is VALID [2022-02-20 20:01:56,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {80231#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; {80231#true} is VALID [2022-02-20 20:01:56,060 INFO L290 TraceCheckUtils]: 58: Hoare triple {80231#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; {80231#true} is VALID [2022-02-20 20:01:56,060 INFO L290 TraceCheckUtils]: 59: Hoare triple {80231#true} assume 0 == ~p_dw_pc~0; {80231#true} is VALID [2022-02-20 20:01:56,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {80231#true} assume !false; {80231#true} is VALID [2022-02-20 20:01:56,061 INFO L290 TraceCheckUtils]: 61: Hoare triple {80231#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {80273#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:56,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {80273#(not (= ~p_dw_st~0 0))} assume { :end_inline_do_write_p } true; {80273#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:56,061 INFO L290 TraceCheckUtils]: 63: Hoare triple {80273#(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; {80273#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:56,062 INFO L290 TraceCheckUtils]: 64: Hoare triple {80273#(not (= ~p_dw_st~0 0))} assume !(0 != eval1_~tmp___0~2#1); {80273#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:56,062 INFO L290 TraceCheckUtils]: 65: Hoare triple {80273#(not (= ~p_dw_st~0 0))} assume !false; {80273#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:56,062 INFO L272 TraceCheckUtils]: 66: Hoare triple {80273#(not (= ~p_dw_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {80231#true} is VALID [2022-02-20 20:01:56,062 INFO L290 TraceCheckUtils]: 67: Hoare triple {80231#true} havoc ~__retres1~2; {80231#true} is VALID [2022-02-20 20:01:56,063 INFO L290 TraceCheckUtils]: 68: Hoare triple {80231#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {80297#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:56,063 INFO L290 TraceCheckUtils]: 69: Hoare triple {80297#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {80297#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:56,063 INFO L290 TraceCheckUtils]: 70: Hoare triple {80297#(= ~p_dw_st~0 0)} assume true; {80297#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:56,064 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {80297#(= ~p_dw_st~0 0)} {80273#(not (= ~p_dw_st~0 0))} #1953#return; {80232#false} is VALID [2022-02-20 20:01:56,064 INFO L290 TraceCheckUtils]: 72: Hoare triple {80232#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; {80232#false} is VALID [2022-02-20 20:01:56,064 INFO L290 TraceCheckUtils]: 73: Hoare triple {80232#false} assume 0 != eval1_~tmp___1~0#1; {80232#false} is VALID [2022-02-20 20:01:56,064 INFO L290 TraceCheckUtils]: 74: Hoare triple {80232#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; {80232#false} is VALID [2022-02-20 20:01:56,064 INFO L290 TraceCheckUtils]: 75: Hoare triple {80232#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; {80232#false} is VALID [2022-02-20 20:01:56,064 INFO L290 TraceCheckUtils]: 76: Hoare triple {80232#false} assume !(0 == ~p_dw_pc~0); {80232#false} is VALID [2022-02-20 20:01:56,065 INFO L290 TraceCheckUtils]: 77: Hoare triple {80232#false} assume 1 == ~p_dw_pc~0; {80232#false} is VALID [2022-02-20 20:01:56,065 INFO L290 TraceCheckUtils]: 78: Hoare triple {80232#false} assume !(0 == ~q_free~0); {80232#false} is VALID [2022-02-20 20:01:56,065 INFO L290 TraceCheckUtils]: 79: Hoare triple {80232#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; {80232#false} is VALID [2022-02-20 20:01:56,065 INFO L290 TraceCheckUtils]: 80: Hoare triple {80232#false} assume !false; {80232#false} is VALID [2022-02-20 20:01:56,065 INFO L290 TraceCheckUtils]: 81: Hoare triple {80232#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {80232#false} is VALID [2022-02-20 20:01:56,065 INFO L290 TraceCheckUtils]: 82: Hoare triple {80232#false} assume { :end_inline_do_write_p } true; {80232#false} is VALID [2022-02-20 20:01:56,065 INFO L290 TraceCheckUtils]: 83: Hoare triple {80232#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; {80232#false} is VALID [2022-02-20 20:01:56,065 INFO L290 TraceCheckUtils]: 84: Hoare triple {80232#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; {80232#false} is VALID [2022-02-20 20:01:56,066 INFO L290 TraceCheckUtils]: 85: Hoare triple {80232#false} assume !(0 == ~c_dr_pc~0); {80232#false} is VALID [2022-02-20 20:01:56,066 INFO L290 TraceCheckUtils]: 86: Hoare triple {80232#false} assume 2 == ~c_dr_pc~0; {80232#false} is VALID [2022-02-20 20:01:56,066 INFO L290 TraceCheckUtils]: 87: Hoare triple {80232#false} do_read_c_~a~0#1 := ~a_t~0; {80232#false} is VALID [2022-02-20 20:01:56,066 INFO L290 TraceCheckUtils]: 88: Hoare triple {80232#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; {80232#false} is VALID [2022-02-20 20:01:56,066 INFO L290 TraceCheckUtils]: 89: Hoare triple {80232#false} assume !(~p_last_write~0 == ~c_last_read~0); {80232#false} is VALID [2022-02-20 20:01:56,066 INFO L272 TraceCheckUtils]: 90: Hoare triple {80232#false} call error1(); {80232#false} is VALID [2022-02-20 20:01:56,066 INFO L290 TraceCheckUtils]: 91: Hoare triple {80232#false} assume !false; {80232#false} is VALID [2022-02-20 20:01:56,067 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:01:56,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:56,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354606059] [2022-02-20 20:01:56,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354606059] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:56,067 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:56,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:56,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382221978] [2022-02-20 20:01:56,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:56,068 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:01:56,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:56,068 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:01:56,123 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:01:56,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:56,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:56,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:56,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:56,124 INFO L87 Difference]: Start difference. First operand 1856 states and 2435 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)