./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.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.04.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 bd466f23ab481babcc03c4173983e1af9100c535496f2e2f8c8fc18a8aaf4174 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:43,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:43,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:43,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:43,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:43,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:43,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:43,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:43,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:43,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:43,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:43,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:43,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:43,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:43,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:43,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:43,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:43,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:43,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:43,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:43,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:43,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:43,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:43,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:43,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:43,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:43,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:43,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:43,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:43,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:43,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:43,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:43,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:43,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:43,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:43,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:43,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:43,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:43,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:43,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:43,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:43,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:59:43,889 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:43,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:43,890 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:43,890 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:43,891 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:43,891 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:43,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:43,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:43,892 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:43,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:43,892 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:43,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:43,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:43,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:43,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:43,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:43,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:43,893 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:43,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:43,894 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:43,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:43,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:43,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:43,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:43,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:43,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:43,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:43,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:43,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:43,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:43,897 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:43,897 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:43,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:43,897 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 -> bd466f23ab481babcc03c4173983e1af9100c535496f2e2f8c8fc18a8aaf4174 [2022-02-20 19:59:44,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:44,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:44,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:44,085 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:44,086 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:44,087 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.04.cil-2.c [2022-02-20 19:59:44,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fecaa162/42ff9b6fb8ce4e179a08199633c475ed/FLAG694f07350 [2022-02-20 19:59:44,515 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:44,516 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-2.c [2022-02-20 19:59:44,524 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fecaa162/42ff9b6fb8ce4e179a08199633c475ed/FLAG694f07350 [2022-02-20 19:59:44,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fecaa162/42ff9b6fb8ce4e179a08199633c475ed [2022-02-20 19:59:44,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:44,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:44,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:44,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:44,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:44,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:44" (1/1) ... [2022-02-20 19:59:44,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ecbc20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:44, skipping insertion in model container [2022-02-20 19:59:44,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:44" (1/1) ... [2022-02-20 19:59:44,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:44,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:44,692 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.04.cil-2.c[911,924] [2022-02-20 19:59:44,731 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.04.cil-2.c[8416,8429] [2022-02-20 19:59:44,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:44,778 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:44,785 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.04.cil-2.c[911,924] [2022-02-20 19:59:44,801 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.04.cil-2.c[8416,8429] [2022-02-20 19:59:44,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:44,837 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:44,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:44 WrapperNode [2022-02-20 19:59:44,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:44,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:44,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:44,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:44,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:44" (1/1) ... [2022-02-20 19:59:44,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:44" (1/1) ... [2022-02-20 19:59:44,903 INFO L137 Inliner]: procedures = 63, calls = 74, calls flagged for inlining = 31, calls inlined = 31, statements flattened = 619 [2022-02-20 19:59:44,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:44,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:44,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:44,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:44,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:44" (1/1) ... [2022-02-20 19:59:44,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:44" (1/1) ... [2022-02-20 19:59:44,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:44" (1/1) ... [2022-02-20 19:59:44,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:44" (1/1) ... [2022-02-20 19:59:44,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:44" (1/1) ... [2022-02-20 19:59:44,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:44" (1/1) ... [2022-02-20 19:59:44,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:44" (1/1) ... [2022-02-20 19:59:44,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:44,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:44,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:44,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:44,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:44" (1/1) ... [2022-02-20 19:59:44,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:44,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:44,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:59:44,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:59:45,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:45,001 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:45,001 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:45,001 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:45,001 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:45,001 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:45,001 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:45,001 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:45,001 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:45,002 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:45,002 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:45,002 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:45,003 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:45,003 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:45,003 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:45,006 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:45,007 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:45,007 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:45,007 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:45,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:45,007 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:45,007 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:45,007 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:45,007 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:45,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:45,008 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:59:45,008 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:59:45,084 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:45,086 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:45,575 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 19:59:45,575 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 19:59:45,607 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:45,615 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:45,615 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-02-20 19:59:45,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:45 BoogieIcfgContainer [2022-02-20 19:59:45,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:45,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:45,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:45,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:45,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:44" (1/3) ... [2022-02-20 19:59:45,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e759286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:45, skipping insertion in model container [2022-02-20 19:59:45,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:44" (2/3) ... [2022-02-20 19:59:45,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e759286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:45, skipping insertion in model container [2022-02-20 19:59:45,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:45" (3/3) ... [2022-02-20 19:59:45,623 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.04.cil-2.c [2022-02-20 19:59:45,627 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:45,627 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:45,657 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:45,662 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:59:45,662 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 307 states, 253 states have (on average 1.592885375494071) internal successors, (403), 261 states have internal predecessors, (403), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-20 19:59:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:45,689 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:45,690 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:45,690 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:45,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:45,694 INFO L85 PathProgramCache]: Analyzing trace with hash 101820907, now seen corresponding path program 1 times [2022-02-20 19:59:45,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:45,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159835836] [2022-02-20 19:59:45,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:45,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {350#(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); {351#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:45,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {351#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {351#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:45,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {351#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {312#(= ~q_write_ev~0 ~q_read_ev~0)} #1078#return; {312#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:45,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {351#(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); {352#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:45,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {352#(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; {353#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:45,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {353#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {353#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:46,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {353#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {312#(= ~q_write_ev~0 ~q_read_ev~0)} #1080#return; {311#false} is VALID [2022-02-20 19:59:46,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {310#true} havoc ~__retres1~0; {310#true} is VALID [2022-02-20 19:59:46,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#true} assume 1 == ~p_dw_pc~0; {310#true} is VALID [2022-02-20 19:59:46,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {310#true} is VALID [2022-02-20 19:59:46,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {310#true} #res := ~__retres1~0; {310#true} is VALID [2022-02-20 19:59:46,050 INFO L290 TraceCheckUtils]: 4: Hoare triple {310#true} assume true; {310#true} is VALID [2022-02-20 19:59:46,050 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {310#true} {310#true} #1074#return; {310#true} is VALID [2022-02-20 19:59:46,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {310#true} havoc ~__retres1~1; {310#true} is VALID [2022-02-20 19:59:46,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#true} assume 1 == ~c_dr_pc~0; {310#true} is VALID [2022-02-20 19:59:46,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {310#true} is VALID [2022-02-20 19:59:46,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {310#true} #res := ~__retres1~1; {310#true} is VALID [2022-02-20 19:59:46,067 INFO L290 TraceCheckUtils]: 4: Hoare triple {310#true} assume true; {310#true} is VALID [2022-02-20 19:59:46,067 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {310#true} {310#true} #1076#return; {310#true} is VALID [2022-02-20 19:59:46,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {354#(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; {310#true} is VALID [2022-02-20 19:59:46,068 INFO L272 TraceCheckUtils]: 1: Hoare triple {310#true} call #t~ret8 := is_do_write_p_triggered(); {310#true} is VALID [2022-02-20 19:59:46,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} havoc ~__retres1~0; {310#true} is VALID [2022-02-20 19:59:46,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {310#true} assume 1 == ~p_dw_pc~0; {310#true} is VALID [2022-02-20 19:59:46,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {310#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {310#true} is VALID [2022-02-20 19:59:46,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {310#true} #res := ~__retres1~0; {310#true} is VALID [2022-02-20 19:59:46,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {310#true} assume true; {310#true} is VALID [2022-02-20 19:59:46,069 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {310#true} {310#true} #1074#return; {310#true} is VALID [2022-02-20 19:59:46,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {310#true} is VALID [2022-02-20 19:59:46,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {310#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {310#true} is VALID [2022-02-20 19:59:46,069 INFO L272 TraceCheckUtils]: 10: Hoare triple {310#true} call #t~ret9 := is_do_read_c_triggered(); {310#true} is VALID [2022-02-20 19:59:46,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {310#true} havoc ~__retres1~1; {310#true} is VALID [2022-02-20 19:59:46,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {310#true} assume 1 == ~c_dr_pc~0; {310#true} is VALID [2022-02-20 19:59:46,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {310#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {310#true} is VALID [2022-02-20 19:59:46,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {310#true} #res := ~__retres1~1; {310#true} is VALID [2022-02-20 19:59:46,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {310#true} assume true; {310#true} is VALID [2022-02-20 19:59:46,070 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {310#true} {310#true} #1076#return; {310#true} is VALID [2022-02-20 19:59:46,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {310#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {310#true} is VALID [2022-02-20 19:59:46,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {310#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {310#true} is VALID [2022-02-20 19:59:46,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {310#true} assume true; {310#true} is VALID [2022-02-20 19:59:46,071 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {310#true} {311#false} #1082#return; {311#false} is VALID [2022-02-20 19:59:46,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {351#(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; {310#true} is VALID [2022-02-20 19:59:46,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {310#true} is VALID [2022-02-20 19:59:46,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} assume true; {310#true} is VALID [2022-02-20 19:59:46,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {310#true} {311#false} #1084#return; {311#false} is VALID [2022-02-20 19:59:46,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {310#true} havoc ~__retres1~2; {310#true} is VALID [2022-02-20 19:59:46,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {310#true} is VALID [2022-02-20 19:59:46,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} #res := ~__retres1~2; {310#true} is VALID [2022-02-20 19:59:46,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {310#true} assume true; {310#true} is VALID [2022-02-20 19:59:46,083 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {310#true} {311#false} #1086#return; {311#false} is VALID [2022-02-20 19:59:46,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {310#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {310#true} is VALID [2022-02-20 19:59:46,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {310#true} is VALID [2022-02-20 19:59:46,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {312#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#(= ~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; {312#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {312#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {350#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:46,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {350#(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); {351#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {351#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {351#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,087 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {351#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {312#(= ~q_write_ev~0 ~q_read_ev~0)} #1078#return; {312#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {312#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {312#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {312#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {312#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {312#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {312#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {312#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:46,089 INFO L272 TraceCheckUtils]: 12: Hoare triple {312#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {351#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {351#(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); {352#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:46,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {352#(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; {353#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:46,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {353#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {353#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:46,091 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {353#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {312#(= ~q_write_ev~0 ~q_read_ev~0)} #1080#return; {311#false} is VALID [2022-02-20 19:59:46,092 INFO L272 TraceCheckUtils]: 17: Hoare triple {311#false} call activate_threads1(); {354#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:46,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {354#(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; {310#true} is VALID [2022-02-20 19:59:46,092 INFO L272 TraceCheckUtils]: 19: Hoare triple {310#true} call #t~ret8 := is_do_write_p_triggered(); {310#true} is VALID [2022-02-20 19:59:46,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#true} havoc ~__retres1~0; {310#true} is VALID [2022-02-20 19:59:46,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {310#true} assume 1 == ~p_dw_pc~0; {310#true} is VALID [2022-02-20 19:59:46,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {310#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {310#true} is VALID [2022-02-20 19:59:46,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {310#true} #res := ~__retres1~0; {310#true} is VALID [2022-02-20 19:59:46,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {310#true} assume true; {310#true} is VALID [2022-02-20 19:59:46,093 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {310#true} {310#true} #1074#return; {310#true} is VALID [2022-02-20 19:59:46,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {310#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {310#true} is VALID [2022-02-20 19:59:46,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {310#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {310#true} is VALID [2022-02-20 19:59:46,094 INFO L272 TraceCheckUtils]: 28: Hoare triple {310#true} call #t~ret9 := is_do_read_c_triggered(); {310#true} is VALID [2022-02-20 19:59:46,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {310#true} havoc ~__retres1~1; {310#true} is VALID [2022-02-20 19:59:46,094 INFO L290 TraceCheckUtils]: 30: Hoare triple {310#true} assume 1 == ~c_dr_pc~0; {310#true} is VALID [2022-02-20 19:59:46,094 INFO L290 TraceCheckUtils]: 31: Hoare triple {310#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {310#true} is VALID [2022-02-20 19:59:46,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {310#true} #res := ~__retres1~1; {310#true} is VALID [2022-02-20 19:59:46,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {310#true} assume true; {310#true} is VALID [2022-02-20 19:59:46,095 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {310#true} {310#true} #1076#return; {310#true} is VALID [2022-02-20 19:59:46,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {310#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {310#true} is VALID [2022-02-20 19:59:46,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {310#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {310#true} is VALID [2022-02-20 19:59:46,095 INFO L290 TraceCheckUtils]: 37: Hoare triple {310#true} assume true; {310#true} is VALID [2022-02-20 19:59:46,095 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {310#true} {311#false} #1082#return; {311#false} is VALID [2022-02-20 19:59:46,096 INFO L272 TraceCheckUtils]: 39: Hoare triple {311#false} call reset_delta_events1(); {351#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:46,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {351#(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; {310#true} is VALID [2022-02-20 19:59:46,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {310#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {310#true} is VALID [2022-02-20 19:59:46,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {310#true} assume true; {310#true} is VALID [2022-02-20 19:59:46,096 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {310#true} {311#false} #1084#return; {311#false} is VALID [2022-02-20 19:59:46,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {311#false} assume !false; {311#false} is VALID [2022-02-20 19:59:46,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {311#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; {311#false} is VALID [2022-02-20 19:59:46,097 INFO L290 TraceCheckUtils]: 46: Hoare triple {311#false} assume !false; {311#false} is VALID [2022-02-20 19:59:46,097 INFO L272 TraceCheckUtils]: 47: Hoare triple {311#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {310#true} is VALID [2022-02-20 19:59:46,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {310#true} havoc ~__retres1~2; {310#true} is VALID [2022-02-20 19:59:46,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {310#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {310#true} is VALID [2022-02-20 19:59:46,098 INFO L290 TraceCheckUtils]: 50: Hoare triple {310#true} #res := ~__retres1~2; {310#true} is VALID [2022-02-20 19:59:46,098 INFO L290 TraceCheckUtils]: 51: Hoare triple {310#true} assume true; {310#true} is VALID [2022-02-20 19:59:46,098 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {310#true} {311#false} #1086#return; {311#false} is VALID [2022-02-20 19:59:46,098 INFO L290 TraceCheckUtils]: 53: Hoare triple {311#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; {311#false} is VALID [2022-02-20 19:59:46,098 INFO L290 TraceCheckUtils]: 54: Hoare triple {311#false} assume 0 != eval1_~tmp___1~0#1; {311#false} is VALID [2022-02-20 19:59:46,099 INFO L290 TraceCheckUtils]: 55: Hoare triple {311#false} assume !(0 == ~p_dw_st~0); {311#false} is VALID [2022-02-20 19:59:46,099 INFO L290 TraceCheckUtils]: 56: Hoare triple {311#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; {311#false} is VALID [2022-02-20 19:59:46,099 INFO L290 TraceCheckUtils]: 57: Hoare triple {311#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; {311#false} is VALID [2022-02-20 19:59:46,099 INFO L290 TraceCheckUtils]: 58: Hoare triple {311#false} assume !(0 == ~c_dr_pc~0); {311#false} is VALID [2022-02-20 19:59:46,099 INFO L290 TraceCheckUtils]: 59: Hoare triple {311#false} assume 2 == ~c_dr_pc~0; {311#false} is VALID [2022-02-20 19:59:46,100 INFO L290 TraceCheckUtils]: 60: Hoare triple {311#false} do_read_c_~a~0#1 := ~a_t~0; {311#false} is VALID [2022-02-20 19:59:46,100 INFO L290 TraceCheckUtils]: 61: Hoare triple {311#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; {311#false} is VALID [2022-02-20 19:59:46,100 INFO L290 TraceCheckUtils]: 62: Hoare triple {311#false} assume !(~p_last_write~0 == ~c_last_read~0); {311#false} is VALID [2022-02-20 19:59:46,100 INFO L272 TraceCheckUtils]: 63: Hoare triple {311#false} call error1(); {311#false} is VALID [2022-02-20 19:59:46,100 INFO L290 TraceCheckUtils]: 64: Hoare triple {311#false} assume !false; {311#false} is VALID [2022-02-20 19:59:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:46,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:46,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159835836] [2022-02-20 19:59:46,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159835836] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:46,102 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:46,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:46,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451291450] [2022-02-20 19:59:46,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:46,108 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:59:46,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:46,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:46,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:46,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:46,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:46,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:46,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:46,185 INFO L87 Difference]: Start difference. First operand has 307 states, 253 states have (on average 1.592885375494071) internal successors, (403), 261 states have internal predecessors, (403), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:49,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:49,366 INFO L93 Difference]: Finished difference Result 779 states and 1210 transitions. [2022-02-20 19:59:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:49,367 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:59:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1210 transitions. [2022-02-20 19:59:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:49,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1210 transitions. [2022-02-20 19:59:49,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1210 transitions. [2022-02-20 19:59:50,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1210 edges. 1210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:50,187 INFO L225 Difference]: With dead ends: 779 [2022-02-20 19:59:50,187 INFO L226 Difference]: Without dead ends: 482 [2022-02-20 19:59:50,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:50,198 INFO L933 BasicCegarLoop]: 537 mSDtfsCounter, 859 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:50,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [885 Valid, 1958 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:59:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-02-20 19:59:50,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 412. [2022-02-20 19:59:50,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:50,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 482 states. Second operand has 412 states, 338 states have (on average 1.4881656804733727) internal successors, (503), 346 states have internal predecessors, (503), 49 states have call successors, (49), 22 states have call predecessors, (49), 23 states have return successors, (56), 46 states have call predecessors, (56), 45 states have call successors, (56) [2022-02-20 19:59:50,254 INFO L74 IsIncluded]: Start isIncluded. First operand 482 states. Second operand has 412 states, 338 states have (on average 1.4881656804733727) internal successors, (503), 346 states have internal predecessors, (503), 49 states have call successors, (49), 22 states have call predecessors, (49), 23 states have return successors, (56), 46 states have call predecessors, (56), 45 states have call successors, (56) [2022-02-20 19:59:50,256 INFO L87 Difference]: Start difference. First operand 482 states. Second operand has 412 states, 338 states have (on average 1.4881656804733727) internal successors, (503), 346 states have internal predecessors, (503), 49 states have call successors, (49), 22 states have call predecessors, (49), 23 states have return successors, (56), 46 states have call predecessors, (56), 45 states have call successors, (56) [2022-02-20 19:59:50,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:50,274 INFO L93 Difference]: Finished difference Result 482 states and 716 transitions. [2022-02-20 19:59:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 716 transitions. [2022-02-20 19:59:50,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:50,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:50,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 412 states, 338 states have (on average 1.4881656804733727) internal successors, (503), 346 states have internal predecessors, (503), 49 states have call successors, (49), 22 states have call predecessors, (49), 23 states have return successors, (56), 46 states have call predecessors, (56), 45 states have call successors, (56) Second operand 482 states. [2022-02-20 19:59:50,281 INFO L87 Difference]: Start difference. First operand has 412 states, 338 states have (on average 1.4881656804733727) internal successors, (503), 346 states have internal predecessors, (503), 49 states have call successors, (49), 22 states have call predecessors, (49), 23 states have return successors, (56), 46 states have call predecessors, (56), 45 states have call successors, (56) Second operand 482 states. [2022-02-20 19:59:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:50,298 INFO L93 Difference]: Finished difference Result 482 states and 716 transitions. [2022-02-20 19:59:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 716 transitions. [2022-02-20 19:59:50,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:50,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:50,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:50,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:50,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 338 states have (on average 1.4881656804733727) internal successors, (503), 346 states have internal predecessors, (503), 49 states have call successors, (49), 22 states have call predecessors, (49), 23 states have return successors, (56), 46 states have call predecessors, (56), 45 states have call successors, (56) [2022-02-20 19:59:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 608 transitions. [2022-02-20 19:59:50,317 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 608 transitions. Word has length 65 [2022-02-20 19:59:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:50,318 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 608 transitions. [2022-02-20 19:59:50,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 608 transitions. [2022-02-20 19:59:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:50,320 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:50,320 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:50,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:59:50,320 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:50,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:50,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1926765203, now seen corresponding path program 1 times [2022-02-20 19:59:50,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:50,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002905564] [2022-02-20 19:59:50,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:50,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {3006#(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); {3007#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:50,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {3007#(not (= |old(~q_req_up~0)| 1))} assume true; {3007#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:50,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3007#(not (= |old(~q_req_up~0)| 1))} {2967#(= ~q_req_up~0 ~p_dw_pc~0)} #1078#return; {2971#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:50,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {3008#(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); {2964#true} is VALID [2022-02-20 19:59:50,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {2964#true} assume !(0 == ~q_write_ev~0); {2964#true} is VALID [2022-02-20 19:59:50,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {2964#true} assume true; {2964#true} is VALID [2022-02-20 19:59:50,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2964#true} {2971#(not (= ~p_dw_pc~0 1))} #1080#return; {2971#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:50,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {2964#true} havoc ~__retres1~0; {2964#true} is VALID [2022-02-20 19:59:50,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {2964#true} assume 1 == ~p_dw_pc~0; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,426 INFO L290 TraceCheckUtils]: 3: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,426 INFO L290 TraceCheckUtils]: 4: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,427 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} {2964#true} #1074#return; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {2964#true} havoc ~__retres1~1; {2964#true} is VALID [2022-02-20 19:59:50,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {2964#true} assume 1 == ~c_dr_pc~0; {2964#true} is VALID [2022-02-20 19:59:50,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {2964#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2964#true} is VALID [2022-02-20 19:59:50,431 INFO L290 TraceCheckUtils]: 3: Hoare triple {2964#true} #res := ~__retres1~1; {2964#true} is VALID [2022-02-20 19:59:50,432 INFO L290 TraceCheckUtils]: 4: Hoare triple {2964#true} assume true; {2964#true} is VALID [2022-02-20 19:59:50,432 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2964#true} {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} #1076#return; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {3009#(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; {2964#true} is VALID [2022-02-20 19:59:50,433 INFO L272 TraceCheckUtils]: 1: Hoare triple {2964#true} call #t~ret8 := is_do_write_p_triggered(); {2964#true} is VALID [2022-02-20 19:59:50,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {2964#true} havoc ~__retres1~0; {2964#true} is VALID [2022-02-20 19:59:50,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {2964#true} assume 1 == ~p_dw_pc~0; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,435 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} {2964#true} #1074#return; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,436 INFO L272 TraceCheckUtils]: 10: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {2964#true} is VALID [2022-02-20 19:59:50,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {2964#true} havoc ~__retres1~1; {2964#true} is VALID [2022-02-20 19:59:50,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {2964#true} assume 1 == ~c_dr_pc~0; {2964#true} is VALID [2022-02-20 19:59:50,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {2964#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2964#true} is VALID [2022-02-20 19:59:50,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {2964#true} #res := ~__retres1~1; {2964#true} is VALID [2022-02-20 19:59:50,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {2964#true} assume true; {2964#true} is VALID [2022-02-20 19:59:50,437 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2964#true} {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} #1076#return; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,438 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} {2971#(not (= ~p_dw_pc~0 1))} #1082#return; {2965#false} is VALID [2022-02-20 19:59:50,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {3008#(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; {2964#true} is VALID [2022-02-20 19:59:50,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {2964#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2964#true} is VALID [2022-02-20 19:59:50,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {2964#true} assume true; {2964#true} is VALID [2022-02-20 19:59:50,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2964#true} {2965#false} #1084#return; {2965#false} is VALID [2022-02-20 19:59:50,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {2964#true} havoc ~__retres1~2; {2964#true} is VALID [2022-02-20 19:59:50,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {2964#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2964#true} is VALID [2022-02-20 19:59:50,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {2964#true} #res := ~__retres1~2; {2964#true} is VALID [2022-02-20 19:59:50,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {2964#true} assume true; {2964#true} is VALID [2022-02-20 19:59:50,449 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2964#true} {2965#false} #1086#return; {2965#false} is VALID [2022-02-20 19:59:50,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {2964#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {2966#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:50,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {2966#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {2966#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:50,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {2966#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {2967#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:50,450 INFO L290 TraceCheckUtils]: 3: Hoare triple {2967#(= ~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; {2967#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:50,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {2967#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {3006#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:50,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {3006#(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); {3007#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:50,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {3007#(not (= |old(~q_req_up~0)| 1))} assume true; {3007#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:50,452 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3007#(not (= |old(~q_req_up~0)| 1))} {2967#(= ~q_req_up~0 ~p_dw_pc~0)} #1078#return; {2971#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:50,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {2971#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {2971#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:50,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {2971#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2971#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:50,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {2971#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2971#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:50,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {2971#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {2971#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:50,454 INFO L272 TraceCheckUtils]: 12: Hoare triple {2971#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {3008#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:50,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {3008#(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); {2964#true} is VALID [2022-02-20 19:59:50,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {2964#true} assume !(0 == ~q_write_ev~0); {2964#true} is VALID [2022-02-20 19:59:50,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {2964#true} assume true; {2964#true} is VALID [2022-02-20 19:59:50,454 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2964#true} {2971#(not (= ~p_dw_pc~0 1))} #1080#return; {2971#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:50,455 INFO L272 TraceCheckUtils]: 17: Hoare triple {2971#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {3009#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:50,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {3009#(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; {2964#true} is VALID [2022-02-20 19:59:50,455 INFO L272 TraceCheckUtils]: 19: Hoare triple {2964#true} call #t~ret8 := is_do_write_p_triggered(); {2964#true} is VALID [2022-02-20 19:59:50,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {2964#true} havoc ~__retres1~0; {2964#true} is VALID [2022-02-20 19:59:50,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {2964#true} assume 1 == ~p_dw_pc~0; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,457 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} {2964#true} #1074#return; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,458 INFO L272 TraceCheckUtils]: 28: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {2964#true} is VALID [2022-02-20 19:59:50,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {2964#true} havoc ~__retres1~1; {2964#true} is VALID [2022-02-20 19:59:50,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {2964#true} assume 1 == ~c_dr_pc~0; {2964#true} is VALID [2022-02-20 19:59:50,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {2964#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2964#true} is VALID [2022-02-20 19:59:50,459 INFO L290 TraceCheckUtils]: 32: Hoare triple {2964#true} #res := ~__retres1~1; {2964#true} is VALID [2022-02-20 19:59:50,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {2964#true} assume true; {2964#true} is VALID [2022-02-20 19:59:50,459 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2964#true} {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} #1076#return; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,460 INFO L290 TraceCheckUtils]: 36: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:50,461 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3016#(= (+ (- 1) ~p_dw_pc~0) 0)} {2971#(not (= ~p_dw_pc~0 1))} #1082#return; {2965#false} is VALID [2022-02-20 19:59:50,461 INFO L272 TraceCheckUtils]: 39: Hoare triple {2965#false} call reset_delta_events1(); {3008#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:50,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {3008#(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; {2964#true} is VALID [2022-02-20 19:59:50,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {2964#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2964#true} is VALID [2022-02-20 19:59:50,462 INFO L290 TraceCheckUtils]: 42: Hoare triple {2964#true} assume true; {2964#true} is VALID [2022-02-20 19:59:50,462 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2964#true} {2965#false} #1084#return; {2965#false} is VALID [2022-02-20 19:59:50,462 INFO L290 TraceCheckUtils]: 44: Hoare triple {2965#false} assume !false; {2965#false} is VALID [2022-02-20 19:59:50,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {2965#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; {2965#false} is VALID [2022-02-20 19:59:50,462 INFO L290 TraceCheckUtils]: 46: Hoare triple {2965#false} assume !false; {2965#false} is VALID [2022-02-20 19:59:50,462 INFO L272 TraceCheckUtils]: 47: Hoare triple {2965#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2964#true} is VALID [2022-02-20 19:59:50,463 INFO L290 TraceCheckUtils]: 48: Hoare triple {2964#true} havoc ~__retres1~2; {2964#true} is VALID [2022-02-20 19:59:50,463 INFO L290 TraceCheckUtils]: 49: Hoare triple {2964#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2964#true} is VALID [2022-02-20 19:59:50,463 INFO L290 TraceCheckUtils]: 50: Hoare triple {2964#true} #res := ~__retres1~2; {2964#true} is VALID [2022-02-20 19:59:50,463 INFO L290 TraceCheckUtils]: 51: Hoare triple {2964#true} assume true; {2964#true} is VALID [2022-02-20 19:59:50,463 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2964#true} {2965#false} #1086#return; {2965#false} is VALID [2022-02-20 19:59:50,463 INFO L290 TraceCheckUtils]: 53: Hoare triple {2965#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; {2965#false} is VALID [2022-02-20 19:59:50,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {2965#false} assume 0 != eval1_~tmp___1~0#1; {2965#false} is VALID [2022-02-20 19:59:50,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {2965#false} assume !(0 == ~p_dw_st~0); {2965#false} is VALID [2022-02-20 19:59:50,464 INFO L290 TraceCheckUtils]: 56: Hoare triple {2965#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; {2965#false} is VALID [2022-02-20 19:59:50,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {2965#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; {2965#false} is VALID [2022-02-20 19:59:50,464 INFO L290 TraceCheckUtils]: 58: Hoare triple {2965#false} assume !(0 == ~c_dr_pc~0); {2965#false} is VALID [2022-02-20 19:59:50,464 INFO L290 TraceCheckUtils]: 59: Hoare triple {2965#false} assume 2 == ~c_dr_pc~0; {2965#false} is VALID [2022-02-20 19:59:50,464 INFO L290 TraceCheckUtils]: 60: Hoare triple {2965#false} do_read_c_~a~0#1 := ~a_t~0; {2965#false} is VALID [2022-02-20 19:59:50,465 INFO L290 TraceCheckUtils]: 61: Hoare triple {2965#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; {2965#false} is VALID [2022-02-20 19:59:50,465 INFO L290 TraceCheckUtils]: 62: Hoare triple {2965#false} assume !(~p_last_write~0 == ~c_last_read~0); {2965#false} is VALID [2022-02-20 19:59:50,465 INFO L272 TraceCheckUtils]: 63: Hoare triple {2965#false} call error1(); {2965#false} is VALID [2022-02-20 19:59:50,465 INFO L290 TraceCheckUtils]: 64: Hoare triple {2965#false} assume !false; {2965#false} is VALID [2022-02-20 19:59:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:50,466 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:50,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002905564] [2022-02-20 19:59:50,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002905564] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:50,466 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:50,466 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:50,466 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47390003] [2022-02-20 19:59:50,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:50,468 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 19:59:50,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:50,468 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 19:59:50,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:50,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:50,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:50,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:50,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:50,503 INFO L87 Difference]: Start difference. First operand 412 states and 608 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 19:59:55,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:55,811 INFO L93 Difference]: Finished difference Result 1505 states and 2187 transitions. [2022-02-20 19:59:55,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:55,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 19:59:55,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:55,812 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 19:59:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1249 transitions. [2022-02-20 19:59:55,833 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 19:59:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1249 transitions. [2022-02-20 19:59:55,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1249 transitions. [2022-02-20 19:59:56,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1249 edges. 1249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:56,747 INFO L225 Difference]: With dead ends: 1505 [2022-02-20 19:59:56,747 INFO L226 Difference]: Without dead ends: 1280 [2022-02-20 19:59:56,749 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 19:59:56,750 INFO L933 BasicCegarLoop]: 608 mSDtfsCounter, 2427 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2445 SdHoareTripleChecker+Valid, 2368 SdHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:56,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2445 Valid, 2368 Invalid, 2352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 19:59:56,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2022-02-20 19:59:56,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1184. [2022-02-20 19:59:56,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:56,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1280 states. Second operand has 1184 states, 956 states have (on average 1.4142259414225942) internal successors, (1352), 977 states have internal predecessors, (1352), 132 states have call successors, (132), 82 states have call predecessors, (132), 94 states have return successors, (161), 127 states have call predecessors, (161), 128 states have call successors, (161) [2022-02-20 19:59:56,810 INFO L74 IsIncluded]: Start isIncluded. First operand 1280 states. Second operand has 1184 states, 956 states have (on average 1.4142259414225942) internal successors, (1352), 977 states have internal predecessors, (1352), 132 states have call successors, (132), 82 states have call predecessors, (132), 94 states have return successors, (161), 127 states have call predecessors, (161), 128 states have call successors, (161) [2022-02-20 19:59:56,813 INFO L87 Difference]: Start difference. First operand 1280 states. Second operand has 1184 states, 956 states have (on average 1.4142259414225942) internal successors, (1352), 977 states have internal predecessors, (1352), 132 states have call successors, (132), 82 states have call predecessors, (132), 94 states have return successors, (161), 127 states have call predecessors, (161), 128 states have call successors, (161) [2022-02-20 19:59:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:56,865 INFO L93 Difference]: Finished difference Result 1280 states and 1774 transitions. [2022-02-20 19:59:56,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1774 transitions. [2022-02-20 19:59:56,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:56,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:56,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 1184 states, 956 states have (on average 1.4142259414225942) internal successors, (1352), 977 states have internal predecessors, (1352), 132 states have call successors, (132), 82 states have call predecessors, (132), 94 states have return successors, (161), 127 states have call predecessors, (161), 128 states have call successors, (161) Second operand 1280 states. [2022-02-20 19:59:56,875 INFO L87 Difference]: Start difference. First operand has 1184 states, 956 states have (on average 1.4142259414225942) internal successors, (1352), 977 states have internal predecessors, (1352), 132 states have call successors, (132), 82 states have call predecessors, (132), 94 states have return successors, (161), 127 states have call predecessors, (161), 128 states have call successors, (161) Second operand 1280 states. [2022-02-20 19:59:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:56,927 INFO L93 Difference]: Finished difference Result 1280 states and 1774 transitions. [2022-02-20 19:59:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1774 transitions. [2022-02-20 19:59:56,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:56,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:56,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:56,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:56,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 956 states have (on average 1.4142259414225942) internal successors, (1352), 977 states have internal predecessors, (1352), 132 states have call successors, (132), 82 states have call predecessors, (132), 94 states have return successors, (161), 127 states have call predecessors, (161), 128 states have call successors, (161) [2022-02-20 19:59:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1645 transitions. [2022-02-20 19:59:56,999 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1645 transitions. Word has length 65 [2022-02-20 19:59:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:57,000 INFO L470 AbstractCegarLoop]: Abstraction has 1184 states and 1645 transitions. [2022-02-20 19:59:57,000 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 19:59:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1645 transitions. [2022-02-20 19:59:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:59:57,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:57,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:57,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:59:57,003 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:57,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:57,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1082356585, now seen corresponding path program 1 times [2022-02-20 19:59:57,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:57,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701394775] [2022-02-20 19:59:57,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:57,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {9320#(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); {9280#true} is VALID [2022-02-20 19:59:57,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {9280#true} assume true; {9280#true} is VALID [2022-02-20 19:59:57,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9280#true} {9280#true} #1078#return; {9280#true} is VALID [2022-02-20 19:59:57,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {9321#(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); {9280#true} is VALID [2022-02-20 19:59:57,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {9280#true} assume !(0 == ~q_write_ev~0); {9280#true} is VALID [2022-02-20 19:59:57,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {9280#true} assume true; {9280#true} is VALID [2022-02-20 19:59:57,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9280#true} {9280#true} #1080#return; {9280#true} is VALID [2022-02-20 19:59:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {9280#true} havoc ~__retres1~0; {9280#true} is VALID [2022-02-20 19:59:57,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {9280#true} assume !(1 == ~p_dw_pc~0); {9280#true} is VALID [2022-02-20 19:59:57,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {9280#true} assume !(2 == ~p_dw_pc~0); {9280#true} is VALID [2022-02-20 19:59:57,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {9280#true} ~__retres1~0 := 0; {9338#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:57,131 INFO L290 TraceCheckUtils]: 4: Hoare triple {9338#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {9339#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:57,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {9339#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {9339#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:57,132 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9339#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {9280#true} #1074#return; {9330#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:57,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {9280#true} havoc ~__retres1~1; {9280#true} is VALID [2022-02-20 19:59:57,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {9280#true} assume 1 == ~c_dr_pc~0; {9280#true} is VALID [2022-02-20 19:59:57,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {9280#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {9280#true} is VALID [2022-02-20 19:59:57,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {9280#true} #res := ~__retres1~1; {9280#true} is VALID [2022-02-20 19:59:57,136 INFO L290 TraceCheckUtils]: 4: Hoare triple {9280#true} assume true; {9280#true} is VALID [2022-02-20 19:59:57,136 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9280#true} {9281#false} #1076#return; {9281#false} is VALID [2022-02-20 19:59:57,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {9322#(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; {9280#true} is VALID [2022-02-20 19:59:57,137 INFO L272 TraceCheckUtils]: 1: Hoare triple {9280#true} call #t~ret8 := is_do_write_p_triggered(); {9280#true} is VALID [2022-02-20 19:59:57,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {9280#true} havoc ~__retres1~0; {9280#true} is VALID [2022-02-20 19:59:57,137 INFO L290 TraceCheckUtils]: 3: Hoare triple {9280#true} assume !(1 == ~p_dw_pc~0); {9280#true} is VALID [2022-02-20 19:59:57,137 INFO L290 TraceCheckUtils]: 4: Hoare triple {9280#true} assume !(2 == ~p_dw_pc~0); {9280#true} is VALID [2022-02-20 19:59:57,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {9280#true} ~__retres1~0 := 0; {9338#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:57,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {9338#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {9339#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:57,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {9339#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {9339#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:57,139 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {9339#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {9280#true} #1074#return; {9330#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:57,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {9330#(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; {9331#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:57,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {9331#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {9281#false} is VALID [2022-02-20 19:59:57,140 INFO L272 TraceCheckUtils]: 11: Hoare triple {9281#false} call #t~ret9 := is_do_read_c_triggered(); {9280#true} is VALID [2022-02-20 19:59:57,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {9280#true} havoc ~__retres1~1; {9280#true} is VALID [2022-02-20 19:59:57,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {9280#true} assume 1 == ~c_dr_pc~0; {9280#true} is VALID [2022-02-20 19:59:57,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {9280#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {9280#true} is VALID [2022-02-20 19:59:57,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {9280#true} #res := ~__retres1~1; {9280#true} is VALID [2022-02-20 19:59:57,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {9280#true} assume true; {9280#true} is VALID [2022-02-20 19:59:57,141 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9280#true} {9281#false} #1076#return; {9281#false} is VALID [2022-02-20 19:59:57,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {9281#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {9281#false} is VALID [2022-02-20 19:59:57,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {9281#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {9281#false} is VALID [2022-02-20 19:59:57,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {9281#false} assume true; {9281#false} is VALID [2022-02-20 19:59:57,141 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9281#false} {9280#true} #1082#return; {9281#false} is VALID [2022-02-20 19:59:57,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 19:59:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {9321#(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; {9280#true} is VALID [2022-02-20 19:59:57,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {9280#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {9280#true} is VALID [2022-02-20 19:59:57,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {9280#true} assume true; {9280#true} is VALID [2022-02-20 19:59:57,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9280#true} {9281#false} #1084#return; {9281#false} is VALID [2022-02-20 19:59:57,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:59:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {9280#true} havoc ~__retres1~2; {9280#true} is VALID [2022-02-20 19:59:57,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {9280#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {9280#true} is VALID [2022-02-20 19:59:57,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {9280#true} #res := ~__retres1~2; {9280#true} is VALID [2022-02-20 19:59:57,150 INFO L290 TraceCheckUtils]: 3: Hoare triple {9280#true} assume true; {9280#true} is VALID [2022-02-20 19:59:57,151 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9280#true} {9281#false} #1086#return; {9281#false} is VALID [2022-02-20 19:59:57,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {9280#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {9280#true} is VALID [2022-02-20 19:59:57,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {9280#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {9280#true} is VALID [2022-02-20 19:59:57,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {9280#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {9280#true} is VALID [2022-02-20 19:59:57,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {9280#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; {9280#true} is VALID [2022-02-20 19:59:57,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {9280#true} call update_channels1(); {9320#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:57,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {9320#(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); {9280#true} is VALID [2022-02-20 19:59:57,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {9280#true} assume true; {9280#true} is VALID [2022-02-20 19:59:57,152 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9280#true} {9280#true} #1078#return; {9280#true} is VALID [2022-02-20 19:59:57,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {9280#true} assume { :begin_inline_init_threads1 } true; {9280#true} is VALID [2022-02-20 19:59:57,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {9280#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {9280#true} is VALID [2022-02-20 19:59:57,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {9280#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {9280#true} is VALID [2022-02-20 19:59:57,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {9280#true} assume { :end_inline_init_threads1 } true; {9280#true} is VALID [2022-02-20 19:59:57,153 INFO L272 TraceCheckUtils]: 12: Hoare triple {9280#true} call fire_delta_events1(); {9321#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:57,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {9321#(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); {9280#true} is VALID [2022-02-20 19:59:57,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {9280#true} assume !(0 == ~q_write_ev~0); {9280#true} is VALID [2022-02-20 19:59:57,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {9280#true} assume true; {9280#true} is VALID [2022-02-20 19:59:57,154 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9280#true} {9280#true} #1080#return; {9280#true} is VALID [2022-02-20 19:59:57,154 INFO L272 TraceCheckUtils]: 17: Hoare triple {9280#true} call activate_threads1(); {9322#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:57,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {9322#(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; {9280#true} is VALID [2022-02-20 19:59:57,155 INFO L272 TraceCheckUtils]: 19: Hoare triple {9280#true} call #t~ret8 := is_do_write_p_triggered(); {9280#true} is VALID [2022-02-20 19:59:57,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {9280#true} havoc ~__retres1~0; {9280#true} is VALID [2022-02-20 19:59:57,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {9280#true} assume !(1 == ~p_dw_pc~0); {9280#true} is VALID [2022-02-20 19:59:57,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {9280#true} assume !(2 == ~p_dw_pc~0); {9280#true} is VALID [2022-02-20 19:59:57,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {9280#true} ~__retres1~0 := 0; {9338#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:57,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {9338#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {9339#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:57,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {9339#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {9339#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:57,157 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9339#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {9280#true} #1074#return; {9330#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:57,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {9330#(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; {9331#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:57,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {9331#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {9281#false} is VALID [2022-02-20 19:59:57,158 INFO L272 TraceCheckUtils]: 29: Hoare triple {9281#false} call #t~ret9 := is_do_read_c_triggered(); {9280#true} is VALID [2022-02-20 19:59:57,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {9280#true} havoc ~__retres1~1; {9280#true} is VALID [2022-02-20 19:59:57,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {9280#true} assume 1 == ~c_dr_pc~0; {9280#true} is VALID [2022-02-20 19:59:57,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {9280#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {9280#true} is VALID [2022-02-20 19:59:57,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {9280#true} #res := ~__retres1~1; {9280#true} is VALID [2022-02-20 19:59:57,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {9280#true} assume true; {9280#true} is VALID [2022-02-20 19:59:57,159 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9280#true} {9281#false} #1076#return; {9281#false} is VALID [2022-02-20 19:59:57,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {9281#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {9281#false} is VALID [2022-02-20 19:59:57,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {9281#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {9281#false} is VALID [2022-02-20 19:59:57,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {9281#false} assume true; {9281#false} is VALID [2022-02-20 19:59:57,159 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9281#false} {9280#true} #1082#return; {9281#false} is VALID [2022-02-20 19:59:57,160 INFO L272 TraceCheckUtils]: 40: Hoare triple {9281#false} call reset_delta_events1(); {9321#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:57,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {9321#(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; {9280#true} is VALID [2022-02-20 19:59:57,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {9280#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {9280#true} is VALID [2022-02-20 19:59:57,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {9280#true} assume true; {9280#true} is VALID [2022-02-20 19:59:57,160 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9280#true} {9281#false} #1084#return; {9281#false} is VALID [2022-02-20 19:59:57,160 INFO L290 TraceCheckUtils]: 45: Hoare triple {9281#false} assume !false; {9281#false} is VALID [2022-02-20 19:59:57,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {9281#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; {9281#false} is VALID [2022-02-20 19:59:57,161 INFO L290 TraceCheckUtils]: 47: Hoare triple {9281#false} assume !false; {9281#false} is VALID [2022-02-20 19:59:57,161 INFO L272 TraceCheckUtils]: 48: Hoare triple {9281#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {9280#true} is VALID [2022-02-20 19:59:57,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {9280#true} havoc ~__retres1~2; {9280#true} is VALID [2022-02-20 19:59:57,161 INFO L290 TraceCheckUtils]: 50: Hoare triple {9280#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {9280#true} is VALID [2022-02-20 19:59:57,161 INFO L290 TraceCheckUtils]: 51: Hoare triple {9280#true} #res := ~__retres1~2; {9280#true} is VALID [2022-02-20 19:59:57,161 INFO L290 TraceCheckUtils]: 52: Hoare triple {9280#true} assume true; {9280#true} is VALID [2022-02-20 19:59:57,162 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9280#true} {9281#false} #1086#return; {9281#false} is VALID [2022-02-20 19:59:57,162 INFO L290 TraceCheckUtils]: 54: Hoare triple {9281#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; {9281#false} is VALID [2022-02-20 19:59:57,162 INFO L290 TraceCheckUtils]: 55: Hoare triple {9281#false} assume 0 != eval1_~tmp___1~0#1; {9281#false} is VALID [2022-02-20 19:59:57,162 INFO L290 TraceCheckUtils]: 56: Hoare triple {9281#false} assume !(0 == ~p_dw_st~0); {9281#false} is VALID [2022-02-20 19:59:57,162 INFO L290 TraceCheckUtils]: 57: Hoare triple {9281#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; {9281#false} is VALID [2022-02-20 19:59:57,162 INFO L290 TraceCheckUtils]: 58: Hoare triple {9281#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; {9281#false} is VALID [2022-02-20 19:59:57,163 INFO L290 TraceCheckUtils]: 59: Hoare triple {9281#false} assume !(0 == ~c_dr_pc~0); {9281#false} is VALID [2022-02-20 19:59:57,163 INFO L290 TraceCheckUtils]: 60: Hoare triple {9281#false} assume 2 == ~c_dr_pc~0; {9281#false} is VALID [2022-02-20 19:59:57,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {9281#false} do_read_c_~a~0#1 := ~a_t~0; {9281#false} is VALID [2022-02-20 19:59:57,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {9281#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; {9281#false} is VALID [2022-02-20 19:59:57,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {9281#false} assume !(~p_last_write~0 == ~c_last_read~0); {9281#false} is VALID [2022-02-20 19:59:57,163 INFO L272 TraceCheckUtils]: 64: Hoare triple {9281#false} call error1(); {9281#false} is VALID [2022-02-20 19:59:57,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {9281#false} assume !false; {9281#false} is VALID [2022-02-20 19:59:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:57,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:57,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701394775] [2022-02-20 19:59:57,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701394775] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:57,164 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:57,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:57,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107082185] [2022-02-20 19:59:57,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:57,165 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 19:59:57,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:57,166 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 19:59:57,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:57,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:57,198 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:57,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:57,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:57,198 INFO L87 Difference]: Start difference. First operand 1184 states and 1645 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 19:59:59,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:59,795 INFO L93 Difference]: Finished difference Result 2284 states and 3169 transitions. [2022-02-20 19:59:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:59,795 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 19:59:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:59,796 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 19:59:59,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 619 transitions. [2022-02-20 19:59:59,800 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 19:59:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 619 transitions. [2022-02-20 19:59:59,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 619 transitions. [2022-02-20 20:00:00,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 619 edges. 619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:00,251 INFO L225 Difference]: With dead ends: 2284 [2022-02-20 20:00:00,251 INFO L226 Difference]: Without dead ends: 1294 [2022-02-20 20:00:00,255 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:00:00,258 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 347 mSDsluCounter, 1519 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:00,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 1948 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 20:00:00,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2022-02-20 20:00:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1224. [2022-02-20 20:00:00,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:00,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1294 states. Second operand has 1224 states, 988 states have (on average 1.3987854251012146) internal successors, (1382), 1009 states have internal predecessors, (1382), 132 states have call successors, (132), 82 states have call predecessors, (132), 102 states have return successors, (169), 135 states have call predecessors, (169), 128 states have call successors, (169) [2022-02-20 20:00:00,320 INFO L74 IsIncluded]: Start isIncluded. First operand 1294 states. Second operand has 1224 states, 988 states have (on average 1.3987854251012146) internal successors, (1382), 1009 states have internal predecessors, (1382), 132 states have call successors, (132), 82 states have call predecessors, (132), 102 states have return successors, (169), 135 states have call predecessors, (169), 128 states have call successors, (169) [2022-02-20 20:00:00,322 INFO L87 Difference]: Start difference. First operand 1294 states. Second operand has 1224 states, 988 states have (on average 1.3987854251012146) internal successors, (1382), 1009 states have internal predecessors, (1382), 132 states have call successors, (132), 82 states have call predecessors, (132), 102 states have return successors, (169), 135 states have call predecessors, (169), 128 states have call successors, (169) [2022-02-20 20:00:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:00,372 INFO L93 Difference]: Finished difference Result 1294 states and 1789 transitions. [2022-02-20 20:00:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1789 transitions. [2022-02-20 20:00:00,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:00,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:00,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 1224 states, 988 states have (on average 1.3987854251012146) internal successors, (1382), 1009 states have internal predecessors, (1382), 132 states have call successors, (132), 82 states have call predecessors, (132), 102 states have return successors, (169), 135 states have call predecessors, (169), 128 states have call successors, (169) Second operand 1294 states. [2022-02-20 20:00:00,380 INFO L87 Difference]: Start difference. First operand has 1224 states, 988 states have (on average 1.3987854251012146) internal successors, (1382), 1009 states have internal predecessors, (1382), 132 states have call successors, (132), 82 states have call predecessors, (132), 102 states have return successors, (169), 135 states have call predecessors, (169), 128 states have call successors, (169) Second operand 1294 states. [2022-02-20 20:00:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:00,430 INFO L93 Difference]: Finished difference Result 1294 states and 1789 transitions. [2022-02-20 20:00:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1789 transitions. [2022-02-20 20:00:00,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:00,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:00,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:00,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 988 states have (on average 1.3987854251012146) internal successors, (1382), 1009 states have internal predecessors, (1382), 132 states have call successors, (132), 82 states have call predecessors, (132), 102 states have return successors, (169), 135 states have call predecessors, (169), 128 states have call successors, (169) [2022-02-20 20:00:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1683 transitions. [2022-02-20 20:00:00,503 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1683 transitions. Word has length 66 [2022-02-20 20:00:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:00,503 INFO L470 AbstractCegarLoop]: Abstraction has 1224 states and 1683 transitions. [2022-02-20 20:00:00,504 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:00:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1683 transitions. [2022-02-20 20:00:00,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:00,505 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:00,506 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:00:00,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:00:00,506 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:00,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:00,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2111715883, now seen corresponding path program 1 times [2022-02-20 20:00:00,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:00,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560662769] [2022-02-20 20:00:00,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:00,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {16696#(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); {16697#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:00,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {16697#(not (= |old(~q_req_up~0)| 1))} assume true; {16697#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:00,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16697#(not (= |old(~q_req_up~0)| 1))} {16656#(= ~c_dr_pc~0 ~q_req_up~0)} #1078#return; {16660#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {16698#(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); {16653#true} is VALID [2022-02-20 20:00:00,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {16653#true} assume !(0 == ~q_write_ev~0); {16653#true} is VALID [2022-02-20 20:00:00,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-02-20 20:00:00,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16653#true} {16660#(not (= ~c_dr_pc~0 1))} #1080#return; {16660#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {16653#true} havoc ~__retres1~0; {16653#true} is VALID [2022-02-20 20:00:00,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {16653#true} assume !(1 == ~p_dw_pc~0); {16653#true} is VALID [2022-02-20 20:00:00,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {16653#true} assume !(2 == ~p_dw_pc~0); {16653#true} is VALID [2022-02-20 20:00:00,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {16653#true} ~__retres1~0 := 0; {16653#true} is VALID [2022-02-20 20:00:00,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {16653#true} #res := ~__retres1~0; {16653#true} is VALID [2022-02-20 20:00:00,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-02-20 20:00:00,632 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {16653#true} {16653#true} #1074#return; {16653#true} is VALID [2022-02-20 20:00:00,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {16653#true} havoc ~__retres1~1; {16653#true} is VALID [2022-02-20 20:00:00,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {16653#true} assume 1 == ~c_dr_pc~0; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,644 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} {16653#true} #1076#return; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {16699#(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; {16653#true} is VALID [2022-02-20 20:00:00,644 INFO L272 TraceCheckUtils]: 1: Hoare triple {16653#true} call #t~ret8 := is_do_write_p_triggered(); {16653#true} is VALID [2022-02-20 20:00:00,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {16653#true} havoc ~__retres1~0; {16653#true} is VALID [2022-02-20 20:00:00,645 INFO L290 TraceCheckUtils]: 3: Hoare triple {16653#true} assume !(1 == ~p_dw_pc~0); {16653#true} is VALID [2022-02-20 20:00:00,645 INFO L290 TraceCheckUtils]: 4: Hoare triple {16653#true} assume !(2 == ~p_dw_pc~0); {16653#true} is VALID [2022-02-20 20:00:00,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {16653#true} ~__retres1~0 := 0; {16653#true} is VALID [2022-02-20 20:00:00,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {16653#true} #res := ~__retres1~0; {16653#true} is VALID [2022-02-20 20:00:00,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-02-20 20:00:00,649 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16653#true} {16653#true} #1074#return; {16653#true} is VALID [2022-02-20 20:00:00,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {16653#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {16653#true} is VALID [2022-02-20 20:00:00,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {16653#true} assume !(0 != ~tmp~1); {16653#true} is VALID [2022-02-20 20:00:00,650 INFO L272 TraceCheckUtils]: 11: Hoare triple {16653#true} call #t~ret9 := is_do_read_c_triggered(); {16653#true} is VALID [2022-02-20 20:00:00,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {16653#true} havoc ~__retres1~1; {16653#true} is VALID [2022-02-20 20:00:00,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {16653#true} assume 1 == ~c_dr_pc~0; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,655 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} {16653#true} #1076#return; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,658 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} {16660#(not (= ~c_dr_pc~0 1))} #1082#return; {16654#false} is VALID [2022-02-20 20:00:00,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {16698#(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; {16653#true} is VALID [2022-02-20 20:00:00,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {16653#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {16653#true} is VALID [2022-02-20 20:00:00,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-02-20 20:00:00,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16653#true} {16654#false} #1084#return; {16654#false} is VALID [2022-02-20 20:00:00,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {16653#true} havoc ~__retres1~2; {16653#true} is VALID [2022-02-20 20:00:00,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {16653#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16653#true} is VALID [2022-02-20 20:00:00,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {16653#true} #res := ~__retres1~2; {16653#true} is VALID [2022-02-20 20:00:00,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-02-20 20:00:00,671 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16653#true} {16654#false} #1086#return; {16654#false} is VALID [2022-02-20 20:00:00,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {16653#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {16655#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:00,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {16655#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {16655#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:00,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {16655#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {16656#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:00,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {16656#(= ~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; {16656#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:00,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {16656#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {16696#(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:00:00,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {16696#(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); {16697#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:00,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {16697#(not (= |old(~q_req_up~0)| 1))} assume true; {16697#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:00,674 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16697#(not (= |old(~q_req_up~0)| 1))} {16656#(= ~c_dr_pc~0 ~q_req_up~0)} #1078#return; {16660#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {16660#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {16660#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {16660#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {16660#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {16660#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {16660#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {16660#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {16660#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,677 INFO L272 TraceCheckUtils]: 12: Hoare triple {16660#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {16698#(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:00:00,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {16698#(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); {16653#true} is VALID [2022-02-20 20:00:00,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {16653#true} assume !(0 == ~q_write_ev~0); {16653#true} is VALID [2022-02-20 20:00:00,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-02-20 20:00:00,678 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16653#true} {16660#(not (= ~c_dr_pc~0 1))} #1080#return; {16660#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,679 INFO L272 TraceCheckUtils]: 17: Hoare triple {16660#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {16699#(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:00:00,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {16699#(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; {16653#true} is VALID [2022-02-20 20:00:00,679 INFO L272 TraceCheckUtils]: 19: Hoare triple {16653#true} call #t~ret8 := is_do_write_p_triggered(); {16653#true} is VALID [2022-02-20 20:00:00,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {16653#true} havoc ~__retres1~0; {16653#true} is VALID [2022-02-20 20:00:00,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {16653#true} assume !(1 == ~p_dw_pc~0); {16653#true} is VALID [2022-02-20 20:00:00,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {16653#true} assume !(2 == ~p_dw_pc~0); {16653#true} is VALID [2022-02-20 20:00:00,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {16653#true} ~__retres1~0 := 0; {16653#true} is VALID [2022-02-20 20:00:00,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {16653#true} #res := ~__retres1~0; {16653#true} is VALID [2022-02-20 20:00:00,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-02-20 20:00:00,680 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16653#true} {16653#true} #1074#return; {16653#true} is VALID [2022-02-20 20:00:00,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {16653#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {16653#true} is VALID [2022-02-20 20:00:00,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {16653#true} assume !(0 != ~tmp~1); {16653#true} is VALID [2022-02-20 20:00:00,680 INFO L272 TraceCheckUtils]: 29: Hoare triple {16653#true} call #t~ret9 := is_do_read_c_triggered(); {16653#true} is VALID [2022-02-20 20:00:00,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {16653#true} havoc ~__retres1~1; {16653#true} is VALID [2022-02-20 20:00:00,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {16653#true} assume 1 == ~c_dr_pc~0; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,682 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} {16653#true} #1076#return; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,683 INFO L290 TraceCheckUtils]: 38: Hoare triple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,683 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16713#(= (+ (- 1) ~c_dr_pc~0) 0)} {16660#(not (= ~c_dr_pc~0 1))} #1082#return; {16654#false} is VALID [2022-02-20 20:00:00,683 INFO L272 TraceCheckUtils]: 40: Hoare triple {16654#false} call reset_delta_events1(); {16698#(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:00:00,683 INFO L290 TraceCheckUtils]: 41: Hoare triple {16698#(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; {16653#true} is VALID [2022-02-20 20:00:00,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {16653#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {16653#true} is VALID [2022-02-20 20:00:00,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-02-20 20:00:00,684 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16653#true} {16654#false} #1084#return; {16654#false} is VALID [2022-02-20 20:00:00,684 INFO L290 TraceCheckUtils]: 45: Hoare triple {16654#false} assume !false; {16654#false} is VALID [2022-02-20 20:00:00,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {16654#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; {16654#false} is VALID [2022-02-20 20:00:00,684 INFO L290 TraceCheckUtils]: 47: Hoare triple {16654#false} assume !false; {16654#false} is VALID [2022-02-20 20:00:00,684 INFO L272 TraceCheckUtils]: 48: Hoare triple {16654#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {16653#true} is VALID [2022-02-20 20:00:00,684 INFO L290 TraceCheckUtils]: 49: Hoare triple {16653#true} havoc ~__retres1~2; {16653#true} is VALID [2022-02-20 20:00:00,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {16653#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16653#true} is VALID [2022-02-20 20:00:00,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {16653#true} #res := ~__retres1~2; {16653#true} is VALID [2022-02-20 20:00:00,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {16653#true} assume true; {16653#true} is VALID [2022-02-20 20:00:00,685 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16653#true} {16654#false} #1086#return; {16654#false} is VALID [2022-02-20 20:00:00,685 INFO L290 TraceCheckUtils]: 54: Hoare triple {16654#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; {16654#false} is VALID [2022-02-20 20:00:00,685 INFO L290 TraceCheckUtils]: 55: Hoare triple {16654#false} assume 0 != eval1_~tmp___1~0#1; {16654#false} is VALID [2022-02-20 20:00:00,685 INFO L290 TraceCheckUtils]: 56: Hoare triple {16654#false} assume !(0 == ~p_dw_st~0); {16654#false} is VALID [2022-02-20 20:00:00,685 INFO L290 TraceCheckUtils]: 57: Hoare triple {16654#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; {16654#false} is VALID [2022-02-20 20:00:00,685 INFO L290 TraceCheckUtils]: 58: Hoare triple {16654#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; {16654#false} is VALID [2022-02-20 20:00:00,685 INFO L290 TraceCheckUtils]: 59: Hoare triple {16654#false} assume !(0 == ~c_dr_pc~0); {16654#false} is VALID [2022-02-20 20:00:00,686 INFO L290 TraceCheckUtils]: 60: Hoare triple {16654#false} assume 2 == ~c_dr_pc~0; {16654#false} is VALID [2022-02-20 20:00:00,686 INFO L290 TraceCheckUtils]: 61: Hoare triple {16654#false} do_read_c_~a~0#1 := ~a_t~0; {16654#false} is VALID [2022-02-20 20:00:00,686 INFO L290 TraceCheckUtils]: 62: Hoare triple {16654#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; {16654#false} is VALID [2022-02-20 20:00:00,686 INFO L290 TraceCheckUtils]: 63: Hoare triple {16654#false} assume !(~p_last_write~0 == ~c_last_read~0); {16654#false} is VALID [2022-02-20 20:00:00,686 INFO L272 TraceCheckUtils]: 64: Hoare triple {16654#false} call error1(); {16654#false} is VALID [2022-02-20 20:00:00,686 INFO L290 TraceCheckUtils]: 65: Hoare triple {16654#false} assume !false; {16654#false} is VALID [2022-02-20 20:00:00,688 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:00:00,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:00,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560662769] [2022-02-20 20:00:00,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560662769] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:00,688 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:00,688 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:00,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192002011] [2022-02-20 20:00:00,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:00,690 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:00:00,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:00,691 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:00:00,729 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:00:00,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:00,730 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:00,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:00,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:00,731 INFO L87 Difference]: Start difference. First operand 1224 states and 1683 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:00:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:06,358 INFO L93 Difference]: Finished difference Result 3894 states and 5384 transitions. [2022-02-20 20:00:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:06,359 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:00:06,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:06,359 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:00:06,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1239 transitions. [2022-02-20 20:00:06,367 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:00:06,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1239 transitions. [2022-02-20 20:00:06,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1239 transitions. [2022-02-20 20:00:07,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1239 edges. 1239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:07,301 INFO L225 Difference]: With dead ends: 3894 [2022-02-20 20:00:07,301 INFO L226 Difference]: Without dead ends: 1614 [2022-02-20 20:00:07,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:00:07,306 INFO L933 BasicCegarLoop]: 574 mSDtfsCounter, 2590 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2608 SdHoareTripleChecker+Valid, 2248 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:07,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2608 Valid, 2248 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-20 20:00:07,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2022-02-20 20:00:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1490. [2022-02-20 20:00:07,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:07,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1614 states. Second operand has 1490 states, 1178 states have (on average 1.3556876061120544) internal successors, (1597), 1203 states have internal predecessors, (1597), 172 states have call successors, (172), 110 states have call predecessors, (172), 138 states have return successors, (221), 179 states have call predecessors, (221), 168 states have call successors, (221) [2022-02-20 20:00:07,371 INFO L74 IsIncluded]: Start isIncluded. First operand 1614 states. Second operand has 1490 states, 1178 states have (on average 1.3556876061120544) internal successors, (1597), 1203 states have internal predecessors, (1597), 172 states have call successors, (172), 110 states have call predecessors, (172), 138 states have return successors, (221), 179 states have call predecessors, (221), 168 states have call successors, (221) [2022-02-20 20:00:07,373 INFO L87 Difference]: Start difference. First operand 1614 states. Second operand has 1490 states, 1178 states have (on average 1.3556876061120544) internal successors, (1597), 1203 states have internal predecessors, (1597), 172 states have call successors, (172), 110 states have call predecessors, (172), 138 states have return successors, (221), 179 states have call predecessors, (221), 168 states have call successors, (221) [2022-02-20 20:00:07,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:07,450 INFO L93 Difference]: Finished difference Result 1614 states and 2157 transitions. [2022-02-20 20:00:07,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2157 transitions. [2022-02-20 20:00:07,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:07,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:07,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 1490 states, 1178 states have (on average 1.3556876061120544) internal successors, (1597), 1203 states have internal predecessors, (1597), 172 states have call successors, (172), 110 states have call predecessors, (172), 138 states have return successors, (221), 179 states have call predecessors, (221), 168 states have call successors, (221) Second operand 1614 states. [2022-02-20 20:00:07,459 INFO L87 Difference]: Start difference. First operand has 1490 states, 1178 states have (on average 1.3556876061120544) internal successors, (1597), 1203 states have internal predecessors, (1597), 172 states have call successors, (172), 110 states have call predecessors, (172), 138 states have return successors, (221), 179 states have call predecessors, (221), 168 states have call successors, (221) Second operand 1614 states. [2022-02-20 20:00:07,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:07,537 INFO L93 Difference]: Finished difference Result 1614 states and 2157 transitions. [2022-02-20 20:00:07,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2157 transitions. [2022-02-20 20:00:07,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:07,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:07,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:07,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1178 states have (on average 1.3556876061120544) internal successors, (1597), 1203 states have internal predecessors, (1597), 172 states have call successors, (172), 110 states have call predecessors, (172), 138 states have return successors, (221), 179 states have call predecessors, (221), 168 states have call successors, (221) [2022-02-20 20:00:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1990 transitions. [2022-02-20 20:00:07,636 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1990 transitions. Word has length 66 [2022-02-20 20:00:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:07,636 INFO L470 AbstractCegarLoop]: Abstraction has 1490 states and 1990 transitions. [2022-02-20 20:00:07,637 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:00:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1990 transitions. [2022-02-20 20:00:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:07,639 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:07,639 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:00:07,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:00:07,639 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:07,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1744333926, now seen corresponding path program 1 times [2022-02-20 20:00:07,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:07,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31497987] [2022-02-20 20:00:07,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:07,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {27291#(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); {27245#true} is VALID [2022-02-20 20:00:07,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {27245#true} assume true; {27245#true} is VALID [2022-02-20 20:00:07,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27245#true} {27245#true} #1078#return; {27245#true} is VALID [2022-02-20 20:00:07,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {27292#(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); {27245#true} is VALID [2022-02-20 20:00:07,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {27245#true} assume !(0 == ~q_write_ev~0); {27245#true} is VALID [2022-02-20 20:00:07,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {27245#true} assume true; {27245#true} is VALID [2022-02-20 20:00:07,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27245#true} {27245#true} #1080#return; {27245#true} is VALID [2022-02-20 20:00:07,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {27245#true} havoc ~__retres1~0; {27245#true} is VALID [2022-02-20 20:00:07,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {27245#true} assume !(1 == ~p_dw_pc~0); {27245#true} is VALID [2022-02-20 20:00:07,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {27245#true} assume !(2 == ~p_dw_pc~0); {27245#true} is VALID [2022-02-20 20:00:07,746 INFO L290 TraceCheckUtils]: 3: Hoare triple {27245#true} ~__retres1~0 := 0; {27245#true} is VALID [2022-02-20 20:00:07,746 INFO L290 TraceCheckUtils]: 4: Hoare triple {27245#true} #res := ~__retres1~0; {27245#true} is VALID [2022-02-20 20:00:07,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {27245#true} assume true; {27245#true} is VALID [2022-02-20 20:00:07,746 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {27245#true} {27245#true} #1074#return; {27245#true} is VALID [2022-02-20 20:00:07,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {27245#true} havoc ~__retres1~1; {27245#true} is VALID [2022-02-20 20:00:07,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {27245#true} assume !(1 == ~c_dr_pc~0); {27245#true} is VALID [2022-02-20 20:00:07,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {27245#true} assume !(2 == ~c_dr_pc~0); {27245#true} is VALID [2022-02-20 20:00:07,783 INFO L290 TraceCheckUtils]: 3: Hoare triple {27245#true} ~__retres1~1 := 0; {27310#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:07,784 INFO L290 TraceCheckUtils]: 4: Hoare triple {27310#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {27311#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:07,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {27311#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {27311#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:07,785 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {27311#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {27245#true} #1076#return; {27308#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:07,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {27293#(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; {27245#true} is VALID [2022-02-20 20:00:07,785 INFO L272 TraceCheckUtils]: 1: Hoare triple {27245#true} call #t~ret8 := is_do_write_p_triggered(); {27245#true} is VALID [2022-02-20 20:00:07,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {27245#true} havoc ~__retres1~0; {27245#true} is VALID [2022-02-20 20:00:07,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {27245#true} assume !(1 == ~p_dw_pc~0); {27245#true} is VALID [2022-02-20 20:00:07,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {27245#true} assume !(2 == ~p_dw_pc~0); {27245#true} is VALID [2022-02-20 20:00:07,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {27245#true} ~__retres1~0 := 0; {27245#true} is VALID [2022-02-20 20:00:07,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {27245#true} #res := ~__retres1~0; {27245#true} is VALID [2022-02-20 20:00:07,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {27245#true} assume true; {27245#true} is VALID [2022-02-20 20:00:07,786 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {27245#true} {27245#true} #1074#return; {27245#true} is VALID [2022-02-20 20:00:07,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {27245#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {27245#true} is VALID [2022-02-20 20:00:07,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {27245#true} assume !(0 != ~tmp~1); {27245#true} is VALID [2022-02-20 20:00:07,787 INFO L272 TraceCheckUtils]: 11: Hoare triple {27245#true} call #t~ret9 := is_do_read_c_triggered(); {27245#true} is VALID [2022-02-20 20:00:07,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {27245#true} havoc ~__retres1~1; {27245#true} is VALID [2022-02-20 20:00:07,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {27245#true} assume !(1 == ~c_dr_pc~0); {27245#true} is VALID [2022-02-20 20:00:07,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {27245#true} assume !(2 == ~c_dr_pc~0); {27245#true} is VALID [2022-02-20 20:00:07,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {27245#true} ~__retres1~1 := 0; {27310#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:07,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {27310#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {27311#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:07,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {27311#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {27311#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:07,791 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {27311#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {27245#true} #1076#return; {27308#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:07,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {27308#(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; {27309#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:00:07,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {27309#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {27246#false} is VALID [2022-02-20 20:00:07,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {27246#false} assume true; {27246#false} is VALID [2022-02-20 20:00:07,792 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27246#false} {27245#true} #1082#return; {27246#false} is VALID [2022-02-20 20:00:07,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {27292#(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; {27245#true} is VALID [2022-02-20 20:00:07,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {27245#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {27245#true} is VALID [2022-02-20 20:00:07,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {27245#true} assume true; {27245#true} is VALID [2022-02-20 20:00:07,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27245#true} {27246#false} #1084#return; {27246#false} is VALID [2022-02-20 20:00:07,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {27245#true} havoc ~__retres1~2; {27245#true} is VALID [2022-02-20 20:00:07,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {27245#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27245#true} is VALID [2022-02-20 20:00:07,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {27245#true} #res := ~__retres1~2; {27245#true} is VALID [2022-02-20 20:00:07,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {27245#true} assume true; {27245#true} is VALID [2022-02-20 20:00:07,818 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {27245#true} {27246#false} #1086#return; {27246#false} is VALID [2022-02-20 20:00:07,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:07,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {27245#true} havoc ~__retres1~2; {27245#true} is VALID [2022-02-20 20:00:07,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {27245#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27245#true} is VALID [2022-02-20 20:00:07,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {27245#true} #res := ~__retres1~2; {27245#true} is VALID [2022-02-20 20:00:07,831 INFO L290 TraceCheckUtils]: 3: Hoare triple {27245#true} assume true; {27245#true} is VALID [2022-02-20 20:00:07,831 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {27245#true} {27246#false} #1086#return; {27246#false} is VALID [2022-02-20 20:00:07,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {27245#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {27245#true} is VALID [2022-02-20 20:00:07,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {27245#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {27245#true} is VALID [2022-02-20 20:00:07,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {27245#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {27245#true} is VALID [2022-02-20 20:00:07,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {27245#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; {27245#true} is VALID [2022-02-20 20:00:07,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {27245#true} call update_channels1(); {27291#(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:00:07,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {27291#(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); {27245#true} is VALID [2022-02-20 20:00:07,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {27245#true} assume true; {27245#true} is VALID [2022-02-20 20:00:07,833 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {27245#true} {27245#true} #1078#return; {27245#true} is VALID [2022-02-20 20:00:07,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {27245#true} assume { :begin_inline_init_threads1 } true; {27245#true} is VALID [2022-02-20 20:00:07,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {27245#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {27245#true} is VALID [2022-02-20 20:00:07,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {27245#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {27245#true} is VALID [2022-02-20 20:00:07,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {27245#true} assume { :end_inline_init_threads1 } true; {27245#true} is VALID [2022-02-20 20:00:07,834 INFO L272 TraceCheckUtils]: 12: Hoare triple {27245#true} call fire_delta_events1(); {27292#(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:00:07,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {27292#(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); {27245#true} is VALID [2022-02-20 20:00:07,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {27245#true} assume !(0 == ~q_write_ev~0); {27245#true} is VALID [2022-02-20 20:00:07,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {27245#true} assume true; {27245#true} is VALID [2022-02-20 20:00:07,834 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27245#true} {27245#true} #1080#return; {27245#true} is VALID [2022-02-20 20:00:07,835 INFO L272 TraceCheckUtils]: 17: Hoare triple {27245#true} call activate_threads1(); {27293#(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:00:07,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {27293#(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; {27245#true} is VALID [2022-02-20 20:00:07,835 INFO L272 TraceCheckUtils]: 19: Hoare triple {27245#true} call #t~ret8 := is_do_write_p_triggered(); {27245#true} is VALID [2022-02-20 20:00:07,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {27245#true} havoc ~__retres1~0; {27245#true} is VALID [2022-02-20 20:00:07,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {27245#true} assume !(1 == ~p_dw_pc~0); {27245#true} is VALID [2022-02-20 20:00:07,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {27245#true} assume !(2 == ~p_dw_pc~0); {27245#true} is VALID [2022-02-20 20:00:07,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {27245#true} ~__retres1~0 := 0; {27245#true} is VALID [2022-02-20 20:00:07,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {27245#true} #res := ~__retres1~0; {27245#true} is VALID [2022-02-20 20:00:07,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {27245#true} assume true; {27245#true} is VALID [2022-02-20 20:00:07,836 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27245#true} {27245#true} #1074#return; {27245#true} is VALID [2022-02-20 20:00:07,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {27245#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {27245#true} is VALID [2022-02-20 20:00:07,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {27245#true} assume !(0 != ~tmp~1); {27245#true} is VALID [2022-02-20 20:00:07,837 INFO L272 TraceCheckUtils]: 29: Hoare triple {27245#true} call #t~ret9 := is_do_read_c_triggered(); {27245#true} is VALID [2022-02-20 20:00:07,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {27245#true} havoc ~__retres1~1; {27245#true} is VALID [2022-02-20 20:00:07,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {27245#true} assume !(1 == ~c_dr_pc~0); {27245#true} is VALID [2022-02-20 20:00:07,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {27245#true} assume !(2 == ~c_dr_pc~0); {27245#true} is VALID [2022-02-20 20:00:07,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {27245#true} ~__retres1~1 := 0; {27310#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:07,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {27310#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {27311#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:07,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {27311#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {27311#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:07,839 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {27311#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {27245#true} #1076#return; {27308#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:07,840 INFO L290 TraceCheckUtils]: 37: Hoare triple {27308#(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; {27309#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:00:07,840 INFO L290 TraceCheckUtils]: 38: Hoare triple {27309#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {27246#false} is VALID [2022-02-20 20:00:07,840 INFO L290 TraceCheckUtils]: 39: Hoare triple {27246#false} assume true; {27246#false} is VALID [2022-02-20 20:00:07,840 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27246#false} {27245#true} #1082#return; {27246#false} is VALID [2022-02-20 20:00:07,840 INFO L272 TraceCheckUtils]: 41: Hoare triple {27246#false} call reset_delta_events1(); {27292#(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:00:07,841 INFO L290 TraceCheckUtils]: 42: Hoare triple {27292#(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; {27245#true} is VALID [2022-02-20 20:00:07,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {27245#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {27245#true} is VALID [2022-02-20 20:00:07,841 INFO L290 TraceCheckUtils]: 44: Hoare triple {27245#true} assume true; {27245#true} is VALID [2022-02-20 20:00:07,841 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {27245#true} {27246#false} #1084#return; {27246#false} is VALID [2022-02-20 20:00:07,841 INFO L290 TraceCheckUtils]: 46: Hoare triple {27246#false} assume !false; {27246#false} is VALID [2022-02-20 20:00:07,841 INFO L290 TraceCheckUtils]: 47: Hoare triple {27246#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; {27246#false} is VALID [2022-02-20 20:00:07,841 INFO L290 TraceCheckUtils]: 48: Hoare triple {27246#false} assume !false; {27246#false} is VALID [2022-02-20 20:00:07,842 INFO L272 TraceCheckUtils]: 49: Hoare triple {27246#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {27245#true} is VALID [2022-02-20 20:00:07,842 INFO L290 TraceCheckUtils]: 50: Hoare triple {27245#true} havoc ~__retres1~2; {27245#true} is VALID [2022-02-20 20:00:07,842 INFO L290 TraceCheckUtils]: 51: Hoare triple {27245#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27245#true} is VALID [2022-02-20 20:00:07,842 INFO L290 TraceCheckUtils]: 52: Hoare triple {27245#true} #res := ~__retres1~2; {27245#true} is VALID [2022-02-20 20:00:07,842 INFO L290 TraceCheckUtils]: 53: Hoare triple {27245#true} assume true; {27245#true} is VALID [2022-02-20 20:00:07,842 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {27245#true} {27246#false} #1086#return; {27246#false} is VALID [2022-02-20 20:00:07,843 INFO L290 TraceCheckUtils]: 55: Hoare triple {27246#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; {27246#false} is VALID [2022-02-20 20:00:07,843 INFO L290 TraceCheckUtils]: 56: Hoare triple {27246#false} assume 0 != eval1_~tmp___1~0#1; {27246#false} is VALID [2022-02-20 20:00:07,843 INFO L290 TraceCheckUtils]: 57: Hoare triple {27246#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; {27246#false} is VALID [2022-02-20 20:00:07,843 INFO L290 TraceCheckUtils]: 58: Hoare triple {27246#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; {27246#false} is VALID [2022-02-20 20:00:07,843 INFO L290 TraceCheckUtils]: 59: Hoare triple {27246#false} assume 0 == ~p_dw_pc~0; {27246#false} is VALID [2022-02-20 20:00:07,843 INFO L290 TraceCheckUtils]: 60: Hoare triple {27246#false} assume !false; {27246#false} is VALID [2022-02-20 20:00:07,844 INFO L290 TraceCheckUtils]: 61: Hoare triple {27246#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {27246#false} is VALID [2022-02-20 20:00:07,844 INFO L290 TraceCheckUtils]: 62: Hoare triple {27246#false} assume { :end_inline_do_write_p } true; {27246#false} is VALID [2022-02-20 20:00:07,844 INFO L290 TraceCheckUtils]: 63: Hoare triple {27246#false} assume !(0 == ~c_dr_st~0); {27246#false} is VALID [2022-02-20 20:00:07,844 INFO L290 TraceCheckUtils]: 64: Hoare triple {27246#false} assume !false; {27246#false} is VALID [2022-02-20 20:00:07,844 INFO L272 TraceCheckUtils]: 65: Hoare triple {27246#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {27245#true} is VALID [2022-02-20 20:00:07,844 INFO L290 TraceCheckUtils]: 66: Hoare triple {27245#true} havoc ~__retres1~2; {27245#true} is VALID [2022-02-20 20:00:07,844 INFO L290 TraceCheckUtils]: 67: Hoare triple {27245#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27245#true} is VALID [2022-02-20 20:00:07,845 INFO L290 TraceCheckUtils]: 68: Hoare triple {27245#true} #res := ~__retres1~2; {27245#true} is VALID [2022-02-20 20:00:07,845 INFO L290 TraceCheckUtils]: 69: Hoare triple {27245#true} assume true; {27245#true} is VALID [2022-02-20 20:00:07,845 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {27245#true} {27246#false} #1086#return; {27246#false} is VALID [2022-02-20 20:00:07,845 INFO L290 TraceCheckUtils]: 71: Hoare triple {27246#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; {27246#false} is VALID [2022-02-20 20:00:07,845 INFO L290 TraceCheckUtils]: 72: Hoare triple {27246#false} assume 0 != eval1_~tmp___1~0#1; {27246#false} is VALID [2022-02-20 20:00:07,845 INFO L290 TraceCheckUtils]: 73: Hoare triple {27246#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; {27246#false} is VALID [2022-02-20 20:00:07,845 INFO L290 TraceCheckUtils]: 74: Hoare triple {27246#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; {27246#false} is VALID [2022-02-20 20:00:07,846 INFO L290 TraceCheckUtils]: 75: Hoare triple {27246#false} assume !(0 == ~p_dw_pc~0); {27246#false} is VALID [2022-02-20 20:00:07,846 INFO L290 TraceCheckUtils]: 76: Hoare triple {27246#false} assume 1 == ~p_dw_pc~0; {27246#false} is VALID [2022-02-20 20:00:07,846 INFO L290 TraceCheckUtils]: 77: Hoare triple {27246#false} assume !(0 == ~q_free~0); {27246#false} is VALID [2022-02-20 20:00:07,846 INFO L290 TraceCheckUtils]: 78: Hoare triple {27246#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; {27246#false} is VALID [2022-02-20 20:00:07,846 INFO L290 TraceCheckUtils]: 79: Hoare triple {27246#false} assume !false; {27246#false} is VALID [2022-02-20 20:00:07,846 INFO L290 TraceCheckUtils]: 80: Hoare triple {27246#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {27246#false} is VALID [2022-02-20 20:00:07,847 INFO L290 TraceCheckUtils]: 81: Hoare triple {27246#false} assume { :end_inline_do_write_p } true; {27246#false} is VALID [2022-02-20 20:00:07,847 INFO L290 TraceCheckUtils]: 82: Hoare triple {27246#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; {27246#false} is VALID [2022-02-20 20:00:07,847 INFO L290 TraceCheckUtils]: 83: Hoare triple {27246#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; {27246#false} is VALID [2022-02-20 20:00:07,847 INFO L290 TraceCheckUtils]: 84: Hoare triple {27246#false} assume !(0 == ~c_dr_pc~0); {27246#false} is VALID [2022-02-20 20:00:07,847 INFO L290 TraceCheckUtils]: 85: Hoare triple {27246#false} assume 2 == ~c_dr_pc~0; {27246#false} is VALID [2022-02-20 20:00:07,847 INFO L290 TraceCheckUtils]: 86: Hoare triple {27246#false} do_read_c_~a~0#1 := ~a_t~0; {27246#false} is VALID [2022-02-20 20:00:07,847 INFO L290 TraceCheckUtils]: 87: Hoare triple {27246#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; {27246#false} is VALID [2022-02-20 20:00:07,848 INFO L290 TraceCheckUtils]: 88: Hoare triple {27246#false} assume !(~p_last_write~0 == ~c_last_read~0); {27246#false} is VALID [2022-02-20 20:00:07,848 INFO L272 TraceCheckUtils]: 89: Hoare triple {27246#false} call error1(); {27246#false} is VALID [2022-02-20 20:00:07,848 INFO L290 TraceCheckUtils]: 90: Hoare triple {27246#false} assume !false; {27246#false} is VALID [2022-02-20 20:00:07,848 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:00:07,848 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:07,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31497987] [2022-02-20 20:00:07,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31497987] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:07,850 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:07,850 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:07,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288824206] [2022-02-20 20:00:07,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:07,851 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:00:07,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:07,852 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:00:07,912 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:00:07,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:07,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:07,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:07,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:07,914 INFO L87 Difference]: Start difference. First operand 1490 states and 1990 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:00:10,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:10,709 INFO L93 Difference]: Finished difference Result 2932 states and 3927 transitions. [2022-02-20 20:00:10,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:00:10,709 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:00:10,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:10,710 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:00:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 604 transitions. [2022-02-20 20:00:10,713 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:00:10,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 604 transitions. [2022-02-20 20:00:10,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 604 transitions. [2022-02-20 20:00:11,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 604 edges. 604 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:11,247 INFO L225 Difference]: With dead ends: 2932 [2022-02-20 20:00:11,247 INFO L226 Difference]: Without dead ends: 1636 [2022-02-20 20:00:11,249 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:00:11,250 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 339 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1896 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:11,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 1896 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 20:00:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2022-02-20 20:00:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1530. [2022-02-20 20:00:11,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:11,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1636 states. Second operand has 1530 states, 1210 states have (on average 1.3413223140495867) internal successors, (1623), 1235 states have internal predecessors, (1623), 172 states have call successors, (172), 110 states have call predecessors, (172), 146 states have return successors, (229), 187 states have call predecessors, (229), 168 states have call successors, (229) [2022-02-20 20:00:11,326 INFO L74 IsIncluded]: Start isIncluded. First operand 1636 states. Second operand has 1530 states, 1210 states have (on average 1.3413223140495867) internal successors, (1623), 1235 states have internal predecessors, (1623), 172 states have call successors, (172), 110 states have call predecessors, (172), 146 states have return successors, (229), 187 states have call predecessors, (229), 168 states have call successors, (229) [2022-02-20 20:00:11,327 INFO L87 Difference]: Start difference. First operand 1636 states. Second operand has 1530 states, 1210 states have (on average 1.3413223140495867) internal successors, (1623), 1235 states have internal predecessors, (1623), 172 states have call successors, (172), 110 states have call predecessors, (172), 146 states have return successors, (229), 187 states have call predecessors, (229), 168 states have call successors, (229) [2022-02-20 20:00:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:11,403 INFO L93 Difference]: Finished difference Result 1636 states and 2178 transitions. [2022-02-20 20:00:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2178 transitions. [2022-02-20 20:00:11,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:11,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:11,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 1530 states, 1210 states have (on average 1.3413223140495867) internal successors, (1623), 1235 states have internal predecessors, (1623), 172 states have call successors, (172), 110 states have call predecessors, (172), 146 states have return successors, (229), 187 states have call predecessors, (229), 168 states have call successors, (229) Second operand 1636 states. [2022-02-20 20:00:11,411 INFO L87 Difference]: Start difference. First operand has 1530 states, 1210 states have (on average 1.3413223140495867) internal successors, (1623), 1235 states have internal predecessors, (1623), 172 states have call successors, (172), 110 states have call predecessors, (172), 146 states have return successors, (229), 187 states have call predecessors, (229), 168 states have call successors, (229) Second operand 1636 states. [2022-02-20 20:00:11,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:11,486 INFO L93 Difference]: Finished difference Result 1636 states and 2178 transitions. [2022-02-20 20:00:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2178 transitions. [2022-02-20 20:00:11,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:11,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:11,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:11,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1210 states have (on average 1.3413223140495867) internal successors, (1623), 1235 states have internal predecessors, (1623), 172 states have call successors, (172), 110 states have call predecessors, (172), 146 states have return successors, (229), 187 states have call predecessors, (229), 168 states have call successors, (229) [2022-02-20 20:00:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 2024 transitions. [2022-02-20 20:00:11,600 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 2024 transitions. Word has length 91 [2022-02-20 20:00:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:11,600 INFO L470 AbstractCegarLoop]: Abstraction has 1530 states and 2024 transitions. [2022-02-20 20:00:11,600 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:00:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 2024 transitions. [2022-02-20 20:00:11,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:11,602 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:11,602 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:00:11,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:00:11,602 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:11,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:11,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2106732696, now seen corresponding path program 1 times [2022-02-20 20:00:11,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:11,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754734288] [2022-02-20 20:00:11,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:11,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {36619#(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); {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:11,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:11,651 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {36574#(= ~q_read_ev~0 2)} #1078#return; {36574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:11,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {36621#(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); {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:11,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(0 == ~q_write_ev~0); {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:11,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:11,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {36574#(= ~q_read_ev~0 2)} #1080#return; {36574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:11,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {36572#true} havoc ~__retres1~0; {36572#true} is VALID [2022-02-20 20:00:11,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {36572#true} assume !(1 == ~p_dw_pc~0); {36572#true} is VALID [2022-02-20 20:00:11,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {36572#true} assume !(2 == ~p_dw_pc~0); {36572#true} is VALID [2022-02-20 20:00:11,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {36572#true} ~__retres1~0 := 0; {36572#true} is VALID [2022-02-20 20:00:11,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {36572#true} #res := ~__retres1~0; {36572#true} is VALID [2022-02-20 20:00:11,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {36572#true} assume true; {36572#true} is VALID [2022-02-20 20:00:11,686 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {36572#true} {36572#true} #1074#return; {36572#true} is VALID [2022-02-20 20:00:11,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {36572#true} havoc ~__retres1~1; {36572#true} is VALID [2022-02-20 20:00:11,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {36572#true} assume !(1 == ~c_dr_pc~0); {36572#true} is VALID [2022-02-20 20:00:11,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {36572#true} assume !(2 == ~c_dr_pc~0); {36572#true} is VALID [2022-02-20 20:00:11,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {36572#true} ~__retres1~1 := 0; {36572#true} is VALID [2022-02-20 20:00:11,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {36572#true} #res := ~__retres1~1; {36572#true} is VALID [2022-02-20 20:00:11,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {36572#true} assume true; {36572#true} is VALID [2022-02-20 20:00:11,691 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {36572#true} {36572#true} #1076#return; {36572#true} is VALID [2022-02-20 20:00:11,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {36622#(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; {36572#true} is VALID [2022-02-20 20:00:11,691 INFO L272 TraceCheckUtils]: 1: Hoare triple {36572#true} call #t~ret8 := is_do_write_p_triggered(); {36572#true} is VALID [2022-02-20 20:00:11,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {36572#true} havoc ~__retres1~0; {36572#true} is VALID [2022-02-20 20:00:11,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {36572#true} assume !(1 == ~p_dw_pc~0); {36572#true} is VALID [2022-02-20 20:00:11,692 INFO L290 TraceCheckUtils]: 4: Hoare triple {36572#true} assume !(2 == ~p_dw_pc~0); {36572#true} is VALID [2022-02-20 20:00:11,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {36572#true} ~__retres1~0 := 0; {36572#true} is VALID [2022-02-20 20:00:11,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {36572#true} #res := ~__retres1~0; {36572#true} is VALID [2022-02-20 20:00:11,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {36572#true} assume true; {36572#true} is VALID [2022-02-20 20:00:11,692 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {36572#true} {36572#true} #1074#return; {36572#true} is VALID [2022-02-20 20:00:11,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {36572#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {36572#true} is VALID [2022-02-20 20:00:11,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {36572#true} assume !(0 != ~tmp~1); {36572#true} is VALID [2022-02-20 20:00:11,693 INFO L272 TraceCheckUtils]: 11: Hoare triple {36572#true} call #t~ret9 := is_do_read_c_triggered(); {36572#true} is VALID [2022-02-20 20:00:11,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {36572#true} havoc ~__retres1~1; {36572#true} is VALID [2022-02-20 20:00:11,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {36572#true} assume !(1 == ~c_dr_pc~0); {36572#true} is VALID [2022-02-20 20:00:11,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {36572#true} assume !(2 == ~c_dr_pc~0); {36572#true} is VALID [2022-02-20 20:00:11,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {36572#true} ~__retres1~1 := 0; {36572#true} is VALID [2022-02-20 20:00:11,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {36572#true} #res := ~__retres1~1; {36572#true} is VALID [2022-02-20 20:00:11,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {36572#true} assume true; {36572#true} is VALID [2022-02-20 20:00:11,694 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {36572#true} {36572#true} #1076#return; {36572#true} is VALID [2022-02-20 20:00:11,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {36572#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {36572#true} is VALID [2022-02-20 20:00:11,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {36572#true} assume !(0 != ~tmp___0~1); {36572#true} is VALID [2022-02-20 20:00:11,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {36572#true} assume true; {36572#true} is VALID [2022-02-20 20:00:11,696 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {36572#true} {36574#(= ~q_read_ev~0 2)} #1082#return; {36574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:11,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {36621#(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; {36637#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 20:00:11,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {36637#(= |old(~q_read_ev~0)| 1)} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {36637#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 20:00:11,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {36637#(= |old(~q_read_ev~0)| 1)} assume true; {36637#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 20:00:11,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36637#(= |old(~q_read_ev~0)| 1)} {36574#(= ~q_read_ev~0 2)} #1084#return; {36573#false} is VALID [2022-02-20 20:00:11,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {36572#true} havoc ~__retres1~2; {36572#true} is VALID [2022-02-20 20:00:11,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {36572#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {36572#true} is VALID [2022-02-20 20:00:11,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {36572#true} #res := ~__retres1~2; {36572#true} is VALID [2022-02-20 20:00:11,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {36572#true} assume true; {36572#true} is VALID [2022-02-20 20:00:11,715 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {36572#true} {36573#false} #1086#return; {36573#false} is VALID [2022-02-20 20:00:11,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {36572#true} havoc ~__retres1~2; {36572#true} is VALID [2022-02-20 20:00:11,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {36572#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {36572#true} is VALID [2022-02-20 20:00:11,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {36572#true} #res := ~__retres1~2; {36572#true} is VALID [2022-02-20 20:00:11,720 INFO L290 TraceCheckUtils]: 3: Hoare triple {36572#true} assume true; {36572#true} is VALID [2022-02-20 20:00:11,720 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {36572#true} {36573#false} #1086#return; {36573#false} is VALID [2022-02-20 20:00:11,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {36572#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {36572#true} is VALID [2022-02-20 20:00:11,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {36572#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {36572#true} is VALID [2022-02-20 20:00:11,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {36572#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {36574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:11,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {36574#(= ~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; {36574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:11,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {36574#(= ~q_read_ev~0 2)} call update_channels1(); {36619#(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:00:11,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {36619#(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); {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:11,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:11,723 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {36574#(= ~q_read_ev~0 2)} #1078#return; {36574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:11,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {36574#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {36574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:11,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {36574#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {36574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:11,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {36574#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {36574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:11,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {36574#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {36574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:11,725 INFO L272 TraceCheckUtils]: 12: Hoare triple {36574#(= ~q_read_ev~0 2)} call fire_delta_events1(); {36621#(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:00:11,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {36621#(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); {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:11,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(0 == ~q_write_ev~0); {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:11,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:11,726 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36620#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {36574#(= ~q_read_ev~0 2)} #1080#return; {36574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:11,727 INFO L272 TraceCheckUtils]: 17: Hoare triple {36574#(= ~q_read_ev~0 2)} call activate_threads1(); {36622#(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:00:11,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {36622#(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; {36572#true} is VALID [2022-02-20 20:00:11,727 INFO L272 TraceCheckUtils]: 19: Hoare triple {36572#true} call #t~ret8 := is_do_write_p_triggered(); {36572#true} is VALID [2022-02-20 20:00:11,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {36572#true} havoc ~__retres1~0; {36572#true} is VALID [2022-02-20 20:00:11,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {36572#true} assume !(1 == ~p_dw_pc~0); {36572#true} is VALID [2022-02-20 20:00:11,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {36572#true} assume !(2 == ~p_dw_pc~0); {36572#true} is VALID [2022-02-20 20:00:11,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {36572#true} ~__retres1~0 := 0; {36572#true} is VALID [2022-02-20 20:00:11,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {36572#true} #res := ~__retres1~0; {36572#true} is VALID [2022-02-20 20:00:11,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {36572#true} assume true; {36572#true} is VALID [2022-02-20 20:00:11,727 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {36572#true} {36572#true} #1074#return; {36572#true} is VALID [2022-02-20 20:00:11,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {36572#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {36572#true} is VALID [2022-02-20 20:00:11,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {36572#true} assume !(0 != ~tmp~1); {36572#true} is VALID [2022-02-20 20:00:11,727 INFO L272 TraceCheckUtils]: 29: Hoare triple {36572#true} call #t~ret9 := is_do_read_c_triggered(); {36572#true} is VALID [2022-02-20 20:00:11,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {36572#true} havoc ~__retres1~1; {36572#true} is VALID [2022-02-20 20:00:11,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {36572#true} assume !(1 == ~c_dr_pc~0); {36572#true} is VALID [2022-02-20 20:00:11,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {36572#true} assume !(2 == ~c_dr_pc~0); {36572#true} is VALID [2022-02-20 20:00:11,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {36572#true} ~__retres1~1 := 0; {36572#true} is VALID [2022-02-20 20:00:11,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {36572#true} #res := ~__retres1~1; {36572#true} is VALID [2022-02-20 20:00:11,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {36572#true} assume true; {36572#true} is VALID [2022-02-20 20:00:11,728 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {36572#true} {36572#true} #1076#return; {36572#true} is VALID [2022-02-20 20:00:11,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {36572#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {36572#true} is VALID [2022-02-20 20:00:11,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {36572#true} assume !(0 != ~tmp___0~1); {36572#true} is VALID [2022-02-20 20:00:11,729 INFO L290 TraceCheckUtils]: 39: Hoare triple {36572#true} assume true; {36572#true} is VALID [2022-02-20 20:00:11,729 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {36572#true} {36574#(= ~q_read_ev~0 2)} #1082#return; {36574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:11,729 INFO L272 TraceCheckUtils]: 41: Hoare triple {36574#(= ~q_read_ev~0 2)} call reset_delta_events1(); {36621#(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:00:11,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {36621#(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; {36637#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 20:00:11,730 INFO L290 TraceCheckUtils]: 43: Hoare triple {36637#(= |old(~q_read_ev~0)| 1)} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {36637#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 20:00:11,730 INFO L290 TraceCheckUtils]: 44: Hoare triple {36637#(= |old(~q_read_ev~0)| 1)} assume true; {36637#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 20:00:11,731 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {36637#(= |old(~q_read_ev~0)| 1)} {36574#(= ~q_read_ev~0 2)} #1084#return; {36573#false} is VALID [2022-02-20 20:00:11,731 INFO L290 TraceCheckUtils]: 46: Hoare triple {36573#false} assume !false; {36573#false} is VALID [2022-02-20 20:00:11,731 INFO L290 TraceCheckUtils]: 47: Hoare triple {36573#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; {36573#false} is VALID [2022-02-20 20:00:11,731 INFO L290 TraceCheckUtils]: 48: Hoare triple {36573#false} assume !false; {36573#false} is VALID [2022-02-20 20:00:11,731 INFO L272 TraceCheckUtils]: 49: Hoare triple {36573#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {36572#true} is VALID [2022-02-20 20:00:11,731 INFO L290 TraceCheckUtils]: 50: Hoare triple {36572#true} havoc ~__retres1~2; {36572#true} is VALID [2022-02-20 20:00:11,732 INFO L290 TraceCheckUtils]: 51: Hoare triple {36572#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {36572#true} is VALID [2022-02-20 20:00:11,732 INFO L290 TraceCheckUtils]: 52: Hoare triple {36572#true} #res := ~__retres1~2; {36572#true} is VALID [2022-02-20 20:00:11,732 INFO L290 TraceCheckUtils]: 53: Hoare triple {36572#true} assume true; {36572#true} is VALID [2022-02-20 20:00:11,732 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {36572#true} {36573#false} #1086#return; {36573#false} is VALID [2022-02-20 20:00:11,732 INFO L290 TraceCheckUtils]: 55: Hoare triple {36573#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; {36573#false} is VALID [2022-02-20 20:00:11,732 INFO L290 TraceCheckUtils]: 56: Hoare triple {36573#false} assume 0 != eval1_~tmp___1~0#1; {36573#false} is VALID [2022-02-20 20:00:11,732 INFO L290 TraceCheckUtils]: 57: Hoare triple {36573#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; {36573#false} is VALID [2022-02-20 20:00:11,732 INFO L290 TraceCheckUtils]: 58: Hoare triple {36573#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; {36573#false} is VALID [2022-02-20 20:00:11,732 INFO L290 TraceCheckUtils]: 59: Hoare triple {36573#false} assume 0 == ~p_dw_pc~0; {36573#false} is VALID [2022-02-20 20:00:11,733 INFO L290 TraceCheckUtils]: 60: Hoare triple {36573#false} assume !false; {36573#false} is VALID [2022-02-20 20:00:11,733 INFO L290 TraceCheckUtils]: 61: Hoare triple {36573#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {36573#false} is VALID [2022-02-20 20:00:11,733 INFO L290 TraceCheckUtils]: 62: Hoare triple {36573#false} assume { :end_inline_do_write_p } true; {36573#false} is VALID [2022-02-20 20:00:11,733 INFO L290 TraceCheckUtils]: 63: Hoare triple {36573#false} assume !(0 == ~c_dr_st~0); {36573#false} is VALID [2022-02-20 20:00:11,733 INFO L290 TraceCheckUtils]: 64: Hoare triple {36573#false} assume !false; {36573#false} is VALID [2022-02-20 20:00:11,733 INFO L272 TraceCheckUtils]: 65: Hoare triple {36573#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {36572#true} is VALID [2022-02-20 20:00:11,733 INFO L290 TraceCheckUtils]: 66: Hoare triple {36572#true} havoc ~__retres1~2; {36572#true} is VALID [2022-02-20 20:00:11,733 INFO L290 TraceCheckUtils]: 67: Hoare triple {36572#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {36572#true} is VALID [2022-02-20 20:00:11,734 INFO L290 TraceCheckUtils]: 68: Hoare triple {36572#true} #res := ~__retres1~2; {36572#true} is VALID [2022-02-20 20:00:11,734 INFO L290 TraceCheckUtils]: 69: Hoare triple {36572#true} assume true; {36572#true} is VALID [2022-02-20 20:00:11,734 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {36572#true} {36573#false} #1086#return; {36573#false} is VALID [2022-02-20 20:00:11,734 INFO L290 TraceCheckUtils]: 71: Hoare triple {36573#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; {36573#false} is VALID [2022-02-20 20:00:11,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {36573#false} assume 0 != eval1_~tmp___1~0#1; {36573#false} is VALID [2022-02-20 20:00:11,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {36573#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; {36573#false} is VALID [2022-02-20 20:00:11,734 INFO L290 TraceCheckUtils]: 74: Hoare triple {36573#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; {36573#false} is VALID [2022-02-20 20:00:11,734 INFO L290 TraceCheckUtils]: 75: Hoare triple {36573#false} assume !(0 == ~p_dw_pc~0); {36573#false} is VALID [2022-02-20 20:00:11,734 INFO L290 TraceCheckUtils]: 76: Hoare triple {36573#false} assume 1 == ~p_dw_pc~0; {36573#false} is VALID [2022-02-20 20:00:11,735 INFO L290 TraceCheckUtils]: 77: Hoare triple {36573#false} assume !(0 == ~q_free~0); {36573#false} is VALID [2022-02-20 20:00:11,735 INFO L290 TraceCheckUtils]: 78: Hoare triple {36573#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; {36573#false} is VALID [2022-02-20 20:00:11,735 INFO L290 TraceCheckUtils]: 79: Hoare triple {36573#false} assume !false; {36573#false} is VALID [2022-02-20 20:00:11,735 INFO L290 TraceCheckUtils]: 80: Hoare triple {36573#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {36573#false} is VALID [2022-02-20 20:00:11,735 INFO L290 TraceCheckUtils]: 81: Hoare triple {36573#false} assume { :end_inline_do_write_p } true; {36573#false} is VALID [2022-02-20 20:00:11,735 INFO L290 TraceCheckUtils]: 82: Hoare triple {36573#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; {36573#false} is VALID [2022-02-20 20:00:11,735 INFO L290 TraceCheckUtils]: 83: Hoare triple {36573#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; {36573#false} is VALID [2022-02-20 20:00:11,735 INFO L290 TraceCheckUtils]: 84: Hoare triple {36573#false} assume !(0 == ~c_dr_pc~0); {36573#false} is VALID [2022-02-20 20:00:11,736 INFO L290 TraceCheckUtils]: 85: Hoare triple {36573#false} assume 2 == ~c_dr_pc~0; {36573#false} is VALID [2022-02-20 20:00:11,736 INFO L290 TraceCheckUtils]: 86: Hoare triple {36573#false} do_read_c_~a~0#1 := ~a_t~0; {36573#false} is VALID [2022-02-20 20:00:11,736 INFO L290 TraceCheckUtils]: 87: Hoare triple {36573#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; {36573#false} is VALID [2022-02-20 20:00:11,736 INFO L290 TraceCheckUtils]: 88: Hoare triple {36573#false} assume !(~p_last_write~0 == ~c_last_read~0); {36573#false} is VALID [2022-02-20 20:00:11,736 INFO L272 TraceCheckUtils]: 89: Hoare triple {36573#false} call error1(); {36573#false} is VALID [2022-02-20 20:00:11,736 INFO L290 TraceCheckUtils]: 90: Hoare triple {36573#false} assume !false; {36573#false} is VALID [2022-02-20 20:00:11,736 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:00:11,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:11,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754734288] [2022-02-20 20:00:11,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754734288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:11,737 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:11,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:11,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54080780] [2022-02-20 20:00:11,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:11,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 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:00:11,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:11,738 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), 5 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:00:11,782 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:00:11,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:11,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:11,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:11,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:11,783 INFO L87 Difference]: Start difference. First operand 1530 states and 2024 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 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:00:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:14,436 INFO L93 Difference]: Finished difference Result 3322 states and 4390 transitions. [2022-02-20 20:00:14,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 20:00:14,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 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:00:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 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:00:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 788 transitions. [2022-02-20 20:00:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 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:00:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 788 transitions. [2022-02-20 20:00:14,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 788 transitions. [2022-02-20 20:00:14,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 788 edges. 788 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:15,168 INFO L225 Difference]: With dead ends: 3322 [2022-02-20 20:00:15,168 INFO L226 Difference]: Without dead ends: 2060 [2022-02-20 20:00:15,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-20 20:00:15,170 INFO L933 BasicCegarLoop]: 446 mSDtfsCounter, 577 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:15,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [584 Valid, 1422 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 20:00:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2022-02-20 20:00:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1884. [2022-02-20 20:00:15,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:15,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2060 states. Second operand has 1884 states, 1492 states have (on average 1.3136729222520107) internal successors, (1960), 1518 states have internal predecessors, (1960), 212 states have call successors, (212), 140 states have call predecessors, (212), 178 states have return successors, (270), 228 states have call predecessors, (270), 208 states have call successors, (270) [2022-02-20 20:00:15,264 INFO L74 IsIncluded]: Start isIncluded. First operand 2060 states. Second operand has 1884 states, 1492 states have (on average 1.3136729222520107) internal successors, (1960), 1518 states have internal predecessors, (1960), 212 states have call successors, (212), 140 states have call predecessors, (212), 178 states have return successors, (270), 228 states have call predecessors, (270), 208 states have call successors, (270) [2022-02-20 20:00:15,266 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand has 1884 states, 1492 states have (on average 1.3136729222520107) internal successors, (1960), 1518 states have internal predecessors, (1960), 212 states have call successors, (212), 140 states have call predecessors, (212), 178 states have return successors, (270), 228 states have call predecessors, (270), 208 states have call successors, (270) [2022-02-20 20:00:15,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:15,388 INFO L93 Difference]: Finished difference Result 2060 states and 2675 transitions. [2022-02-20 20:00:15,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 2675 transitions. [2022-02-20 20:00:15,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:15,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:15,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 1884 states, 1492 states have (on average 1.3136729222520107) internal successors, (1960), 1518 states have internal predecessors, (1960), 212 states have call successors, (212), 140 states have call predecessors, (212), 178 states have return successors, (270), 228 states have call predecessors, (270), 208 states have call successors, (270) Second operand 2060 states. [2022-02-20 20:00:15,399 INFO L87 Difference]: Start difference. First operand has 1884 states, 1492 states have (on average 1.3136729222520107) internal successors, (1960), 1518 states have internal predecessors, (1960), 212 states have call successors, (212), 140 states have call predecessors, (212), 178 states have return successors, (270), 228 states have call predecessors, (270), 208 states have call successors, (270) Second operand 2060 states. [2022-02-20 20:00:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:15,525 INFO L93 Difference]: Finished difference Result 2060 states and 2675 transitions. [2022-02-20 20:00:15,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 2675 transitions. [2022-02-20 20:00:15,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:15,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:15,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:15,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1492 states have (on average 1.3136729222520107) internal successors, (1960), 1518 states have internal predecessors, (1960), 212 states have call successors, (212), 140 states have call predecessors, (212), 178 states have return successors, (270), 228 states have call predecessors, (270), 208 states have call successors, (270) [2022-02-20 20:00:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2442 transitions. [2022-02-20 20:00:15,690 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2442 transitions. Word has length 91 [2022-02-20 20:00:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:15,690 INFO L470 AbstractCegarLoop]: Abstraction has 1884 states and 2442 transitions. [2022-02-20 20:00:15,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 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:00:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2442 transitions. [2022-02-20 20:00:15,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:15,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:15,692 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:00:15,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:00:15,693 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:15,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:15,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2122251414, now seen corresponding path program 1 times [2022-02-20 20:00:15,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:15,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359625937] [2022-02-20 20:00:15,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:15,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:15,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:15,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {47799#(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); {47800#(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:00:15,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {47800#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {47800#(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:00:15,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47800#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {47754#(= ~q_write_ev~0 ~q_read_ev~0)} #1078#return; {47754#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:15,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:15,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {47800#(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); {47800#(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:00:15,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {47800#(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); {47800#(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:00:15,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {47800#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {47800#(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:00:15,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47800#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {47754#(= ~q_write_ev~0 ~q_read_ev~0)} #1080#return; {47754#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:15,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:15,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:15,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {47752#true} havoc ~__retres1~0; {47752#true} is VALID [2022-02-20 20:00:15,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {47752#true} assume !(1 == ~p_dw_pc~0); {47752#true} is VALID [2022-02-20 20:00:15,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {47752#true} assume !(2 == ~p_dw_pc~0); {47752#true} is VALID [2022-02-20 20:00:15,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {47752#true} ~__retres1~0 := 0; {47752#true} is VALID [2022-02-20 20:00:15,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {47752#true} #res := ~__retres1~0; {47752#true} is VALID [2022-02-20 20:00:15,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {47752#true} assume true; {47752#true} is VALID [2022-02-20 20:00:15,785 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {47752#true} {47752#true} #1074#return; {47752#true} is VALID [2022-02-20 20:00:15,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:15,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {47752#true} havoc ~__retres1~1; {47752#true} is VALID [2022-02-20 20:00:15,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {47752#true} assume !(1 == ~c_dr_pc~0); {47752#true} is VALID [2022-02-20 20:00:15,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {47752#true} assume !(2 == ~c_dr_pc~0); {47752#true} is VALID [2022-02-20 20:00:15,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {47752#true} ~__retres1~1 := 0; {47752#true} is VALID [2022-02-20 20:00:15,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {47752#true} #res := ~__retres1~1; {47752#true} is VALID [2022-02-20 20:00:15,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {47752#true} assume true; {47752#true} is VALID [2022-02-20 20:00:15,791 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {47752#true} {47752#true} #1076#return; {47752#true} is VALID [2022-02-20 20:00:15,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {47801#(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; {47752#true} is VALID [2022-02-20 20:00:15,791 INFO L272 TraceCheckUtils]: 1: Hoare triple {47752#true} call #t~ret8 := is_do_write_p_triggered(); {47752#true} is VALID [2022-02-20 20:00:15,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {47752#true} havoc ~__retres1~0; {47752#true} is VALID [2022-02-20 20:00:15,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {47752#true} assume !(1 == ~p_dw_pc~0); {47752#true} is VALID [2022-02-20 20:00:15,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {47752#true} assume !(2 == ~p_dw_pc~0); {47752#true} is VALID [2022-02-20 20:00:15,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {47752#true} ~__retres1~0 := 0; {47752#true} is VALID [2022-02-20 20:00:15,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {47752#true} #res := ~__retres1~0; {47752#true} is VALID [2022-02-20 20:00:15,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {47752#true} assume true; {47752#true} is VALID [2022-02-20 20:00:15,792 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {47752#true} {47752#true} #1074#return; {47752#true} is VALID [2022-02-20 20:00:15,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {47752#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {47752#true} is VALID [2022-02-20 20:00:15,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {47752#true} assume !(0 != ~tmp~1); {47752#true} is VALID [2022-02-20 20:00:15,792 INFO L272 TraceCheckUtils]: 11: Hoare triple {47752#true} call #t~ret9 := is_do_read_c_triggered(); {47752#true} is VALID [2022-02-20 20:00:15,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {47752#true} havoc ~__retres1~1; {47752#true} is VALID [2022-02-20 20:00:15,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {47752#true} assume !(1 == ~c_dr_pc~0); {47752#true} is VALID [2022-02-20 20:00:15,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {47752#true} assume !(2 == ~c_dr_pc~0); {47752#true} is VALID [2022-02-20 20:00:15,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {47752#true} ~__retres1~1 := 0; {47752#true} is VALID [2022-02-20 20:00:15,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {47752#true} #res := ~__retres1~1; {47752#true} is VALID [2022-02-20 20:00:15,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {47752#true} assume true; {47752#true} is VALID [2022-02-20 20:00:15,793 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {47752#true} {47752#true} #1076#return; {47752#true} is VALID [2022-02-20 20:00:15,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {47752#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {47752#true} is VALID [2022-02-20 20:00:15,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {47752#true} assume !(0 != ~tmp___0~1); {47752#true} is VALID [2022-02-20 20:00:15,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {47752#true} assume true; {47752#true} is VALID [2022-02-20 20:00:15,794 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {47752#true} {47754#(= ~q_write_ev~0 ~q_read_ev~0)} #1082#return; {47754#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:15,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:15,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {47800#(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); {47816#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:00:15,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {47816#(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; {47817#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:15,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {47817#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {47817#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:15,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47817#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {47754#(= ~q_write_ev~0 ~q_read_ev~0)} #1084#return; {47753#false} is VALID [2022-02-20 20:00:15,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:15,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {47752#true} havoc ~__retres1~2; {47752#true} is VALID [2022-02-20 20:00:15,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {47752#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {47752#true} is VALID [2022-02-20 20:00:15,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {47752#true} #res := ~__retres1~2; {47752#true} is VALID [2022-02-20 20:00:15,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {47752#true} assume true; {47752#true} is VALID [2022-02-20 20:00:15,822 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {47752#true} {47753#false} #1086#return; {47753#false} is VALID [2022-02-20 20:00:15,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:15,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {47752#true} havoc ~__retres1~2; {47752#true} is VALID [2022-02-20 20:00:15,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {47752#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {47752#true} is VALID [2022-02-20 20:00:15,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {47752#true} #res := ~__retres1~2; {47752#true} is VALID [2022-02-20 20:00:15,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {47752#true} assume true; {47752#true} is VALID [2022-02-20 20:00:15,826 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {47752#true} {47753#false} #1086#return; {47753#false} is VALID [2022-02-20 20:00:15,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {47752#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {47752#true} is VALID [2022-02-20 20:00:15,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {47752#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {47752#true} is VALID [2022-02-20 20:00:15,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {47752#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {47754#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:15,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {47754#(= ~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; {47754#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:15,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {47754#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {47799#(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:00:15,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {47799#(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); {47800#(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:00:15,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {47800#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {47800#(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:00:15,829 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {47800#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {47754#(= ~q_write_ev~0 ~q_read_ev~0)} #1078#return; {47754#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:15,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {47754#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {47754#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:15,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {47754#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {47754#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:15,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {47754#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {47754#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:15,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {47754#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {47754#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:15,830 INFO L272 TraceCheckUtils]: 12: Hoare triple {47754#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {47800#(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:00:15,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {47800#(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); {47800#(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:00:15,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {47800#(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); {47800#(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:00:15,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {47800#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {47800#(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:00:15,832 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {47800#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {47754#(= ~q_write_ev~0 ~q_read_ev~0)} #1080#return; {47754#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:15,832 INFO L272 TraceCheckUtils]: 17: Hoare triple {47754#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {47801#(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:00:15,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {47801#(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; {47752#true} is VALID [2022-02-20 20:00:15,832 INFO L272 TraceCheckUtils]: 19: Hoare triple {47752#true} call #t~ret8 := is_do_write_p_triggered(); {47752#true} is VALID [2022-02-20 20:00:15,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {47752#true} havoc ~__retres1~0; {47752#true} is VALID [2022-02-20 20:00:15,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {47752#true} assume !(1 == ~p_dw_pc~0); {47752#true} is VALID [2022-02-20 20:00:15,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {47752#true} assume !(2 == ~p_dw_pc~0); {47752#true} is VALID [2022-02-20 20:00:15,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {47752#true} ~__retres1~0 := 0; {47752#true} is VALID [2022-02-20 20:00:15,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {47752#true} #res := ~__retres1~0; {47752#true} is VALID [2022-02-20 20:00:15,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {47752#true} assume true; {47752#true} is VALID [2022-02-20 20:00:15,833 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {47752#true} {47752#true} #1074#return; {47752#true} is VALID [2022-02-20 20:00:15,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {47752#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {47752#true} is VALID [2022-02-20 20:00:15,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {47752#true} assume !(0 != ~tmp~1); {47752#true} is VALID [2022-02-20 20:00:15,834 INFO L272 TraceCheckUtils]: 29: Hoare triple {47752#true} call #t~ret9 := is_do_read_c_triggered(); {47752#true} is VALID [2022-02-20 20:00:15,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {47752#true} havoc ~__retres1~1; {47752#true} is VALID [2022-02-20 20:00:15,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {47752#true} assume !(1 == ~c_dr_pc~0); {47752#true} is VALID [2022-02-20 20:00:15,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {47752#true} assume !(2 == ~c_dr_pc~0); {47752#true} is VALID [2022-02-20 20:00:15,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {47752#true} ~__retres1~1 := 0; {47752#true} is VALID [2022-02-20 20:00:15,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {47752#true} #res := ~__retres1~1; {47752#true} is VALID [2022-02-20 20:00:15,834 INFO L290 TraceCheckUtils]: 35: Hoare triple {47752#true} assume true; {47752#true} is VALID [2022-02-20 20:00:15,834 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {47752#true} {47752#true} #1076#return; {47752#true} is VALID [2022-02-20 20:00:15,835 INFO L290 TraceCheckUtils]: 37: Hoare triple {47752#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {47752#true} is VALID [2022-02-20 20:00:15,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {47752#true} assume !(0 != ~tmp___0~1); {47752#true} is VALID [2022-02-20 20:00:15,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {47752#true} assume true; {47752#true} is VALID [2022-02-20 20:00:15,835 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {47752#true} {47754#(= ~q_write_ev~0 ~q_read_ev~0)} #1082#return; {47754#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:15,836 INFO L272 TraceCheckUtils]: 41: Hoare triple {47754#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {47800#(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:00:15,836 INFO L290 TraceCheckUtils]: 42: Hoare triple {47800#(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); {47816#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:00:15,836 INFO L290 TraceCheckUtils]: 43: Hoare triple {47816#(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; {47817#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:15,837 INFO L290 TraceCheckUtils]: 44: Hoare triple {47817#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {47817#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:15,837 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {47817#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {47754#(= ~q_write_ev~0 ~q_read_ev~0)} #1084#return; {47753#false} is VALID [2022-02-20 20:00:15,837 INFO L290 TraceCheckUtils]: 46: Hoare triple {47753#false} assume !false; {47753#false} is VALID [2022-02-20 20:00:15,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {47753#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; {47753#false} is VALID [2022-02-20 20:00:15,837 INFO L290 TraceCheckUtils]: 48: Hoare triple {47753#false} assume !false; {47753#false} is VALID [2022-02-20 20:00:15,837 INFO L272 TraceCheckUtils]: 49: Hoare triple {47753#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {47752#true} is VALID [2022-02-20 20:00:15,838 INFO L290 TraceCheckUtils]: 50: Hoare triple {47752#true} havoc ~__retres1~2; {47752#true} is VALID [2022-02-20 20:00:15,838 INFO L290 TraceCheckUtils]: 51: Hoare triple {47752#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {47752#true} is VALID [2022-02-20 20:00:15,838 INFO L290 TraceCheckUtils]: 52: Hoare triple {47752#true} #res := ~__retres1~2; {47752#true} is VALID [2022-02-20 20:00:15,838 INFO L290 TraceCheckUtils]: 53: Hoare triple {47752#true} assume true; {47752#true} is VALID [2022-02-20 20:00:15,838 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {47752#true} {47753#false} #1086#return; {47753#false} is VALID [2022-02-20 20:00:15,838 INFO L290 TraceCheckUtils]: 55: Hoare triple {47753#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; {47753#false} is VALID [2022-02-20 20:00:15,838 INFO L290 TraceCheckUtils]: 56: Hoare triple {47753#false} assume 0 != eval1_~tmp___1~0#1; {47753#false} is VALID [2022-02-20 20:00:15,838 INFO L290 TraceCheckUtils]: 57: Hoare triple {47753#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; {47753#false} is VALID [2022-02-20 20:00:15,838 INFO L290 TraceCheckUtils]: 58: Hoare triple {47753#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; {47753#false} is VALID [2022-02-20 20:00:15,839 INFO L290 TraceCheckUtils]: 59: Hoare triple {47753#false} assume 0 == ~p_dw_pc~0; {47753#false} is VALID [2022-02-20 20:00:15,839 INFO L290 TraceCheckUtils]: 60: Hoare triple {47753#false} assume !false; {47753#false} is VALID [2022-02-20 20:00:15,839 INFO L290 TraceCheckUtils]: 61: Hoare triple {47753#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {47753#false} is VALID [2022-02-20 20:00:15,839 INFO L290 TraceCheckUtils]: 62: Hoare triple {47753#false} assume { :end_inline_do_write_p } true; {47753#false} is VALID [2022-02-20 20:00:15,839 INFO L290 TraceCheckUtils]: 63: Hoare triple {47753#false} assume !(0 == ~c_dr_st~0); {47753#false} is VALID [2022-02-20 20:00:15,839 INFO L290 TraceCheckUtils]: 64: Hoare triple {47753#false} assume !false; {47753#false} is VALID [2022-02-20 20:00:15,839 INFO L272 TraceCheckUtils]: 65: Hoare triple {47753#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {47752#true} is VALID [2022-02-20 20:00:15,839 INFO L290 TraceCheckUtils]: 66: Hoare triple {47752#true} havoc ~__retres1~2; {47752#true} is VALID [2022-02-20 20:00:15,840 INFO L290 TraceCheckUtils]: 67: Hoare triple {47752#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {47752#true} is VALID [2022-02-20 20:00:15,840 INFO L290 TraceCheckUtils]: 68: Hoare triple {47752#true} #res := ~__retres1~2; {47752#true} is VALID [2022-02-20 20:00:15,840 INFO L290 TraceCheckUtils]: 69: Hoare triple {47752#true} assume true; {47752#true} is VALID [2022-02-20 20:00:15,840 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {47752#true} {47753#false} #1086#return; {47753#false} is VALID [2022-02-20 20:00:15,840 INFO L290 TraceCheckUtils]: 71: Hoare triple {47753#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; {47753#false} is VALID [2022-02-20 20:00:15,840 INFO L290 TraceCheckUtils]: 72: Hoare triple {47753#false} assume 0 != eval1_~tmp___1~0#1; {47753#false} is VALID [2022-02-20 20:00:15,840 INFO L290 TraceCheckUtils]: 73: Hoare triple {47753#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; {47753#false} is VALID [2022-02-20 20:00:15,840 INFO L290 TraceCheckUtils]: 74: Hoare triple {47753#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; {47753#false} is VALID [2022-02-20 20:00:15,840 INFO L290 TraceCheckUtils]: 75: Hoare triple {47753#false} assume !(0 == ~p_dw_pc~0); {47753#false} is VALID [2022-02-20 20:00:15,841 INFO L290 TraceCheckUtils]: 76: Hoare triple {47753#false} assume 1 == ~p_dw_pc~0; {47753#false} is VALID [2022-02-20 20:00:15,841 INFO L290 TraceCheckUtils]: 77: Hoare triple {47753#false} assume !(0 == ~q_free~0); {47753#false} is VALID [2022-02-20 20:00:15,841 INFO L290 TraceCheckUtils]: 78: Hoare triple {47753#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; {47753#false} is VALID [2022-02-20 20:00:15,841 INFO L290 TraceCheckUtils]: 79: Hoare triple {47753#false} assume !false; {47753#false} is VALID [2022-02-20 20:00:15,841 INFO L290 TraceCheckUtils]: 80: Hoare triple {47753#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {47753#false} is VALID [2022-02-20 20:00:15,841 INFO L290 TraceCheckUtils]: 81: Hoare triple {47753#false} assume { :end_inline_do_write_p } true; {47753#false} is VALID [2022-02-20 20:00:15,841 INFO L290 TraceCheckUtils]: 82: Hoare triple {47753#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; {47753#false} is VALID [2022-02-20 20:00:15,841 INFO L290 TraceCheckUtils]: 83: Hoare triple {47753#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; {47753#false} is VALID [2022-02-20 20:00:15,842 INFO L290 TraceCheckUtils]: 84: Hoare triple {47753#false} assume !(0 == ~c_dr_pc~0); {47753#false} is VALID [2022-02-20 20:00:15,842 INFO L290 TraceCheckUtils]: 85: Hoare triple {47753#false} assume 2 == ~c_dr_pc~0; {47753#false} is VALID [2022-02-20 20:00:15,842 INFO L290 TraceCheckUtils]: 86: Hoare triple {47753#false} do_read_c_~a~0#1 := ~a_t~0; {47753#false} is VALID [2022-02-20 20:00:15,842 INFO L290 TraceCheckUtils]: 87: Hoare triple {47753#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; {47753#false} is VALID [2022-02-20 20:00:15,842 INFO L290 TraceCheckUtils]: 88: Hoare triple {47753#false} assume !(~p_last_write~0 == ~c_last_read~0); {47753#false} is VALID [2022-02-20 20:00:15,842 INFO L272 TraceCheckUtils]: 89: Hoare triple {47753#false} call error1(); {47753#false} is VALID [2022-02-20 20:00:15,842 INFO L290 TraceCheckUtils]: 90: Hoare triple {47753#false} assume !false; {47753#false} is VALID [2022-02-20 20:00:15,843 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:00:15,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:15,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359625937] [2022-02-20 20:00:15,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359625937] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:15,843 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:15,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:15,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088238083] [2022-02-20 20:00:15,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:15,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:00:15,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:15,844 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:00:15,885 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:00:15,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:15,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:15,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:15,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:15,886 INFO L87 Difference]: Start difference. First operand 1884 states and 2442 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:00:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:18,812 INFO L93 Difference]: Finished difference Result 3411 states and 4406 transitions. [2022-02-20 20:00:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 20:00:18,812 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:00:18,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:18,813 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:00:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 795 transitions. [2022-02-20 20:00:18,817 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:00:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 795 transitions. [2022-02-20 20:00:18,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 795 transitions. [2022-02-20 20:00:19,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 795 edges. 795 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:19,493 INFO L225 Difference]: With dead ends: 3411 [2022-02-20 20:00:19,493 INFO L226 Difference]: Without dead ends: 1958 [2022-02-20 20:00:19,495 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:00:19,501 INFO L933 BasicCegarLoop]: 449 mSDtfsCounter, 849 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:19,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [872 Valid, 1562 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 20:00:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2022-02-20 20:00:19,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1663. [2022-02-20 20:00:19,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:19,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1958 states. Second operand has 1663 states, 1324 states have (on average 1.3157099697885197) internal successors, (1742), 1345 states have internal predecessors, (1742), 184 states have call successors, (184), 121 states have call predecessors, (184), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2022-02-20 20:00:19,593 INFO L74 IsIncluded]: Start isIncluded. First operand 1958 states. Second operand has 1663 states, 1324 states have (on average 1.3157099697885197) internal successors, (1742), 1345 states have internal predecessors, (1742), 184 states have call successors, (184), 121 states have call predecessors, (184), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2022-02-20 20:00:19,594 INFO L87 Difference]: Start difference. First operand 1958 states. Second operand has 1663 states, 1324 states have (on average 1.3157099697885197) internal successors, (1742), 1345 states have internal predecessors, (1742), 184 states have call successors, (184), 121 states have call predecessors, (184), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2022-02-20 20:00:19,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:19,702 INFO L93 Difference]: Finished difference Result 1958 states and 2529 transitions. [2022-02-20 20:00:19,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2529 transitions. [2022-02-20 20:00:19,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:19,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:19,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 1663 states, 1324 states have (on average 1.3157099697885197) internal successors, (1742), 1345 states have internal predecessors, (1742), 184 states have call successors, (184), 121 states have call predecessors, (184), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) Second operand 1958 states. [2022-02-20 20:00:19,710 INFO L87 Difference]: Start difference. First operand has 1663 states, 1324 states have (on average 1.3157099697885197) internal successors, (1742), 1345 states have internal predecessors, (1742), 184 states have call successors, (184), 121 states have call predecessors, (184), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) Second operand 1958 states. [2022-02-20 20:00:19,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:19,821 INFO L93 Difference]: Finished difference Result 1958 states and 2529 transitions. [2022-02-20 20:00:19,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2529 transitions. [2022-02-20 20:00:19,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:19,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:19,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:19,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1324 states have (on average 1.3157099697885197) internal successors, (1742), 1345 states have internal predecessors, (1742), 184 states have call successors, (184), 121 states have call predecessors, (184), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2022-02-20 20:00:19,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2156 transitions. [2022-02-20 20:00:19,939 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2156 transitions. Word has length 91 [2022-02-20 20:00:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:19,940 INFO L470 AbstractCegarLoop]: Abstraction has 1663 states and 2156 transitions. [2022-02-20 20:00:19,940 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:00:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2156 transitions. [2022-02-20 20:00:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:19,942 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:19,943 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:00:19,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:00:19,943 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:19,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:19,943 INFO L85 PathProgramCache]: Analyzing trace with hash -183089368, now seen corresponding path program 1 times [2022-02-20 20:00:19,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:19,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348258456] [2022-02-20 20:00:19,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:19,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:19,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {58582#(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); {58535#true} is VALID [2022-02-20 20:00:19,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {58535#true} assume true; {58535#true} is VALID [2022-02-20 20:00:19,994 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58535#true} {58535#true} #1078#return; {58535#true} is VALID [2022-02-20 20:00:19,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:20,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {58583#(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); {58535#true} is VALID [2022-02-20 20:00:20,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {58535#true} assume !(0 == ~q_write_ev~0); {58535#true} is VALID [2022-02-20 20:00:20,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {58535#true} assume true; {58535#true} is VALID [2022-02-20 20:00:20,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58535#true} {58540#(= ~c_dr_st~0 0)} #1080#return; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:20,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:20,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {58535#true} havoc ~__retres1~0; {58535#true} is VALID [2022-02-20 20:00:20,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {58535#true} assume !(1 == ~p_dw_pc~0); {58535#true} is VALID [2022-02-20 20:00:20,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {58535#true} assume !(2 == ~p_dw_pc~0); {58535#true} is VALID [2022-02-20 20:00:20,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {58535#true} ~__retres1~0 := 0; {58535#true} is VALID [2022-02-20 20:00:20,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {58535#true} #res := ~__retres1~0; {58535#true} is VALID [2022-02-20 20:00:20,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {58535#true} assume true; {58535#true} is VALID [2022-02-20 20:00:20,027 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {58535#true} {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1074#return; {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:20,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {58535#true} havoc ~__retres1~1; {58535#true} is VALID [2022-02-20 20:00:20,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {58535#true} assume !(1 == ~c_dr_pc~0); {58535#true} is VALID [2022-02-20 20:00:20,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {58535#true} assume !(2 == ~c_dr_pc~0); {58535#true} is VALID [2022-02-20 20:00:20,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {58535#true} ~__retres1~1 := 0; {58535#true} is VALID [2022-02-20 20:00:20,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {58535#true} #res := ~__retres1~1; {58535#true} is VALID [2022-02-20 20:00:20,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {58535#true} assume true; {58535#true} is VALID [2022-02-20 20:00:20,032 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {58535#true} {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1076#return; {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {58584#(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; {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,032 INFO L272 TraceCheckUtils]: 1: Hoare triple {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {58535#true} is VALID [2022-02-20 20:00:20,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {58535#true} havoc ~__retres1~0; {58535#true} is VALID [2022-02-20 20:00:20,032 INFO L290 TraceCheckUtils]: 3: Hoare triple {58535#true} assume !(1 == ~p_dw_pc~0); {58535#true} is VALID [2022-02-20 20:00:20,032 INFO L290 TraceCheckUtils]: 4: Hoare triple {58535#true} assume !(2 == ~p_dw_pc~0); {58535#true} is VALID [2022-02-20 20:00:20,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {58535#true} ~__retres1~0 := 0; {58535#true} is VALID [2022-02-20 20:00:20,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {58535#true} #res := ~__retres1~0; {58535#true} is VALID [2022-02-20 20:00:20,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {58535#true} assume true; {58535#true} is VALID [2022-02-20 20:00:20,033 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {58535#true} {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1074#return; {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,034 INFO L272 TraceCheckUtils]: 11: Hoare triple {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {58535#true} is VALID [2022-02-20 20:00:20,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {58535#true} havoc ~__retres1~1; {58535#true} is VALID [2022-02-20 20:00:20,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {58535#true} assume !(1 == ~c_dr_pc~0); {58535#true} is VALID [2022-02-20 20:00:20,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {58535#true} assume !(2 == ~c_dr_pc~0); {58535#true} is VALID [2022-02-20 20:00:20,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {58535#true} ~__retres1~1 := 0; {58535#true} is VALID [2022-02-20 20:00:20,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {58535#true} #res := ~__retres1~1; {58535#true} is VALID [2022-02-20 20:00:20,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {58535#true} assume true; {58535#true} is VALID [2022-02-20 20:00:20,035 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {58535#true} {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1076#return; {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,036 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {58540#(= ~c_dr_st~0 0)} #1082#return; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:20,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {58583#(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); {58535#true} is VALID [2022-02-20 20:00:20,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {58535#true} assume !(1 == ~q_write_ev~0); {58535#true} is VALID [2022-02-20 20:00:20,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {58535#true} assume true; {58535#true} is VALID [2022-02-20 20:00:20,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58535#true} {58540#(= ~c_dr_st~0 0)} #1084#return; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:20,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {58535#true} havoc ~__retres1~2; {58535#true} is VALID [2022-02-20 20:00:20,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {58535#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {58535#true} is VALID [2022-02-20 20:00:20,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {58535#true} #res := ~__retres1~2; {58535#true} is VALID [2022-02-20 20:00:20,044 INFO L290 TraceCheckUtils]: 3: Hoare triple {58535#true} assume true; {58535#true} is VALID [2022-02-20 20:00:20,044 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {58535#true} {58540#(= ~c_dr_st~0 0)} #1086#return; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:20,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {58535#true} havoc ~__retres1~2; {58535#true} is VALID [2022-02-20 20:00:20,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {58535#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {58535#true} is VALID [2022-02-20 20:00:20,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {58535#true} #res := ~__retres1~2; {58535#true} is VALID [2022-02-20 20:00:20,048 INFO L290 TraceCheckUtils]: 3: Hoare triple {58535#true} assume true; {58535#true} is VALID [2022-02-20 20:00:20,048 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {58535#true} {58536#false} #1086#return; {58536#false} is VALID [2022-02-20 20:00:20,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {58535#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {58535#true} is VALID [2022-02-20 20:00:20,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {58535#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {58535#true} is VALID [2022-02-20 20:00:20,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {58535#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {58535#true} is VALID [2022-02-20 20:00:20,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {58535#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; {58535#true} is VALID [2022-02-20 20:00:20,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {58535#true} call update_channels1(); {58582#(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:00:20,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {58582#(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); {58535#true} is VALID [2022-02-20 20:00:20,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {58535#true} assume true; {58535#true} is VALID [2022-02-20 20:00:20,049 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {58535#true} {58535#true} #1078#return; {58535#true} is VALID [2022-02-20 20:00:20,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {58535#true} assume { :begin_inline_init_threads1 } true; {58535#true} is VALID [2022-02-20 20:00:20,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {58535#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {58535#true} is VALID [2022-02-20 20:00:20,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {58535#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {58540#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads1 } true; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,051 INFO L272 TraceCheckUtils]: 12: Hoare triple {58540#(= ~c_dr_st~0 0)} call fire_delta_events1(); {58583#(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:00:20,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {58583#(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); {58535#true} is VALID [2022-02-20 20:00:20,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {58535#true} assume !(0 == ~q_write_ev~0); {58535#true} is VALID [2022-02-20 20:00:20,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {58535#true} assume true; {58535#true} is VALID [2022-02-20 20:00:20,051 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {58535#true} {58540#(= ~c_dr_st~0 0)} #1080#return; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,052 INFO L272 TraceCheckUtils]: 17: Hoare triple {58540#(= ~c_dr_st~0 0)} call activate_threads1(); {58584#(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:00:20,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {58584#(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; {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,052 INFO L272 TraceCheckUtils]: 19: Hoare triple {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {58535#true} is VALID [2022-02-20 20:00:20,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {58535#true} havoc ~__retres1~0; {58535#true} is VALID [2022-02-20 20:00:20,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {58535#true} assume !(1 == ~p_dw_pc~0); {58535#true} is VALID [2022-02-20 20:00:20,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {58535#true} assume !(2 == ~p_dw_pc~0); {58535#true} is VALID [2022-02-20 20:00:20,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {58535#true} ~__retres1~0 := 0; {58535#true} is VALID [2022-02-20 20:00:20,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {58535#true} #res := ~__retres1~0; {58535#true} is VALID [2022-02-20 20:00:20,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {58535#true} assume true; {58535#true} is VALID [2022-02-20 20:00:20,053 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {58535#true} {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1074#return; {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,054 INFO L272 TraceCheckUtils]: 29: Hoare triple {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {58535#true} is VALID [2022-02-20 20:00:20,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {58535#true} havoc ~__retres1~1; {58535#true} is VALID [2022-02-20 20:00:20,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {58535#true} assume !(1 == ~c_dr_pc~0); {58535#true} is VALID [2022-02-20 20:00:20,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {58535#true} assume !(2 == ~c_dr_pc~0); {58535#true} is VALID [2022-02-20 20:00:20,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {58535#true} ~__retres1~1 := 0; {58535#true} is VALID [2022-02-20 20:00:20,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {58535#true} #res := ~__retres1~1; {58535#true} is VALID [2022-02-20 20:00:20,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {58535#true} assume true; {58535#true} is VALID [2022-02-20 20:00:20,055 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {58535#true} {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1076#return; {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,056 INFO L290 TraceCheckUtils]: 38: Hoare triple {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:20,056 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {58585#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {58540#(= ~c_dr_st~0 0)} #1082#return; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,057 INFO L272 TraceCheckUtils]: 41: Hoare triple {58540#(= ~c_dr_st~0 0)} call reset_delta_events1(); {58583#(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:00:20,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {58583#(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); {58535#true} is VALID [2022-02-20 20:00:20,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {58535#true} assume !(1 == ~q_write_ev~0); {58535#true} is VALID [2022-02-20 20:00:20,057 INFO L290 TraceCheckUtils]: 44: Hoare triple {58535#true} assume true; {58535#true} is VALID [2022-02-20 20:00:20,057 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {58535#true} {58540#(= ~c_dr_st~0 0)} #1084#return; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {58540#(= ~c_dr_st~0 0)} assume !false; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {58540#(= ~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; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,058 INFO L290 TraceCheckUtils]: 48: Hoare triple {58540#(= ~c_dr_st~0 0)} assume !false; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,058 INFO L272 TraceCheckUtils]: 49: Hoare triple {58540#(= ~c_dr_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {58535#true} is VALID [2022-02-20 20:00:20,058 INFO L290 TraceCheckUtils]: 50: Hoare triple {58535#true} havoc ~__retres1~2; {58535#true} is VALID [2022-02-20 20:00:20,058 INFO L290 TraceCheckUtils]: 51: Hoare triple {58535#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {58535#true} is VALID [2022-02-20 20:00:20,059 INFO L290 TraceCheckUtils]: 52: Hoare triple {58535#true} #res := ~__retres1~2; {58535#true} is VALID [2022-02-20 20:00:20,059 INFO L290 TraceCheckUtils]: 53: Hoare triple {58535#true} assume true; {58535#true} is VALID [2022-02-20 20:00:20,059 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {58535#true} {58540#(= ~c_dr_st~0 0)} #1086#return; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,059 INFO L290 TraceCheckUtils]: 55: Hoare triple {58540#(= ~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; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {58540#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {58540#(= ~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; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,060 INFO L290 TraceCheckUtils]: 58: Hoare triple {58540#(= ~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; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,060 INFO L290 TraceCheckUtils]: 59: Hoare triple {58540#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_pc~0; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {58540#(= ~c_dr_st~0 0)} assume !false; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,061 INFO L290 TraceCheckUtils]: 61: Hoare triple {58540#(= ~c_dr_st~0 0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {58540#(= ~c_dr_st~0 0)} assume { :end_inline_do_write_p } true; {58540#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:20,061 INFO L290 TraceCheckUtils]: 63: Hoare triple {58540#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {58536#false} is VALID [2022-02-20 20:00:20,061 INFO L290 TraceCheckUtils]: 64: Hoare triple {58536#false} assume !false; {58536#false} is VALID [2022-02-20 20:00:20,062 INFO L272 TraceCheckUtils]: 65: Hoare triple {58536#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {58535#true} is VALID [2022-02-20 20:00:20,062 INFO L290 TraceCheckUtils]: 66: Hoare triple {58535#true} havoc ~__retres1~2; {58535#true} is VALID [2022-02-20 20:00:20,062 INFO L290 TraceCheckUtils]: 67: Hoare triple {58535#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {58535#true} is VALID [2022-02-20 20:00:20,062 INFO L290 TraceCheckUtils]: 68: Hoare triple {58535#true} #res := ~__retres1~2; {58535#true} is VALID [2022-02-20 20:00:20,062 INFO L290 TraceCheckUtils]: 69: Hoare triple {58535#true} assume true; {58535#true} is VALID [2022-02-20 20:00:20,062 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {58535#true} {58536#false} #1086#return; {58536#false} is VALID [2022-02-20 20:00:20,062 INFO L290 TraceCheckUtils]: 71: Hoare triple {58536#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; {58536#false} is VALID [2022-02-20 20:00:20,062 INFO L290 TraceCheckUtils]: 72: Hoare triple {58536#false} assume 0 != eval1_~tmp___1~0#1; {58536#false} is VALID [2022-02-20 20:00:20,063 INFO L290 TraceCheckUtils]: 73: Hoare triple {58536#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; {58536#false} is VALID [2022-02-20 20:00:20,063 INFO L290 TraceCheckUtils]: 74: Hoare triple {58536#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; {58536#false} is VALID [2022-02-20 20:00:20,063 INFO L290 TraceCheckUtils]: 75: Hoare triple {58536#false} assume !(0 == ~p_dw_pc~0); {58536#false} is VALID [2022-02-20 20:00:20,063 INFO L290 TraceCheckUtils]: 76: Hoare triple {58536#false} assume 1 == ~p_dw_pc~0; {58536#false} is VALID [2022-02-20 20:00:20,063 INFO L290 TraceCheckUtils]: 77: Hoare triple {58536#false} assume !(0 == ~q_free~0); {58536#false} is VALID [2022-02-20 20:00:20,063 INFO L290 TraceCheckUtils]: 78: Hoare triple {58536#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; {58536#false} is VALID [2022-02-20 20:00:20,063 INFO L290 TraceCheckUtils]: 79: Hoare triple {58536#false} assume !false; {58536#false} is VALID [2022-02-20 20:00:20,063 INFO L290 TraceCheckUtils]: 80: Hoare triple {58536#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {58536#false} is VALID [2022-02-20 20:00:20,064 INFO L290 TraceCheckUtils]: 81: Hoare triple {58536#false} assume { :end_inline_do_write_p } true; {58536#false} is VALID [2022-02-20 20:00:20,064 INFO L290 TraceCheckUtils]: 82: Hoare triple {58536#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; {58536#false} is VALID [2022-02-20 20:00:20,064 INFO L290 TraceCheckUtils]: 83: Hoare triple {58536#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; {58536#false} is VALID [2022-02-20 20:00:20,064 INFO L290 TraceCheckUtils]: 84: Hoare triple {58536#false} assume !(0 == ~c_dr_pc~0); {58536#false} is VALID [2022-02-20 20:00:20,064 INFO L290 TraceCheckUtils]: 85: Hoare triple {58536#false} assume 2 == ~c_dr_pc~0; {58536#false} is VALID [2022-02-20 20:00:20,064 INFO L290 TraceCheckUtils]: 86: Hoare triple {58536#false} do_read_c_~a~0#1 := ~a_t~0; {58536#false} is VALID [2022-02-20 20:00:20,064 INFO L290 TraceCheckUtils]: 87: Hoare triple {58536#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; {58536#false} is VALID [2022-02-20 20:00:20,064 INFO L290 TraceCheckUtils]: 88: Hoare triple {58536#false} assume !(~p_last_write~0 == ~c_last_read~0); {58536#false} is VALID [2022-02-20 20:00:20,064 INFO L272 TraceCheckUtils]: 89: Hoare triple {58536#false} call error1(); {58536#false} is VALID [2022-02-20 20:00:20,065 INFO L290 TraceCheckUtils]: 90: Hoare triple {58536#false} assume !false; {58536#false} is VALID [2022-02-20 20:00:20,065 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:00:20,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:20,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348258456] [2022-02-20 20:00:20,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348258456] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:20,065 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:20,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:20,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462408018] [2022-02-20 20:00:20,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:20,066 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:00:20,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:20,067 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:00:20,112 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:00:20,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:20,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:20,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:20,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:20,114 INFO L87 Difference]: Start difference. First operand 1663 states and 2156 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:00:22,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:22,642 INFO L93 Difference]: Finished difference Result 4815 states and 6268 transitions. [2022-02-20 20:00:22,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:00:22,642 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:00:22,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:22,642 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:00:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 744 transitions. [2022-02-20 20:00:22,648 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:00:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 744 transitions. [2022-02-20 20:00:22,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 744 transitions. [2022-02-20 20:00:23,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 744 edges. 744 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:23,567 INFO L225 Difference]: With dead ends: 4815 [2022-02-20 20:00:23,567 INFO L226 Difference]: Without dead ends: 3346 [2022-02-20 20:00:23,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 20:00:23,570 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 959 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:23,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [985 Valid, 1090 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 20:00:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2022-02-20 20:00:23,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 3132. [2022-02-20 20:00:23,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:23,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3346 states. Second operand has 3132 states, 2473 states have (on average 1.281843914274161) internal successors, (3170), 2523 states have internal predecessors, (3170), 345 states have call successors, (345), 234 states have call predecessors, (345), 312 states have return successors, (513), 377 states have call predecessors, (513), 341 states have call successors, (513) [2022-02-20 20:00:23,738 INFO L74 IsIncluded]: Start isIncluded. First operand 3346 states. Second operand has 3132 states, 2473 states have (on average 1.281843914274161) internal successors, (3170), 2523 states have internal predecessors, (3170), 345 states have call successors, (345), 234 states have call predecessors, (345), 312 states have return successors, (513), 377 states have call predecessors, (513), 341 states have call successors, (513) [2022-02-20 20:00:23,743 INFO L87 Difference]: Start difference. First operand 3346 states. Second operand has 3132 states, 2473 states have (on average 1.281843914274161) internal successors, (3170), 2523 states have internal predecessors, (3170), 345 states have call successors, (345), 234 states have call predecessors, (345), 312 states have return successors, (513), 377 states have call predecessors, (513), 341 states have call successors, (513) [2022-02-20 20:00:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:24,045 INFO L93 Difference]: Finished difference Result 3346 states and 4324 transitions. [2022-02-20 20:00:24,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 4324 transitions. [2022-02-20 20:00:24,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:24,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:24,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 3132 states, 2473 states have (on average 1.281843914274161) internal successors, (3170), 2523 states have internal predecessors, (3170), 345 states have call successors, (345), 234 states have call predecessors, (345), 312 states have return successors, (513), 377 states have call predecessors, (513), 341 states have call successors, (513) Second operand 3346 states. [2022-02-20 20:00:24,059 INFO L87 Difference]: Start difference. First operand has 3132 states, 2473 states have (on average 1.281843914274161) internal successors, (3170), 2523 states have internal predecessors, (3170), 345 states have call successors, (345), 234 states have call predecessors, (345), 312 states have return successors, (513), 377 states have call predecessors, (513), 341 states have call successors, (513) Second operand 3346 states. [2022-02-20 20:00:24,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:24,369 INFO L93 Difference]: Finished difference Result 3346 states and 4324 transitions. [2022-02-20 20:00:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 4324 transitions. [2022-02-20 20:00:24,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:24,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:24,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:24,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:24,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 2473 states have (on average 1.281843914274161) internal successors, (3170), 2523 states have internal predecessors, (3170), 345 states have call successors, (345), 234 states have call predecessors, (345), 312 states have return successors, (513), 377 states have call predecessors, (513), 341 states have call successors, (513) [2022-02-20 20:00:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 4028 transitions. [2022-02-20 20:00:24,827 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 4028 transitions. Word has length 91 [2022-02-20 20:00:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:24,827 INFO L470 AbstractCegarLoop]: Abstraction has 3132 states and 4028 transitions. [2022-02-20 20:00:24,828 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:00:24,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 4028 transitions. [2022-02-20 20:00:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:24,829 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:24,829 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:00:24,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:00:24,829 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:24,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:24,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1240927446, now seen corresponding path program 1 times [2022-02-20 20:00:24,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:24,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141525650] [2022-02-20 20:00:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:24,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {76010#(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); {75963#true} is VALID [2022-02-20 20:00:24,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75963#true} {75965#(= 1 ~c_dr_i~0)} #1078#return; {75965#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:24,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {76011#(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); {75963#true} is VALID [2022-02-20 20:00:24,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {75963#true} assume !(0 == ~q_write_ev~0); {75963#true} is VALID [2022-02-20 20:00:24,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75963#true} {75964#false} #1080#return; {75964#false} is VALID [2022-02-20 20:00:24,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {75963#true} havoc ~__retres1~0; {75963#true} is VALID [2022-02-20 20:00:24,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {75963#true} assume !(1 == ~p_dw_pc~0); {75963#true} is VALID [2022-02-20 20:00:24,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {75963#true} assume !(2 == ~p_dw_pc~0); {75963#true} is VALID [2022-02-20 20:00:24,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {75963#true} ~__retres1~0 := 0; {75963#true} is VALID [2022-02-20 20:00:24,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {75963#true} #res := ~__retres1~0; {75963#true} is VALID [2022-02-20 20:00:24,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,890 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {75963#true} {75963#true} #1074#return; {75963#true} is VALID [2022-02-20 20:00:24,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {75963#true} havoc ~__retres1~1; {75963#true} is VALID [2022-02-20 20:00:24,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {75963#true} assume !(1 == ~c_dr_pc~0); {75963#true} is VALID [2022-02-20 20:00:24,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {75963#true} assume !(2 == ~c_dr_pc~0); {75963#true} is VALID [2022-02-20 20:00:24,893 INFO L290 TraceCheckUtils]: 3: Hoare triple {75963#true} ~__retres1~1 := 0; {75963#true} is VALID [2022-02-20 20:00:24,893 INFO L290 TraceCheckUtils]: 4: Hoare triple {75963#true} #res := ~__retres1~1; {75963#true} is VALID [2022-02-20 20:00:24,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,893 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {75963#true} {75963#true} #1076#return; {75963#true} is VALID [2022-02-20 20:00:24,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {76012#(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; {75963#true} is VALID [2022-02-20 20:00:24,893 INFO L272 TraceCheckUtils]: 1: Hoare triple {75963#true} call #t~ret8 := is_do_write_p_triggered(); {75963#true} is VALID [2022-02-20 20:00:24,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {75963#true} havoc ~__retres1~0; {75963#true} is VALID [2022-02-20 20:00:24,894 INFO L290 TraceCheckUtils]: 3: Hoare triple {75963#true} assume !(1 == ~p_dw_pc~0); {75963#true} is VALID [2022-02-20 20:00:24,894 INFO L290 TraceCheckUtils]: 4: Hoare triple {75963#true} assume !(2 == ~p_dw_pc~0); {75963#true} is VALID [2022-02-20 20:00:24,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {75963#true} ~__retres1~0 := 0; {75963#true} is VALID [2022-02-20 20:00:24,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {75963#true} #res := ~__retres1~0; {75963#true} is VALID [2022-02-20 20:00:24,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,894 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {75963#true} {75963#true} #1074#return; {75963#true} is VALID [2022-02-20 20:00:24,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {75963#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {75963#true} is VALID [2022-02-20 20:00:24,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {75963#true} assume !(0 != ~tmp~1); {75963#true} is VALID [2022-02-20 20:00:24,895 INFO L272 TraceCheckUtils]: 11: Hoare triple {75963#true} call #t~ret9 := is_do_read_c_triggered(); {75963#true} is VALID [2022-02-20 20:00:24,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {75963#true} havoc ~__retres1~1; {75963#true} is VALID [2022-02-20 20:00:24,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {75963#true} assume !(1 == ~c_dr_pc~0); {75963#true} is VALID [2022-02-20 20:00:24,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {75963#true} assume !(2 == ~c_dr_pc~0); {75963#true} is VALID [2022-02-20 20:00:24,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {75963#true} ~__retres1~1 := 0; {75963#true} is VALID [2022-02-20 20:00:24,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {75963#true} #res := ~__retres1~1; {75963#true} is VALID [2022-02-20 20:00:24,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,895 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {75963#true} {75963#true} #1076#return; {75963#true} is VALID [2022-02-20 20:00:24,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {75963#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {75963#true} is VALID [2022-02-20 20:00:24,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {75963#true} assume !(0 != ~tmp___0~1); {75963#true} is VALID [2022-02-20 20:00:24,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,896 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {75963#true} {75964#false} #1082#return; {75964#false} is VALID [2022-02-20 20:00:24,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {76011#(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); {75963#true} is VALID [2022-02-20 20:00:24,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {75963#true} assume !(1 == ~q_write_ev~0); {75963#true} is VALID [2022-02-20 20:00:24,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75963#true} {75964#false} #1084#return; {75964#false} is VALID [2022-02-20 20:00:24,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {75963#true} havoc ~__retres1~2; {75963#true} is VALID [2022-02-20 20:00:24,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {75963#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {75963#true} is VALID [2022-02-20 20:00:24,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {75963#true} #res := ~__retres1~2; {75963#true} is VALID [2022-02-20 20:00:24,909 INFO L290 TraceCheckUtils]: 3: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,909 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {75963#true} {75964#false} #1086#return; {75964#false} is VALID [2022-02-20 20:00:24,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {75963#true} havoc ~__retres1~2; {75963#true} is VALID [2022-02-20 20:00:24,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {75963#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {75963#true} is VALID [2022-02-20 20:00:24,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {75963#true} #res := ~__retres1~2; {75963#true} is VALID [2022-02-20 20:00:24,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,913 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {75963#true} {75964#false} #1086#return; {75964#false} is VALID [2022-02-20 20:00:24,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {75963#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {75963#true} is VALID [2022-02-20 20:00:24,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {75963#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {75963#true} is VALID [2022-02-20 20:00:24,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {75963#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {75965#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:24,914 INFO L290 TraceCheckUtils]: 3: Hoare triple {75965#(= 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; {75965#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:24,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {75965#(= 1 ~c_dr_i~0)} call update_channels1(); {76010#(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:00:24,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {76010#(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); {75963#true} is VALID [2022-02-20 20:00:24,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,915 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {75963#true} {75965#(= 1 ~c_dr_i~0)} #1078#return; {75965#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:24,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {75965#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {75965#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:24,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {75965#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {75965#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:24,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {75965#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {75964#false} is VALID [2022-02-20 20:00:24,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {75964#false} assume { :end_inline_init_threads1 } true; {75964#false} is VALID [2022-02-20 20:00:24,916 INFO L272 TraceCheckUtils]: 12: Hoare triple {75964#false} call fire_delta_events1(); {76011#(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:00:24,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {76011#(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); {75963#true} is VALID [2022-02-20 20:00:24,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {75963#true} assume !(0 == ~q_write_ev~0); {75963#true} is VALID [2022-02-20 20:00:24,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,917 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {75963#true} {75964#false} #1080#return; {75964#false} is VALID [2022-02-20 20:00:24,917 INFO L272 TraceCheckUtils]: 17: Hoare triple {75964#false} call activate_threads1(); {76012#(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:00:24,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {76012#(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; {75963#true} is VALID [2022-02-20 20:00:24,917 INFO L272 TraceCheckUtils]: 19: Hoare triple {75963#true} call #t~ret8 := is_do_write_p_triggered(); {75963#true} is VALID [2022-02-20 20:00:24,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {75963#true} havoc ~__retres1~0; {75963#true} is VALID [2022-02-20 20:00:24,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {75963#true} assume !(1 == ~p_dw_pc~0); {75963#true} is VALID [2022-02-20 20:00:24,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {75963#true} assume !(2 == ~p_dw_pc~0); {75963#true} is VALID [2022-02-20 20:00:24,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {75963#true} ~__retres1~0 := 0; {75963#true} is VALID [2022-02-20 20:00:24,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {75963#true} #res := ~__retres1~0; {75963#true} is VALID [2022-02-20 20:00:24,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,918 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {75963#true} {75963#true} #1074#return; {75963#true} is VALID [2022-02-20 20:00:24,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {75963#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {75963#true} is VALID [2022-02-20 20:00:24,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {75963#true} assume !(0 != ~tmp~1); {75963#true} is VALID [2022-02-20 20:00:24,918 INFO L272 TraceCheckUtils]: 29: Hoare triple {75963#true} call #t~ret9 := is_do_read_c_triggered(); {75963#true} is VALID [2022-02-20 20:00:24,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {75963#true} havoc ~__retres1~1; {75963#true} is VALID [2022-02-20 20:00:24,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {75963#true} assume !(1 == ~c_dr_pc~0); {75963#true} is VALID [2022-02-20 20:00:24,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {75963#true} assume !(2 == ~c_dr_pc~0); {75963#true} is VALID [2022-02-20 20:00:24,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {75963#true} ~__retres1~1 := 0; {75963#true} is VALID [2022-02-20 20:00:24,919 INFO L290 TraceCheckUtils]: 34: Hoare triple {75963#true} #res := ~__retres1~1; {75963#true} is VALID [2022-02-20 20:00:24,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,919 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {75963#true} {75963#true} #1076#return; {75963#true} is VALID [2022-02-20 20:00:24,919 INFO L290 TraceCheckUtils]: 37: Hoare triple {75963#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {75963#true} is VALID [2022-02-20 20:00:24,919 INFO L290 TraceCheckUtils]: 38: Hoare triple {75963#true} assume !(0 != ~tmp___0~1); {75963#true} is VALID [2022-02-20 20:00:24,919 INFO L290 TraceCheckUtils]: 39: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,919 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {75963#true} {75964#false} #1082#return; {75964#false} is VALID [2022-02-20 20:00:24,920 INFO L272 TraceCheckUtils]: 41: Hoare triple {75964#false} call reset_delta_events1(); {76011#(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:00:24,920 INFO L290 TraceCheckUtils]: 42: Hoare triple {76011#(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); {75963#true} is VALID [2022-02-20 20:00:24,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {75963#true} assume !(1 == ~q_write_ev~0); {75963#true} is VALID [2022-02-20 20:00:24,920 INFO L290 TraceCheckUtils]: 44: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,920 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {75963#true} {75964#false} #1084#return; {75964#false} is VALID [2022-02-20 20:00:24,920 INFO L290 TraceCheckUtils]: 46: Hoare triple {75964#false} assume !false; {75964#false} is VALID [2022-02-20 20:00:24,920 INFO L290 TraceCheckUtils]: 47: Hoare triple {75964#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; {75964#false} is VALID [2022-02-20 20:00:24,920 INFO L290 TraceCheckUtils]: 48: Hoare triple {75964#false} assume !false; {75964#false} is VALID [2022-02-20 20:00:24,920 INFO L272 TraceCheckUtils]: 49: Hoare triple {75964#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {75963#true} is VALID [2022-02-20 20:00:24,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {75963#true} havoc ~__retres1~2; {75963#true} is VALID [2022-02-20 20:00:24,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {75963#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {75963#true} is VALID [2022-02-20 20:00:24,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {75963#true} #res := ~__retres1~2; {75963#true} is VALID [2022-02-20 20:00:24,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,921 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {75963#true} {75964#false} #1086#return; {75964#false} is VALID [2022-02-20 20:00:24,921 INFO L290 TraceCheckUtils]: 55: Hoare triple {75964#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; {75964#false} is VALID [2022-02-20 20:00:24,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {75964#false} assume 0 != eval1_~tmp___1~0#1; {75964#false} is VALID [2022-02-20 20:00:24,921 INFO L290 TraceCheckUtils]: 57: Hoare triple {75964#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; {75964#false} is VALID [2022-02-20 20:00:24,921 INFO L290 TraceCheckUtils]: 58: Hoare triple {75964#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; {75964#false} is VALID [2022-02-20 20:00:24,922 INFO L290 TraceCheckUtils]: 59: Hoare triple {75964#false} assume 0 == ~p_dw_pc~0; {75964#false} is VALID [2022-02-20 20:00:24,922 INFO L290 TraceCheckUtils]: 60: Hoare triple {75964#false} assume !false; {75964#false} is VALID [2022-02-20 20:00:24,922 INFO L290 TraceCheckUtils]: 61: Hoare triple {75964#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {75964#false} is VALID [2022-02-20 20:00:24,922 INFO L290 TraceCheckUtils]: 62: Hoare triple {75964#false} assume { :end_inline_do_write_p } true; {75964#false} is VALID [2022-02-20 20:00:24,922 INFO L290 TraceCheckUtils]: 63: Hoare triple {75964#false} assume !(0 == ~c_dr_st~0); {75964#false} is VALID [2022-02-20 20:00:24,922 INFO L290 TraceCheckUtils]: 64: Hoare triple {75964#false} assume !false; {75964#false} is VALID [2022-02-20 20:00:24,922 INFO L272 TraceCheckUtils]: 65: Hoare triple {75964#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {75963#true} is VALID [2022-02-20 20:00:24,922 INFO L290 TraceCheckUtils]: 66: Hoare triple {75963#true} havoc ~__retres1~2; {75963#true} is VALID [2022-02-20 20:00:24,923 INFO L290 TraceCheckUtils]: 67: Hoare triple {75963#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {75963#true} is VALID [2022-02-20 20:00:24,923 INFO L290 TraceCheckUtils]: 68: Hoare triple {75963#true} #res := ~__retres1~2; {75963#true} is VALID [2022-02-20 20:00:24,923 INFO L290 TraceCheckUtils]: 69: Hoare triple {75963#true} assume true; {75963#true} is VALID [2022-02-20 20:00:24,923 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {75963#true} {75964#false} #1086#return; {75964#false} is VALID [2022-02-20 20:00:24,923 INFO L290 TraceCheckUtils]: 71: Hoare triple {75964#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; {75964#false} is VALID [2022-02-20 20:00:24,923 INFO L290 TraceCheckUtils]: 72: Hoare triple {75964#false} assume 0 != eval1_~tmp___1~0#1; {75964#false} is VALID [2022-02-20 20:00:24,923 INFO L290 TraceCheckUtils]: 73: Hoare triple {75964#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; {75964#false} is VALID [2022-02-20 20:00:24,923 INFO L290 TraceCheckUtils]: 74: Hoare triple {75964#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; {75964#false} is VALID [2022-02-20 20:00:24,923 INFO L290 TraceCheckUtils]: 75: Hoare triple {75964#false} assume !(0 == ~p_dw_pc~0); {75964#false} is VALID [2022-02-20 20:00:24,924 INFO L290 TraceCheckUtils]: 76: Hoare triple {75964#false} assume 1 == ~p_dw_pc~0; {75964#false} is VALID [2022-02-20 20:00:24,924 INFO L290 TraceCheckUtils]: 77: Hoare triple {75964#false} assume !(0 == ~q_free~0); {75964#false} is VALID [2022-02-20 20:00:24,924 INFO L290 TraceCheckUtils]: 78: Hoare triple {75964#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; {75964#false} is VALID [2022-02-20 20:00:24,924 INFO L290 TraceCheckUtils]: 79: Hoare triple {75964#false} assume !false; {75964#false} is VALID [2022-02-20 20:00:24,924 INFO L290 TraceCheckUtils]: 80: Hoare triple {75964#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {75964#false} is VALID [2022-02-20 20:00:24,924 INFO L290 TraceCheckUtils]: 81: Hoare triple {75964#false} assume { :end_inline_do_write_p } true; {75964#false} is VALID [2022-02-20 20:00:24,924 INFO L290 TraceCheckUtils]: 82: Hoare triple {75964#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; {75964#false} is VALID [2022-02-20 20:00:24,924 INFO L290 TraceCheckUtils]: 83: Hoare triple {75964#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; {75964#false} is VALID [2022-02-20 20:00:24,924 INFO L290 TraceCheckUtils]: 84: Hoare triple {75964#false} assume !(0 == ~c_dr_pc~0); {75964#false} is VALID [2022-02-20 20:00:24,925 INFO L290 TraceCheckUtils]: 85: Hoare triple {75964#false} assume 2 == ~c_dr_pc~0; {75964#false} is VALID [2022-02-20 20:00:24,925 INFO L290 TraceCheckUtils]: 86: Hoare triple {75964#false} do_read_c_~a~0#1 := ~a_t~0; {75964#false} is VALID [2022-02-20 20:00:24,925 INFO L290 TraceCheckUtils]: 87: Hoare triple {75964#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; {75964#false} is VALID [2022-02-20 20:00:24,925 INFO L290 TraceCheckUtils]: 88: Hoare triple {75964#false} assume !(~p_last_write~0 == ~c_last_read~0); {75964#false} is VALID [2022-02-20 20:00:24,925 INFO L272 TraceCheckUtils]: 89: Hoare triple {75964#false} call error1(); {75964#false} is VALID [2022-02-20 20:00:24,925 INFO L290 TraceCheckUtils]: 90: Hoare triple {75964#false} assume !false; {75964#false} is VALID [2022-02-20 20:00:24,925 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:00:24,926 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:24,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141525650] [2022-02-20 20:00:24,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141525650] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:24,926 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:24,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:24,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099899959] [2022-02-20 20:00:24,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:24,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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 91 [2022-02-20 20:00:24,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:24,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:00:24,971 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:00:24,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:24,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:24,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:24,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:24,972 INFO L87 Difference]: Start difference. First operand 3132 states and 4028 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:00:26,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:26,877 INFO L93 Difference]: Finished difference Result 4716 states and 6012 transitions. [2022-02-20 20:00:26,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:00:26,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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 91 [2022-02-20 20:00:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:00:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 589 transitions. [2022-02-20 20:00:26,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:00:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 589 transitions. [2022-02-20 20:00:26,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 589 transitions. [2022-02-20 20:00:27,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:27,367 INFO L225 Difference]: With dead ends: 4716 [2022-02-20 20:00:27,368 INFO L226 Difference]: Without dead ends: 1778 [2022-02-20 20:00:27,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 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:00:27,371 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 458 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:27,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 1123 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 20:00:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2022-02-20 20:00:27,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1663. [2022-02-20 20:00:27,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:27,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1778 states. Second operand has 1663 states, 1324 states have (on average 1.2877643504531722) internal successors, (1705), 1345 states have internal predecessors, (1705), 184 states have call successors, (184), 121 states have call predecessors, (184), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2022-02-20 20:00:27,456 INFO L74 IsIncluded]: Start isIncluded. First operand 1778 states. Second operand has 1663 states, 1324 states have (on average 1.2877643504531722) internal successors, (1705), 1345 states have internal predecessors, (1705), 184 states have call successors, (184), 121 states have call predecessors, (184), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2022-02-20 20:00:27,457 INFO L87 Difference]: Start difference. First operand 1778 states. Second operand has 1663 states, 1324 states have (on average 1.2877643504531722) internal successors, (1705), 1345 states have internal predecessors, (1705), 184 states have call successors, (184), 121 states have call predecessors, (184), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2022-02-20 20:00:27,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:27,544 INFO L93 Difference]: Finished difference Result 1778 states and 2279 transitions. [2022-02-20 20:00:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2279 transitions. [2022-02-20 20:00:27,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:27,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:27,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 1663 states, 1324 states have (on average 1.2877643504531722) internal successors, (1705), 1345 states have internal predecessors, (1705), 184 states have call successors, (184), 121 states have call predecessors, (184), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) Second operand 1778 states. [2022-02-20 20:00:27,551 INFO L87 Difference]: Start difference. First operand has 1663 states, 1324 states have (on average 1.2877643504531722) internal successors, (1705), 1345 states have internal predecessors, (1705), 184 states have call successors, (184), 121 states have call predecessors, (184), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) Second operand 1778 states. [2022-02-20 20:00:27,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:27,639 INFO L93 Difference]: Finished difference Result 1778 states and 2279 transitions. [2022-02-20 20:00:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2279 transitions. [2022-02-20 20:00:27,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:27,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:27,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:27,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1324 states have (on average 1.2877643504531722) internal successors, (1705), 1345 states have internal predecessors, (1705), 184 states have call successors, (184), 121 states have call predecessors, (184), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2022-02-20 20:00:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2119 transitions. [2022-02-20 20:00:27,753 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2119 transitions. Word has length 91 [2022-02-20 20:00:27,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:27,753 INFO L470 AbstractCegarLoop]: Abstraction has 1663 states and 2119 transitions. [2022-02-20 20:00:27,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:00:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2119 transitions. [2022-02-20 20:00:27,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 20:00:27,754 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:27,754 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:00:27,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:00:27,755 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:27,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:27,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2108882217, now seen corresponding path program 1 times [2022-02-20 20:00:27,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:27,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652543529] [2022-02-20 20:00:27,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:27,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {88207#(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); {88208#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:27,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {88208#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {88208#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:27,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88208#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {88161#(= ~q_read_ev~0 2)} #1078#return; {88161#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:27,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {88209#(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); {88159#true} is VALID [2022-02-20 20:00:27,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {88159#true} assume !(0 == ~q_write_ev~0); {88159#true} is VALID [2022-02-20 20:00:27,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {88159#true} assume true; {88159#true} is VALID [2022-02-20 20:00:27,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88159#true} {88161#(= ~q_read_ev~0 2)} #1080#return; {88159#true} is VALID [2022-02-20 20:00:27,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {88159#true} havoc ~__retres1~0; {88159#true} is VALID [2022-02-20 20:00:27,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {88159#true} assume !(1 == ~p_dw_pc~0); {88159#true} is VALID [2022-02-20 20:00:27,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {88159#true} assume !(2 == ~p_dw_pc~0); {88159#true} is VALID [2022-02-20 20:00:27,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {88159#true} ~__retres1~0 := 0; {88159#true} is VALID [2022-02-20 20:00:27,824 INFO L290 TraceCheckUtils]: 4: Hoare triple {88159#true} #res := ~__retres1~0; {88159#true} is VALID [2022-02-20 20:00:27,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {88159#true} assume true; {88159#true} is VALID [2022-02-20 20:00:27,825 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {88159#true} {88159#true} #1074#return; {88159#true} is VALID [2022-02-20 20:00:27,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {88159#true} havoc ~__retres1~1; {88159#true} is VALID [2022-02-20 20:00:27,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {88159#true} assume !(1 == ~c_dr_pc~0); {88159#true} is VALID [2022-02-20 20:00:27,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {88159#true} assume !(2 == ~c_dr_pc~0); {88159#true} is VALID [2022-02-20 20:00:27,828 INFO L290 TraceCheckUtils]: 3: Hoare triple {88159#true} ~__retres1~1 := 0; {88159#true} is VALID [2022-02-20 20:00:27,828 INFO L290 TraceCheckUtils]: 4: Hoare triple {88159#true} #res := ~__retres1~1; {88159#true} is VALID [2022-02-20 20:00:27,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {88159#true} assume true; {88159#true} is VALID [2022-02-20 20:00:27,829 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {88159#true} {88159#true} #1076#return; {88159#true} is VALID [2022-02-20 20:00:27,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {88210#(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; {88159#true} is VALID [2022-02-20 20:00:27,829 INFO L272 TraceCheckUtils]: 1: Hoare triple {88159#true} call #t~ret8 := is_do_write_p_triggered(); {88159#true} is VALID [2022-02-20 20:00:27,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {88159#true} havoc ~__retres1~0; {88159#true} is VALID [2022-02-20 20:00:27,829 INFO L290 TraceCheckUtils]: 3: Hoare triple {88159#true} assume !(1 == ~p_dw_pc~0); {88159#true} is VALID [2022-02-20 20:00:27,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {88159#true} assume !(2 == ~p_dw_pc~0); {88159#true} is VALID [2022-02-20 20:00:27,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {88159#true} ~__retres1~0 := 0; {88159#true} is VALID [2022-02-20 20:00:27,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {88159#true} #res := ~__retres1~0; {88159#true} is VALID [2022-02-20 20:00:27,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {88159#true} assume true; {88159#true} is VALID [2022-02-20 20:00:27,830 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {88159#true} {88159#true} #1074#return; {88159#true} is VALID [2022-02-20 20:00:27,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {88159#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {88159#true} is VALID [2022-02-20 20:00:27,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {88159#true} assume !(0 != ~tmp~1); {88159#true} is VALID [2022-02-20 20:00:27,830 INFO L272 TraceCheckUtils]: 11: Hoare triple {88159#true} call #t~ret9 := is_do_read_c_triggered(); {88159#true} is VALID [2022-02-20 20:00:27,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {88159#true} havoc ~__retres1~1; {88159#true} is VALID [2022-02-20 20:00:27,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {88159#true} assume !(1 == ~c_dr_pc~0); {88159#true} is VALID [2022-02-20 20:00:27,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {88159#true} assume !(2 == ~c_dr_pc~0); {88159#true} is VALID [2022-02-20 20:00:27,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {88159#true} ~__retres1~1 := 0; {88159#true} is VALID [2022-02-20 20:00:27,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {88159#true} #res := ~__retres1~1; {88159#true} is VALID [2022-02-20 20:00:27,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {88159#true} assume true; {88159#true} is VALID [2022-02-20 20:00:27,831 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {88159#true} {88159#true} #1076#return; {88159#true} is VALID [2022-02-20 20:00:27,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {88159#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {88159#true} is VALID [2022-02-20 20:00:27,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {88159#true} assume !(0 != ~tmp___0~1); {88159#true} is VALID [2022-02-20 20:00:27,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {88159#true} assume true; {88159#true} is VALID [2022-02-20 20:00:27,831 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {88159#true} {88159#true} #1082#return; {88159#true} is VALID [2022-02-20 20:00:27,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {88209#(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); {88159#true} is VALID [2022-02-20 20:00:27,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {88159#true} assume !(1 == ~q_write_ev~0); {88159#true} is VALID [2022-02-20 20:00:27,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {88159#true} assume true; {88159#true} is VALID [2022-02-20 20:00:27,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88159#true} {88159#true} #1084#return; {88159#true} is VALID [2022-02-20 20:00:27,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {88159#true} havoc ~__retres1~2; {88159#true} is VALID [2022-02-20 20:00:27,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {88159#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {88159#true} is VALID [2022-02-20 20:00:27,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {88159#true} #res := ~__retres1~2; {88159#true} is VALID [2022-02-20 20:00:27,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {88159#true} assume true; {88159#true} is VALID [2022-02-20 20:00:27,837 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {88159#true} {88159#true} #1086#return; {88159#true} is VALID [2022-02-20 20:00:27,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:00:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:27,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {88159#true} havoc ~__retres1~2; {88159#true} is VALID [2022-02-20 20:00:27,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {88159#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {88225#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:27,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {88225#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {88225#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:27,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {88225#(= ~p_dw_st~0 0)} assume true; {88225#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:27,846 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {88225#(= ~p_dw_st~0 0)} {88201#(not (= ~p_dw_st~0 0))} #1086#return; {88160#false} is VALID [2022-02-20 20:00:27,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {88159#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {88159#true} is VALID [2022-02-20 20:00:27,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {88159#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {88159#true} is VALID [2022-02-20 20:00:27,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {88159#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {88161#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:27,847 INFO L290 TraceCheckUtils]: 3: Hoare triple {88161#(= ~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; {88161#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:27,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {88161#(= ~q_read_ev~0 2)} call update_channels1(); {88207#(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:00:27,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {88207#(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); {88208#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:27,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {88208#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {88208#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:27,848 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {88208#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {88161#(= ~q_read_ev~0 2)} #1078#return; {88161#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:27,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {88161#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {88161#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:27,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {88161#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {88161#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:27,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {88161#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {88161#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:27,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {88161#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {88161#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:27,849 INFO L272 TraceCheckUtils]: 12: Hoare triple {88161#(= ~q_read_ev~0 2)} call fire_delta_events1(); {88209#(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:00:27,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {88209#(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); {88159#true} is VALID [2022-02-20 20:00:27,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {88159#true} assume !(0 == ~q_write_ev~0); {88159#true} is VALID [2022-02-20 20:00:27,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {88159#true} assume true; {88159#true} is VALID [2022-02-20 20:00:27,850 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {88159#true} {88161#(= ~q_read_ev~0 2)} #1080#return; {88159#true} is VALID [2022-02-20 20:00:27,850 INFO L272 TraceCheckUtils]: 17: Hoare triple {88159#true} call activate_threads1(); {88210#(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:00:27,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {88210#(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; {88159#true} is VALID [2022-02-20 20:00:27,850 INFO L272 TraceCheckUtils]: 19: Hoare triple {88159#true} call #t~ret8 := is_do_write_p_triggered(); {88159#true} is VALID [2022-02-20 20:00:27,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {88159#true} havoc ~__retres1~0; {88159#true} is VALID [2022-02-20 20:00:27,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {88159#true} assume !(1 == ~p_dw_pc~0); {88159#true} is VALID [2022-02-20 20:00:27,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {88159#true} assume !(2 == ~p_dw_pc~0); {88159#true} is VALID [2022-02-20 20:00:27,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {88159#true} ~__retres1~0 := 0; {88159#true} is VALID [2022-02-20 20:00:27,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {88159#true} #res := ~__retres1~0; {88159#true} is VALID [2022-02-20 20:00:27,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {88159#true} assume true; {88159#true} is VALID [2022-02-20 20:00:27,851 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {88159#true} {88159#true} #1074#return; {88159#true} is VALID [2022-02-20 20:00:27,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {88159#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {88159#true} is VALID [2022-02-20 20:00:27,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {88159#true} assume !(0 != ~tmp~1); {88159#true} is VALID [2022-02-20 20:00:27,852 INFO L272 TraceCheckUtils]: 29: Hoare triple {88159#true} call #t~ret9 := is_do_read_c_triggered(); {88159#true} is VALID [2022-02-20 20:00:27,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {88159#true} havoc ~__retres1~1; {88159#true} is VALID [2022-02-20 20:00:27,852 INFO L290 TraceCheckUtils]: 31: Hoare triple {88159#true} assume !(1 == ~c_dr_pc~0); {88159#true} is VALID [2022-02-20 20:00:27,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {88159#true} assume !(2 == ~c_dr_pc~0); {88159#true} is VALID [2022-02-20 20:00:27,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {88159#true} ~__retres1~1 := 0; {88159#true} is VALID [2022-02-20 20:00:27,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {88159#true} #res := ~__retres1~1; {88159#true} is VALID [2022-02-20 20:00:27,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {88159#true} assume true; {88159#true} is VALID [2022-02-20 20:00:27,852 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {88159#true} {88159#true} #1076#return; {88159#true} is VALID [2022-02-20 20:00:27,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {88159#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {88159#true} is VALID [2022-02-20 20:00:27,853 INFO L290 TraceCheckUtils]: 38: Hoare triple {88159#true} assume !(0 != ~tmp___0~1); {88159#true} is VALID [2022-02-20 20:00:27,853 INFO L290 TraceCheckUtils]: 39: Hoare triple {88159#true} assume true; {88159#true} is VALID [2022-02-20 20:00:27,853 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {88159#true} {88159#true} #1082#return; {88159#true} is VALID [2022-02-20 20:00:27,853 INFO L272 TraceCheckUtils]: 41: Hoare triple {88159#true} call reset_delta_events1(); {88209#(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:00:27,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {88209#(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); {88159#true} is VALID [2022-02-20 20:00:27,853 INFO L290 TraceCheckUtils]: 43: Hoare triple {88159#true} assume !(1 == ~q_write_ev~0); {88159#true} is VALID [2022-02-20 20:00:27,854 INFO L290 TraceCheckUtils]: 44: Hoare triple {88159#true} assume true; {88159#true} is VALID [2022-02-20 20:00:27,854 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {88159#true} {88159#true} #1084#return; {88159#true} is VALID [2022-02-20 20:00:27,854 INFO L290 TraceCheckUtils]: 46: Hoare triple {88159#true} assume !false; {88159#true} is VALID [2022-02-20 20:00:27,854 INFO L290 TraceCheckUtils]: 47: Hoare triple {88159#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; {88159#true} is VALID [2022-02-20 20:00:27,854 INFO L290 TraceCheckUtils]: 48: Hoare triple {88159#true} assume !false; {88159#true} is VALID [2022-02-20 20:00:27,854 INFO L272 TraceCheckUtils]: 49: Hoare triple {88159#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {88159#true} is VALID [2022-02-20 20:00:27,854 INFO L290 TraceCheckUtils]: 50: Hoare triple {88159#true} havoc ~__retres1~2; {88159#true} is VALID [2022-02-20 20:00:27,854 INFO L290 TraceCheckUtils]: 51: Hoare triple {88159#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {88159#true} is VALID [2022-02-20 20:00:27,854 INFO L290 TraceCheckUtils]: 52: Hoare triple {88159#true} #res := ~__retres1~2; {88159#true} is VALID [2022-02-20 20:00:27,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {88159#true} assume true; {88159#true} is VALID [2022-02-20 20:00:27,855 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {88159#true} {88159#true} #1086#return; {88159#true} is VALID [2022-02-20 20:00:27,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {88159#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; {88159#true} is VALID [2022-02-20 20:00:27,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {88159#true} assume 0 != eval1_~tmp___1~0#1; {88159#true} is VALID [2022-02-20 20:00:27,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {88159#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; {88159#true} is VALID [2022-02-20 20:00:27,855 INFO L290 TraceCheckUtils]: 58: Hoare triple {88159#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; {88159#true} is VALID [2022-02-20 20:00:27,855 INFO L290 TraceCheckUtils]: 59: Hoare triple {88159#true} assume 0 == ~p_dw_pc~0; {88159#true} is VALID [2022-02-20 20:00:27,855 INFO L290 TraceCheckUtils]: 60: Hoare triple {88159#true} assume !false; {88159#true} is VALID [2022-02-20 20:00:27,856 INFO L290 TraceCheckUtils]: 61: Hoare triple {88159#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {88201#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:27,856 INFO L290 TraceCheckUtils]: 62: Hoare triple {88201#(not (= ~p_dw_st~0 0))} assume { :end_inline_do_write_p } true; {88201#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:27,856 INFO L290 TraceCheckUtils]: 63: Hoare triple {88201#(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; {88201#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:27,857 INFO L290 TraceCheckUtils]: 64: Hoare triple {88201#(not (= ~p_dw_st~0 0))} assume !(0 != eval1_~tmp___0~2#1); {88201#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:27,857 INFO L290 TraceCheckUtils]: 65: Hoare triple {88201#(not (= ~p_dw_st~0 0))} assume !false; {88201#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:27,857 INFO L272 TraceCheckUtils]: 66: Hoare triple {88201#(not (= ~p_dw_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {88159#true} is VALID [2022-02-20 20:00:27,857 INFO L290 TraceCheckUtils]: 67: Hoare triple {88159#true} havoc ~__retres1~2; {88159#true} is VALID [2022-02-20 20:00:27,857 INFO L290 TraceCheckUtils]: 68: Hoare triple {88159#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {88225#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:27,858 INFO L290 TraceCheckUtils]: 69: Hoare triple {88225#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {88225#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:27,858 INFO L290 TraceCheckUtils]: 70: Hoare triple {88225#(= ~p_dw_st~0 0)} assume true; {88225#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:27,858 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {88225#(= ~p_dw_st~0 0)} {88201#(not (= ~p_dw_st~0 0))} #1086#return; {88160#false} is VALID [2022-02-20 20:00:27,858 INFO L290 TraceCheckUtils]: 72: Hoare triple {88160#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; {88160#false} is VALID [2022-02-20 20:00:27,858 INFO L290 TraceCheckUtils]: 73: Hoare triple {88160#false} assume 0 != eval1_~tmp___1~0#1; {88160#false} is VALID [2022-02-20 20:00:27,859 INFO L290 TraceCheckUtils]: 74: Hoare triple {88160#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; {88160#false} is VALID [2022-02-20 20:00:27,859 INFO L290 TraceCheckUtils]: 75: Hoare triple {88160#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; {88160#false} is VALID [2022-02-20 20:00:27,859 INFO L290 TraceCheckUtils]: 76: Hoare triple {88160#false} assume !(0 == ~p_dw_pc~0); {88160#false} is VALID [2022-02-20 20:00:27,859 INFO L290 TraceCheckUtils]: 77: Hoare triple {88160#false} assume 1 == ~p_dw_pc~0; {88160#false} is VALID [2022-02-20 20:00:27,859 INFO L290 TraceCheckUtils]: 78: Hoare triple {88160#false} assume !(0 == ~q_free~0); {88160#false} is VALID [2022-02-20 20:00:27,859 INFO L290 TraceCheckUtils]: 79: Hoare triple {88160#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; {88160#false} is VALID [2022-02-20 20:00:27,859 INFO L290 TraceCheckUtils]: 80: Hoare triple {88160#false} assume !false; {88160#false} is VALID [2022-02-20 20:00:27,859 INFO L290 TraceCheckUtils]: 81: Hoare triple {88160#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {88160#false} is VALID [2022-02-20 20:00:27,859 INFO L290 TraceCheckUtils]: 82: Hoare triple {88160#false} assume { :end_inline_do_write_p } true; {88160#false} is VALID [2022-02-20 20:00:27,860 INFO L290 TraceCheckUtils]: 83: Hoare triple {88160#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; {88160#false} is VALID [2022-02-20 20:00:27,860 INFO L290 TraceCheckUtils]: 84: Hoare triple {88160#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; {88160#false} is VALID [2022-02-20 20:00:27,860 INFO L290 TraceCheckUtils]: 85: Hoare triple {88160#false} assume !(0 == ~c_dr_pc~0); {88160#false} is VALID [2022-02-20 20:00:27,860 INFO L290 TraceCheckUtils]: 86: Hoare triple {88160#false} assume 2 == ~c_dr_pc~0; {88160#false} is VALID [2022-02-20 20:00:27,860 INFO L290 TraceCheckUtils]: 87: Hoare triple {88160#false} do_read_c_~a~0#1 := ~a_t~0; {88160#false} is VALID [2022-02-20 20:00:27,860 INFO L290 TraceCheckUtils]: 88: Hoare triple {88160#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; {88160#false} is VALID [2022-02-20 20:00:27,860 INFO L290 TraceCheckUtils]: 89: Hoare triple {88160#false} assume !(~p_last_write~0 == ~c_last_read~0); {88160#false} is VALID [2022-02-20 20:00:27,860 INFO L272 TraceCheckUtils]: 90: Hoare triple {88160#false} call error1(); {88160#false} is VALID [2022-02-20 20:00:27,861 INFO L290 TraceCheckUtils]: 91: Hoare triple {88160#false} assume !false; {88160#false} is VALID [2022-02-20 20:00:27,861 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:00:27,861 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:27,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652543529] [2022-02-20 20:00:27,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652543529] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:27,861 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:27,861 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:27,862 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857809216] [2022-02-20 20:00:27,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:27,862 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:00:27,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:27,863 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:00:27,909 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:00:27,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:27,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:27,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:27,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:27,910 INFO L87 Difference]: Start difference. First operand 1663 states and 2119 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) [2022-02-20 20:00:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:31,676 INFO L93 Difference]: Finished difference Result 4081 states and 5202 transitions. [2022-02-20 20:00:31,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 20:00:31,676 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:00:31,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 20:00:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1029 transitions. [2022-02-20 20:00:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 20:00:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1029 transitions. [2022-02-20 20:00:31,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 1029 transitions. [2022-02-20 20:00:32,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1029 edges. 1029 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:32,610 INFO L225 Difference]: With dead ends: 4081 [2022-02-20 20:00:32,611 INFO L226 Difference]: Without dead ends: 2461 [2022-02-20 20:00:32,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-02-20 20:00:32,614 INFO L933 BasicCegarLoop]: 488 mSDtfsCounter, 1462 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:32,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1499 Valid, 1642 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:00:32,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2022-02-20 20:00:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2284. [2022-02-20 20:00:32,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:32,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2461 states. Second operand has 2284 states, 1791 states have (on average 1.254606365159129) internal successors, (2247), 1820 states have internal predecessors, (2247), 261 states have call successors, (261), 169 states have call predecessors, (261), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) [2022-02-20 20:00:32,756 INFO L74 IsIncluded]: Start isIncluded. First operand 2461 states. Second operand has 2284 states, 1791 states have (on average 1.254606365159129) internal successors, (2247), 1820 states have internal predecessors, (2247), 261 states have call successors, (261), 169 states have call predecessors, (261), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) [2022-02-20 20:00:32,758 INFO L87 Difference]: Start difference. First operand 2461 states. Second operand has 2284 states, 1791 states have (on average 1.254606365159129) internal successors, (2247), 1820 states have internal predecessors, (2247), 261 states have call successors, (261), 169 states have call predecessors, (261), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) [2022-02-20 20:00:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:32,919 INFO L93 Difference]: Finished difference Result 2461 states and 3074 transitions. [2022-02-20 20:00:32,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3074 transitions. [2022-02-20 20:00:32,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:32,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:32,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 2284 states, 1791 states have (on average 1.254606365159129) internal successors, (2247), 1820 states have internal predecessors, (2247), 261 states have call successors, (261), 169 states have call predecessors, (261), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) Second operand 2461 states. [2022-02-20 20:00:32,927 INFO L87 Difference]: Start difference. First operand has 2284 states, 1791 states have (on average 1.254606365159129) internal successors, (2247), 1820 states have internal predecessors, (2247), 261 states have call successors, (261), 169 states have call predecessors, (261), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) Second operand 2461 states. [2022-02-20 20:00:33,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:33,082 INFO L93 Difference]: Finished difference Result 2461 states and 3074 transitions. [2022-02-20 20:00:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3074 transitions. [2022-02-20 20:00:33,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:33,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:33,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:33,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 1791 states have (on average 1.254606365159129) internal successors, (2247), 1820 states have internal predecessors, (2247), 261 states have call successors, (261), 169 states have call predecessors, (261), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) [2022-02-20 20:00:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 2869 transitions. [2022-02-20 20:00:33,314 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 2869 transitions. Word has length 92 [2022-02-20 20:00:33,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:33,314 INFO L470 AbstractCegarLoop]: Abstraction has 2284 states and 2869 transitions. [2022-02-20 20:00:33,314 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 20:00:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 2869 transitions. [2022-02-20 20:00:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:33,315 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:33,315 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:33,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 20:00:33,316 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:33,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:33,316 INFO L85 PathProgramCache]: Analyzing trace with hash -6968229, now seen corresponding path program 1 times [2022-02-20 20:00:33,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:33,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240518115] [2022-02-20 20:00:33,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:33,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {101722#true} assume true; {101722#true} is VALID [2022-02-20 20:00:33,340 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {101722#true} {101724#(= ~t4_i~0 1)} #1106#return; {101724#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:33,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 20:00:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {101788#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {101722#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {101722#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {101722#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {101722#true} assume 0 == ~T4_E~0;~T4_E~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {101722#true} assume !(0 == ~E_M~0); {101722#true} is VALID [2022-02-20 20:00:33,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {101722#true} assume 0 == ~E_1~0;~E_1~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {101722#true} assume 0 == ~E_2~0;~E_2~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {101722#true} assume 0 == ~E_3~0;~E_3~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {101722#true} assume 0 == ~E_4~0;~E_4~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {101722#true} assume true; {101722#true} is VALID [2022-02-20 20:00:33,358 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {101722#true} {101723#false} #1108#return; {101723#false} is VALID [2022-02-20 20:00:33,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 20:00:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {101789#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {101722#true} is VALID [2022-02-20 20:00:33,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {101722#true} assume !(1 == ~m_pc~0); {101722#true} is VALID [2022-02-20 20:00:33,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {101722#true} is_master_triggered_~__retres1~4#1 := 0; {101722#true} is VALID [2022-02-20 20:00:33,375 INFO L290 TraceCheckUtils]: 3: Hoare triple {101722#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {101722#true} is VALID [2022-02-20 20:00:33,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {101722#true} #t~ret28#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp~6#1 := #t~ret28#1;havoc #t~ret28#1; {101722#true} is VALID [2022-02-20 20:00:33,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {101722#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {101722#true} is VALID [2022-02-20 20:00:33,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {101722#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {101722#true} is VALID [2022-02-20 20:00:33,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {101722#true} assume 1 == ~t1_pc~0; {101722#true} is VALID [2022-02-20 20:00:33,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {101722#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {101722#true} is VALID [2022-02-20 20:00:33,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {101722#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {101722#true} is VALID [2022-02-20 20:00:33,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {101722#true} #t~ret29#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___0~4#1 := #t~ret29#1;havoc #t~ret29#1; {101722#true} is VALID [2022-02-20 20:00:33,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {101722#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {101722#true} is VALID [2022-02-20 20:00:33,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {101722#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {101722#true} is VALID [2022-02-20 20:00:33,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {101722#true} assume !(1 == ~t2_pc~0); {101722#true} is VALID [2022-02-20 20:00:33,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {101722#true} is_transmit2_triggered_~__retres1~6#1 := 0; {101722#true} is VALID [2022-02-20 20:00:33,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {101722#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {101722#true} is VALID [2022-02-20 20:00:33,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {101722#true} #t~ret30#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___1~1#1 := #t~ret30#1;havoc #t~ret30#1; {101722#true} is VALID [2022-02-20 20:00:33,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {101722#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {101722#true} is VALID [2022-02-20 20:00:33,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {101722#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {101722#true} is VALID [2022-02-20 20:00:33,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {101722#true} assume 1 == ~t3_pc~0; {101722#true} is VALID [2022-02-20 20:00:33,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {101722#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {101722#true} is VALID [2022-02-20 20:00:33,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {101722#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {101722#true} is VALID [2022-02-20 20:00:33,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {101722#true} #t~ret31#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___2~0#1 := #t~ret31#1;havoc #t~ret31#1; {101722#true} is VALID [2022-02-20 20:00:33,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {101722#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {101722#true} is VALID [2022-02-20 20:00:33,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {101722#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {101722#true} is VALID [2022-02-20 20:00:33,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {101722#true} assume 1 == ~t4_pc~0; {101722#true} is VALID [2022-02-20 20:00:33,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {101722#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {101722#true} is VALID [2022-02-20 20:00:33,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {101722#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {101722#true} is VALID [2022-02-20 20:00:33,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {101722#true} #t~ret32#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___3~0#1 := #t~ret32#1;havoc #t~ret32#1; {101722#true} is VALID [2022-02-20 20:00:33,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {101722#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {101722#true} is VALID [2022-02-20 20:00:33,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {101722#true} assume true; {101722#true} is VALID [2022-02-20 20:00:33,380 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {101722#true} {101723#false} #1110#return; {101723#false} is VALID [2022-02-20 20:00:33,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-20 20:00:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {101788#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {101722#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {101722#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {101722#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {101722#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {101722#true} assume !(1 == ~E_M~0); {101722#true} is VALID [2022-02-20 20:00:33,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {101722#true} assume 1 == ~E_1~0;~E_1~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {101722#true} assume 1 == ~E_2~0;~E_2~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {101722#true} assume 1 == ~E_3~0;~E_3~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {101722#true} assume 1 == ~E_4~0;~E_4~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {101722#true} assume true; {101722#true} is VALID [2022-02-20 20:00:33,387 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {101722#true} {101723#false} #1112#return; {101723#false} is VALID [2022-02-20 20:00:33,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-02-20 20:00:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {101722#true} havoc ~__retres1~9; {101722#true} is VALID [2022-02-20 20:00:33,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {101722#true} assume 0 == ~m_st~0;~__retres1~9 := 1; {101722#true} is VALID [2022-02-20 20:00:33,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {101722#true} #res := ~__retres1~9; {101722#true} is VALID [2022-02-20 20:00:33,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {101722#true} assume true; {101722#true} is VALID [2022-02-20 20:00:33,395 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {101722#true} {101723#false} #1114#return; {101723#false} is VALID [2022-02-20 20:00:33,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {101722#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {101722#true} is VALID [2022-02-20 20:00:33,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {101722#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {101722#true} is VALID [2022-02-20 20:00:33,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {101722#true} assume !(0 != main_#t~nondet36#1);havoc main_#t~nondet36#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~10#1;havoc main2_~__retres1~10#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; {101724#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:33,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {101724#(= ~t4_i~0 1)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret34#1, start_simulation2_#t~ret35#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~5#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~5#1;start_simulation2_~kernel_st~1#1 := 0; {101724#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:33,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {101724#(= ~t4_i~0 1)} call update_channels2(); {101722#true} is VALID [2022-02-20 20:00:33,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {101722#true} assume true; {101722#true} is VALID [2022-02-20 20:00:33,396 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {101722#true} {101724#(= ~t4_i~0 1)} #1106#return; {101724#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:33,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {101724#(= ~t4_i~0 1)} assume { :begin_inline_init_threads2 } true; {101724#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:33,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {101724#(= ~t4_i~0 1)} assume 1 == ~m_i~0;~m_st~0 := 0; {101724#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:33,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {101724#(= ~t4_i~0 1)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {101724#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:33,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {101724#(= ~t4_i~0 1)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {101724#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:33,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {101724#(= ~t4_i~0 1)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {101724#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:33,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {101724#(= ~t4_i~0 1)} assume !(1 == ~t4_i~0);~t4_st~0 := 2; {101723#false} is VALID [2022-02-20 20:00:33,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {101723#false} assume { :end_inline_init_threads2 } true; {101723#false} is VALID [2022-02-20 20:00:33,399 INFO L272 TraceCheckUtils]: 14: Hoare triple {101723#false} call fire_delta_events2(); {101788#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:33,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {101788#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {101722#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {101722#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {101722#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {101722#true} assume 0 == ~T4_E~0;~T4_E~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {101722#true} assume !(0 == ~E_M~0); {101722#true} is VALID [2022-02-20 20:00:33,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {101722#true} assume 0 == ~E_1~0;~E_1~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {101722#true} assume 0 == ~E_2~0;~E_2~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {101722#true} assume 0 == ~E_3~0;~E_3~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {101722#true} assume 0 == ~E_4~0;~E_4~0 := 1; {101722#true} is VALID [2022-02-20 20:00:33,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {101722#true} assume true; {101722#true} is VALID [2022-02-20 20:00:33,401 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {101722#true} {101723#false} #1108#return; {101723#false} is VALID [2022-02-20 20:00:33,401 INFO L272 TraceCheckUtils]: 27: Hoare triple {101723#false} call activate_threads2(); {101789#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} is VALID [2022-02-20 20:00:33,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {101789#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {101722#true} is VALID [2022-02-20 20:00:33,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {101722#true} assume !(1 == ~m_pc~0); {101722#true} is VALID [2022-02-20 20:00:33,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {101722#true} is_master_triggered_~__retres1~4#1 := 0; {101722#true} is VALID [2022-02-20 20:00:33,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {101722#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {101722#true} is VALID [2022-02-20 20:00:33,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {101722#true} #t~ret28#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp~6#1 := #t~ret28#1;havoc #t~ret28#1; {101722#true} is VALID [2022-02-20 20:00:33,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {101722#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {101722#true} is VALID [2022-02-20 20:00:33,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {101722#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {101722#true} is VALID [2022-02-20 20:00:33,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {101722#true} assume 1 == ~t1_pc~0; {101722#true} is VALID [2022-02-20 20:00:33,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {101722#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {101722#true} is VALID [2022-02-20 20:00:33,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {101722#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {101722#true} is VALID [2022-02-20 20:00:33,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {101722#true} #t~ret29#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___0~4#1 := #t~ret29#1;havoc #t~ret29#1; {101722#true} is VALID [2022-02-20 20:00:33,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {101722#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {101722#true} is VALID [2022-02-20 20:00:33,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {101722#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {101722#true} is VALID [2022-02-20 20:00:33,403 INFO L290 TraceCheckUtils]: 41: Hoare triple {101722#true} assume !(1 == ~t2_pc~0); {101722#true} is VALID [2022-02-20 20:00:33,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {101722#true} is_transmit2_triggered_~__retres1~6#1 := 0; {101722#true} is VALID [2022-02-20 20:00:33,403 INFO L290 TraceCheckUtils]: 43: Hoare triple {101722#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {101722#true} is VALID [2022-02-20 20:00:33,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {101722#true} #t~ret30#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___1~1#1 := #t~ret30#1;havoc #t~ret30#1; {101722#true} is VALID [2022-02-20 20:00:33,403 INFO L290 TraceCheckUtils]: 45: Hoare triple {101722#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {101722#true} is VALID [2022-02-20 20:00:33,404 INFO L290 TraceCheckUtils]: 46: Hoare triple {101722#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {101722#true} is VALID [2022-02-20 20:00:33,404 INFO L290 TraceCheckUtils]: 47: Hoare triple {101722#true} assume 1 == ~t3_pc~0; {101722#true} is VALID [2022-02-20 20:00:33,404 INFO L290 TraceCheckUtils]: 48: Hoare triple {101722#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {101722#true} is VALID [2022-02-20 20:00:33,404 INFO L290 TraceCheckUtils]: 49: Hoare triple {101722#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {101722#true} is VALID [2022-02-20 20:00:33,404 INFO L290 TraceCheckUtils]: 50: Hoare triple {101722#true} #t~ret31#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___2~0#1 := #t~ret31#1;havoc #t~ret31#1; {101722#true} is VALID [2022-02-20 20:00:33,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {101722#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {101722#true} is VALID [2022-02-20 20:00:33,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {101722#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {101722#true} is VALID [2022-02-20 20:00:33,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {101722#true} assume 1 == ~t4_pc~0; {101722#true} is VALID [2022-02-20 20:00:33,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {101722#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {101722#true} is VALID [2022-02-20 20:00:33,405 INFO L290 TraceCheckUtils]: 55: Hoare triple {101722#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {101722#true} is VALID [2022-02-20 20:00:33,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {101722#true} #t~ret32#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___3~0#1 := #t~ret32#1;havoc #t~ret32#1; {101722#true} is VALID [2022-02-20 20:00:33,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {101722#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {101722#true} is VALID [2022-02-20 20:00:33,405 INFO L290 TraceCheckUtils]: 58: Hoare triple {101722#true} assume true; {101722#true} is VALID [2022-02-20 20:00:33,405 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {101722#true} {101723#false} #1110#return; {101723#false} is VALID [2022-02-20 20:00:33,406 INFO L272 TraceCheckUtils]: 60: Hoare triple {101723#false} call reset_delta_events2(); {101788#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:33,406 INFO L290 TraceCheckUtils]: 61: Hoare triple {101788#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,406 INFO L290 TraceCheckUtils]: 62: Hoare triple {101722#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,406 INFO L290 TraceCheckUtils]: 63: Hoare triple {101722#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,406 INFO L290 TraceCheckUtils]: 64: Hoare triple {101722#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,406 INFO L290 TraceCheckUtils]: 65: Hoare triple {101722#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,406 INFO L290 TraceCheckUtils]: 66: Hoare triple {101722#true} assume !(1 == ~E_M~0); {101722#true} is VALID [2022-02-20 20:00:33,407 INFO L290 TraceCheckUtils]: 67: Hoare triple {101722#true} assume 1 == ~E_1~0;~E_1~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,407 INFO L290 TraceCheckUtils]: 68: Hoare triple {101722#true} assume 1 == ~E_2~0;~E_2~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,407 INFO L290 TraceCheckUtils]: 69: Hoare triple {101722#true} assume 1 == ~E_3~0;~E_3~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,407 INFO L290 TraceCheckUtils]: 70: Hoare triple {101722#true} assume 1 == ~E_4~0;~E_4~0 := 2; {101722#true} is VALID [2022-02-20 20:00:33,407 INFO L290 TraceCheckUtils]: 71: Hoare triple {101722#true} assume true; {101722#true} is VALID [2022-02-20 20:00:33,407 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {101722#true} {101723#false} #1112#return; {101723#false} is VALID [2022-02-20 20:00:33,408 INFO L290 TraceCheckUtils]: 73: Hoare triple {101723#false} assume !false; {101723#false} is VALID [2022-02-20 20:00:33,408 INFO L290 TraceCheckUtils]: 74: Hoare triple {101723#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_4~0#1, eval2_#t~nondet27#1, eval2_~tmp_ndt_5~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {101723#false} is VALID [2022-02-20 20:00:33,408 INFO L290 TraceCheckUtils]: 75: Hoare triple {101723#false} assume !false; {101723#false} is VALID [2022-02-20 20:00:33,409 INFO L272 TraceCheckUtils]: 76: Hoare triple {101723#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {101722#true} is VALID [2022-02-20 20:00:33,409 INFO L290 TraceCheckUtils]: 77: Hoare triple {101722#true} havoc ~__retres1~9; {101722#true} is VALID [2022-02-20 20:00:33,409 INFO L290 TraceCheckUtils]: 78: Hoare triple {101722#true} assume 0 == ~m_st~0;~__retres1~9 := 1; {101722#true} is VALID [2022-02-20 20:00:33,409 INFO L290 TraceCheckUtils]: 79: Hoare triple {101722#true} #res := ~__retres1~9; {101722#true} is VALID [2022-02-20 20:00:33,409 INFO L290 TraceCheckUtils]: 80: Hoare triple {101722#true} assume true; {101722#true} is VALID [2022-02-20 20:00:33,409 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {101722#true} {101723#false} #1114#return; {101723#false} is VALID [2022-02-20 20:00:33,409 INFO L290 TraceCheckUtils]: 82: Hoare triple {101723#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {101723#false} is VALID [2022-02-20 20:00:33,410 INFO L290 TraceCheckUtils]: 83: Hoare triple {101723#false} assume 0 != eval2_~tmp~5#1; {101723#false} is VALID [2022-02-20 20:00:33,410 INFO L290 TraceCheckUtils]: 84: Hoare triple {101723#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {101723#false} is VALID [2022-02-20 20:00:33,410 INFO L290 TraceCheckUtils]: 85: Hoare triple {101723#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {101723#false} is VALID [2022-02-20 20:00:33,410 INFO L290 TraceCheckUtils]: 86: Hoare triple {101723#false} assume !(0 == ~m_pc~0); {101723#false} is VALID [2022-02-20 20:00:33,410 INFO L290 TraceCheckUtils]: 87: Hoare triple {101723#false} assume 1 == ~m_pc~0; {101723#false} is VALID [2022-02-20 20:00:33,410 INFO L290 TraceCheckUtils]: 88: Hoare triple {101723#false} assume ~token~0 != 4 + ~local~0; {101723#false} is VALID [2022-02-20 20:00:33,410 INFO L272 TraceCheckUtils]: 89: Hoare triple {101723#false} call error2(); {101723#false} is VALID [2022-02-20 20:00:33,411 INFO L290 TraceCheckUtils]: 90: Hoare triple {101723#false} assume !false; {101723#false} is VALID [2022-02-20 20:00:33,411 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:00:33,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:33,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240518115] [2022-02-20 20:00:33,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240518115] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:33,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:33,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:00:33,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609698701] [2022-02-20 20:00:33,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:33,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2022-02-20 20:00:33,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:33,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:33,474 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:00:33,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:00:33,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:33,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:00:33,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:00:33,476 INFO L87 Difference]: Start difference. First operand 2284 states and 2869 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:35,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:35,135 INFO L93 Difference]: Finished difference Result 2512 states and 3225 transitions. [2022-02-20 20:00:35,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:00:35,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2022-02-20 20:00:35,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 780 transitions. [2022-02-20 20:00:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 780 transitions. [2022-02-20 20:00:35,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 780 transitions. [2022-02-20 20:00:35,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 780 edges. 780 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:35,856 INFO L225 Difference]: With dead ends: 2512 [2022-02-20 20:00:35,856 INFO L226 Difference]: Without dead ends: 2338 [2022-02-20 20:00:35,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:35,858 INFO L933 BasicCegarLoop]: 443 mSDtfsCounter, 550 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:35,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 836 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 20:00:35,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2022-02-20 20:00:36,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2284. [2022-02-20 20:00:36,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:36,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2338 states. Second operand has 2284 states, 1791 states have (on average 1.2540480178671134) internal successors, (2246), 1820 states have internal predecessors, (2246), 261 states have call successors, (261), 169 states have call predecessors, (261), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) [2022-02-20 20:00:36,013 INFO L74 IsIncluded]: Start isIncluded. First operand 2338 states. Second operand has 2284 states, 1791 states have (on average 1.2540480178671134) internal successors, (2246), 1820 states have internal predecessors, (2246), 261 states have call successors, (261), 169 states have call predecessors, (261), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) [2022-02-20 20:00:36,015 INFO L87 Difference]: Start difference. First operand 2338 states. Second operand has 2284 states, 1791 states have (on average 1.2540480178671134) internal successors, (2246), 1820 states have internal predecessors, (2246), 261 states have call successors, (261), 169 states have call predecessors, (261), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) [2022-02-20 20:00:36,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:36,151 INFO L93 Difference]: Finished difference Result 2338 states and 2961 transitions. [2022-02-20 20:00:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 2961 transitions. [2022-02-20 20:00:36,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:36,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:36,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 2284 states, 1791 states have (on average 1.2540480178671134) internal successors, (2246), 1820 states have internal predecessors, (2246), 261 states have call successors, (261), 169 states have call predecessors, (261), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) Second operand 2338 states. [2022-02-20 20:00:36,158 INFO L87 Difference]: Start difference. First operand has 2284 states, 1791 states have (on average 1.2540480178671134) internal successors, (2246), 1820 states have internal predecessors, (2246), 261 states have call successors, (261), 169 states have call predecessors, (261), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) Second operand 2338 states. [2022-02-20 20:00:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:36,295 INFO L93 Difference]: Finished difference Result 2338 states and 2961 transitions. [2022-02-20 20:00:36,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 2961 transitions. [2022-02-20 20:00:36,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:36,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:36,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:36,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:36,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 1791 states have (on average 1.2540480178671134) internal successors, (2246), 1820 states have internal predecessors, (2246), 261 states have call successors, (261), 169 states have call predecessors, (261), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) [2022-02-20 20:00:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 2868 transitions. [2022-02-20 20:00:36,503 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 2868 transitions. Word has length 91 [2022-02-20 20:00:36,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:36,503 INFO L470 AbstractCegarLoop]: Abstraction has 2284 states and 2868 transitions. [2022-02-20 20:00:36,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:36,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 2868 transitions. [2022-02-20 20:00:36,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:36,504 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:36,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:36,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 20:00:36,505 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:36,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash -247207975, now seen corresponding path program 1 times [2022-02-20 20:00:36,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:36,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239362889] [2022-02-20 20:00:36,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:36,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:36,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:36,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {112900#true} assume true; {112900#true} is VALID [2022-02-20 20:00:36,547 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {112900#true} {112902#(= ~M_E~0 2)} #1106#return; {112902#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:36,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 20:00:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:36,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {112966#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume 0 == ~T4_E~0;~T4_E~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume !(0 == ~E_M~0); {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume 0 == ~E_4~0;~E_4~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume true; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,574 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {112967#(= |old(~M_E~0)| 0)} {112902#(= ~M_E~0 2)} #1108#return; {112901#false} is VALID [2022-02-20 20:00:36,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 20:00:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:36,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {112968#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {112900#true} is VALID [2022-02-20 20:00:36,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {112900#true} assume !(1 == ~m_pc~0); {112900#true} is VALID [2022-02-20 20:00:36,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {112900#true} is_master_triggered_~__retres1~4#1 := 0; {112900#true} is VALID [2022-02-20 20:00:36,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {112900#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {112900#true} is VALID [2022-02-20 20:00:36,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {112900#true} #t~ret28#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp~6#1 := #t~ret28#1;havoc #t~ret28#1; {112900#true} is VALID [2022-02-20 20:00:36,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {112900#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {112900#true} is VALID [2022-02-20 20:00:36,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {112900#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {112900#true} is VALID [2022-02-20 20:00:36,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {112900#true} assume 1 == ~t1_pc~0; {112900#true} is VALID [2022-02-20 20:00:36,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {112900#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {112900#true} is VALID [2022-02-20 20:00:36,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {112900#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {112900#true} is VALID [2022-02-20 20:00:36,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {112900#true} #t~ret29#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___0~4#1 := #t~ret29#1;havoc #t~ret29#1; {112900#true} is VALID [2022-02-20 20:00:36,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {112900#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {112900#true} is VALID [2022-02-20 20:00:36,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {112900#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {112900#true} is VALID [2022-02-20 20:00:36,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {112900#true} assume !(1 == ~t2_pc~0); {112900#true} is VALID [2022-02-20 20:00:36,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {112900#true} is_transmit2_triggered_~__retres1~6#1 := 0; {112900#true} is VALID [2022-02-20 20:00:36,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {112900#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {112900#true} is VALID [2022-02-20 20:00:36,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {112900#true} #t~ret30#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___1~1#1 := #t~ret30#1;havoc #t~ret30#1; {112900#true} is VALID [2022-02-20 20:00:36,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {112900#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {112900#true} is VALID [2022-02-20 20:00:36,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {112900#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {112900#true} is VALID [2022-02-20 20:00:36,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {112900#true} assume 1 == ~t3_pc~0; {112900#true} is VALID [2022-02-20 20:00:36,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {112900#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {112900#true} is VALID [2022-02-20 20:00:36,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {112900#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {112900#true} is VALID [2022-02-20 20:00:36,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {112900#true} #t~ret31#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___2~0#1 := #t~ret31#1;havoc #t~ret31#1; {112900#true} is VALID [2022-02-20 20:00:36,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {112900#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {112900#true} is VALID [2022-02-20 20:00:36,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {112900#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {112900#true} is VALID [2022-02-20 20:00:36,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {112900#true} assume 1 == ~t4_pc~0; {112900#true} is VALID [2022-02-20 20:00:36,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {112900#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {112900#true} is VALID [2022-02-20 20:00:36,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {112900#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {112900#true} is VALID [2022-02-20 20:00:36,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {112900#true} #t~ret32#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___3~0#1 := #t~ret32#1;havoc #t~ret32#1; {112900#true} is VALID [2022-02-20 20:00:36,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {112900#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {112900#true} is VALID [2022-02-20 20:00:36,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {112900#true} assume true; {112900#true} is VALID [2022-02-20 20:00:36,592 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {112900#true} {112901#false} #1110#return; {112901#false} is VALID [2022-02-20 20:00:36,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-20 20:00:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:36,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {112966#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {112900#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {112900#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {112900#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {112900#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {112900#true} assume !(1 == ~E_M~0); {112900#true} is VALID [2022-02-20 20:00:36,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {112900#true} assume 1 == ~E_1~0;~E_1~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {112900#true} assume 1 == ~E_2~0;~E_2~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {112900#true} assume 1 == ~E_3~0;~E_3~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {112900#true} assume 1 == ~E_4~0;~E_4~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {112900#true} assume true; {112900#true} is VALID [2022-02-20 20:00:36,598 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {112900#true} {112901#false} #1112#return; {112901#false} is VALID [2022-02-20 20:00:36,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-02-20 20:00:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:36,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {112900#true} havoc ~__retres1~9; {112900#true} is VALID [2022-02-20 20:00:36,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {112900#true} assume 0 == ~m_st~0;~__retres1~9 := 1; {112900#true} is VALID [2022-02-20 20:00:36,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {112900#true} #res := ~__retres1~9; {112900#true} is VALID [2022-02-20 20:00:36,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {112900#true} assume true; {112900#true} is VALID [2022-02-20 20:00:36,601 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {112900#true} {112901#false} #1114#return; {112901#false} is VALID [2022-02-20 20:00:36,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {112900#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {112902#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:36,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {112902#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {112902#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:36,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {112902#(= ~M_E~0 2)} assume !(0 != main_#t~nondet36#1);havoc main_#t~nondet36#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~10#1;havoc main2_~__retres1~10#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; {112902#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:36,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {112902#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret34#1, start_simulation2_#t~ret35#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~5#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~5#1;start_simulation2_~kernel_st~1#1 := 0; {112902#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:36,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {112902#(= ~M_E~0 2)} call update_channels2(); {112900#true} is VALID [2022-02-20 20:00:36,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {112900#true} assume true; {112900#true} is VALID [2022-02-20 20:00:36,603 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {112900#true} {112902#(= ~M_E~0 2)} #1106#return; {112902#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:36,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {112902#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {112902#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:36,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {112902#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {112902#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:36,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {112902#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {112902#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:36,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {112902#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {112902#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:36,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {112902#(= ~M_E~0 2)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {112902#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:36,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {112902#(= ~M_E~0 2)} assume 1 == ~t4_i~0;~t4_st~0 := 0; {112902#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:36,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {112902#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {112902#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:36,606 INFO L272 TraceCheckUtils]: 14: Hoare triple {112902#(= ~M_E~0 2)} call fire_delta_events2(); {112966#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:36,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {112966#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume 0 == ~T4_E~0;~T4_E~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume !(0 == ~E_M~0); {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume 0 == ~E_4~0;~E_4~0 := 1; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {112967#(= |old(~M_E~0)| 0)} assume true; {112967#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:36,609 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {112967#(= |old(~M_E~0)| 0)} {112902#(= ~M_E~0 2)} #1108#return; {112901#false} is VALID [2022-02-20 20:00:36,609 INFO L272 TraceCheckUtils]: 27: Hoare triple {112901#false} call activate_threads2(); {112968#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} is VALID [2022-02-20 20:00:36,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {112968#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {112900#true} is VALID [2022-02-20 20:00:36,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {112900#true} assume !(1 == ~m_pc~0); {112900#true} is VALID [2022-02-20 20:00:36,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {112900#true} is_master_triggered_~__retres1~4#1 := 0; {112900#true} is VALID [2022-02-20 20:00:36,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {112900#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {112900#true} is VALID [2022-02-20 20:00:36,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {112900#true} #t~ret28#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp~6#1 := #t~ret28#1;havoc #t~ret28#1; {112900#true} is VALID [2022-02-20 20:00:36,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {112900#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {112900#true} is VALID [2022-02-20 20:00:36,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {112900#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {112900#true} is VALID [2022-02-20 20:00:36,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {112900#true} assume 1 == ~t1_pc~0; {112900#true} is VALID [2022-02-20 20:00:36,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {112900#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {112900#true} is VALID [2022-02-20 20:00:36,611 INFO L290 TraceCheckUtils]: 37: Hoare triple {112900#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {112900#true} is VALID [2022-02-20 20:00:36,611 INFO L290 TraceCheckUtils]: 38: Hoare triple {112900#true} #t~ret29#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___0~4#1 := #t~ret29#1;havoc #t~ret29#1; {112900#true} is VALID [2022-02-20 20:00:36,611 INFO L290 TraceCheckUtils]: 39: Hoare triple {112900#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {112900#true} is VALID [2022-02-20 20:00:36,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {112900#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {112900#true} is VALID [2022-02-20 20:00:36,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {112900#true} assume !(1 == ~t2_pc~0); {112900#true} is VALID [2022-02-20 20:00:36,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {112900#true} is_transmit2_triggered_~__retres1~6#1 := 0; {112900#true} is VALID [2022-02-20 20:00:36,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {112900#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {112900#true} is VALID [2022-02-20 20:00:36,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {112900#true} #t~ret30#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___1~1#1 := #t~ret30#1;havoc #t~ret30#1; {112900#true} is VALID [2022-02-20 20:00:36,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {112900#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {112900#true} is VALID [2022-02-20 20:00:36,612 INFO L290 TraceCheckUtils]: 46: Hoare triple {112900#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {112900#true} is VALID [2022-02-20 20:00:36,612 INFO L290 TraceCheckUtils]: 47: Hoare triple {112900#true} assume 1 == ~t3_pc~0; {112900#true} is VALID [2022-02-20 20:00:36,612 INFO L290 TraceCheckUtils]: 48: Hoare triple {112900#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {112900#true} is VALID [2022-02-20 20:00:36,612 INFO L290 TraceCheckUtils]: 49: Hoare triple {112900#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {112900#true} is VALID [2022-02-20 20:00:36,612 INFO L290 TraceCheckUtils]: 50: Hoare triple {112900#true} #t~ret31#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___2~0#1 := #t~ret31#1;havoc #t~ret31#1; {112900#true} is VALID [2022-02-20 20:00:36,612 INFO L290 TraceCheckUtils]: 51: Hoare triple {112900#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {112900#true} is VALID [2022-02-20 20:00:36,612 INFO L290 TraceCheckUtils]: 52: Hoare triple {112900#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {112900#true} is VALID [2022-02-20 20:00:36,612 INFO L290 TraceCheckUtils]: 53: Hoare triple {112900#true} assume 1 == ~t4_pc~0; {112900#true} is VALID [2022-02-20 20:00:36,613 INFO L290 TraceCheckUtils]: 54: Hoare triple {112900#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {112900#true} is VALID [2022-02-20 20:00:36,613 INFO L290 TraceCheckUtils]: 55: Hoare triple {112900#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {112900#true} is VALID [2022-02-20 20:00:36,613 INFO L290 TraceCheckUtils]: 56: Hoare triple {112900#true} #t~ret32#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___3~0#1 := #t~ret32#1;havoc #t~ret32#1; {112900#true} is VALID [2022-02-20 20:00:36,613 INFO L290 TraceCheckUtils]: 57: Hoare triple {112900#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {112900#true} is VALID [2022-02-20 20:00:36,613 INFO L290 TraceCheckUtils]: 58: Hoare triple {112900#true} assume true; {112900#true} is VALID [2022-02-20 20:00:36,613 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {112900#true} {112901#false} #1110#return; {112901#false} is VALID [2022-02-20 20:00:36,613 INFO L272 TraceCheckUtils]: 60: Hoare triple {112901#false} call reset_delta_events2(); {112966#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:36,613 INFO L290 TraceCheckUtils]: 61: Hoare triple {112966#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,614 INFO L290 TraceCheckUtils]: 62: Hoare triple {112900#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,614 INFO L290 TraceCheckUtils]: 63: Hoare triple {112900#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,614 INFO L290 TraceCheckUtils]: 64: Hoare triple {112900#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,614 INFO L290 TraceCheckUtils]: 65: Hoare triple {112900#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,614 INFO L290 TraceCheckUtils]: 66: Hoare triple {112900#true} assume !(1 == ~E_M~0); {112900#true} is VALID [2022-02-20 20:00:36,614 INFO L290 TraceCheckUtils]: 67: Hoare triple {112900#true} assume 1 == ~E_1~0;~E_1~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,614 INFO L290 TraceCheckUtils]: 68: Hoare triple {112900#true} assume 1 == ~E_2~0;~E_2~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,614 INFO L290 TraceCheckUtils]: 69: Hoare triple {112900#true} assume 1 == ~E_3~0;~E_3~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,614 INFO L290 TraceCheckUtils]: 70: Hoare triple {112900#true} assume 1 == ~E_4~0;~E_4~0 := 2; {112900#true} is VALID [2022-02-20 20:00:36,615 INFO L290 TraceCheckUtils]: 71: Hoare triple {112900#true} assume true; {112900#true} is VALID [2022-02-20 20:00:36,615 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {112900#true} {112901#false} #1112#return; {112901#false} is VALID [2022-02-20 20:00:36,615 INFO L290 TraceCheckUtils]: 73: Hoare triple {112901#false} assume !false; {112901#false} is VALID [2022-02-20 20:00:36,615 INFO L290 TraceCheckUtils]: 74: Hoare triple {112901#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_4~0#1, eval2_#t~nondet27#1, eval2_~tmp_ndt_5~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {112901#false} is VALID [2022-02-20 20:00:36,615 INFO L290 TraceCheckUtils]: 75: Hoare triple {112901#false} assume !false; {112901#false} is VALID [2022-02-20 20:00:36,615 INFO L272 TraceCheckUtils]: 76: Hoare triple {112901#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {112900#true} is VALID [2022-02-20 20:00:36,615 INFO L290 TraceCheckUtils]: 77: Hoare triple {112900#true} havoc ~__retres1~9; {112900#true} is VALID [2022-02-20 20:00:36,615 INFO L290 TraceCheckUtils]: 78: Hoare triple {112900#true} assume 0 == ~m_st~0;~__retres1~9 := 1; {112900#true} is VALID [2022-02-20 20:00:36,616 INFO L290 TraceCheckUtils]: 79: Hoare triple {112900#true} #res := ~__retres1~9; {112900#true} is VALID [2022-02-20 20:00:36,616 INFO L290 TraceCheckUtils]: 80: Hoare triple {112900#true} assume true; {112900#true} is VALID [2022-02-20 20:00:36,616 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {112900#true} {112901#false} #1114#return; {112901#false} is VALID [2022-02-20 20:00:36,616 INFO L290 TraceCheckUtils]: 82: Hoare triple {112901#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {112901#false} is VALID [2022-02-20 20:00:36,616 INFO L290 TraceCheckUtils]: 83: Hoare triple {112901#false} assume 0 != eval2_~tmp~5#1; {112901#false} is VALID [2022-02-20 20:00:36,616 INFO L290 TraceCheckUtils]: 84: Hoare triple {112901#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {112901#false} is VALID [2022-02-20 20:00:36,616 INFO L290 TraceCheckUtils]: 85: Hoare triple {112901#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {112901#false} is VALID [2022-02-20 20:00:36,616 INFO L290 TraceCheckUtils]: 86: Hoare triple {112901#false} assume !(0 == ~m_pc~0); {112901#false} is VALID [2022-02-20 20:00:36,617 INFO L290 TraceCheckUtils]: 87: Hoare triple {112901#false} assume 1 == ~m_pc~0; {112901#false} is VALID [2022-02-20 20:00:36,617 INFO L290 TraceCheckUtils]: 88: Hoare triple {112901#false} assume ~token~0 != 4 + ~local~0; {112901#false} is VALID [2022-02-20 20:00:36,617 INFO L272 TraceCheckUtils]: 89: Hoare triple {112901#false} call error2(); {112901#false} is VALID [2022-02-20 20:00:36,617 INFO L290 TraceCheckUtils]: 90: Hoare triple {112901#false} assume !false; {112901#false} is VALID [2022-02-20 20:00:36,617 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:00:36,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:36,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239362889] [2022-02-20 20:00:36,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239362889] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:36,618 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:36,618 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:36,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013024828] [2022-02-20 20:00:36,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:36,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2022-02-20 20:00:36,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:36,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:36,679 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:00:36,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:36,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:36,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:36,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:36,681 INFO L87 Difference]: Start difference. First operand 2284 states and 2868 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:39,581 INFO L93 Difference]: Finished difference Result 2738 states and 3579 transitions. [2022-02-20 20:00:39,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 20:00:39,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2022-02-20 20:00:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1134 transitions. [2022-02-20 20:00:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1134 transitions. [2022-02-20 20:00:39,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1134 transitions. [2022-02-20 20:00:40,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1134 edges. 1134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:40,600 INFO L225 Difference]: With dead ends: 2738 [2022-02-20 20:00:40,600 INFO L226 Difference]: Without dead ends: 2566 [2022-02-20 20:00:40,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:00:40,601 INFO L933 BasicCegarLoop]: 470 mSDtfsCounter, 887 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:40,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [910 Valid, 1167 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 20:00:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2022-02-20 20:00:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2457. [2022-02-20 20:00:40,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:40,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2566 states. Second operand has 2457 states, 1944 states have (on average 1.2777777777777777) internal successors, (2484), 1974 states have internal predecessors, (2484), 274 states have call successors, (274), 175 states have call predecessors, (274), 237 states have return successors, (377), 309 states have call predecessors, (377), 270 states have call successors, (377) [2022-02-20 20:00:40,756 INFO L74 IsIncluded]: Start isIncluded. First operand 2566 states. Second operand has 2457 states, 1944 states have (on average 1.2777777777777777) internal successors, (2484), 1974 states have internal predecessors, (2484), 274 states have call successors, (274), 175 states have call predecessors, (274), 237 states have return successors, (377), 309 states have call predecessors, (377), 270 states have call successors, (377) [2022-02-20 20:00:40,757 INFO L87 Difference]: Start difference. First operand 2566 states. Second operand has 2457 states, 1944 states have (on average 1.2777777777777777) internal successors, (2484), 1974 states have internal predecessors, (2484), 274 states have call successors, (274), 175 states have call predecessors, (274), 237 states have return successors, (377), 309 states have call predecessors, (377), 270 states have call successors, (377) [2022-02-20 20:00:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:40,919 INFO L93 Difference]: Finished difference Result 2566 states and 3313 transitions. [2022-02-20 20:00:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3313 transitions. [2022-02-20 20:00:40,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:40,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:40,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 2457 states, 1944 states have (on average 1.2777777777777777) internal successors, (2484), 1974 states have internal predecessors, (2484), 274 states have call successors, (274), 175 states have call predecessors, (274), 237 states have return successors, (377), 309 states have call predecessors, (377), 270 states have call successors, (377) Second operand 2566 states. [2022-02-20 20:00:40,926 INFO L87 Difference]: Start difference. First operand has 2457 states, 1944 states have (on average 1.2777777777777777) internal successors, (2484), 1974 states have internal predecessors, (2484), 274 states have call successors, (274), 175 states have call predecessors, (274), 237 states have return successors, (377), 309 states have call predecessors, (377), 270 states have call successors, (377) Second operand 2566 states. [2022-02-20 20:00:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:41,088 INFO L93 Difference]: Finished difference Result 2566 states and 3313 transitions. [2022-02-20 20:00:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3313 transitions. [2022-02-20 20:00:41,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:41,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:41,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:41,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:41,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 1944 states have (on average 1.2777777777777777) internal successors, (2484), 1974 states have internal predecessors, (2484), 274 states have call successors, (274), 175 states have call predecessors, (274), 237 states have return successors, (377), 309 states have call predecessors, (377), 270 states have call successors, (377) [2022-02-20 20:00:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3135 transitions. [2022-02-20 20:00:41,341 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3135 transitions. Word has length 91 [2022-02-20 20:00:41,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:41,341 INFO L470 AbstractCegarLoop]: Abstraction has 2457 states and 3135 transitions. [2022-02-20 20:00:41,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:41,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3135 transitions. [2022-02-20 20:00:41,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:41,342 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:41,342 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:41,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 20:00:41,342 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:41,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:41,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1993054677, now seen corresponding path program 1 times [2022-02-20 20:00:41,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:41,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387122032] [2022-02-20 20:00:41,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:41,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {125046#true} assume true; {125046#true} is VALID [2022-02-20 20:00:41,364 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {125046#true} {125048#(= ~T1_E~0 ~M_E~0)} #1106#return; {125048#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:41,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 20:00:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {125112#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {125113#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:41,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {125113#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,393 INFO L290 TraceCheckUtils]: 3: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T4_E~0;~T4_E~0 := 1; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_4~0;~E_4~0 := 1; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,396 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {125048#(= ~T1_E~0 ~M_E~0)} #1108#return; {125047#false} is VALID [2022-02-20 20:00:41,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 20:00:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {125115#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {125046#true} is VALID [2022-02-20 20:00:41,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {125046#true} assume !(1 == ~m_pc~0); {125046#true} is VALID [2022-02-20 20:00:41,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {125046#true} is_master_triggered_~__retres1~4#1 := 0; {125046#true} is VALID [2022-02-20 20:00:41,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {125046#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {125046#true} is VALID [2022-02-20 20:00:41,412 INFO L290 TraceCheckUtils]: 4: Hoare triple {125046#true} #t~ret28#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp~6#1 := #t~ret28#1;havoc #t~ret28#1; {125046#true} is VALID [2022-02-20 20:00:41,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {125046#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {125046#true} is VALID [2022-02-20 20:00:41,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {125046#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {125046#true} is VALID [2022-02-20 20:00:41,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {125046#true} assume 1 == ~t1_pc~0; {125046#true} is VALID [2022-02-20 20:00:41,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {125046#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {125046#true} is VALID [2022-02-20 20:00:41,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {125046#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {125046#true} is VALID [2022-02-20 20:00:41,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {125046#true} #t~ret29#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___0~4#1 := #t~ret29#1;havoc #t~ret29#1; {125046#true} is VALID [2022-02-20 20:00:41,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {125046#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {125046#true} is VALID [2022-02-20 20:00:41,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {125046#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {125046#true} is VALID [2022-02-20 20:00:41,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {125046#true} assume !(1 == ~t2_pc~0); {125046#true} is VALID [2022-02-20 20:00:41,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {125046#true} is_transmit2_triggered_~__retres1~6#1 := 0; {125046#true} is VALID [2022-02-20 20:00:41,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {125046#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {125046#true} is VALID [2022-02-20 20:00:41,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {125046#true} #t~ret30#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___1~1#1 := #t~ret30#1;havoc #t~ret30#1; {125046#true} is VALID [2022-02-20 20:00:41,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {125046#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {125046#true} is VALID [2022-02-20 20:00:41,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {125046#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {125046#true} is VALID [2022-02-20 20:00:41,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {125046#true} assume 1 == ~t3_pc~0; {125046#true} is VALID [2022-02-20 20:00:41,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {125046#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {125046#true} is VALID [2022-02-20 20:00:41,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {125046#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {125046#true} is VALID [2022-02-20 20:00:41,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {125046#true} #t~ret31#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___2~0#1 := #t~ret31#1;havoc #t~ret31#1; {125046#true} is VALID [2022-02-20 20:00:41,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {125046#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {125046#true} is VALID [2022-02-20 20:00:41,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {125046#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {125046#true} is VALID [2022-02-20 20:00:41,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {125046#true} assume 1 == ~t4_pc~0; {125046#true} is VALID [2022-02-20 20:00:41,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {125046#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {125046#true} is VALID [2022-02-20 20:00:41,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {125046#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {125046#true} is VALID [2022-02-20 20:00:41,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {125046#true} #t~ret32#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___3~0#1 := #t~ret32#1;havoc #t~ret32#1; {125046#true} is VALID [2022-02-20 20:00:41,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {125046#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {125046#true} is VALID [2022-02-20 20:00:41,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {125046#true} assume true; {125046#true} is VALID [2022-02-20 20:00:41,416 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {125046#true} {125047#false} #1110#return; {125047#false} is VALID [2022-02-20 20:00:41,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-20 20:00:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {125112#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {125046#true} is VALID [2022-02-20 20:00:41,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {125046#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {125046#true} is VALID [2022-02-20 20:00:41,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {125046#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {125046#true} is VALID [2022-02-20 20:00:41,421 INFO L290 TraceCheckUtils]: 3: Hoare triple {125046#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {125046#true} is VALID [2022-02-20 20:00:41,421 INFO L290 TraceCheckUtils]: 4: Hoare triple {125046#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {125046#true} is VALID [2022-02-20 20:00:41,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {125046#true} assume !(1 == ~E_M~0); {125046#true} is VALID [2022-02-20 20:00:41,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {125046#true} assume 1 == ~E_1~0;~E_1~0 := 2; {125046#true} is VALID [2022-02-20 20:00:41,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {125046#true} assume 1 == ~E_2~0;~E_2~0 := 2; {125046#true} is VALID [2022-02-20 20:00:41,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {125046#true} assume 1 == ~E_3~0;~E_3~0 := 2; {125046#true} is VALID [2022-02-20 20:00:41,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {125046#true} assume 1 == ~E_4~0;~E_4~0 := 2; {125046#true} is VALID [2022-02-20 20:00:41,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {125046#true} assume true; {125046#true} is VALID [2022-02-20 20:00:41,422 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {125046#true} {125047#false} #1112#return; {125047#false} is VALID [2022-02-20 20:00:41,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-02-20 20:00:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {125046#true} havoc ~__retres1~9; {125046#true} is VALID [2022-02-20 20:00:41,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {125046#true} assume 0 == ~m_st~0;~__retres1~9 := 1; {125046#true} is VALID [2022-02-20 20:00:41,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {125046#true} #res := ~__retres1~9; {125046#true} is VALID [2022-02-20 20:00:41,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {125046#true} assume true; {125046#true} is VALID [2022-02-20 20:00:41,425 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {125046#true} {125047#false} #1114#return; {125047#false} is VALID [2022-02-20 20:00:41,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {125046#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {125048#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:41,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {125048#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {125048#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:41,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {125048#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet36#1);havoc main_#t~nondet36#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~10#1;havoc main2_~__retres1~10#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; {125048#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:41,427 INFO L290 TraceCheckUtils]: 3: Hoare triple {125048#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret34#1, start_simulation2_#t~ret35#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~5#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~5#1;start_simulation2_~kernel_st~1#1 := 0; {125048#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:41,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {125048#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {125046#true} is VALID [2022-02-20 20:00:41,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {125046#true} assume true; {125046#true} is VALID [2022-02-20 20:00:41,427 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {125046#true} {125048#(= ~T1_E~0 ~M_E~0)} #1106#return; {125048#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:41,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {125048#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {125048#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:41,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {125048#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {125048#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:41,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {125048#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {125048#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:41,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {125048#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {125048#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:41,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {125048#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {125048#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:41,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {125048#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t4_i~0;~t4_st~0 := 0; {125048#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:41,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {125048#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {125048#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:41,430 INFO L272 TraceCheckUtils]: 14: Hoare triple {125048#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {125112#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:41,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {125112#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {125113#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:41,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {125113#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T4_E~0;~T4_E~0 := 1; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_4~0;~E_4~0 := 1; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:41,434 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {125114#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {125048#(= ~T1_E~0 ~M_E~0)} #1108#return; {125047#false} is VALID [2022-02-20 20:00:41,434 INFO L272 TraceCheckUtils]: 27: Hoare triple {125047#false} call activate_threads2(); {125115#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} is VALID [2022-02-20 20:00:41,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {125115#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {125046#true} is VALID [2022-02-20 20:00:41,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {125046#true} assume !(1 == ~m_pc~0); {125046#true} is VALID [2022-02-20 20:00:41,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {125046#true} is_master_triggered_~__retres1~4#1 := 0; {125046#true} is VALID [2022-02-20 20:00:41,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {125046#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {125046#true} is VALID [2022-02-20 20:00:41,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {125046#true} #t~ret28#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp~6#1 := #t~ret28#1;havoc #t~ret28#1; {125046#true} is VALID [2022-02-20 20:00:41,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {125046#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {125046#true} is VALID [2022-02-20 20:00:41,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {125046#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {125046#true} is VALID [2022-02-20 20:00:41,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {125046#true} assume 1 == ~t1_pc~0; {125046#true} is VALID [2022-02-20 20:00:41,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {125046#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {125046#true} is VALID [2022-02-20 20:00:41,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {125046#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {125046#true} is VALID [2022-02-20 20:00:41,434 INFO L290 TraceCheckUtils]: 38: Hoare triple {125046#true} #t~ret29#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___0~4#1 := #t~ret29#1;havoc #t~ret29#1; {125046#true} is VALID [2022-02-20 20:00:41,435 INFO L290 TraceCheckUtils]: 39: Hoare triple {125046#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {125046#true} is VALID [2022-02-20 20:00:41,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {125046#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {125046#true} is VALID [2022-02-20 20:00:41,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {125046#true} assume !(1 == ~t2_pc~0); {125046#true} is VALID [2022-02-20 20:00:41,435 INFO L290 TraceCheckUtils]: 42: Hoare triple {125046#true} is_transmit2_triggered_~__retres1~6#1 := 0; {125046#true} is VALID [2022-02-20 20:00:41,435 INFO L290 TraceCheckUtils]: 43: Hoare triple {125046#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {125046#true} is VALID [2022-02-20 20:00:41,435 INFO L290 TraceCheckUtils]: 44: Hoare triple {125046#true} #t~ret30#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___1~1#1 := #t~ret30#1;havoc #t~ret30#1; {125046#true} is VALID [2022-02-20 20:00:41,435 INFO L290 TraceCheckUtils]: 45: Hoare triple {125046#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {125046#true} is VALID [2022-02-20 20:00:41,435 INFO L290 TraceCheckUtils]: 46: Hoare triple {125046#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {125046#true} is VALID [2022-02-20 20:00:41,435 INFO L290 TraceCheckUtils]: 47: Hoare triple {125046#true} assume 1 == ~t3_pc~0; {125046#true} is VALID [2022-02-20 20:00:41,435 INFO L290 TraceCheckUtils]: 48: Hoare triple {125046#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {125046#true} is VALID [2022-02-20 20:00:41,435 INFO L290 TraceCheckUtils]: 49: Hoare triple {125046#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {125046#true} is VALID [2022-02-20 20:00:41,436 INFO L290 TraceCheckUtils]: 50: Hoare triple {125046#true} #t~ret31#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___2~0#1 := #t~ret31#1;havoc #t~ret31#1; {125046#true} is VALID [2022-02-20 20:00:41,436 INFO L290 TraceCheckUtils]: 51: Hoare triple {125046#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {125046#true} is VALID [2022-02-20 20:00:41,436 INFO L290 TraceCheckUtils]: 52: Hoare triple {125046#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {125046#true} is VALID [2022-02-20 20:00:41,436 INFO L290 TraceCheckUtils]: 53: Hoare triple {125046#true} assume 1 == ~t4_pc~0; {125046#true} is VALID [2022-02-20 20:00:41,436 INFO L290 TraceCheckUtils]: 54: Hoare triple {125046#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {125046#true} is VALID [2022-02-20 20:00:41,436 INFO L290 TraceCheckUtils]: 55: Hoare triple {125046#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {125046#true} is VALID [2022-02-20 20:00:41,436 INFO L290 TraceCheckUtils]: 56: Hoare triple {125046#true} #t~ret32#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___3~0#1 := #t~ret32#1;havoc #t~ret32#1; {125046#true} is VALID [2022-02-20 20:00:41,436 INFO L290 TraceCheckUtils]: 57: Hoare triple {125046#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {125046#true} is VALID [2022-02-20 20:00:41,436 INFO L290 TraceCheckUtils]: 58: Hoare triple {125046#true} assume true; {125046#true} is VALID [2022-02-20 20:00:41,436 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {125046#true} {125047#false} #1110#return; {125047#false} is VALID [2022-02-20 20:00:41,436 INFO L272 TraceCheckUtils]: 60: Hoare triple {125047#false} call reset_delta_events2(); {125112#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:41,436 INFO L290 TraceCheckUtils]: 61: Hoare triple {125112#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {125046#true} is VALID [2022-02-20 20:00:41,436 INFO L290 TraceCheckUtils]: 62: Hoare triple {125046#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {125046#true} is VALID [2022-02-20 20:00:41,436 INFO L290 TraceCheckUtils]: 63: Hoare triple {125046#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {125046#true} is VALID [2022-02-20 20:00:41,436 INFO L290 TraceCheckUtils]: 64: Hoare triple {125046#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {125046#true} is VALID [2022-02-20 20:00:41,436 INFO L290 TraceCheckUtils]: 65: Hoare triple {125046#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {125046#true} is VALID [2022-02-20 20:00:41,437 INFO L290 TraceCheckUtils]: 66: Hoare triple {125046#true} assume !(1 == ~E_M~0); {125046#true} is VALID [2022-02-20 20:00:41,437 INFO L290 TraceCheckUtils]: 67: Hoare triple {125046#true} assume 1 == ~E_1~0;~E_1~0 := 2; {125046#true} is VALID [2022-02-20 20:00:41,437 INFO L290 TraceCheckUtils]: 68: Hoare triple {125046#true} assume 1 == ~E_2~0;~E_2~0 := 2; {125046#true} is VALID [2022-02-20 20:00:41,437 INFO L290 TraceCheckUtils]: 69: Hoare triple {125046#true} assume 1 == ~E_3~0;~E_3~0 := 2; {125046#true} is VALID [2022-02-20 20:00:41,437 INFO L290 TraceCheckUtils]: 70: Hoare triple {125046#true} assume 1 == ~E_4~0;~E_4~0 := 2; {125046#true} is VALID [2022-02-20 20:00:41,437 INFO L290 TraceCheckUtils]: 71: Hoare triple {125046#true} assume true; {125046#true} is VALID [2022-02-20 20:00:41,437 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {125046#true} {125047#false} #1112#return; {125047#false} is VALID [2022-02-20 20:00:41,437 INFO L290 TraceCheckUtils]: 73: Hoare triple {125047#false} assume !false; {125047#false} is VALID [2022-02-20 20:00:41,437 INFO L290 TraceCheckUtils]: 74: Hoare triple {125047#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_4~0#1, eval2_#t~nondet27#1, eval2_~tmp_ndt_5~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {125047#false} is VALID [2022-02-20 20:00:41,437 INFO L290 TraceCheckUtils]: 75: Hoare triple {125047#false} assume !false; {125047#false} is VALID [2022-02-20 20:00:41,437 INFO L272 TraceCheckUtils]: 76: Hoare triple {125047#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {125046#true} is VALID [2022-02-20 20:00:41,437 INFO L290 TraceCheckUtils]: 77: Hoare triple {125046#true} havoc ~__retres1~9; {125046#true} is VALID [2022-02-20 20:00:41,437 INFO L290 TraceCheckUtils]: 78: Hoare triple {125046#true} assume 0 == ~m_st~0;~__retres1~9 := 1; {125046#true} is VALID [2022-02-20 20:00:41,437 INFO L290 TraceCheckUtils]: 79: Hoare triple {125046#true} #res := ~__retres1~9; {125046#true} is VALID [2022-02-20 20:00:41,437 INFO L290 TraceCheckUtils]: 80: Hoare triple {125046#true} assume true; {125046#true} is VALID [2022-02-20 20:00:41,437 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {125046#true} {125047#false} #1114#return; {125047#false} is VALID [2022-02-20 20:00:41,437 INFO L290 TraceCheckUtils]: 82: Hoare triple {125047#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {125047#false} is VALID [2022-02-20 20:00:41,438 INFO L290 TraceCheckUtils]: 83: Hoare triple {125047#false} assume 0 != eval2_~tmp~5#1; {125047#false} is VALID [2022-02-20 20:00:41,438 INFO L290 TraceCheckUtils]: 84: Hoare triple {125047#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {125047#false} is VALID [2022-02-20 20:00:41,438 INFO L290 TraceCheckUtils]: 85: Hoare triple {125047#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {125047#false} is VALID [2022-02-20 20:00:41,438 INFO L290 TraceCheckUtils]: 86: Hoare triple {125047#false} assume !(0 == ~m_pc~0); {125047#false} is VALID [2022-02-20 20:00:41,438 INFO L290 TraceCheckUtils]: 87: Hoare triple {125047#false} assume 1 == ~m_pc~0; {125047#false} is VALID [2022-02-20 20:00:41,438 INFO L290 TraceCheckUtils]: 88: Hoare triple {125047#false} assume ~token~0 != 4 + ~local~0; {125047#false} is VALID [2022-02-20 20:00:41,438 INFO L272 TraceCheckUtils]: 89: Hoare triple {125047#false} call error2(); {125047#false} is VALID [2022-02-20 20:00:41,438 INFO L290 TraceCheckUtils]: 90: Hoare triple {125047#false} assume !false; {125047#false} is VALID [2022-02-20 20:00:41,438 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:00:41,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:41,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387122032] [2022-02-20 20:00:41,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387122032] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:41,439 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:41,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:41,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054353429] [2022-02-20 20:00:41,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:41,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2022-02-20 20:00:41,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:41,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:41,493 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:00:41,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:41,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:41,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:41,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:41,494 INFO L87 Difference]: Start difference. First operand 2457 states and 3135 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)