./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-1.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.05.cil-1.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 2b9ed7c85c1e945b329b46ea2facde1ef0195f46b3e9e9585453dabdeb816de5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:54,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:54,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:54,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:54,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:54,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:54,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:54,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:54,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:54,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:54,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:54,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:54,898 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:54,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:54,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:54,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:54,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:54,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:54,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:54,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:54,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:54,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:54,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:54,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:54,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:54,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:54,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:54,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:54,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:54,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:54,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:54,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:54,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:54,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:54,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:54,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:54,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:54,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:54,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:54,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:54,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:54,927 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:54,954 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:54,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:54,955 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:54,955 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:54,955 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:54,956 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:54,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:54,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:54,956 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:54,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:54,957 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:54,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:54,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:54,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:54,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:54,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:54,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:54,958 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:54,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:54,958 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:54,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:54,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:54,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:54,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:54,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:54,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:54,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:54,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:54,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:54,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:54,961 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:54,961 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:54,961 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:54,961 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 -> 2b9ed7c85c1e945b329b46ea2facde1ef0195f46b3e9e9585453dabdeb816de5 [2022-02-20 19:59:55,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:55,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:55,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:55,183 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:55,199 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:55,200 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.05.cil-1.c [2022-02-20 19:59:55,247 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a89dff611/ed57b4ff3fa14444849ecc5237503165/FLAG26d1fee42 [2022-02-20 19:59:55,688 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:55,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-1.c [2022-02-20 19:59:55,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a89dff611/ed57b4ff3fa14444849ecc5237503165/FLAG26d1fee42 [2022-02-20 19:59:55,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a89dff611/ed57b4ff3fa14444849ecc5237503165 [2022-02-20 19:59:55,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:55,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:55,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:55,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:55,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:55,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:55" (1/1) ... [2022-02-20 19:59:55,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7850f833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:55, skipping insertion in model container [2022-02-20 19:59:55,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:55" (1/1) ... [2022-02-20 19:59:55,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:55,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:55,938 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.05.cil-1.c[911,924] [2022-02-20 19:59:55,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-1.c[8416,8429] [2022-02-20 19:59:56,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:56,115 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:56,124 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.05.cil-1.c[911,924] [2022-02-20 19:59:56,152 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.05.cil-1.c[8416,8429] [2022-02-20 19:59:56,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:56,221 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:56,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:56 WrapperNode [2022-02-20 19:59:56,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:56,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:56,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:56,237 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:56,242 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:56" (1/1) ... [2022-02-20 19:59:56,251 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:56" (1/1) ... [2022-02-20 19:59:56,295 INFO L137 Inliner]: procedures = 65, calls = 76, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 672 [2022-02-20 19:59:56,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:56,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:56,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:56,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:56,308 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:56" (1/1) ... [2022-02-20 19:59:56,309 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:56" (1/1) ... [2022-02-20 19:59:56,321 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:56" (1/1) ... [2022-02-20 19:59:56,329 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:56" (1/1) ... [2022-02-20 19:59:56,338 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:56" (1/1) ... [2022-02-20 19:59:56,356 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:56" (1/1) ... [2022-02-20 19:59:56,367 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:56" (1/1) ... [2022-02-20 19:59:56,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:56,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:56,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:56,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:56,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:56" (1/1) ... [2022-02-20 19:59:56,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:56,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:56,407 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:56,412 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:56,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:56,432 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:56,432 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:56,432 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:56,432 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:56,433 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:56,434 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:56,434 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:56,434 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:56,434 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:56,435 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:56,436 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:56,436 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:56,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:56,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:56,438 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:56,438 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:56,531 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:56,536 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:57,098 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 19:59:57,098 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:57,131 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:57,143 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:57,145 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 19:59:57,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:57 BoogieIcfgContainer [2022-02-20 19:59:57,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:57,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:57,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:57,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:57,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:55" (1/3) ... [2022-02-20 19:59:57,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23539780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:57, skipping insertion in model container [2022-02-20 19:59:57,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:56" (2/3) ... [2022-02-20 19:59:57,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23539780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:57, skipping insertion in model container [2022-02-20 19:59:57,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:57" (3/3) ... [2022-02-20 19:59:57,153 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.05.cil-1.c [2022-02-20 19:59:57,156 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:57,157 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:57,198 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:57,205 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:57,205 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 324 states, 272 states have (on average 1.5955882352941178) internal successors, (434), 278 states have internal predecessors, (434), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 19:59:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:57,241 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:57,242 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:57,242 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:57,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:57,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1519130765, now seen corresponding path program 1 times [2022-02-20 19:59:57,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:57,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15059472] [2022-02-20 19:59:57,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:57,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {367#(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); {368#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:57,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {368#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:57,492 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {368#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {329#(= ~q_read_ev~0 2)} #1161#return; {329#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:57,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {369#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {370#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:57,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {370#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:57,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#(= |old(~q_read_ev~0)| 0)} assume true; {370#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:57,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {370#(= |old(~q_read_ev~0)| 0)} {329#(= ~q_read_ev~0 2)} #1163#return; {328#false} is VALID [2022-02-20 19:59:57,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} havoc ~__retres1~0; {327#true} is VALID [2022-02-20 19:59:57,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume 1 == ~p_dw_pc~0; {327#true} is VALID [2022-02-20 19:59:57,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {327#true} is VALID [2022-02-20 19:59:57,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#true} #res := ~__retres1~0; {327#true} is VALID [2022-02-20 19:59:57,574 INFO L290 TraceCheckUtils]: 4: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 19:59:57,574 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {327#true} {327#true} #1157#return; {327#true} is VALID [2022-02-20 19:59:57,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} havoc ~__retres1~1; {327#true} is VALID [2022-02-20 19:59:57,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume 1 == ~c_dr_pc~0; {327#true} is VALID [2022-02-20 19:59:57,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {327#true} is VALID [2022-02-20 19:59:57,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#true} #res := ~__retres1~1; {327#true} is VALID [2022-02-20 19:59:57,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 19:59:57,580 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {327#true} {327#true} #1159#return; {327#true} is VALID [2022-02-20 19:59:57,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {371#(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; {327#true} is VALID [2022-02-20 19:59:57,580 INFO L272 TraceCheckUtils]: 1: Hoare triple {327#true} call #t~ret8 := is_do_write_p_triggered(); {327#true} is VALID [2022-02-20 19:59:57,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} havoc ~__retres1~0; {327#true} is VALID [2022-02-20 19:59:57,581 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#true} assume 1 == ~p_dw_pc~0; {327#true} is VALID [2022-02-20 19:59:57,582 INFO L290 TraceCheckUtils]: 4: Hoare triple {327#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {327#true} is VALID [2022-02-20 19:59:57,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#true} #res := ~__retres1~0; {327#true} is VALID [2022-02-20 19:59:57,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 19:59:57,583 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {327#true} {327#true} #1157#return; {327#true} is VALID [2022-02-20 19:59:57,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {327#true} is VALID [2022-02-20 19:59:57,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {327#true} is VALID [2022-02-20 19:59:57,584 INFO L272 TraceCheckUtils]: 10: Hoare triple {327#true} call #t~ret9 := is_do_read_c_triggered(); {327#true} is VALID [2022-02-20 19:59:57,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {327#true} havoc ~__retres1~1; {327#true} is VALID [2022-02-20 19:59:57,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#true} assume 1 == ~c_dr_pc~0; {327#true} is VALID [2022-02-20 19:59:57,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {327#true} is VALID [2022-02-20 19:59:57,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} #res := ~__retres1~1; {327#true} is VALID [2022-02-20 19:59:57,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 19:59:57,585 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {327#true} {327#true} #1159#return; {327#true} is VALID [2022-02-20 19:59:57,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {327#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {327#true} is VALID [2022-02-20 19:59:57,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {327#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {327#true} is VALID [2022-02-20 19:59:57,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 19:59:57,589 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {327#true} {328#false} #1165#return; {328#false} is VALID [2022-02-20 19:59:57,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {369#(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); {327#true} is VALID [2022-02-20 19:59:57,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {327#true} is VALID [2022-02-20 19:59:57,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 19:59:57,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {328#false} #1167#return; {328#false} is VALID [2022-02-20 19:59:57,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:57,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} havoc ~__retres1~2; {327#true} is VALID [2022-02-20 19:59:57,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {327#true} is VALID [2022-02-20 19:59:57,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} #res := ~__retres1~2; {327#true} is VALID [2022-02-20 19:59:57,611 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 19:59:57,613 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {327#true} {328#false} #1169#return; {328#false} is VALID [2022-02-20 19:59:57,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {327#true} is VALID [2022-02-20 19:59:57,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {327#true} is VALID [2022-02-20 19:59:57,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#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; {329#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:57,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {329#(= ~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; {329#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:57,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {329#(= ~q_read_ev~0 2)} call update_channels1(); {367#(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,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#(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); {368#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:57,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {368#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:57,619 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {368#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {329#(= ~q_read_ev~0 2)} #1161#return; {329#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:57,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {329#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {329#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:57,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {329#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {329#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:57,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {329#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {329#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:57,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {329#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {329#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:57,621 INFO L272 TraceCheckUtils]: 12: Hoare triple {329#(= ~q_read_ev~0 2)} call fire_delta_events1(); {369#(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,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {369#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {370#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:57,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {370#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {370#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:57,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {370#(= |old(~q_read_ev~0)| 0)} assume true; {370#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:57,623 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {370#(= |old(~q_read_ev~0)| 0)} {329#(= ~q_read_ev~0 2)} #1163#return; {328#false} is VALID [2022-02-20 19:59:57,623 INFO L272 TraceCheckUtils]: 17: Hoare triple {328#false} call activate_threads1(); {371#(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,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {371#(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; {327#true} is VALID [2022-02-20 19:59:57,624 INFO L272 TraceCheckUtils]: 19: Hoare triple {327#true} call #t~ret8 := is_do_write_p_triggered(); {327#true} is VALID [2022-02-20 19:59:57,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {327#true} havoc ~__retres1~0; {327#true} is VALID [2022-02-20 19:59:57,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {327#true} assume 1 == ~p_dw_pc~0; {327#true} is VALID [2022-02-20 19:59:57,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {327#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {327#true} is VALID [2022-02-20 19:59:57,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {327#true} #res := ~__retres1~0; {327#true} is VALID [2022-02-20 19:59:57,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 19:59:57,625 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {327#true} {327#true} #1157#return; {327#true} is VALID [2022-02-20 19:59:57,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {327#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {327#true} is VALID [2022-02-20 19:59:57,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {327#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {327#true} is VALID [2022-02-20 19:59:57,625 INFO L272 TraceCheckUtils]: 28: Hoare triple {327#true} call #t~ret9 := is_do_read_c_triggered(); {327#true} is VALID [2022-02-20 19:59:57,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {327#true} havoc ~__retres1~1; {327#true} is VALID [2022-02-20 19:59:57,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {327#true} assume 1 == ~c_dr_pc~0; {327#true} is VALID [2022-02-20 19:59:57,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {327#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {327#true} is VALID [2022-02-20 19:59:57,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {327#true} #res := ~__retres1~1; {327#true} is VALID [2022-02-20 19:59:57,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 19:59:57,627 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {327#true} {327#true} #1159#return; {327#true} is VALID [2022-02-20 19:59:57,627 INFO L290 TraceCheckUtils]: 35: Hoare triple {327#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {327#true} is VALID [2022-02-20 19:59:57,627 INFO L290 TraceCheckUtils]: 36: Hoare triple {327#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {327#true} is VALID [2022-02-20 19:59:57,627 INFO L290 TraceCheckUtils]: 37: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 19:59:57,627 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {327#true} {328#false} #1165#return; {328#false} is VALID [2022-02-20 19:59:57,628 INFO L272 TraceCheckUtils]: 39: Hoare triple {328#false} call reset_delta_events1(); {369#(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,628 INFO L290 TraceCheckUtils]: 40: Hoare triple {369#(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); {327#true} is VALID [2022-02-20 19:59:57,628 INFO L290 TraceCheckUtils]: 41: Hoare triple {327#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {327#true} is VALID [2022-02-20 19:59:57,628 INFO L290 TraceCheckUtils]: 42: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 19:59:57,628 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {327#true} {328#false} #1167#return; {328#false} is VALID [2022-02-20 19:59:57,629 INFO L290 TraceCheckUtils]: 44: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-02-20 19:59:57,629 INFO L290 TraceCheckUtils]: 45: Hoare triple {328#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; {328#false} is VALID [2022-02-20 19:59:57,629 INFO L290 TraceCheckUtils]: 46: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-02-20 19:59:57,629 INFO L272 TraceCheckUtils]: 47: Hoare triple {328#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {327#true} is VALID [2022-02-20 19:59:57,629 INFO L290 TraceCheckUtils]: 48: Hoare triple {327#true} havoc ~__retres1~2; {327#true} is VALID [2022-02-20 19:59:57,629 INFO L290 TraceCheckUtils]: 49: Hoare triple {327#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {327#true} is VALID [2022-02-20 19:59:57,630 INFO L290 TraceCheckUtils]: 50: Hoare triple {327#true} #res := ~__retres1~2; {327#true} is VALID [2022-02-20 19:59:57,630 INFO L290 TraceCheckUtils]: 51: Hoare triple {327#true} assume true; {327#true} is VALID [2022-02-20 19:59:57,632 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {327#true} {328#false} #1169#return; {328#false} is VALID [2022-02-20 19:59:57,632 INFO L290 TraceCheckUtils]: 53: Hoare triple {328#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; {328#false} is VALID [2022-02-20 19:59:57,632 INFO L290 TraceCheckUtils]: 54: Hoare triple {328#false} assume 0 != eval1_~tmp___1~0#1; {328#false} is VALID [2022-02-20 19:59:57,633 INFO L290 TraceCheckUtils]: 55: Hoare triple {328#false} assume !(0 == ~p_dw_st~0); {328#false} is VALID [2022-02-20 19:59:57,633 INFO L290 TraceCheckUtils]: 56: Hoare triple {328#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; {328#false} is VALID [2022-02-20 19:59:57,633 INFO L290 TraceCheckUtils]: 57: Hoare triple {328#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; {328#false} is VALID [2022-02-20 19:59:57,634 INFO L290 TraceCheckUtils]: 58: Hoare triple {328#false} assume !(0 == ~c_dr_pc~0); {328#false} is VALID [2022-02-20 19:59:57,635 INFO L290 TraceCheckUtils]: 59: Hoare triple {328#false} assume 2 == ~c_dr_pc~0; {328#false} is VALID [2022-02-20 19:59:57,635 INFO L290 TraceCheckUtils]: 60: Hoare triple {328#false} do_read_c_~a~0#1 := ~a_t~0; {328#false} is VALID [2022-02-20 19:59:57,635 INFO L290 TraceCheckUtils]: 61: Hoare triple {328#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; {328#false} is VALID [2022-02-20 19:59:57,635 INFO L290 TraceCheckUtils]: 62: Hoare triple {328#false} assume !(~p_last_write~0 == ~c_last_read~0); {328#false} is VALID [2022-02-20 19:59:57,635 INFO L272 TraceCheckUtils]: 63: Hoare triple {328#false} call error1(); {328#false} is VALID [2022-02-20 19:59:57,636 INFO L290 TraceCheckUtils]: 64: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-02-20 19:59:57,637 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,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:57,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15059472] [2022-02-20 19:59:57,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15059472] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:57,663 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:57,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:57,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988730557] [2022-02-20 19:59:57,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:57,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:59:57,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:57,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:57,724 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:57,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:57,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:57,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:57,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:57,747 INFO L87 Difference]: Start difference. First operand has 324 states, 272 states have (on average 1.5955882352941178) internal successors, (434), 278 states have internal predecessors, (434), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:00,284 INFO L93 Difference]: Finished difference Result 778 states and 1209 transitions. [2022-02-20 20:00:00,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:00,284 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:00,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1209 transitions. [2022-02-20 20:00:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1209 transitions. [2022-02-20 20:00:00,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1209 transitions. [2022-02-20 20:00:00,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1209 edges. 1209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:00,994 INFO L225 Difference]: With dead ends: 778 [2022-02-20 20:00:00,994 INFO L226 Difference]: Without dead ends: 465 [2022-02-20 20:00:01,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:00:01,004 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 852 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:01,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 1715 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 20:00:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-02-20 20:00:01,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 426. [2022-02-20 20:00:01,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:01,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 465 states. Second operand has 426 states, 354 states have (on average 1.4830508474576272) internal successors, (525), 360 states have internal predecessors, (525), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 20:00:01,084 INFO L74 IsIncluded]: Start isIncluded. First operand 465 states. Second operand has 426 states, 354 states have (on average 1.4830508474576272) internal successors, (525), 360 states have internal predecessors, (525), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 20:00:01,086 INFO L87 Difference]: Start difference. First operand 465 states. Second operand has 426 states, 354 states have (on average 1.4830508474576272) internal successors, (525), 360 states have internal predecessors, (525), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 20:00:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:01,107 INFO L93 Difference]: Finished difference Result 465 states and 680 transitions. [2022-02-20 20:00:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 680 transitions. [2022-02-20 20:00:01,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:01,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:01,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 354 states have (on average 1.4830508474576272) internal successors, (525), 360 states have internal predecessors, (525), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) Second operand 465 states. [2022-02-20 20:00:01,113 INFO L87 Difference]: Start difference. First operand has 426 states, 354 states have (on average 1.4830508474576272) internal successors, (525), 360 states have internal predecessors, (525), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) Second operand 465 states. [2022-02-20 20:00:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:01,130 INFO L93 Difference]: Finished difference Result 465 states and 680 transitions. [2022-02-20 20:00:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 680 transitions. [2022-02-20 20:00:01,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:01,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:01,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:01,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 354 states have (on average 1.4830508474576272) internal successors, (525), 360 states have internal predecessors, (525), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 20:00:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 624 transitions. [2022-02-20 20:00:01,150 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 624 transitions. Word has length 65 [2022-02-20 20:00:01,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:01,151 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 624 transitions. [2022-02-20 20:00:01,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 624 transitions. [2022-02-20 20:00:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:01,153 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:01,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:01,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:00:01,154 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:01,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1237496501, now seen corresponding path program 1 times [2022-02-20 20:00:01,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:01,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419903587] [2022-02-20 20:00:01,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:01,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:01,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:01,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {2996#(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); {2997#(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:01,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {2997#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2997#(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:01,211 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2997#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2958#(= ~q_write_ev~0 ~q_read_ev~0)} #1161#return; {2958#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:01,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:01,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {2997#(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); {2998#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:01,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {2998#(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; {2999#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:01,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {2999#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2999#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:01,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2999#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2958#(= ~q_write_ev~0 ~q_read_ev~0)} #1163#return; {2957#false} is VALID [2022-02-20 20:00:01,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:01,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:01,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {2956#true} havoc ~__retres1~0; {2956#true} is VALID [2022-02-20 20:00:01,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {2956#true} assume 1 == ~p_dw_pc~0; {2956#true} is VALID [2022-02-20 20:00:01,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {2956#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2956#true} is VALID [2022-02-20 20:00:01,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {2956#true} #res := ~__retres1~0; {2956#true} is VALID [2022-02-20 20:00:01,251 INFO L290 TraceCheckUtils]: 4: Hoare triple {2956#true} assume true; {2956#true} is VALID [2022-02-20 20:00:01,252 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2956#true} {2956#true} #1157#return; {2956#true} is VALID [2022-02-20 20:00:01,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:01,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {2956#true} havoc ~__retres1~1; {2956#true} is VALID [2022-02-20 20:00:01,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {2956#true} assume 1 == ~c_dr_pc~0; {2956#true} is VALID [2022-02-20 20:00:01,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {2956#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2956#true} is VALID [2022-02-20 20:00:01,256 INFO L290 TraceCheckUtils]: 3: Hoare triple {2956#true} #res := ~__retres1~1; {2956#true} is VALID [2022-02-20 20:00:01,256 INFO L290 TraceCheckUtils]: 4: Hoare triple {2956#true} assume true; {2956#true} is VALID [2022-02-20 20:00:01,256 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2956#true} {2956#true} #1159#return; {2956#true} is VALID [2022-02-20 20:00:01,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {3000#(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; {2956#true} is VALID [2022-02-20 20:00:01,256 INFO L272 TraceCheckUtils]: 1: Hoare triple {2956#true} call #t~ret8 := is_do_write_p_triggered(); {2956#true} is VALID [2022-02-20 20:00:01,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {2956#true} havoc ~__retres1~0; {2956#true} is VALID [2022-02-20 20:00:01,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {2956#true} assume 1 == ~p_dw_pc~0; {2956#true} is VALID [2022-02-20 20:00:01,257 INFO L290 TraceCheckUtils]: 4: Hoare triple {2956#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2956#true} is VALID [2022-02-20 20:00:01,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {2956#true} #res := ~__retres1~0; {2956#true} is VALID [2022-02-20 20:00:01,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {2956#true} assume true; {2956#true} is VALID [2022-02-20 20:00:01,257 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2956#true} {2956#true} #1157#return; {2956#true} is VALID [2022-02-20 20:00:01,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {2956#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2956#true} is VALID [2022-02-20 20:00:01,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {2956#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2956#true} is VALID [2022-02-20 20:00:01,258 INFO L272 TraceCheckUtils]: 10: Hoare triple {2956#true} call #t~ret9 := is_do_read_c_triggered(); {2956#true} is VALID [2022-02-20 20:00:01,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {2956#true} havoc ~__retres1~1; {2956#true} is VALID [2022-02-20 20:00:01,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {2956#true} assume 1 == ~c_dr_pc~0; {2956#true} is VALID [2022-02-20 20:00:01,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {2956#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2956#true} is VALID [2022-02-20 20:00:01,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {2956#true} #res := ~__retres1~1; {2956#true} is VALID [2022-02-20 20:00:01,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {2956#true} assume true; {2956#true} is VALID [2022-02-20 20:00:01,259 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2956#true} {2956#true} #1159#return; {2956#true} is VALID [2022-02-20 20:00:01,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {2956#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2956#true} is VALID [2022-02-20 20:00:01,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {2956#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2956#true} is VALID [2022-02-20 20:00:01,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {2956#true} assume true; {2956#true} is VALID [2022-02-20 20:00:01,259 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2956#true} {2957#false} #1165#return; {2957#false} is VALID [2022-02-20 20:00:01,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:01,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {2997#(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); {2956#true} is VALID [2022-02-20 20:00:01,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {2956#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2956#true} is VALID [2022-02-20 20:00:01,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {2956#true} assume true; {2956#true} is VALID [2022-02-20 20:00:01,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2956#true} {2957#false} #1167#return; {2957#false} is VALID [2022-02-20 20:00:01,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:01,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {2956#true} havoc ~__retres1~2; {2956#true} is VALID [2022-02-20 20:00:01,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {2956#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2956#true} is VALID [2022-02-20 20:00:01,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {2956#true} #res := ~__retres1~2; {2956#true} is VALID [2022-02-20 20:00:01,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {2956#true} assume true; {2956#true} is VALID [2022-02-20 20:00:01,269 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2956#true} {2957#false} #1169#return; {2957#false} is VALID [2022-02-20 20:00:01,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {2956#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {2956#true} is VALID [2022-02-20 20:00:01,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {2956#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {2956#true} is VALID [2022-02-20 20:00:01,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {2956#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#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; {2958#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:01,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {2958#(= ~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; {2958#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:01,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {2996#(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:01,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {2996#(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); {2997#(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:01,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {2997#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2997#(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:01,272 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2997#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2958#(= ~q_write_ev~0 ~q_read_ev~0)} #1161#return; {2958#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:01,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {2958#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:01,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2958#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:01,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {2958#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2958#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:01,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {2958#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {2958#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:01,274 INFO L272 TraceCheckUtils]: 12: Hoare triple {2958#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {2997#(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:01,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {2997#(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); {2998#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:01,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {2998#(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; {2999#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:01,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {2999#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2999#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:01,275 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2999#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2958#(= ~q_write_ev~0 ~q_read_ev~0)} #1163#return; {2957#false} is VALID [2022-02-20 20:00:01,276 INFO L272 TraceCheckUtils]: 17: Hoare triple {2957#false} call activate_threads1(); {3000#(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:01,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {3000#(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; {2956#true} is VALID [2022-02-20 20:00:01,276 INFO L272 TraceCheckUtils]: 19: Hoare triple {2956#true} call #t~ret8 := is_do_write_p_triggered(); {2956#true} is VALID [2022-02-20 20:00:01,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {2956#true} havoc ~__retres1~0; {2956#true} is VALID [2022-02-20 20:00:01,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {2956#true} assume 1 == ~p_dw_pc~0; {2956#true} is VALID [2022-02-20 20:00:01,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {2956#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2956#true} is VALID [2022-02-20 20:00:01,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {2956#true} #res := ~__retres1~0; {2956#true} is VALID [2022-02-20 20:00:01,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {2956#true} assume true; {2956#true} is VALID [2022-02-20 20:00:01,277 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2956#true} {2956#true} #1157#return; {2956#true} is VALID [2022-02-20 20:00:01,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {2956#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2956#true} is VALID [2022-02-20 20:00:01,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {2956#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2956#true} is VALID [2022-02-20 20:00:01,277 INFO L272 TraceCheckUtils]: 28: Hoare triple {2956#true} call #t~ret9 := is_do_read_c_triggered(); {2956#true} is VALID [2022-02-20 20:00:01,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {2956#true} havoc ~__retres1~1; {2956#true} is VALID [2022-02-20 20:00:01,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {2956#true} assume 1 == ~c_dr_pc~0; {2956#true} is VALID [2022-02-20 20:00:01,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {2956#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2956#true} is VALID [2022-02-20 20:00:01,278 INFO L290 TraceCheckUtils]: 32: Hoare triple {2956#true} #res := ~__retres1~1; {2956#true} is VALID [2022-02-20 20:00:01,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {2956#true} assume true; {2956#true} is VALID [2022-02-20 20:00:01,278 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2956#true} {2956#true} #1159#return; {2956#true} is VALID [2022-02-20 20:00:01,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {2956#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2956#true} is VALID [2022-02-20 20:00:01,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {2956#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2956#true} is VALID [2022-02-20 20:00:01,279 INFO L290 TraceCheckUtils]: 37: Hoare triple {2956#true} assume true; {2956#true} is VALID [2022-02-20 20:00:01,279 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2956#true} {2957#false} #1165#return; {2957#false} is VALID [2022-02-20 20:00:01,279 INFO L272 TraceCheckUtils]: 39: Hoare triple {2957#false} call reset_delta_events1(); {2997#(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:01,279 INFO L290 TraceCheckUtils]: 40: Hoare triple {2997#(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); {2956#true} is VALID [2022-02-20 20:00:01,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {2956#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2956#true} is VALID [2022-02-20 20:00:01,279 INFO L290 TraceCheckUtils]: 42: Hoare triple {2956#true} assume true; {2956#true} is VALID [2022-02-20 20:00:01,280 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2956#true} {2957#false} #1167#return; {2957#false} is VALID [2022-02-20 20:00:01,280 INFO L290 TraceCheckUtils]: 44: Hoare triple {2957#false} assume !false; {2957#false} is VALID [2022-02-20 20:00:01,280 INFO L290 TraceCheckUtils]: 45: Hoare triple {2957#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; {2957#false} is VALID [2022-02-20 20:00:01,280 INFO L290 TraceCheckUtils]: 46: Hoare triple {2957#false} assume !false; {2957#false} is VALID [2022-02-20 20:00:01,280 INFO L272 TraceCheckUtils]: 47: Hoare triple {2957#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2956#true} is VALID [2022-02-20 20:00:01,280 INFO L290 TraceCheckUtils]: 48: Hoare triple {2956#true} havoc ~__retres1~2; {2956#true} is VALID [2022-02-20 20:00:01,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {2956#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2956#true} is VALID [2022-02-20 20:00:01,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {2956#true} #res := ~__retres1~2; {2956#true} is VALID [2022-02-20 20:00:01,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {2956#true} assume true; {2956#true} is VALID [2022-02-20 20:00:01,281 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2956#true} {2957#false} #1169#return; {2957#false} is VALID [2022-02-20 20:00:01,281 INFO L290 TraceCheckUtils]: 53: Hoare triple {2957#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; {2957#false} is VALID [2022-02-20 20:00:01,281 INFO L290 TraceCheckUtils]: 54: Hoare triple {2957#false} assume 0 != eval1_~tmp___1~0#1; {2957#false} is VALID [2022-02-20 20:00:01,281 INFO L290 TraceCheckUtils]: 55: Hoare triple {2957#false} assume !(0 == ~p_dw_st~0); {2957#false} is VALID [2022-02-20 20:00:01,282 INFO L290 TraceCheckUtils]: 56: Hoare triple {2957#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; {2957#false} is VALID [2022-02-20 20:00:01,282 INFO L290 TraceCheckUtils]: 57: Hoare triple {2957#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; {2957#false} is VALID [2022-02-20 20:00:01,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {2957#false} assume !(0 == ~c_dr_pc~0); {2957#false} is VALID [2022-02-20 20:00:01,282 INFO L290 TraceCheckUtils]: 59: Hoare triple {2957#false} assume 2 == ~c_dr_pc~0; {2957#false} is VALID [2022-02-20 20:00:01,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {2957#false} do_read_c_~a~0#1 := ~a_t~0; {2957#false} is VALID [2022-02-20 20:00:01,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {2957#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; {2957#false} is VALID [2022-02-20 20:00:01,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {2957#false} assume !(~p_last_write~0 == ~c_last_read~0); {2957#false} is VALID [2022-02-20 20:00:01,283 INFO L272 TraceCheckUtils]: 63: Hoare triple {2957#false} call error1(); {2957#false} is VALID [2022-02-20 20:00:01,283 INFO L290 TraceCheckUtils]: 64: Hoare triple {2957#false} assume !false; {2957#false} is VALID [2022-02-20 20:00:01,283 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:01,283 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:01,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419903587] [2022-02-20 20:00:01,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419903587] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:01,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:01,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:01,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383061206] [2022-02-20 20:00:01,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:01,285 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:01,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:01,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:01,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:01,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:01,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:01,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:01,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:01,324 INFO L87 Difference]: Start difference. First operand 426 states and 624 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:04,197 INFO L93 Difference]: Finished difference Result 823 states and 1190 transitions. [2022-02-20 20:00:04,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 20:00:04,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:04,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:04,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 866 transitions. [2022-02-20 20:00:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 866 transitions. [2022-02-20 20:00:04,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 866 transitions. [2022-02-20 20:00:04,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 866 edges. 866 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:04,829 INFO L225 Difference]: With dead ends: 823 [2022-02-20 20:00:04,830 INFO L226 Difference]: Without dead ends: 614 [2022-02-20 20:00:04,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 20:00:04,831 INFO L933 BasicCegarLoop]: 556 mSDtfsCounter, 897 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:04,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [924 Valid, 1957 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:00:04,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-02-20 20:00:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 538. [2022-02-20 20:00:04,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:04,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 614 states. Second operand has 538 states, 444 states have (on average 1.4662162162162162) internal successors, (651), 452 states have internal predecessors, (651), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 20:00:04,849 INFO L74 IsIncluded]: Start isIncluded. First operand 614 states. Second operand has 538 states, 444 states have (on average 1.4662162162162162) internal successors, (651), 452 states have internal predecessors, (651), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 20:00:04,850 INFO L87 Difference]: Start difference. First operand 614 states. Second operand has 538 states, 444 states have (on average 1.4662162162162162) internal successors, (651), 452 states have internal predecessors, (651), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 20:00:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:04,889 INFO L93 Difference]: Finished difference Result 614 states and 898 transitions. [2022-02-20 20:00:04,889 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 898 transitions. [2022-02-20 20:00:04,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:04,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:04,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 538 states, 444 states have (on average 1.4662162162162162) internal successors, (651), 452 states have internal predecessors, (651), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) Second operand 614 states. [2022-02-20 20:00:04,894 INFO L87 Difference]: Start difference. First operand has 538 states, 444 states have (on average 1.4662162162162162) internal successors, (651), 452 states have internal predecessors, (651), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) Second operand 614 states. [2022-02-20 20:00:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:04,913 INFO L93 Difference]: Finished difference Result 614 states and 898 transitions. [2022-02-20 20:00:04,913 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 898 transitions. [2022-02-20 20:00:04,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:04,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:04,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:04,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 444 states have (on average 1.4662162162162162) internal successors, (651), 452 states have internal predecessors, (651), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2022-02-20 20:00:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 784 transitions. [2022-02-20 20:00:04,936 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 784 transitions. Word has length 65 [2022-02-20 20:00:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:04,937 INFO L470 AbstractCegarLoop]: Abstraction has 538 states and 784 transitions. [2022-02-20 20:00:04,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 784 transitions. [2022-02-20 20:00:04,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:04,938 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:04,938 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:04,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:00:04,938 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:04,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:04,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1028884685, now seen corresponding path program 1 times [2022-02-20 20:00:04,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:04,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893197199] [2022-02-20 20:00:04,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:04,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:04,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {6141#(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); {6142#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:05,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {6142#(not (= |old(~q_req_up~0)| 1))} assume true; {6142#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:05,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6142#(not (= |old(~q_req_up~0)| 1))} {6102#(= ~q_req_up~0 ~p_dw_pc~0)} #1161#return; {6106#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:05,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:05,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {6143#(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); {6099#true} is VALID [2022-02-20 20:00:05,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {6099#true} assume !(0 == ~q_write_ev~0); {6099#true} is VALID [2022-02-20 20:00:05,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {6099#true} assume true; {6099#true} is VALID [2022-02-20 20:00:05,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6099#true} {6106#(not (= ~p_dw_pc~0 1))} #1163#return; {6106#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:05,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:05,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:05,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {6099#true} havoc ~__retres1~0; {6099#true} is VALID [2022-02-20 20:00:05,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {6099#true} assume 1 == ~p_dw_pc~0; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,047 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} {6099#true} #1157#return; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:05,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {6099#true} havoc ~__retres1~1; {6099#true} is VALID [2022-02-20 20:00:05,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {6099#true} assume 1 == ~c_dr_pc~0; {6099#true} is VALID [2022-02-20 20:00:05,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {6099#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6099#true} is VALID [2022-02-20 20:00:05,052 INFO L290 TraceCheckUtils]: 3: Hoare triple {6099#true} #res := ~__retres1~1; {6099#true} is VALID [2022-02-20 20:00:05,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {6099#true} assume true; {6099#true} is VALID [2022-02-20 20:00:05,053 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6099#true} {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} #1159#return; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {6144#(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; {6099#true} is VALID [2022-02-20 20:00:05,053 INFO L272 TraceCheckUtils]: 1: Hoare triple {6099#true} call #t~ret8 := is_do_write_p_triggered(); {6099#true} is VALID [2022-02-20 20:00:05,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {6099#true} havoc ~__retres1~0; {6099#true} is VALID [2022-02-20 20:00:05,054 INFO L290 TraceCheckUtils]: 3: Hoare triple {6099#true} assume 1 == ~p_dw_pc~0; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,054 INFO L290 TraceCheckUtils]: 4: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,055 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} {6099#true} #1157#return; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,056 INFO L272 TraceCheckUtils]: 10: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {6099#true} is VALID [2022-02-20 20:00:05,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {6099#true} havoc ~__retres1~1; {6099#true} is VALID [2022-02-20 20:00:05,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {6099#true} assume 1 == ~c_dr_pc~0; {6099#true} is VALID [2022-02-20 20:00:05,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {6099#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6099#true} is VALID [2022-02-20 20:00:05,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {6099#true} #res := ~__retres1~1; {6099#true} is VALID [2022-02-20 20:00:05,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {6099#true} assume true; {6099#true} is VALID [2022-02-20 20:00:05,057 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6099#true} {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} #1159#return; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,059 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} {6106#(not (= ~p_dw_pc~0 1))} #1165#return; {6100#false} is VALID [2022-02-20 20:00:05,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:05,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {6143#(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); {6099#true} is VALID [2022-02-20 20:00:05,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {6099#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6099#true} is VALID [2022-02-20 20:00:05,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {6099#true} assume true; {6099#true} is VALID [2022-02-20 20:00:05,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6099#true} {6100#false} #1167#return; {6100#false} is VALID [2022-02-20 20:00:05,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:05,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {6099#true} havoc ~__retres1~2; {6099#true} is VALID [2022-02-20 20:00:05,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {6099#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6099#true} is VALID [2022-02-20 20:00:05,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {6099#true} #res := ~__retres1~2; {6099#true} is VALID [2022-02-20 20:00:05,066 INFO L290 TraceCheckUtils]: 3: Hoare triple {6099#true} assume true; {6099#true} is VALID [2022-02-20 20:00:05,066 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6099#true} {6100#false} #1169#return; {6100#false} is VALID [2022-02-20 20:00:05,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {6099#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {6101#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:05,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {6101#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {6101#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:05,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {6101#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#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; {6102#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:05,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {6102#(= ~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; {6102#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:05,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {6102#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {6141#(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:05,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {6141#(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); {6142#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:05,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {6142#(not (= |old(~q_req_up~0)| 1))} assume true; {6142#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:05,069 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6142#(not (= |old(~q_req_up~0)| 1))} {6102#(= ~q_req_up~0 ~p_dw_pc~0)} #1161#return; {6106#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:05,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {6106#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {6106#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:05,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {6106#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {6106#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:05,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {6106#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {6106#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:05,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {6106#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {6106#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:05,071 INFO L272 TraceCheckUtils]: 12: Hoare triple {6106#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {6143#(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:05,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {6143#(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); {6099#true} is VALID [2022-02-20 20:00:05,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {6099#true} assume !(0 == ~q_write_ev~0); {6099#true} is VALID [2022-02-20 20:00:05,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {6099#true} assume true; {6099#true} is VALID [2022-02-20 20:00:05,072 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6099#true} {6106#(not (= ~p_dw_pc~0 1))} #1163#return; {6106#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:05,072 INFO L272 TraceCheckUtils]: 17: Hoare triple {6106#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {6144#(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:05,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {6144#(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; {6099#true} is VALID [2022-02-20 20:00:05,073 INFO L272 TraceCheckUtils]: 19: Hoare triple {6099#true} call #t~ret8 := is_do_write_p_triggered(); {6099#true} is VALID [2022-02-20 20:00:05,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {6099#true} havoc ~__retres1~0; {6099#true} is VALID [2022-02-20 20:00:05,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {6099#true} assume 1 == ~p_dw_pc~0; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,074 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} {6099#true} #1157#return; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,076 INFO L272 TraceCheckUtils]: 28: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {6099#true} is VALID [2022-02-20 20:00:05,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {6099#true} havoc ~__retres1~1; {6099#true} is VALID [2022-02-20 20:00:05,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {6099#true} assume 1 == ~c_dr_pc~0; {6099#true} is VALID [2022-02-20 20:00:05,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {6099#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {6099#true} is VALID [2022-02-20 20:00:05,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {6099#true} #res := ~__retres1~1; {6099#true} is VALID [2022-02-20 20:00:05,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {6099#true} assume true; {6099#true} is VALID [2022-02-20 20:00:05,077 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6099#true} {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} #1159#return; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:05,079 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6151#(= (+ (- 1) ~p_dw_pc~0) 0)} {6106#(not (= ~p_dw_pc~0 1))} #1165#return; {6100#false} is VALID [2022-02-20 20:00:05,079 INFO L272 TraceCheckUtils]: 39: Hoare triple {6100#false} call reset_delta_events1(); {6143#(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:05,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {6143#(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); {6099#true} is VALID [2022-02-20 20:00:05,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {6099#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6099#true} is VALID [2022-02-20 20:00:05,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {6099#true} assume true; {6099#true} is VALID [2022-02-20 20:00:05,079 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6099#true} {6100#false} #1167#return; {6100#false} is VALID [2022-02-20 20:00:05,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {6100#false} assume !false; {6100#false} is VALID [2022-02-20 20:00:05,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {6100#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; {6100#false} is VALID [2022-02-20 20:00:05,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {6100#false} assume !false; {6100#false} is VALID [2022-02-20 20:00:05,080 INFO L272 TraceCheckUtils]: 47: Hoare triple {6100#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {6099#true} is VALID [2022-02-20 20:00:05,080 INFO L290 TraceCheckUtils]: 48: Hoare triple {6099#true} havoc ~__retres1~2; {6099#true} is VALID [2022-02-20 20:00:05,080 INFO L290 TraceCheckUtils]: 49: Hoare triple {6099#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6099#true} is VALID [2022-02-20 20:00:05,080 INFO L290 TraceCheckUtils]: 50: Hoare triple {6099#true} #res := ~__retres1~2; {6099#true} is VALID [2022-02-20 20:00:05,081 INFO L290 TraceCheckUtils]: 51: Hoare triple {6099#true} assume true; {6099#true} is VALID [2022-02-20 20:00:05,081 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6099#true} {6100#false} #1169#return; {6100#false} is VALID [2022-02-20 20:00:05,081 INFO L290 TraceCheckUtils]: 53: Hoare triple {6100#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; {6100#false} is VALID [2022-02-20 20:00:05,081 INFO L290 TraceCheckUtils]: 54: Hoare triple {6100#false} assume 0 != eval1_~tmp___1~0#1; {6100#false} is VALID [2022-02-20 20:00:05,081 INFO L290 TraceCheckUtils]: 55: Hoare triple {6100#false} assume !(0 == ~p_dw_st~0); {6100#false} is VALID [2022-02-20 20:00:05,081 INFO L290 TraceCheckUtils]: 56: Hoare triple {6100#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; {6100#false} is VALID [2022-02-20 20:00:05,081 INFO L290 TraceCheckUtils]: 57: Hoare triple {6100#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; {6100#false} is VALID [2022-02-20 20:00:05,082 INFO L290 TraceCheckUtils]: 58: Hoare triple {6100#false} assume !(0 == ~c_dr_pc~0); {6100#false} is VALID [2022-02-20 20:00:05,082 INFO L290 TraceCheckUtils]: 59: Hoare triple {6100#false} assume 2 == ~c_dr_pc~0; {6100#false} is VALID [2022-02-20 20:00:05,082 INFO L290 TraceCheckUtils]: 60: Hoare triple {6100#false} do_read_c_~a~0#1 := ~a_t~0; {6100#false} is VALID [2022-02-20 20:00:05,082 INFO L290 TraceCheckUtils]: 61: Hoare triple {6100#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; {6100#false} is VALID [2022-02-20 20:00:05,082 INFO L290 TraceCheckUtils]: 62: Hoare triple {6100#false} assume !(~p_last_write~0 == ~c_last_read~0); {6100#false} is VALID [2022-02-20 20:00:05,082 INFO L272 TraceCheckUtils]: 63: Hoare triple {6100#false} call error1(); {6100#false} is VALID [2022-02-20 20:00:05,082 INFO L290 TraceCheckUtils]: 64: Hoare triple {6100#false} assume !false; {6100#false} is VALID [2022-02-20 20:00:05,083 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:05,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:05,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893197199] [2022-02-20 20:00:05,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893197199] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:05,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:05,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:05,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848821250] [2022-02-20 20:00:05,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:05,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:00:05,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:05,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:05,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:05,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:05,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:05,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:05,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:05,124 INFO L87 Difference]: Start difference. First operand 538 states and 784 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:10,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:10,283 INFO L93 Difference]: Finished difference Result 2084 states and 2982 transitions. [2022-02-20 20:00:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:10,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:00:10,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1271 transitions. [2022-02-20 20:00:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1271 transitions. [2022-02-20 20:00:10,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1271 transitions. [2022-02-20 20:00:11,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1271 edges. 1271 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: 2084 [2022-02-20 20:00:11,247 INFO L226 Difference]: Without dead ends: 1751 [2022-02-20 20:00:11,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:00:11,256 INFO L933 BasicCegarLoop]: 600 mSDtfsCounter, 2959 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 691 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2977 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 691 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:11,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2977 Valid, 2000 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [691 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 20:00:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2022-02-20 20:00:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1591. [2022-02-20 20:00:11,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:11,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1751 states. Second operand has 1591 states, 1292 states have (on average 1.3893188854489165) internal successors, (1795), 1315 states have internal predecessors, (1795), 171 states have call successors, (171), 111 states have call predecessors, (171), 126 states have return successors, (205), 167 states have call predecessors, (205), 169 states have call successors, (205) [2022-02-20 20:00:11,317 INFO L74 IsIncluded]: Start isIncluded. First operand 1751 states. Second operand has 1591 states, 1292 states have (on average 1.3893188854489165) internal successors, (1795), 1315 states have internal predecessors, (1795), 171 states have call successors, (171), 111 states have call predecessors, (171), 126 states have return successors, (205), 167 states have call predecessors, (205), 169 states have call successors, (205) [2022-02-20 20:00:11,320 INFO L87 Difference]: Start difference. First operand 1751 states. Second operand has 1591 states, 1292 states have (on average 1.3893188854489165) internal successors, (1795), 1315 states have internal predecessors, (1795), 171 states have call successors, (171), 111 states have call predecessors, (171), 126 states have return successors, (205), 167 states have call predecessors, (205), 169 states have call successors, (205) [2022-02-20 20:00:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:11,450 INFO L93 Difference]: Finished difference Result 1751 states and 2383 transitions. [2022-02-20 20:00:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2383 transitions. [2022-02-20 20:00:11,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:11,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:11,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 1591 states, 1292 states have (on average 1.3893188854489165) internal successors, (1795), 1315 states have internal predecessors, (1795), 171 states have call successors, (171), 111 states have call predecessors, (171), 126 states have return successors, (205), 167 states have call predecessors, (205), 169 states have call successors, (205) Second operand 1751 states. [2022-02-20 20:00:11,459 INFO L87 Difference]: Start difference. First operand has 1591 states, 1292 states have (on average 1.3893188854489165) internal successors, (1795), 1315 states have internal predecessors, (1795), 171 states have call successors, (171), 111 states have call predecessors, (171), 126 states have return successors, (205), 167 states have call predecessors, (205), 169 states have call successors, (205) Second operand 1751 states. [2022-02-20 20:00:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:11,567 INFO L93 Difference]: Finished difference Result 1751 states and 2383 transitions. [2022-02-20 20:00:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2383 transitions. [2022-02-20 20:00:11,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:11,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:11,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:11,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1292 states have (on average 1.3893188854489165) internal successors, (1795), 1315 states have internal predecessors, (1795), 171 states have call successors, (171), 111 states have call predecessors, (171), 126 states have return successors, (205), 167 states have call predecessors, (205), 169 states have call successors, (205) [2022-02-20 20:00:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2171 transitions. [2022-02-20 20:00:11,695 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2171 transitions. Word has length 65 [2022-02-20 20:00:11,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:11,695 INFO L470 AbstractCegarLoop]: Abstraction has 1591 states and 2171 transitions. [2022-02-20 20:00:11,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2171 transitions. [2022-02-20 20:00:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:11,697 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:11,698 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:11,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:00:11,698 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:11,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:11,699 INFO L85 PathProgramCache]: Analyzing trace with hash -591028054, now seen corresponding path program 1 times [2022-02-20 20:00:11,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:11,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156776612] [2022-02-20 20:00:11,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:11,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {14725#(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); {14685#true} is VALID [2022-02-20 20:00:11,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {14685#true} assume true; {14685#true} is VALID [2022-02-20 20:00:11,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14685#true} {14685#true} #1161#return; {14685#true} is VALID [2022-02-20 20:00:11,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {14726#(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); {14685#true} is VALID [2022-02-20 20:00:11,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {14685#true} assume !(0 == ~q_write_ev~0); {14685#true} is VALID [2022-02-20 20:00:11,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {14685#true} assume true; {14685#true} is VALID [2022-02-20 20:00:11,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14685#true} {14685#true} #1163#return; {14685#true} is VALID [2022-02-20 20:00:11,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {14685#true} havoc ~__retres1~0; {14685#true} is VALID [2022-02-20 20:00:11,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {14685#true} assume !(1 == ~p_dw_pc~0); {14685#true} is VALID [2022-02-20 20:00:11,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {14685#true} assume !(2 == ~p_dw_pc~0); {14685#true} is VALID [2022-02-20 20:00:11,823 INFO L290 TraceCheckUtils]: 3: Hoare triple {14685#true} ~__retres1~0 := 0; {14743#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:11,823 INFO L290 TraceCheckUtils]: 4: Hoare triple {14743#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {14744#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:11,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {14744#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {14744#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:11,824 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {14744#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {14685#true} #1157#return; {14735#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:11,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {14685#true} havoc ~__retres1~1; {14685#true} is VALID [2022-02-20 20:00:11,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {14685#true} assume 1 == ~c_dr_pc~0; {14685#true} is VALID [2022-02-20 20:00:11,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {14685#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {14685#true} is VALID [2022-02-20 20:00:11,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {14685#true} #res := ~__retres1~1; {14685#true} is VALID [2022-02-20 20:00:11,830 INFO L290 TraceCheckUtils]: 4: Hoare triple {14685#true} assume true; {14685#true} is VALID [2022-02-20 20:00:11,830 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14685#true} {14686#false} #1159#return; {14686#false} is VALID [2022-02-20 20:00:11,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {14727#(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; {14685#true} is VALID [2022-02-20 20:00:11,830 INFO L272 TraceCheckUtils]: 1: Hoare triple {14685#true} call #t~ret8 := is_do_write_p_triggered(); {14685#true} is VALID [2022-02-20 20:00:11,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {14685#true} havoc ~__retres1~0; {14685#true} is VALID [2022-02-20 20:00:11,831 INFO L290 TraceCheckUtils]: 3: Hoare triple {14685#true} assume !(1 == ~p_dw_pc~0); {14685#true} is VALID [2022-02-20 20:00:11,831 INFO L290 TraceCheckUtils]: 4: Hoare triple {14685#true} assume !(2 == ~p_dw_pc~0); {14685#true} is VALID [2022-02-20 20:00:11,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {14685#true} ~__retres1~0 := 0; {14743#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:11,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {14743#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {14744#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:11,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {14744#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {14744#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:11,833 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {14744#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {14685#true} #1157#return; {14735#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:11,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {14735#(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; {14736#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:00:11,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {14736#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {14686#false} is VALID [2022-02-20 20:00:11,835 INFO L272 TraceCheckUtils]: 11: Hoare triple {14686#false} call #t~ret9 := is_do_read_c_triggered(); {14685#true} is VALID [2022-02-20 20:00:11,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {14685#true} havoc ~__retres1~1; {14685#true} is VALID [2022-02-20 20:00:11,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {14685#true} assume 1 == ~c_dr_pc~0; {14685#true} is VALID [2022-02-20 20:00:11,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {14685#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {14685#true} is VALID [2022-02-20 20:00:11,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {14685#true} #res := ~__retres1~1; {14685#true} is VALID [2022-02-20 20:00:11,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {14685#true} assume true; {14685#true} is VALID [2022-02-20 20:00:11,839 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14685#true} {14686#false} #1159#return; {14686#false} is VALID [2022-02-20 20:00:11,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {14686#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14686#false} is VALID [2022-02-20 20:00:11,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {14686#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14686#false} is VALID [2022-02-20 20:00:11,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {14686#false} assume true; {14686#false} is VALID [2022-02-20 20:00:11,842 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14686#false} {14685#true} #1165#return; {14686#false} is VALID [2022-02-20 20:00:11,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {14726#(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); {14685#true} is VALID [2022-02-20 20:00:11,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {14685#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14685#true} is VALID [2022-02-20 20:00:11,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {14685#true} assume true; {14685#true} is VALID [2022-02-20 20:00:11,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14685#true} {14686#false} #1167#return; {14686#false} is VALID [2022-02-20 20:00:11,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {14685#true} havoc ~__retres1~2; {14685#true} is VALID [2022-02-20 20:00:11,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {14685#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14685#true} is VALID [2022-02-20 20:00:11,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {14685#true} #res := ~__retres1~2; {14685#true} is VALID [2022-02-20 20:00:11,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {14685#true} assume true; {14685#true} is VALID [2022-02-20 20:00:11,852 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14685#true} {14686#false} #1169#return; {14686#false} is VALID [2022-02-20 20:00:11,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {14685#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {14685#true} is VALID [2022-02-20 20:00:11,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {14685#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {14685#true} is VALID [2022-02-20 20:00:11,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {14685#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#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; {14685#true} is VALID [2022-02-20 20:00:11,853 INFO L290 TraceCheckUtils]: 3: Hoare triple {14685#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; {14685#true} is VALID [2022-02-20 20:00:11,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {14685#true} call update_channels1(); {14725#(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,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {14725#(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); {14685#true} is VALID [2022-02-20 20:00:11,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {14685#true} assume true; {14685#true} is VALID [2022-02-20 20:00:11,854 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14685#true} {14685#true} #1161#return; {14685#true} is VALID [2022-02-20 20:00:11,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {14685#true} assume { :begin_inline_init_threads1 } true; {14685#true} is VALID [2022-02-20 20:00:11,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {14685#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {14685#true} is VALID [2022-02-20 20:00:11,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {14685#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {14685#true} is VALID [2022-02-20 20:00:11,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {14685#true} assume { :end_inline_init_threads1 } true; {14685#true} is VALID [2022-02-20 20:00:11,855 INFO L272 TraceCheckUtils]: 12: Hoare triple {14685#true} call fire_delta_events1(); {14726#(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,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {14726#(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); {14685#true} is VALID [2022-02-20 20:00:11,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {14685#true} assume !(0 == ~q_write_ev~0); {14685#true} is VALID [2022-02-20 20:00:11,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {14685#true} assume true; {14685#true} is VALID [2022-02-20 20:00:11,855 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14685#true} {14685#true} #1163#return; {14685#true} is VALID [2022-02-20 20:00:11,856 INFO L272 TraceCheckUtils]: 17: Hoare triple {14685#true} call activate_threads1(); {14727#(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,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {14727#(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; {14685#true} is VALID [2022-02-20 20:00:11,856 INFO L272 TraceCheckUtils]: 19: Hoare triple {14685#true} call #t~ret8 := is_do_write_p_triggered(); {14685#true} is VALID [2022-02-20 20:00:11,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {14685#true} havoc ~__retres1~0; {14685#true} is VALID [2022-02-20 20:00:11,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {14685#true} assume !(1 == ~p_dw_pc~0); {14685#true} is VALID [2022-02-20 20:00:11,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {14685#true} assume !(2 == ~p_dw_pc~0); {14685#true} is VALID [2022-02-20 20:00:11,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {14685#true} ~__retres1~0 := 0; {14743#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:11,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {14743#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {14744#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:11,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {14744#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {14744#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:11,858 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14744#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {14685#true} #1157#return; {14735#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:11,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {14735#(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; {14736#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:00:11,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {14736#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {14686#false} is VALID [2022-02-20 20:00:11,859 INFO L272 TraceCheckUtils]: 29: Hoare triple {14686#false} call #t~ret9 := is_do_read_c_triggered(); {14685#true} is VALID [2022-02-20 20:00:11,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {14685#true} havoc ~__retres1~1; {14685#true} is VALID [2022-02-20 20:00:11,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {14685#true} assume 1 == ~c_dr_pc~0; {14685#true} is VALID [2022-02-20 20:00:11,859 INFO L290 TraceCheckUtils]: 32: Hoare triple {14685#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {14685#true} is VALID [2022-02-20 20:00:11,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {14685#true} #res := ~__retres1~1; {14685#true} is VALID [2022-02-20 20:00:11,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {14685#true} assume true; {14685#true} is VALID [2022-02-20 20:00:11,860 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {14685#true} {14686#false} #1159#return; {14686#false} is VALID [2022-02-20 20:00:11,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {14686#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14686#false} is VALID [2022-02-20 20:00:11,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {14686#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14686#false} is VALID [2022-02-20 20:00:11,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {14686#false} assume true; {14686#false} is VALID [2022-02-20 20:00:11,860 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14686#false} {14685#true} #1165#return; {14686#false} is VALID [2022-02-20 20:00:11,860 INFO L272 TraceCheckUtils]: 40: Hoare triple {14686#false} call reset_delta_events1(); {14726#(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,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {14726#(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); {14685#true} is VALID [2022-02-20 20:00:11,860 INFO L290 TraceCheckUtils]: 42: Hoare triple {14685#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14685#true} is VALID [2022-02-20 20:00:11,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {14685#true} assume true; {14685#true} is VALID [2022-02-20 20:00:11,861 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14685#true} {14686#false} #1167#return; {14686#false} is VALID [2022-02-20 20:00:11,861 INFO L290 TraceCheckUtils]: 45: Hoare triple {14686#false} assume !false; {14686#false} is VALID [2022-02-20 20:00:11,861 INFO L290 TraceCheckUtils]: 46: Hoare triple {14686#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; {14686#false} is VALID [2022-02-20 20:00:11,861 INFO L290 TraceCheckUtils]: 47: Hoare triple {14686#false} assume !false; {14686#false} is VALID [2022-02-20 20:00:11,861 INFO L272 TraceCheckUtils]: 48: Hoare triple {14686#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {14685#true} is VALID [2022-02-20 20:00:11,861 INFO L290 TraceCheckUtils]: 49: Hoare triple {14685#true} havoc ~__retres1~2; {14685#true} is VALID [2022-02-20 20:00:11,861 INFO L290 TraceCheckUtils]: 50: Hoare triple {14685#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14685#true} is VALID [2022-02-20 20:00:11,862 INFO L290 TraceCheckUtils]: 51: Hoare triple {14685#true} #res := ~__retres1~2; {14685#true} is VALID [2022-02-20 20:00:11,862 INFO L290 TraceCheckUtils]: 52: Hoare triple {14685#true} assume true; {14685#true} is VALID [2022-02-20 20:00:11,862 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {14685#true} {14686#false} #1169#return; {14686#false} is VALID [2022-02-20 20:00:11,862 INFO L290 TraceCheckUtils]: 54: Hoare triple {14686#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; {14686#false} is VALID [2022-02-20 20:00:11,862 INFO L290 TraceCheckUtils]: 55: Hoare triple {14686#false} assume 0 != eval1_~tmp___1~0#1; {14686#false} is VALID [2022-02-20 20:00:11,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {14686#false} assume !(0 == ~p_dw_st~0); {14686#false} is VALID [2022-02-20 20:00:11,862 INFO L290 TraceCheckUtils]: 57: Hoare triple {14686#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; {14686#false} is VALID [2022-02-20 20:00:11,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {14686#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; {14686#false} is VALID [2022-02-20 20:00:11,863 INFO L290 TraceCheckUtils]: 59: Hoare triple {14686#false} assume !(0 == ~c_dr_pc~0); {14686#false} is VALID [2022-02-20 20:00:11,863 INFO L290 TraceCheckUtils]: 60: Hoare triple {14686#false} assume 2 == ~c_dr_pc~0; {14686#false} is VALID [2022-02-20 20:00:11,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {14686#false} do_read_c_~a~0#1 := ~a_t~0; {14686#false} is VALID [2022-02-20 20:00:11,863 INFO L290 TraceCheckUtils]: 62: Hoare triple {14686#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; {14686#false} is VALID [2022-02-20 20:00:11,863 INFO L290 TraceCheckUtils]: 63: Hoare triple {14686#false} assume !(~p_last_write~0 == ~c_last_read~0); {14686#false} is VALID [2022-02-20 20:00:11,863 INFO L272 TraceCheckUtils]: 64: Hoare triple {14686#false} call error1(); {14686#false} is VALID [2022-02-20 20:00:11,863 INFO L290 TraceCheckUtils]: 65: Hoare triple {14686#false} assume !false; {14686#false} is VALID [2022-02-20 20:00:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:11,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:11,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156776612] [2022-02-20 20:00:11,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156776612] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:11,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:11,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:11,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547067206] [2022-02-20 20:00:11,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:11,865 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 20:00:11,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:11,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:11,897 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:11,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:11,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:11,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:11,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:11,898 INFO L87 Difference]: Start difference. First operand 1591 states and 2171 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:15,014 INFO L93 Difference]: Finished difference Result 3119 states and 4250 transitions. [2022-02-20 20:00:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:00:15,014 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 20:00:15,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 647 transitions. [2022-02-20 20:00:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 647 transitions. [2022-02-20 20:00:15,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 647 transitions. [2022-02-20 20:00:15,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 647 edges. 647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:15,599 INFO L225 Difference]: With dead ends: 3119 [2022-02-20 20:00:15,599 INFO L226 Difference]: Without dead ends: 1739 [2022-02-20 20:00:15,601 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:15,608 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 386 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:15,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 2039 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 20:00:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-02-20 20:00:15,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1631. [2022-02-20 20:00:15,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:15,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1739 states. Second operand has 1631 states, 1324 states have (on average 1.3753776435045317) internal successors, (1821), 1347 states have internal predecessors, (1821), 171 states have call successors, (171), 111 states have call predecessors, (171), 134 states have return successors, (213), 175 states have call predecessors, (213), 169 states have call successors, (213) [2022-02-20 20:00:15,678 INFO L74 IsIncluded]: Start isIncluded. First operand 1739 states. Second operand has 1631 states, 1324 states have (on average 1.3753776435045317) internal successors, (1821), 1347 states have internal predecessors, (1821), 171 states have call successors, (171), 111 states have call predecessors, (171), 134 states have return successors, (213), 175 states have call predecessors, (213), 169 states have call successors, (213) [2022-02-20 20:00:15,692 INFO L87 Difference]: Start difference. First operand 1739 states. Second operand has 1631 states, 1324 states have (on average 1.3753776435045317) internal successors, (1821), 1347 states have internal predecessors, (1821), 171 states have call successors, (171), 111 states have call predecessors, (171), 134 states have return successors, (213), 175 states have call predecessors, (213), 169 states have call successors, (213) [2022-02-20 20:00:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:15,797 INFO L93 Difference]: Finished difference Result 1739 states and 2359 transitions. [2022-02-20 20:00:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2359 transitions. [2022-02-20 20:00:15,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:15,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:15,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 1631 states, 1324 states have (on average 1.3753776435045317) internal successors, (1821), 1347 states have internal predecessors, (1821), 171 states have call successors, (171), 111 states have call predecessors, (171), 134 states have return successors, (213), 175 states have call predecessors, (213), 169 states have call successors, (213) Second operand 1739 states. [2022-02-20 20:00:15,807 INFO L87 Difference]: Start difference. First operand has 1631 states, 1324 states have (on average 1.3753776435045317) internal successors, (1821), 1347 states have internal predecessors, (1821), 171 states have call successors, (171), 111 states have call predecessors, (171), 134 states have return successors, (213), 175 states have call predecessors, (213), 169 states have call successors, (213) Second operand 1739 states. [2022-02-20 20:00:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:15,910 INFO L93 Difference]: Finished difference Result 1739 states and 2359 transitions. [2022-02-20 20:00:15,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2359 transitions. [2022-02-20 20:00:15,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:15,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:15,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:15,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:15,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1324 states have (on average 1.3753776435045317) internal successors, (1821), 1347 states have internal predecessors, (1821), 171 states have call successors, (171), 111 states have call predecessors, (171), 134 states have return successors, (213), 175 states have call predecessors, (213), 169 states have call successors, (213) [2022-02-20 20:00:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2205 transitions. [2022-02-20 20:00:16,043 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2205 transitions. Word has length 66 [2022-02-20 20:00:16,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:16,043 INFO L470 AbstractCegarLoop]: Abstraction has 1631 states and 2205 transitions. [2022-02-20 20:00:16,043 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:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2205 transitions. [2022-02-20 20:00:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:16,044 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:16,044 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:16,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:00:16,045 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:16,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:16,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1620387352, now seen corresponding path program 1 times [2022-02-20 20:00:16,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:16,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231223327] [2022-02-20 20:00:16,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:16,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {24665#(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); {24666#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:16,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {24666#(not (= |old(~q_req_up~0)| 1))} assume true; {24666#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:16,099 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24666#(not (= |old(~q_req_up~0)| 1))} {24625#(= ~c_dr_pc~0 ~q_req_up~0)} #1161#return; {24629#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:16,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {24667#(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); {24622#true} is VALID [2022-02-20 20:00:16,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {24622#true} assume !(0 == ~q_write_ev~0); {24622#true} is VALID [2022-02-20 20:00:16,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {24622#true} assume true; {24622#true} is VALID [2022-02-20 20:00:16,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24622#true} {24629#(not (= ~c_dr_pc~0 1))} #1163#return; {24629#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:16,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {24622#true} havoc ~__retres1~0; {24622#true} is VALID [2022-02-20 20:00:16,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {24622#true} assume !(1 == ~p_dw_pc~0); {24622#true} is VALID [2022-02-20 20:00:16,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {24622#true} assume !(2 == ~p_dw_pc~0); {24622#true} is VALID [2022-02-20 20:00:16,146 INFO L290 TraceCheckUtils]: 3: Hoare triple {24622#true} ~__retres1~0 := 0; {24622#true} is VALID [2022-02-20 20:00:16,146 INFO L290 TraceCheckUtils]: 4: Hoare triple {24622#true} #res := ~__retres1~0; {24622#true} is VALID [2022-02-20 20:00:16,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {24622#true} assume true; {24622#true} is VALID [2022-02-20 20:00:16,147 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {24622#true} {24622#true} #1157#return; {24622#true} is VALID [2022-02-20 20:00:16,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {24622#true} havoc ~__retres1~1; {24622#true} is VALID [2022-02-20 20:00:16,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {24622#true} assume 1 == ~c_dr_pc~0; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,153 INFO L290 TraceCheckUtils]: 3: Hoare triple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,153 INFO L290 TraceCheckUtils]: 4: Hoare triple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,154 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} {24622#true} #1159#return; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {24668#(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; {24622#true} is VALID [2022-02-20 20:00:16,154 INFO L272 TraceCheckUtils]: 1: Hoare triple {24622#true} call #t~ret8 := is_do_write_p_triggered(); {24622#true} is VALID [2022-02-20 20:00:16,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {24622#true} havoc ~__retres1~0; {24622#true} is VALID [2022-02-20 20:00:16,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {24622#true} assume !(1 == ~p_dw_pc~0); {24622#true} is VALID [2022-02-20 20:00:16,154 INFO L290 TraceCheckUtils]: 4: Hoare triple {24622#true} assume !(2 == ~p_dw_pc~0); {24622#true} is VALID [2022-02-20 20:00:16,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {24622#true} ~__retres1~0 := 0; {24622#true} is VALID [2022-02-20 20:00:16,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {24622#true} #res := ~__retres1~0; {24622#true} is VALID [2022-02-20 20:00:16,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {24622#true} assume true; {24622#true} is VALID [2022-02-20 20:00:16,155 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {24622#true} {24622#true} #1157#return; {24622#true} is VALID [2022-02-20 20:00:16,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {24622#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {24622#true} is VALID [2022-02-20 20:00:16,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {24622#true} assume !(0 != ~tmp~1); {24622#true} is VALID [2022-02-20 20:00:16,155 INFO L272 TraceCheckUtils]: 11: Hoare triple {24622#true} call #t~ret9 := is_do_read_c_triggered(); {24622#true} is VALID [2022-02-20 20:00:16,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {24622#true} havoc ~__retres1~1; {24622#true} is VALID [2022-02-20 20:00:16,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {24622#true} assume 1 == ~c_dr_pc~0; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,157 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} {24622#true} #1159#return; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,159 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} {24629#(not (= ~c_dr_pc~0 1))} #1165#return; {24623#false} is VALID [2022-02-20 20:00:16,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {24667#(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); {24622#true} is VALID [2022-02-20 20:00:16,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {24622#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {24622#true} is VALID [2022-02-20 20:00:16,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {24622#true} assume true; {24622#true} is VALID [2022-02-20 20:00:16,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24622#true} {24623#false} #1167#return; {24623#false} is VALID [2022-02-20 20:00:16,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {24622#true} havoc ~__retres1~2; {24622#true} is VALID [2022-02-20 20:00:16,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {24622#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {24622#true} is VALID [2022-02-20 20:00:16,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {24622#true} #res := ~__retres1~2; {24622#true} is VALID [2022-02-20 20:00:16,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {24622#true} assume true; {24622#true} is VALID [2022-02-20 20:00:16,171 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {24622#true} {24623#false} #1169#return; {24623#false} is VALID [2022-02-20 20:00:16,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {24622#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {24624#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:16,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {24624#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {24624#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:16,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {24624#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#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; {24625#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:16,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {24625#(= ~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; {24625#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:16,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {24625#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {24665#(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:16,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {24665#(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); {24666#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:16,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {24666#(not (= |old(~q_req_up~0)| 1))} assume true; {24666#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:16,174 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {24666#(not (= |old(~q_req_up~0)| 1))} {24625#(= ~c_dr_pc~0 ~q_req_up~0)} #1161#return; {24629#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:16,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {24629#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {24629#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:16,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {24629#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {24629#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:16,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {24629#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {24629#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:16,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {24629#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {24629#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:16,176 INFO L272 TraceCheckUtils]: 12: Hoare triple {24629#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {24667#(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:16,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {24667#(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); {24622#true} is VALID [2022-02-20 20:00:16,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {24622#true} assume !(0 == ~q_write_ev~0); {24622#true} is VALID [2022-02-20 20:00:16,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {24622#true} assume true; {24622#true} is VALID [2022-02-20 20:00:16,176 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {24622#true} {24629#(not (= ~c_dr_pc~0 1))} #1163#return; {24629#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:16,177 INFO L272 TraceCheckUtils]: 17: Hoare triple {24629#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {24668#(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:16,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {24668#(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; {24622#true} is VALID [2022-02-20 20:00:16,177 INFO L272 TraceCheckUtils]: 19: Hoare triple {24622#true} call #t~ret8 := is_do_write_p_triggered(); {24622#true} is VALID [2022-02-20 20:00:16,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {24622#true} havoc ~__retres1~0; {24622#true} is VALID [2022-02-20 20:00:16,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {24622#true} assume !(1 == ~p_dw_pc~0); {24622#true} is VALID [2022-02-20 20:00:16,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {24622#true} assume !(2 == ~p_dw_pc~0); {24622#true} is VALID [2022-02-20 20:00:16,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {24622#true} ~__retres1~0 := 0; {24622#true} is VALID [2022-02-20 20:00:16,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {24622#true} #res := ~__retres1~0; {24622#true} is VALID [2022-02-20 20:00:16,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {24622#true} assume true; {24622#true} is VALID [2022-02-20 20:00:16,178 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24622#true} {24622#true} #1157#return; {24622#true} is VALID [2022-02-20 20:00:16,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {24622#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {24622#true} is VALID [2022-02-20 20:00:16,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {24622#true} assume !(0 != ~tmp~1); {24622#true} is VALID [2022-02-20 20:00:16,178 INFO L272 TraceCheckUtils]: 29: Hoare triple {24622#true} call #t~ret9 := is_do_read_c_triggered(); {24622#true} is VALID [2022-02-20 20:00:16,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {24622#true} havoc ~__retres1~1; {24622#true} is VALID [2022-02-20 20:00:16,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {24622#true} assume 1 == ~c_dr_pc~0; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,180 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} {24622#true} #1159#return; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,180 INFO L290 TraceCheckUtils]: 36: Hoare triple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,181 INFO L290 TraceCheckUtils]: 37: Hoare triple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,181 INFO L290 TraceCheckUtils]: 38: Hoare triple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:16,181 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {24682#(= (+ (- 1) ~c_dr_pc~0) 0)} {24629#(not (= ~c_dr_pc~0 1))} #1165#return; {24623#false} is VALID [2022-02-20 20:00:16,181 INFO L272 TraceCheckUtils]: 40: Hoare triple {24623#false} call reset_delta_events1(); {24667#(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:16,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {24667#(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); {24622#true} is VALID [2022-02-20 20:00:16,182 INFO L290 TraceCheckUtils]: 42: Hoare triple {24622#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {24622#true} is VALID [2022-02-20 20:00:16,182 INFO L290 TraceCheckUtils]: 43: Hoare triple {24622#true} assume true; {24622#true} is VALID [2022-02-20 20:00:16,182 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {24622#true} {24623#false} #1167#return; {24623#false} is VALID [2022-02-20 20:00:16,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {24623#false} assume !false; {24623#false} is VALID [2022-02-20 20:00:16,182 INFO L290 TraceCheckUtils]: 46: Hoare triple {24623#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; {24623#false} is VALID [2022-02-20 20:00:16,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {24623#false} assume !false; {24623#false} is VALID [2022-02-20 20:00:16,182 INFO L272 TraceCheckUtils]: 48: Hoare triple {24623#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {24622#true} is VALID [2022-02-20 20:00:16,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {24622#true} havoc ~__retres1~2; {24622#true} is VALID [2022-02-20 20:00:16,183 INFO L290 TraceCheckUtils]: 50: Hoare triple {24622#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {24622#true} is VALID [2022-02-20 20:00:16,183 INFO L290 TraceCheckUtils]: 51: Hoare triple {24622#true} #res := ~__retres1~2; {24622#true} is VALID [2022-02-20 20:00:16,183 INFO L290 TraceCheckUtils]: 52: Hoare triple {24622#true} assume true; {24622#true} is VALID [2022-02-20 20:00:16,183 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {24622#true} {24623#false} #1169#return; {24623#false} is VALID [2022-02-20 20:00:16,183 INFO L290 TraceCheckUtils]: 54: Hoare triple {24623#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; {24623#false} is VALID [2022-02-20 20:00:16,183 INFO L290 TraceCheckUtils]: 55: Hoare triple {24623#false} assume 0 != eval1_~tmp___1~0#1; {24623#false} is VALID [2022-02-20 20:00:16,183 INFO L290 TraceCheckUtils]: 56: Hoare triple {24623#false} assume !(0 == ~p_dw_st~0); {24623#false} is VALID [2022-02-20 20:00:16,183 INFO L290 TraceCheckUtils]: 57: Hoare triple {24623#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; {24623#false} is VALID [2022-02-20 20:00:16,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {24623#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; {24623#false} is VALID [2022-02-20 20:00:16,184 INFO L290 TraceCheckUtils]: 59: Hoare triple {24623#false} assume !(0 == ~c_dr_pc~0); {24623#false} is VALID [2022-02-20 20:00:16,184 INFO L290 TraceCheckUtils]: 60: Hoare triple {24623#false} assume 2 == ~c_dr_pc~0; {24623#false} is VALID [2022-02-20 20:00:16,184 INFO L290 TraceCheckUtils]: 61: Hoare triple {24623#false} do_read_c_~a~0#1 := ~a_t~0; {24623#false} is VALID [2022-02-20 20:00:16,184 INFO L290 TraceCheckUtils]: 62: Hoare triple {24623#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; {24623#false} is VALID [2022-02-20 20:00:16,184 INFO L290 TraceCheckUtils]: 63: Hoare triple {24623#false} assume !(~p_last_write~0 == ~c_last_read~0); {24623#false} is VALID [2022-02-20 20:00:16,184 INFO L272 TraceCheckUtils]: 64: Hoare triple {24623#false} call error1(); {24623#false} is VALID [2022-02-20 20:00:16,184 INFO L290 TraceCheckUtils]: 65: Hoare triple {24623#false} assume !false; {24623#false} is VALID [2022-02-20 20:00:16,185 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:16,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:16,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231223327] [2022-02-20 20:00:16,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231223327] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:16,186 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:16,186 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:16,186 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747114070] [2022-02-20 20:00:16,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:16,186 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:16,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:16,187 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:16,217 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:16,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:16,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:16,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:16,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:16,218 INFO L87 Difference]: Start difference. First operand 1631 states and 2205 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:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:23,210 INFO L93 Difference]: Finished difference Result 5203 states and 7079 transitions. [2022-02-20 20:00:23,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:23,211 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:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:23,212 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:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1260 transitions. [2022-02-20 20:00:23,220 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:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1260 transitions. [2022-02-20 20:00:23,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1260 transitions. [2022-02-20 20:00:24,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1260 edges. 1260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:24,369 INFO L225 Difference]: With dead ends: 5203 [2022-02-20 20:00:24,369 INFO L226 Difference]: Without dead ends: 2022 [2022-02-20 20:00:24,375 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:24,376 INFO L933 BasicCegarLoop]: 597 mSDtfsCounter, 2712 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 626 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2730 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 626 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:24,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2730 Valid, 2321 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [626 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 20:00:24,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2022-02-20 20:00:24,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1842. [2022-02-20 20:00:24,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:24,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2022 states. Second operand has 1842 states, 1463 states have (on average 1.330827067669173) internal successors, (1947), 1488 states have internal predecessors, (1947), 211 states have call successors, (211), 139 states have call predecessors, (211), 166 states have return successors, (259), 217 states have call predecessors, (259), 209 states have call successors, (259) [2022-02-20 20:00:24,465 INFO L74 IsIncluded]: Start isIncluded. First operand 2022 states. Second operand has 1842 states, 1463 states have (on average 1.330827067669173) internal successors, (1947), 1488 states have internal predecessors, (1947), 211 states have call successors, (211), 139 states have call predecessors, (211), 166 states have return successors, (259), 217 states have call predecessors, (259), 209 states have call successors, (259) [2022-02-20 20:00:24,467 INFO L87 Difference]: Start difference. First operand 2022 states. Second operand has 1842 states, 1463 states have (on average 1.330827067669173) internal successors, (1947), 1488 states have internal predecessors, (1947), 211 states have call successors, (211), 139 states have call predecessors, (211), 166 states have return successors, (259), 217 states have call predecessors, (259), 209 states have call successors, (259) [2022-02-20 20:00:24,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:24,608 INFO L93 Difference]: Finished difference Result 2022 states and 2648 transitions. [2022-02-20 20:00:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2648 transitions. [2022-02-20 20:00:24,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:24,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:24,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 1842 states, 1463 states have (on average 1.330827067669173) internal successors, (1947), 1488 states have internal predecessors, (1947), 211 states have call successors, (211), 139 states have call predecessors, (211), 166 states have return successors, (259), 217 states have call predecessors, (259), 209 states have call successors, (259) Second operand 2022 states. [2022-02-20 20:00:24,616 INFO L87 Difference]: Start difference. First operand has 1842 states, 1463 states have (on average 1.330827067669173) internal successors, (1947), 1488 states have internal predecessors, (1947), 211 states have call successors, (211), 139 states have call predecessors, (211), 166 states have return successors, (259), 217 states have call predecessors, (259), 209 states have call successors, (259) Second operand 2022 states. [2022-02-20 20:00:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:24,754 INFO L93 Difference]: Finished difference Result 2022 states and 2648 transitions. [2022-02-20 20:00:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2648 transitions. [2022-02-20 20:00:24,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:24,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:24,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:24,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1463 states have (on average 1.330827067669173) internal successors, (1947), 1488 states have internal predecessors, (1947), 211 states have call successors, (211), 139 states have call predecessors, (211), 166 states have return successors, (259), 217 states have call predecessors, (259), 209 states have call successors, (259) [2022-02-20 20:00:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2417 transitions. [2022-02-20 20:00:24,935 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2417 transitions. Word has length 66 [2022-02-20 20:00:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:24,936 INFO L470 AbstractCegarLoop]: Abstraction has 1842 states and 2417 transitions. [2022-02-20 20:00:24,936 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:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2417 transitions. [2022-02-20 20:00:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:24,937 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:24,938 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,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:00:24,938 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:24,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:24,939 INFO L85 PathProgramCache]: Analyzing trace with hash -920662268, now seen corresponding path program 1 times [2022-02-20 20:00:24,939 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:24,939 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821125945] [2022-02-20 20:00:24,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:24,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {38330#(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); {38284#true} is VALID [2022-02-20 20:00:24,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {38284#true} assume true; {38284#true} is VALID [2022-02-20 20:00:24,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38284#true} {38284#true} #1161#return; {38284#true} is VALID [2022-02-20 20:00:24,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {38331#(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); {38284#true} is VALID [2022-02-20 20:00:24,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {38284#true} assume !(0 == ~q_write_ev~0); {38284#true} is VALID [2022-02-20 20:00:24,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {38284#true} assume true; {38284#true} is VALID [2022-02-20 20:00:24,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38284#true} {38284#true} #1163#return; {38284#true} is VALID [2022-02-20 20:00:24,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:25,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:25,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {38284#true} havoc ~__retres1~0; {38284#true} is VALID [2022-02-20 20:00:25,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {38284#true} assume !(1 == ~p_dw_pc~0); {38284#true} is VALID [2022-02-20 20:00:25,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {38284#true} assume !(2 == ~p_dw_pc~0); {38284#true} is VALID [2022-02-20 20:00:25,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {38284#true} ~__retres1~0 := 0; {38284#true} is VALID [2022-02-20 20:00:25,012 INFO L290 TraceCheckUtils]: 4: Hoare triple {38284#true} #res := ~__retres1~0; {38284#true} is VALID [2022-02-20 20:00:25,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {38284#true} assume true; {38284#true} is VALID [2022-02-20 20:00:25,012 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {38284#true} {38284#true} #1157#return; {38284#true} is VALID [2022-02-20 20:00:25,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:25,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {38284#true} havoc ~__retres1~1; {38284#true} is VALID [2022-02-20 20:00:25,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {38284#true} assume !(1 == ~c_dr_pc~0); {38284#true} is VALID [2022-02-20 20:00:25,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {38284#true} assume !(2 == ~c_dr_pc~0); {38284#true} is VALID [2022-02-20 20:00:25,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {38284#true} ~__retres1~1 := 0; {38349#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:25,038 INFO L290 TraceCheckUtils]: 4: Hoare triple {38349#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {38350#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:25,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {38350#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {38350#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:25,039 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {38350#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {38284#true} #1159#return; {38347#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:25,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {38332#(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; {38284#true} is VALID [2022-02-20 20:00:25,039 INFO L272 TraceCheckUtils]: 1: Hoare triple {38284#true} call #t~ret8 := is_do_write_p_triggered(); {38284#true} is VALID [2022-02-20 20:00:25,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {38284#true} havoc ~__retres1~0; {38284#true} is VALID [2022-02-20 20:00:25,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {38284#true} assume !(1 == ~p_dw_pc~0); {38284#true} is VALID [2022-02-20 20:00:25,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {38284#true} assume !(2 == ~p_dw_pc~0); {38284#true} is VALID [2022-02-20 20:00:25,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {38284#true} ~__retres1~0 := 0; {38284#true} is VALID [2022-02-20 20:00:25,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {38284#true} #res := ~__retres1~0; {38284#true} is VALID [2022-02-20 20:00:25,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {38284#true} assume true; {38284#true} is VALID [2022-02-20 20:00:25,040 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {38284#true} {38284#true} #1157#return; {38284#true} is VALID [2022-02-20 20:00:25,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {38284#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38284#true} is VALID [2022-02-20 20:00:25,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {38284#true} assume !(0 != ~tmp~1); {38284#true} is VALID [2022-02-20 20:00:25,040 INFO L272 TraceCheckUtils]: 11: Hoare triple {38284#true} call #t~ret9 := is_do_read_c_triggered(); {38284#true} is VALID [2022-02-20 20:00:25,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {38284#true} havoc ~__retres1~1; {38284#true} is VALID [2022-02-20 20:00:25,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {38284#true} assume !(1 == ~c_dr_pc~0); {38284#true} is VALID [2022-02-20 20:00:25,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {38284#true} assume !(2 == ~c_dr_pc~0); {38284#true} is VALID [2022-02-20 20:00:25,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {38284#true} ~__retres1~1 := 0; {38349#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:25,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {38349#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {38350#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:25,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {38350#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {38350#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:25,042 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {38350#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {38284#true} #1159#return; {38347#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:25,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {38347#(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; {38348#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:00:25,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {38348#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {38285#false} is VALID [2022-02-20 20:00:25,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {38285#false} assume true; {38285#false} is VALID [2022-02-20 20:00:25,043 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {38285#false} {38284#true} #1165#return; {38285#false} is VALID [2022-02-20 20:00:25,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:25,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {38331#(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); {38284#true} is VALID [2022-02-20 20:00:25,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {38284#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {38284#true} is VALID [2022-02-20 20:00:25,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {38284#true} assume true; {38284#true} is VALID [2022-02-20 20:00:25,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38284#true} {38285#false} #1167#return; {38285#false} is VALID [2022-02-20 20:00:25,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:25,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {38284#true} havoc ~__retres1~2; {38284#true} is VALID [2022-02-20 20:00:25,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {38284#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38284#true} is VALID [2022-02-20 20:00:25,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {38284#true} #res := ~__retres1~2; {38284#true} is VALID [2022-02-20 20:00:25,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {38284#true} assume true; {38284#true} is VALID [2022-02-20 20:00:25,056 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38284#true} {38285#false} #1169#return; {38285#false} is VALID [2022-02-20 20:00:25,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:25,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {38284#true} havoc ~__retres1~2; {38284#true} is VALID [2022-02-20 20:00:25,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {38284#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38284#true} is VALID [2022-02-20 20:00:25,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {38284#true} #res := ~__retres1~2; {38284#true} is VALID [2022-02-20 20:00:25,060 INFO L290 TraceCheckUtils]: 3: Hoare triple {38284#true} assume true; {38284#true} is VALID [2022-02-20 20:00:25,061 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38284#true} {38285#false} #1169#return; {38285#false} is VALID [2022-02-20 20:00:25,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {38284#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {38284#true} is VALID [2022-02-20 20:00:25,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {38284#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {38284#true} is VALID [2022-02-20 20:00:25,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {38284#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#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; {38284#true} is VALID [2022-02-20 20:00:25,061 INFO L290 TraceCheckUtils]: 3: Hoare triple {38284#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; {38284#true} is VALID [2022-02-20 20:00:25,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {38284#true} call update_channels1(); {38330#(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:25,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {38330#(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); {38284#true} is VALID [2022-02-20 20:00:25,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {38284#true} assume true; {38284#true} is VALID [2022-02-20 20:00:25,062 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {38284#true} {38284#true} #1161#return; {38284#true} is VALID [2022-02-20 20:00:25,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {38284#true} assume { :begin_inline_init_threads1 } true; {38284#true} is VALID [2022-02-20 20:00:25,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {38284#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {38284#true} is VALID [2022-02-20 20:00:25,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {38284#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {38284#true} is VALID [2022-02-20 20:00:25,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {38284#true} assume { :end_inline_init_threads1 } true; {38284#true} is VALID [2022-02-20 20:00:25,063 INFO L272 TraceCheckUtils]: 12: Hoare triple {38284#true} call fire_delta_events1(); {38331#(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:25,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {38331#(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); {38284#true} is VALID [2022-02-20 20:00:25,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {38284#true} assume !(0 == ~q_write_ev~0); {38284#true} is VALID [2022-02-20 20:00:25,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {38284#true} assume true; {38284#true} is VALID [2022-02-20 20:00:25,063 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38284#true} {38284#true} #1163#return; {38284#true} is VALID [2022-02-20 20:00:25,064 INFO L272 TraceCheckUtils]: 17: Hoare triple {38284#true} call activate_threads1(); {38332#(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:25,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {38332#(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; {38284#true} is VALID [2022-02-20 20:00:25,064 INFO L272 TraceCheckUtils]: 19: Hoare triple {38284#true} call #t~ret8 := is_do_write_p_triggered(); {38284#true} is VALID [2022-02-20 20:00:25,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {38284#true} havoc ~__retres1~0; {38284#true} is VALID [2022-02-20 20:00:25,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {38284#true} assume !(1 == ~p_dw_pc~0); {38284#true} is VALID [2022-02-20 20:00:25,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {38284#true} assume !(2 == ~p_dw_pc~0); {38284#true} is VALID [2022-02-20 20:00:25,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {38284#true} ~__retres1~0 := 0; {38284#true} is VALID [2022-02-20 20:00:25,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {38284#true} #res := ~__retres1~0; {38284#true} is VALID [2022-02-20 20:00:25,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {38284#true} assume true; {38284#true} is VALID [2022-02-20 20:00:25,067 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {38284#true} {38284#true} #1157#return; {38284#true} is VALID [2022-02-20 20:00:25,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {38284#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38284#true} is VALID [2022-02-20 20:00:25,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {38284#true} assume !(0 != ~tmp~1); {38284#true} is VALID [2022-02-20 20:00:25,067 INFO L272 TraceCheckUtils]: 29: Hoare triple {38284#true} call #t~ret9 := is_do_read_c_triggered(); {38284#true} is VALID [2022-02-20 20:00:25,067 INFO L290 TraceCheckUtils]: 30: Hoare triple {38284#true} havoc ~__retres1~1; {38284#true} is VALID [2022-02-20 20:00:25,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {38284#true} assume !(1 == ~c_dr_pc~0); {38284#true} is VALID [2022-02-20 20:00:25,068 INFO L290 TraceCheckUtils]: 32: Hoare triple {38284#true} assume !(2 == ~c_dr_pc~0); {38284#true} is VALID [2022-02-20 20:00:25,068 INFO L290 TraceCheckUtils]: 33: Hoare triple {38284#true} ~__retres1~1 := 0; {38349#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:25,068 INFO L290 TraceCheckUtils]: 34: Hoare triple {38349#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {38350#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:25,069 INFO L290 TraceCheckUtils]: 35: Hoare triple {38350#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {38350#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:25,069 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {38350#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {38284#true} #1159#return; {38347#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:25,070 INFO L290 TraceCheckUtils]: 37: Hoare triple {38347#(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; {38348#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:00:25,070 INFO L290 TraceCheckUtils]: 38: Hoare triple {38348#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {38285#false} is VALID [2022-02-20 20:00:25,070 INFO L290 TraceCheckUtils]: 39: Hoare triple {38285#false} assume true; {38285#false} is VALID [2022-02-20 20:00:25,070 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {38285#false} {38284#true} #1165#return; {38285#false} is VALID [2022-02-20 20:00:25,070 INFO L272 TraceCheckUtils]: 41: Hoare triple {38285#false} call reset_delta_events1(); {38331#(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:25,071 INFO L290 TraceCheckUtils]: 42: Hoare triple {38331#(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); {38284#true} is VALID [2022-02-20 20:00:25,071 INFO L290 TraceCheckUtils]: 43: Hoare triple {38284#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {38284#true} is VALID [2022-02-20 20:00:25,071 INFO L290 TraceCheckUtils]: 44: Hoare triple {38284#true} assume true; {38284#true} is VALID [2022-02-20 20:00:25,071 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {38284#true} {38285#false} #1167#return; {38285#false} is VALID [2022-02-20 20:00:25,071 INFO L290 TraceCheckUtils]: 46: Hoare triple {38285#false} assume !false; {38285#false} is VALID [2022-02-20 20:00:25,071 INFO L290 TraceCheckUtils]: 47: Hoare triple {38285#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; {38285#false} is VALID [2022-02-20 20:00:25,071 INFO L290 TraceCheckUtils]: 48: Hoare triple {38285#false} assume !false; {38285#false} is VALID [2022-02-20 20:00:25,071 INFO L272 TraceCheckUtils]: 49: Hoare triple {38285#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {38284#true} is VALID [2022-02-20 20:00:25,072 INFO L290 TraceCheckUtils]: 50: Hoare triple {38284#true} havoc ~__retres1~2; {38284#true} is VALID [2022-02-20 20:00:25,072 INFO L290 TraceCheckUtils]: 51: Hoare triple {38284#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38284#true} is VALID [2022-02-20 20:00:25,072 INFO L290 TraceCheckUtils]: 52: Hoare triple {38284#true} #res := ~__retres1~2; {38284#true} is VALID [2022-02-20 20:00:25,072 INFO L290 TraceCheckUtils]: 53: Hoare triple {38284#true} assume true; {38284#true} is VALID [2022-02-20 20:00:25,072 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {38284#true} {38285#false} #1169#return; {38285#false} is VALID [2022-02-20 20:00:25,072 INFO L290 TraceCheckUtils]: 55: Hoare triple {38285#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; {38285#false} is VALID [2022-02-20 20:00:25,072 INFO L290 TraceCheckUtils]: 56: Hoare triple {38285#false} assume 0 != eval1_~tmp___1~0#1; {38285#false} is VALID [2022-02-20 20:00:25,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {38285#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; {38285#false} is VALID [2022-02-20 20:00:25,073 INFO L290 TraceCheckUtils]: 58: Hoare triple {38285#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; {38285#false} is VALID [2022-02-20 20:00:25,073 INFO L290 TraceCheckUtils]: 59: Hoare triple {38285#false} assume 0 == ~p_dw_pc~0; {38285#false} is VALID [2022-02-20 20:00:25,073 INFO L290 TraceCheckUtils]: 60: Hoare triple {38285#false} assume !false; {38285#false} is VALID [2022-02-20 20:00:25,073 INFO L290 TraceCheckUtils]: 61: Hoare triple {38285#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {38285#false} is VALID [2022-02-20 20:00:25,073 INFO L290 TraceCheckUtils]: 62: Hoare triple {38285#false} assume { :end_inline_do_write_p } true; {38285#false} is VALID [2022-02-20 20:00:25,073 INFO L290 TraceCheckUtils]: 63: Hoare triple {38285#false} assume !(0 == ~c_dr_st~0); {38285#false} is VALID [2022-02-20 20:00:25,073 INFO L290 TraceCheckUtils]: 64: Hoare triple {38285#false} assume !false; {38285#false} is VALID [2022-02-20 20:00:25,073 INFO L272 TraceCheckUtils]: 65: Hoare triple {38285#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {38284#true} is VALID [2022-02-20 20:00:25,073 INFO L290 TraceCheckUtils]: 66: Hoare triple {38284#true} havoc ~__retres1~2; {38284#true} is VALID [2022-02-20 20:00:25,074 INFO L290 TraceCheckUtils]: 67: Hoare triple {38284#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38284#true} is VALID [2022-02-20 20:00:25,074 INFO L290 TraceCheckUtils]: 68: Hoare triple {38284#true} #res := ~__retres1~2; {38284#true} is VALID [2022-02-20 20:00:25,074 INFO L290 TraceCheckUtils]: 69: Hoare triple {38284#true} assume true; {38284#true} is VALID [2022-02-20 20:00:25,074 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {38284#true} {38285#false} #1169#return; {38285#false} is VALID [2022-02-20 20:00:25,086 INFO L290 TraceCheckUtils]: 71: Hoare triple {38285#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; {38285#false} is VALID [2022-02-20 20:00:25,095 INFO L290 TraceCheckUtils]: 72: Hoare triple {38285#false} assume 0 != eval1_~tmp___1~0#1; {38285#false} is VALID [2022-02-20 20:00:25,096 INFO L290 TraceCheckUtils]: 73: Hoare triple {38285#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; {38285#false} is VALID [2022-02-20 20:00:25,096 INFO L290 TraceCheckUtils]: 74: Hoare triple {38285#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; {38285#false} is VALID [2022-02-20 20:00:25,096 INFO L290 TraceCheckUtils]: 75: Hoare triple {38285#false} assume !(0 == ~p_dw_pc~0); {38285#false} is VALID [2022-02-20 20:00:25,096 INFO L290 TraceCheckUtils]: 76: Hoare triple {38285#false} assume 1 == ~p_dw_pc~0; {38285#false} is VALID [2022-02-20 20:00:25,096 INFO L290 TraceCheckUtils]: 77: Hoare triple {38285#false} assume !(0 == ~q_free~0); {38285#false} is VALID [2022-02-20 20:00:25,096 INFO L290 TraceCheckUtils]: 78: Hoare triple {38285#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; {38285#false} is VALID [2022-02-20 20:00:25,096 INFO L290 TraceCheckUtils]: 79: Hoare triple {38285#false} assume !false; {38285#false} is VALID [2022-02-20 20:00:25,097 INFO L290 TraceCheckUtils]: 80: Hoare triple {38285#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {38285#false} is VALID [2022-02-20 20:00:25,097 INFO L290 TraceCheckUtils]: 81: Hoare triple {38285#false} assume { :end_inline_do_write_p } true; {38285#false} is VALID [2022-02-20 20:00:25,097 INFO L290 TraceCheckUtils]: 82: Hoare triple {38285#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; {38285#false} is VALID [2022-02-20 20:00:25,097 INFO L290 TraceCheckUtils]: 83: Hoare triple {38285#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; {38285#false} is VALID [2022-02-20 20:00:25,097 INFO L290 TraceCheckUtils]: 84: Hoare triple {38285#false} assume !(0 == ~c_dr_pc~0); {38285#false} is VALID [2022-02-20 20:00:25,097 INFO L290 TraceCheckUtils]: 85: Hoare triple {38285#false} assume 2 == ~c_dr_pc~0; {38285#false} is VALID [2022-02-20 20:00:25,097 INFO L290 TraceCheckUtils]: 86: Hoare triple {38285#false} do_read_c_~a~0#1 := ~a_t~0; {38285#false} is VALID [2022-02-20 20:00:25,097 INFO L290 TraceCheckUtils]: 87: Hoare triple {38285#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; {38285#false} is VALID [2022-02-20 20:00:25,097 INFO L290 TraceCheckUtils]: 88: Hoare triple {38285#false} assume !(~p_last_write~0 == ~c_last_read~0); {38285#false} is VALID [2022-02-20 20:00:25,098 INFO L272 TraceCheckUtils]: 89: Hoare triple {38285#false} call error1(); {38285#false} is VALID [2022-02-20 20:00:25,098 INFO L290 TraceCheckUtils]: 90: Hoare triple {38285#false} assume !false; {38285#false} is VALID [2022-02-20 20:00:25,098 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:25,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:25,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821125945] [2022-02-20 20:00:25,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821125945] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:25,099 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:25,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:25,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550206094] [2022-02-20 20:00:25,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:25,099 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:25,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:25,100 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:25,144 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:25,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:25,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:25,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:25,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:25,146 INFO L87 Difference]: Start difference. First operand 1842 states and 2417 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:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:28,314 INFO L93 Difference]: Finished difference Result 3667 states and 4819 transitions. [2022-02-20 20:00:28,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:00:28,314 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:28,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:28,315 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:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 632 transitions. [2022-02-20 20:00:28,318 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:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 632 transitions. [2022-02-20 20:00:28,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 632 transitions. [2022-02-20 20:00:28,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 632 edges. 632 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:28,920 INFO L225 Difference]: With dead ends: 3667 [2022-02-20 20:00:28,920 INFO L226 Difference]: Without dead ends: 2036 [2022-02-20 20:00:28,923 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:28,923 INFO L933 BasicCegarLoop]: 441 mSDtfsCounter, 378 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:28,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 1985 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 20:00:28,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2022-02-20 20:00:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1902. [2022-02-20 20:00:29,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:29,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2036 states. Second operand has 1902 states, 1511 states have (on average 1.3163467902051622) internal successors, (1989), 1536 states have internal predecessors, (1989), 211 states have call successors, (211), 139 states have call predecessors, (211), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) [2022-02-20 20:00:29,081 INFO L74 IsIncluded]: Start isIncluded. First operand 2036 states. Second operand has 1902 states, 1511 states have (on average 1.3163467902051622) internal successors, (1989), 1536 states have internal predecessors, (1989), 211 states have call successors, (211), 139 states have call predecessors, (211), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) [2022-02-20 20:00:29,083 INFO L87 Difference]: Start difference. First operand 2036 states. Second operand has 1902 states, 1511 states have (on average 1.3163467902051622) internal successors, (1989), 1536 states have internal predecessors, (1989), 211 states have call successors, (211), 139 states have call predecessors, (211), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) [2022-02-20 20:00:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:29,212 INFO L93 Difference]: Finished difference Result 2036 states and 2660 transitions. [2022-02-20 20:00:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2660 transitions. [2022-02-20 20:00:29,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:29,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:29,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 1902 states, 1511 states have (on average 1.3163467902051622) internal successors, (1989), 1536 states have internal predecessors, (1989), 211 states have call successors, (211), 139 states have call predecessors, (211), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) Second operand 2036 states. [2022-02-20 20:00:29,221 INFO L87 Difference]: Start difference. First operand has 1902 states, 1511 states have (on average 1.3163467902051622) internal successors, (1989), 1536 states have internal predecessors, (1989), 211 states have call successors, (211), 139 states have call predecessors, (211), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) Second operand 2036 states. [2022-02-20 20:00:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:29,351 INFO L93 Difference]: Finished difference Result 2036 states and 2660 transitions. [2022-02-20 20:00:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2660 transitions. [2022-02-20 20:00:29,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:29,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:29,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:29,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1511 states have (on average 1.3163467902051622) internal successors, (1989), 1536 states have internal predecessors, (1989), 211 states have call successors, (211), 139 states have call predecessors, (211), 178 states have return successors, (271), 229 states have call predecessors, (271), 209 states have call successors, (271) [2022-02-20 20:00:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2471 transitions. [2022-02-20 20:00:29,520 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2471 transitions. Word has length 91 [2022-02-20 20:00:29,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:29,521 INFO L470 AbstractCegarLoop]: Abstraction has 1902 states and 2471 transitions. [2022-02-20 20:00:29,521 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:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2471 transitions. [2022-02-20 20:00:29,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:29,525 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:29,525 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:29,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:00:29,526 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:29,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:29,526 INFO L85 PathProgramCache]: Analyzing trace with hash -476761594, now seen corresponding path program 1 times [2022-02-20 20:00:29,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:29,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068136000] [2022-02-20 20:00:29,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:29,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:29,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:29,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {49961#(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); {49962#(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:29,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {49962#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {49962#(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:29,574 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49962#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {49916#(= ~q_write_ev~0 ~q_read_ev~0)} #1161#return; {49916#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:29,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {49962#(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); {49962#(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:29,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {49962#(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); {49962#(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:29,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {49962#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {49962#(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:29,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49962#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {49916#(= ~q_write_ev~0 ~q_read_ev~0)} #1163#return; {49916#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:29,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:29,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {49914#true} havoc ~__retres1~0; {49914#true} is VALID [2022-02-20 20:00:29,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {49914#true} assume !(1 == ~p_dw_pc~0); {49914#true} is VALID [2022-02-20 20:00:29,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {49914#true} assume !(2 == ~p_dw_pc~0); {49914#true} is VALID [2022-02-20 20:00:29,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {49914#true} ~__retres1~0 := 0; {49914#true} is VALID [2022-02-20 20:00:29,599 INFO L290 TraceCheckUtils]: 4: Hoare triple {49914#true} #res := ~__retres1~0; {49914#true} is VALID [2022-02-20 20:00:29,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {49914#true} assume true; {49914#true} is VALID [2022-02-20 20:00:29,599 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {49914#true} {49914#true} #1157#return; {49914#true} is VALID [2022-02-20 20:00:29,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:29,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {49914#true} havoc ~__retres1~1; {49914#true} is VALID [2022-02-20 20:00:29,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {49914#true} assume !(1 == ~c_dr_pc~0); {49914#true} is VALID [2022-02-20 20:00:29,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {49914#true} assume !(2 == ~c_dr_pc~0); {49914#true} is VALID [2022-02-20 20:00:29,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {49914#true} ~__retres1~1 := 0; {49914#true} is VALID [2022-02-20 20:00:29,603 INFO L290 TraceCheckUtils]: 4: Hoare triple {49914#true} #res := ~__retres1~1; {49914#true} is VALID [2022-02-20 20:00:29,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {49914#true} assume true; {49914#true} is VALID [2022-02-20 20:00:29,603 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {49914#true} {49914#true} #1159#return; {49914#true} is VALID [2022-02-20 20:00:29,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {49963#(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; {49914#true} is VALID [2022-02-20 20:00:29,603 INFO L272 TraceCheckUtils]: 1: Hoare triple {49914#true} call #t~ret8 := is_do_write_p_triggered(); {49914#true} is VALID [2022-02-20 20:00:29,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {49914#true} havoc ~__retres1~0; {49914#true} is VALID [2022-02-20 20:00:29,604 INFO L290 TraceCheckUtils]: 3: Hoare triple {49914#true} assume !(1 == ~p_dw_pc~0); {49914#true} is VALID [2022-02-20 20:00:29,604 INFO L290 TraceCheckUtils]: 4: Hoare triple {49914#true} assume !(2 == ~p_dw_pc~0); {49914#true} is VALID [2022-02-20 20:00:29,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {49914#true} ~__retres1~0 := 0; {49914#true} is VALID [2022-02-20 20:00:29,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {49914#true} #res := ~__retres1~0; {49914#true} is VALID [2022-02-20 20:00:29,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {49914#true} assume true; {49914#true} is VALID [2022-02-20 20:00:29,604 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {49914#true} {49914#true} #1157#return; {49914#true} is VALID [2022-02-20 20:00:29,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {49914#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {49914#true} is VALID [2022-02-20 20:00:29,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {49914#true} assume !(0 != ~tmp~1); {49914#true} is VALID [2022-02-20 20:00:29,605 INFO L272 TraceCheckUtils]: 11: Hoare triple {49914#true} call #t~ret9 := is_do_read_c_triggered(); {49914#true} is VALID [2022-02-20 20:00:29,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {49914#true} havoc ~__retres1~1; {49914#true} is VALID [2022-02-20 20:00:29,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {49914#true} assume !(1 == ~c_dr_pc~0); {49914#true} is VALID [2022-02-20 20:00:29,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {49914#true} assume !(2 == ~c_dr_pc~0); {49914#true} is VALID [2022-02-20 20:00:29,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {49914#true} ~__retres1~1 := 0; {49914#true} is VALID [2022-02-20 20:00:29,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {49914#true} #res := ~__retres1~1; {49914#true} is VALID [2022-02-20 20:00:29,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {49914#true} assume true; {49914#true} is VALID [2022-02-20 20:00:29,606 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {49914#true} {49914#true} #1159#return; {49914#true} is VALID [2022-02-20 20:00:29,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {49914#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {49914#true} is VALID [2022-02-20 20:00:29,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {49914#true} assume !(0 != ~tmp___0~1); {49914#true} is VALID [2022-02-20 20:00:29,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {49914#true} assume true; {49914#true} is VALID [2022-02-20 20:00:29,607 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {49914#true} {49916#(= ~q_write_ev~0 ~q_read_ev~0)} #1165#return; {49916#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:29,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {49962#(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); {49978#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:00:29,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {49978#(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; {49979#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:29,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {49979#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {49979#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:29,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49979#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {49916#(= ~q_write_ev~0 ~q_read_ev~0)} #1167#return; {49915#false} is VALID [2022-02-20 20:00:29,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:29,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {49914#true} havoc ~__retres1~2; {49914#true} is VALID [2022-02-20 20:00:29,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {49914#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {49914#true} is VALID [2022-02-20 20:00:29,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {49914#true} #res := ~__retres1~2; {49914#true} is VALID [2022-02-20 20:00:29,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {49914#true} assume true; {49914#true} is VALID [2022-02-20 20:00:29,631 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {49914#true} {49915#false} #1169#return; {49915#false} is VALID [2022-02-20 20:00:29,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:29,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {49914#true} havoc ~__retres1~2; {49914#true} is VALID [2022-02-20 20:00:29,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {49914#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {49914#true} is VALID [2022-02-20 20:00:29,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {49914#true} #res := ~__retres1~2; {49914#true} is VALID [2022-02-20 20:00:29,634 INFO L290 TraceCheckUtils]: 3: Hoare triple {49914#true} assume true; {49914#true} is VALID [2022-02-20 20:00:29,634 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {49914#true} {49915#false} #1169#return; {49915#false} is VALID [2022-02-20 20:00:29,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {49914#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {49914#true} is VALID [2022-02-20 20:00:29,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {49914#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {49914#true} is VALID [2022-02-20 20:00:29,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {49914#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#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; {49916#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,635 INFO L290 TraceCheckUtils]: 3: Hoare triple {49916#(= ~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; {49916#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {49916#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {49961#(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:29,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {49961#(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); {49962#(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:29,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {49962#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {49962#(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:29,637 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {49962#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {49916#(= ~q_write_ev~0 ~q_read_ev~0)} #1161#return; {49916#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {49916#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {49916#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {49916#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {49916#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {49916#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {49916#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {49916#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {49916#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,638 INFO L272 TraceCheckUtils]: 12: Hoare triple {49916#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {49962#(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:29,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {49962#(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); {49962#(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:29,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {49962#(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); {49962#(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:29,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {49962#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {49962#(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:29,640 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {49962#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {49916#(= ~q_write_ev~0 ~q_read_ev~0)} #1163#return; {49916#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,640 INFO L272 TraceCheckUtils]: 17: Hoare triple {49916#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {49963#(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:29,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {49963#(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; {49914#true} is VALID [2022-02-20 20:00:29,640 INFO L272 TraceCheckUtils]: 19: Hoare triple {49914#true} call #t~ret8 := is_do_write_p_triggered(); {49914#true} is VALID [2022-02-20 20:00:29,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {49914#true} havoc ~__retres1~0; {49914#true} is VALID [2022-02-20 20:00:29,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {49914#true} assume !(1 == ~p_dw_pc~0); {49914#true} is VALID [2022-02-20 20:00:29,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {49914#true} assume !(2 == ~p_dw_pc~0); {49914#true} is VALID [2022-02-20 20:00:29,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {49914#true} ~__retres1~0 := 0; {49914#true} is VALID [2022-02-20 20:00:29,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {49914#true} #res := ~__retres1~0; {49914#true} is VALID [2022-02-20 20:00:29,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {49914#true} assume true; {49914#true} is VALID [2022-02-20 20:00:29,641 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {49914#true} {49914#true} #1157#return; {49914#true} is VALID [2022-02-20 20:00:29,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {49914#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {49914#true} is VALID [2022-02-20 20:00:29,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {49914#true} assume !(0 != ~tmp~1); {49914#true} is VALID [2022-02-20 20:00:29,641 INFO L272 TraceCheckUtils]: 29: Hoare triple {49914#true} call #t~ret9 := is_do_read_c_triggered(); {49914#true} is VALID [2022-02-20 20:00:29,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {49914#true} havoc ~__retres1~1; {49914#true} is VALID [2022-02-20 20:00:29,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {49914#true} assume !(1 == ~c_dr_pc~0); {49914#true} is VALID [2022-02-20 20:00:29,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {49914#true} assume !(2 == ~c_dr_pc~0); {49914#true} is VALID [2022-02-20 20:00:29,642 INFO L290 TraceCheckUtils]: 33: Hoare triple {49914#true} ~__retres1~1 := 0; {49914#true} is VALID [2022-02-20 20:00:29,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {49914#true} #res := ~__retres1~1; {49914#true} is VALID [2022-02-20 20:00:29,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {49914#true} assume true; {49914#true} is VALID [2022-02-20 20:00:29,642 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {49914#true} {49914#true} #1159#return; {49914#true} is VALID [2022-02-20 20:00:29,642 INFO L290 TraceCheckUtils]: 37: Hoare triple {49914#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {49914#true} is VALID [2022-02-20 20:00:29,642 INFO L290 TraceCheckUtils]: 38: Hoare triple {49914#true} assume !(0 != ~tmp___0~1); {49914#true} is VALID [2022-02-20 20:00:29,643 INFO L290 TraceCheckUtils]: 39: Hoare triple {49914#true} assume true; {49914#true} is VALID [2022-02-20 20:00:29,643 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {49914#true} {49916#(= ~q_write_ev~0 ~q_read_ev~0)} #1165#return; {49916#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:29,643 INFO L272 TraceCheckUtils]: 41: Hoare triple {49916#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {49962#(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:29,644 INFO L290 TraceCheckUtils]: 42: Hoare triple {49962#(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); {49978#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:00:29,644 INFO L290 TraceCheckUtils]: 43: Hoare triple {49978#(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; {49979#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:29,644 INFO L290 TraceCheckUtils]: 44: Hoare triple {49979#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {49979#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:29,645 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {49979#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {49916#(= ~q_write_ev~0 ~q_read_ev~0)} #1167#return; {49915#false} is VALID [2022-02-20 20:00:29,645 INFO L290 TraceCheckUtils]: 46: Hoare triple {49915#false} assume !false; {49915#false} is VALID [2022-02-20 20:00:29,645 INFO L290 TraceCheckUtils]: 47: Hoare triple {49915#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; {49915#false} is VALID [2022-02-20 20:00:29,645 INFO L290 TraceCheckUtils]: 48: Hoare triple {49915#false} assume !false; {49915#false} is VALID [2022-02-20 20:00:29,645 INFO L272 TraceCheckUtils]: 49: Hoare triple {49915#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {49914#true} is VALID [2022-02-20 20:00:29,645 INFO L290 TraceCheckUtils]: 50: Hoare triple {49914#true} havoc ~__retres1~2; {49914#true} is VALID [2022-02-20 20:00:29,645 INFO L290 TraceCheckUtils]: 51: Hoare triple {49914#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {49914#true} is VALID [2022-02-20 20:00:29,645 INFO L290 TraceCheckUtils]: 52: Hoare triple {49914#true} #res := ~__retres1~2; {49914#true} is VALID [2022-02-20 20:00:29,645 INFO L290 TraceCheckUtils]: 53: Hoare triple {49914#true} assume true; {49914#true} is VALID [2022-02-20 20:00:29,646 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {49914#true} {49915#false} #1169#return; {49915#false} is VALID [2022-02-20 20:00:29,646 INFO L290 TraceCheckUtils]: 55: Hoare triple {49915#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; {49915#false} is VALID [2022-02-20 20:00:29,646 INFO L290 TraceCheckUtils]: 56: Hoare triple {49915#false} assume 0 != eval1_~tmp___1~0#1; {49915#false} is VALID [2022-02-20 20:00:29,646 INFO L290 TraceCheckUtils]: 57: Hoare triple {49915#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; {49915#false} is VALID [2022-02-20 20:00:29,646 INFO L290 TraceCheckUtils]: 58: Hoare triple {49915#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; {49915#false} is VALID [2022-02-20 20:00:29,646 INFO L290 TraceCheckUtils]: 59: Hoare triple {49915#false} assume 0 == ~p_dw_pc~0; {49915#false} is VALID [2022-02-20 20:00:29,646 INFO L290 TraceCheckUtils]: 60: Hoare triple {49915#false} assume !false; {49915#false} is VALID [2022-02-20 20:00:29,646 INFO L290 TraceCheckUtils]: 61: Hoare triple {49915#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {49915#false} is VALID [2022-02-20 20:00:29,647 INFO L290 TraceCheckUtils]: 62: Hoare triple {49915#false} assume { :end_inline_do_write_p } true; {49915#false} is VALID [2022-02-20 20:00:29,647 INFO L290 TraceCheckUtils]: 63: Hoare triple {49915#false} assume !(0 == ~c_dr_st~0); {49915#false} is VALID [2022-02-20 20:00:29,647 INFO L290 TraceCheckUtils]: 64: Hoare triple {49915#false} assume !false; {49915#false} is VALID [2022-02-20 20:00:29,647 INFO L272 TraceCheckUtils]: 65: Hoare triple {49915#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {49914#true} is VALID [2022-02-20 20:00:29,647 INFO L290 TraceCheckUtils]: 66: Hoare triple {49914#true} havoc ~__retres1~2; {49914#true} is VALID [2022-02-20 20:00:29,647 INFO L290 TraceCheckUtils]: 67: Hoare triple {49914#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {49914#true} is VALID [2022-02-20 20:00:29,647 INFO L290 TraceCheckUtils]: 68: Hoare triple {49914#true} #res := ~__retres1~2; {49914#true} is VALID [2022-02-20 20:00:29,647 INFO L290 TraceCheckUtils]: 69: Hoare triple {49914#true} assume true; {49914#true} is VALID [2022-02-20 20:00:29,647 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {49914#true} {49915#false} #1169#return; {49915#false} is VALID [2022-02-20 20:00:29,648 INFO L290 TraceCheckUtils]: 71: Hoare triple {49915#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; {49915#false} is VALID [2022-02-20 20:00:29,648 INFO L290 TraceCheckUtils]: 72: Hoare triple {49915#false} assume 0 != eval1_~tmp___1~0#1; {49915#false} is VALID [2022-02-20 20:00:29,648 INFO L290 TraceCheckUtils]: 73: Hoare triple {49915#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; {49915#false} is VALID [2022-02-20 20:00:29,648 INFO L290 TraceCheckUtils]: 74: Hoare triple {49915#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; {49915#false} is VALID [2022-02-20 20:00:29,648 INFO L290 TraceCheckUtils]: 75: Hoare triple {49915#false} assume !(0 == ~p_dw_pc~0); {49915#false} is VALID [2022-02-20 20:00:29,648 INFO L290 TraceCheckUtils]: 76: Hoare triple {49915#false} assume 1 == ~p_dw_pc~0; {49915#false} is VALID [2022-02-20 20:00:29,648 INFO L290 TraceCheckUtils]: 77: Hoare triple {49915#false} assume !(0 == ~q_free~0); {49915#false} is VALID [2022-02-20 20:00:29,648 INFO L290 TraceCheckUtils]: 78: Hoare triple {49915#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; {49915#false} is VALID [2022-02-20 20:00:29,649 INFO L290 TraceCheckUtils]: 79: Hoare triple {49915#false} assume !false; {49915#false} is VALID [2022-02-20 20:00:29,649 INFO L290 TraceCheckUtils]: 80: Hoare triple {49915#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {49915#false} is VALID [2022-02-20 20:00:29,649 INFO L290 TraceCheckUtils]: 81: Hoare triple {49915#false} assume { :end_inline_do_write_p } true; {49915#false} is VALID [2022-02-20 20:00:29,649 INFO L290 TraceCheckUtils]: 82: Hoare triple {49915#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; {49915#false} is VALID [2022-02-20 20:00:29,649 INFO L290 TraceCheckUtils]: 83: Hoare triple {49915#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; {49915#false} is VALID [2022-02-20 20:00:29,649 INFO L290 TraceCheckUtils]: 84: Hoare triple {49915#false} assume !(0 == ~c_dr_pc~0); {49915#false} is VALID [2022-02-20 20:00:29,649 INFO L290 TraceCheckUtils]: 85: Hoare triple {49915#false} assume 2 == ~c_dr_pc~0; {49915#false} is VALID [2022-02-20 20:00:29,649 INFO L290 TraceCheckUtils]: 86: Hoare triple {49915#false} do_read_c_~a~0#1 := ~a_t~0; {49915#false} is VALID [2022-02-20 20:00:29,649 INFO L290 TraceCheckUtils]: 87: Hoare triple {49915#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; {49915#false} is VALID [2022-02-20 20:00:29,650 INFO L290 TraceCheckUtils]: 88: Hoare triple {49915#false} assume !(~p_last_write~0 == ~c_last_read~0); {49915#false} is VALID [2022-02-20 20:00:29,650 INFO L272 TraceCheckUtils]: 89: Hoare triple {49915#false} call error1(); {49915#false} is VALID [2022-02-20 20:00:29,650 INFO L290 TraceCheckUtils]: 90: Hoare triple {49915#false} assume !false; {49915#false} is VALID [2022-02-20 20:00:29,650 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:29,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:29,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068136000] [2022-02-20 20:00:29,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068136000] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:29,651 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:29,651 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:29,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838858010] [2022-02-20 20:00:29,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:29,651 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:29,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:29,652 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:29,685 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:29,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:29,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:29,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:29,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:29,687 INFO L87 Difference]: Start difference. First operand 1902 states and 2471 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:32,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:32,601 INFO L93 Difference]: Finished difference Result 3429 states and 4435 transitions. [2022-02-20 20:00:32,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 20:00:32,601 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:32,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:32,602 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:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 824 transitions. [2022-02-20 20:00:32,606 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:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 824 transitions. [2022-02-20 20:00:32,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 824 transitions. [2022-02-20 20:00:33,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 824 edges. 824 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:33,362 INFO L225 Difference]: With dead ends: 3429 [2022-02-20 20:00:33,362 INFO L226 Difference]: Without dead ends: 1976 [2022-02-20 20:00:33,366 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:33,366 INFO L933 BasicCegarLoop]: 479 mSDtfsCounter, 1123 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:33,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1149 Valid, 1422 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 20:00:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2022-02-20 20:00:33,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1681. [2022-02-20 20:00:33,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:33,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1976 states. Second operand has 1681 states, 1343 states have (on average 1.3186895011169024) internal successors, (1771), 1363 states have internal predecessors, (1771), 183 states have call successors, (183), 120 states have call predecessors, (183), 153 states have return successors, (231), 199 states have call predecessors, (231), 181 states have call successors, (231) [2022-02-20 20:00:33,468 INFO L74 IsIncluded]: Start isIncluded. First operand 1976 states. Second operand has 1681 states, 1343 states have (on average 1.3186895011169024) internal successors, (1771), 1363 states have internal predecessors, (1771), 183 states have call successors, (183), 120 states have call predecessors, (183), 153 states have return successors, (231), 199 states have call predecessors, (231), 181 states have call successors, (231) [2022-02-20 20:00:33,470 INFO L87 Difference]: Start difference. First operand 1976 states. Second operand has 1681 states, 1343 states have (on average 1.3186895011169024) internal successors, (1771), 1363 states have internal predecessors, (1771), 183 states have call successors, (183), 120 states have call predecessors, (183), 153 states have return successors, (231), 199 states have call predecessors, (231), 181 states have call successors, (231) [2022-02-20 20:00:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:33,615 INFO L93 Difference]: Finished difference Result 1976 states and 2558 transitions. [2022-02-20 20:00:33,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2558 transitions. [2022-02-20 20:00:33,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:33,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:33,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 1681 states, 1343 states have (on average 1.3186895011169024) internal successors, (1771), 1363 states have internal predecessors, (1771), 183 states have call successors, (183), 120 states have call predecessors, (183), 153 states have return successors, (231), 199 states have call predecessors, (231), 181 states have call successors, (231) Second operand 1976 states. [2022-02-20 20:00:33,624 INFO L87 Difference]: Start difference. First operand has 1681 states, 1343 states have (on average 1.3186895011169024) internal successors, (1771), 1363 states have internal predecessors, (1771), 183 states have call successors, (183), 120 states have call predecessors, (183), 153 states have return successors, (231), 199 states have call predecessors, (231), 181 states have call successors, (231) Second operand 1976 states. [2022-02-20 20:00:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:33,752 INFO L93 Difference]: Finished difference Result 1976 states and 2558 transitions. [2022-02-20 20:00:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2558 transitions. [2022-02-20 20:00:33,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:33,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:33,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:33,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1343 states have (on average 1.3186895011169024) internal successors, (1771), 1363 states have internal predecessors, (1771), 183 states have call successors, (183), 120 states have call predecessors, (183), 153 states have return successors, (231), 199 states have call predecessors, (231), 181 states have call successors, (231) [2022-02-20 20:00:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2185 transitions. [2022-02-20 20:00:33,886 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2185 transitions. Word has length 91 [2022-02-20 20:00:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:33,886 INFO L470 AbstractCegarLoop]: Abstraction has 1681 states and 2185 transitions. [2022-02-20 20:00:33,886 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:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2185 transitions. [2022-02-20 20:00:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:33,887 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:33,887 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:33,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:00:33,888 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:33,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:33,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1462400452, now seen corresponding path program 1 times [2022-02-20 20:00:33,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:33,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936853328] [2022-02-20 20:00:33,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:33,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {60822#(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); {60775#true} is VALID [2022-02-20 20:00:33,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {60775#true} assume true; {60775#true} is VALID [2022-02-20 20:00:33,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60775#true} {60775#true} #1161#return; {60775#true} is VALID [2022-02-20 20:00:33,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {60823#(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); {60775#true} is VALID [2022-02-20 20:00:33,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {60775#true} assume !(0 == ~q_write_ev~0); {60775#true} is VALID [2022-02-20 20:00:33,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {60775#true} assume true; {60775#true} is VALID [2022-02-20 20:00:33,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60775#true} {60780#(= ~c_dr_st~0 0)} #1163#return; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {60775#true} havoc ~__retres1~0; {60775#true} is VALID [2022-02-20 20:00:33,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {60775#true} assume !(1 == ~p_dw_pc~0); {60775#true} is VALID [2022-02-20 20:00:33,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {60775#true} assume !(2 == ~p_dw_pc~0); {60775#true} is VALID [2022-02-20 20:00:33,958 INFO L290 TraceCheckUtils]: 3: Hoare triple {60775#true} ~__retres1~0 := 0; {60775#true} is VALID [2022-02-20 20:00:33,958 INFO L290 TraceCheckUtils]: 4: Hoare triple {60775#true} #res := ~__retres1~0; {60775#true} is VALID [2022-02-20 20:00:33,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {60775#true} assume true; {60775#true} is VALID [2022-02-20 20:00:33,958 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {60775#true} {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1157#return; {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {60775#true} havoc ~__retres1~1; {60775#true} is VALID [2022-02-20 20:00:33,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {60775#true} assume !(1 == ~c_dr_pc~0); {60775#true} is VALID [2022-02-20 20:00:33,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {60775#true} assume !(2 == ~c_dr_pc~0); {60775#true} is VALID [2022-02-20 20:00:33,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {60775#true} ~__retres1~1 := 0; {60775#true} is VALID [2022-02-20 20:00:33,962 INFO L290 TraceCheckUtils]: 4: Hoare triple {60775#true} #res := ~__retres1~1; {60775#true} is VALID [2022-02-20 20:00:33,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {60775#true} assume true; {60775#true} is VALID [2022-02-20 20:00:33,962 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {60775#true} {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1159#return; {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {60824#(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; {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,963 INFO L272 TraceCheckUtils]: 1: Hoare triple {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {60775#true} is VALID [2022-02-20 20:00:33,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {60775#true} havoc ~__retres1~0; {60775#true} is VALID [2022-02-20 20:00:33,963 INFO L290 TraceCheckUtils]: 3: Hoare triple {60775#true} assume !(1 == ~p_dw_pc~0); {60775#true} is VALID [2022-02-20 20:00:33,963 INFO L290 TraceCheckUtils]: 4: Hoare triple {60775#true} assume !(2 == ~p_dw_pc~0); {60775#true} is VALID [2022-02-20 20:00:33,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {60775#true} ~__retres1~0 := 0; {60775#true} is VALID [2022-02-20 20:00:33,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {60775#true} #res := ~__retres1~0; {60775#true} is VALID [2022-02-20 20:00:33,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {60775#true} assume true; {60775#true} is VALID [2022-02-20 20:00:33,964 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {60775#true} {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1157#return; {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,965 INFO L272 TraceCheckUtils]: 11: Hoare triple {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {60775#true} is VALID [2022-02-20 20:00:33,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {60775#true} havoc ~__retres1~1; {60775#true} is VALID [2022-02-20 20:00:33,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {60775#true} assume !(1 == ~c_dr_pc~0); {60775#true} is VALID [2022-02-20 20:00:33,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {60775#true} assume !(2 == ~c_dr_pc~0); {60775#true} is VALID [2022-02-20 20:00:33,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {60775#true} ~__retres1~1 := 0; {60775#true} is VALID [2022-02-20 20:00:33,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {60775#true} #res := ~__retres1~1; {60775#true} is VALID [2022-02-20 20:00:33,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {60775#true} assume true; {60775#true} is VALID [2022-02-20 20:00:33,966 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {60775#true} {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1159#return; {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,967 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {60780#(= ~c_dr_st~0 0)} #1165#return; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {60823#(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); {60775#true} is VALID [2022-02-20 20:00:33,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {60775#true} assume !(1 == ~q_write_ev~0); {60775#true} is VALID [2022-02-20 20:00:33,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {60775#true} assume true; {60775#true} is VALID [2022-02-20 20:00:33,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60775#true} {60780#(= ~c_dr_st~0 0)} #1167#return; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {60775#true} havoc ~__retres1~2; {60775#true} is VALID [2022-02-20 20:00:33,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {60775#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {60775#true} is VALID [2022-02-20 20:00:33,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {60775#true} #res := ~__retres1~2; {60775#true} is VALID [2022-02-20 20:00:33,974 INFO L290 TraceCheckUtils]: 3: Hoare triple {60775#true} assume true; {60775#true} is VALID [2022-02-20 20:00:33,974 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {60775#true} {60780#(= ~c_dr_st~0 0)} #1169#return; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:33,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {60775#true} havoc ~__retres1~2; {60775#true} is VALID [2022-02-20 20:00:33,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {60775#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {60775#true} is VALID [2022-02-20 20:00:33,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {60775#true} #res := ~__retres1~2; {60775#true} is VALID [2022-02-20 20:00:33,977 INFO L290 TraceCheckUtils]: 3: Hoare triple {60775#true} assume true; {60775#true} is VALID [2022-02-20 20:00:33,977 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {60775#true} {60776#false} #1169#return; {60776#false} is VALID [2022-02-20 20:00:33,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {60775#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {60775#true} is VALID [2022-02-20 20:00:33,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {60775#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {60775#true} is VALID [2022-02-20 20:00:33,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {60775#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#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; {60775#true} is VALID [2022-02-20 20:00:33,978 INFO L290 TraceCheckUtils]: 3: Hoare triple {60775#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; {60775#true} is VALID [2022-02-20 20:00:33,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {60775#true} call update_channels1(); {60822#(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:33,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {60822#(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); {60775#true} is VALID [2022-02-20 20:00:33,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {60775#true} assume true; {60775#true} is VALID [2022-02-20 20:00:33,978 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {60775#true} {60775#true} #1161#return; {60775#true} is VALID [2022-02-20 20:00:33,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {60775#true} assume { :begin_inline_init_threads1 } true; {60775#true} is VALID [2022-02-20 20:00:33,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {60775#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {60775#true} is VALID [2022-02-20 20:00:33,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {60775#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {60780#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads1 } true; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,980 INFO L272 TraceCheckUtils]: 12: Hoare triple {60780#(= ~c_dr_st~0 0)} call fire_delta_events1(); {60823#(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:33,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {60823#(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); {60775#true} is VALID [2022-02-20 20:00:33,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {60775#true} assume !(0 == ~q_write_ev~0); {60775#true} is VALID [2022-02-20 20:00:33,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {60775#true} assume true; {60775#true} is VALID [2022-02-20 20:00:33,980 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {60775#true} {60780#(= ~c_dr_st~0 0)} #1163#return; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,981 INFO L272 TraceCheckUtils]: 17: Hoare triple {60780#(= ~c_dr_st~0 0)} call activate_threads1(); {60824#(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:33,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {60824#(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; {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,981 INFO L272 TraceCheckUtils]: 19: Hoare triple {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {60775#true} is VALID [2022-02-20 20:00:33,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {60775#true} havoc ~__retres1~0; {60775#true} is VALID [2022-02-20 20:00:33,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {60775#true} assume !(1 == ~p_dw_pc~0); {60775#true} is VALID [2022-02-20 20:00:33,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {60775#true} assume !(2 == ~p_dw_pc~0); {60775#true} is VALID [2022-02-20 20:00:33,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {60775#true} ~__retres1~0 := 0; {60775#true} is VALID [2022-02-20 20:00:33,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {60775#true} #res := ~__retres1~0; {60775#true} is VALID [2022-02-20 20:00:33,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {60775#true} assume true; {60775#true} is VALID [2022-02-20 20:00:33,982 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {60775#true} {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1157#return; {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,983 INFO L272 TraceCheckUtils]: 29: Hoare triple {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {60775#true} is VALID [2022-02-20 20:00:33,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {60775#true} havoc ~__retres1~1; {60775#true} is VALID [2022-02-20 20:00:33,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {60775#true} assume !(1 == ~c_dr_pc~0); {60775#true} is VALID [2022-02-20 20:00:33,983 INFO L290 TraceCheckUtils]: 32: Hoare triple {60775#true} assume !(2 == ~c_dr_pc~0); {60775#true} is VALID [2022-02-20 20:00:33,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {60775#true} ~__retres1~1 := 0; {60775#true} is VALID [2022-02-20 20:00:33,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {60775#true} #res := ~__retres1~1; {60775#true} is VALID [2022-02-20 20:00:33,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {60775#true} assume true; {60775#true} is VALID [2022-02-20 20:00:33,984 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {60775#true} {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1159#return; {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:33,985 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {60825#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {60780#(= ~c_dr_st~0 0)} #1165#return; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,986 INFO L272 TraceCheckUtils]: 41: Hoare triple {60780#(= ~c_dr_st~0 0)} call reset_delta_events1(); {60823#(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:33,986 INFO L290 TraceCheckUtils]: 42: Hoare triple {60823#(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); {60775#true} is VALID [2022-02-20 20:00:33,986 INFO L290 TraceCheckUtils]: 43: Hoare triple {60775#true} assume !(1 == ~q_write_ev~0); {60775#true} is VALID [2022-02-20 20:00:33,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {60775#true} assume true; {60775#true} is VALID [2022-02-20 20:00:33,986 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {60775#true} {60780#(= ~c_dr_st~0 0)} #1167#return; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {60780#(= ~c_dr_st~0 0)} assume !false; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {60780#(= ~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; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {60780#(= ~c_dr_st~0 0)} assume !false; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,987 INFO L272 TraceCheckUtils]: 49: Hoare triple {60780#(= ~c_dr_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {60775#true} is VALID [2022-02-20 20:00:33,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {60775#true} havoc ~__retres1~2; {60775#true} is VALID [2022-02-20 20:00:33,988 INFO L290 TraceCheckUtils]: 51: Hoare triple {60775#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {60775#true} is VALID [2022-02-20 20:00:33,988 INFO L290 TraceCheckUtils]: 52: Hoare triple {60775#true} #res := ~__retres1~2; {60775#true} is VALID [2022-02-20 20:00:33,988 INFO L290 TraceCheckUtils]: 53: Hoare triple {60775#true} assume true; {60775#true} is VALID [2022-02-20 20:00:33,988 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {60775#true} {60780#(= ~c_dr_st~0 0)} #1169#return; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,989 INFO L290 TraceCheckUtils]: 55: Hoare triple {60780#(= ~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; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,989 INFO L290 TraceCheckUtils]: 56: Hoare triple {60780#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,989 INFO L290 TraceCheckUtils]: 57: Hoare triple {60780#(= ~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; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,989 INFO L290 TraceCheckUtils]: 58: Hoare triple {60780#(= ~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; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,990 INFO L290 TraceCheckUtils]: 59: Hoare triple {60780#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_pc~0; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,990 INFO L290 TraceCheckUtils]: 60: Hoare triple {60780#(= ~c_dr_st~0 0)} assume !false; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,990 INFO L290 TraceCheckUtils]: 61: Hoare triple {60780#(= ~c_dr_st~0 0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,991 INFO L290 TraceCheckUtils]: 62: Hoare triple {60780#(= ~c_dr_st~0 0)} assume { :end_inline_do_write_p } true; {60780#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:33,991 INFO L290 TraceCheckUtils]: 63: Hoare triple {60780#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {60776#false} is VALID [2022-02-20 20:00:33,991 INFO L290 TraceCheckUtils]: 64: Hoare triple {60776#false} assume !false; {60776#false} is VALID [2022-02-20 20:00:33,991 INFO L272 TraceCheckUtils]: 65: Hoare triple {60776#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {60775#true} is VALID [2022-02-20 20:00:33,991 INFO L290 TraceCheckUtils]: 66: Hoare triple {60775#true} havoc ~__retres1~2; {60775#true} is VALID [2022-02-20 20:00:33,991 INFO L290 TraceCheckUtils]: 67: Hoare triple {60775#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {60775#true} is VALID [2022-02-20 20:00:33,991 INFO L290 TraceCheckUtils]: 68: Hoare triple {60775#true} #res := ~__retres1~2; {60775#true} is VALID [2022-02-20 20:00:33,992 INFO L290 TraceCheckUtils]: 69: Hoare triple {60775#true} assume true; {60775#true} is VALID [2022-02-20 20:00:33,992 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {60775#true} {60776#false} #1169#return; {60776#false} is VALID [2022-02-20 20:00:33,992 INFO L290 TraceCheckUtils]: 71: Hoare triple {60776#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; {60776#false} is VALID [2022-02-20 20:00:33,992 INFO L290 TraceCheckUtils]: 72: Hoare triple {60776#false} assume 0 != eval1_~tmp___1~0#1; {60776#false} is VALID [2022-02-20 20:00:33,992 INFO L290 TraceCheckUtils]: 73: Hoare triple {60776#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; {60776#false} is VALID [2022-02-20 20:00:33,992 INFO L290 TraceCheckUtils]: 74: Hoare triple {60776#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; {60776#false} is VALID [2022-02-20 20:00:33,992 INFO L290 TraceCheckUtils]: 75: Hoare triple {60776#false} assume !(0 == ~p_dw_pc~0); {60776#false} is VALID [2022-02-20 20:00:33,992 INFO L290 TraceCheckUtils]: 76: Hoare triple {60776#false} assume 1 == ~p_dw_pc~0; {60776#false} is VALID [2022-02-20 20:00:33,993 INFO L290 TraceCheckUtils]: 77: Hoare triple {60776#false} assume !(0 == ~q_free~0); {60776#false} is VALID [2022-02-20 20:00:33,993 INFO L290 TraceCheckUtils]: 78: Hoare triple {60776#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; {60776#false} is VALID [2022-02-20 20:00:33,993 INFO L290 TraceCheckUtils]: 79: Hoare triple {60776#false} assume !false; {60776#false} is VALID [2022-02-20 20:00:33,993 INFO L290 TraceCheckUtils]: 80: Hoare triple {60776#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {60776#false} is VALID [2022-02-20 20:00:33,993 INFO L290 TraceCheckUtils]: 81: Hoare triple {60776#false} assume { :end_inline_do_write_p } true; {60776#false} is VALID [2022-02-20 20:00:33,993 INFO L290 TraceCheckUtils]: 82: Hoare triple {60776#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; {60776#false} is VALID [2022-02-20 20:00:33,993 INFO L290 TraceCheckUtils]: 83: Hoare triple {60776#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; {60776#false} is VALID [2022-02-20 20:00:33,993 INFO L290 TraceCheckUtils]: 84: Hoare triple {60776#false} assume !(0 == ~c_dr_pc~0); {60776#false} is VALID [2022-02-20 20:00:33,994 INFO L290 TraceCheckUtils]: 85: Hoare triple {60776#false} assume 2 == ~c_dr_pc~0; {60776#false} is VALID [2022-02-20 20:00:33,994 INFO L290 TraceCheckUtils]: 86: Hoare triple {60776#false} do_read_c_~a~0#1 := ~a_t~0; {60776#false} is VALID [2022-02-20 20:00:33,994 INFO L290 TraceCheckUtils]: 87: Hoare triple {60776#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; {60776#false} is VALID [2022-02-20 20:00:33,994 INFO L290 TraceCheckUtils]: 88: Hoare triple {60776#false} assume !(~p_last_write~0 == ~c_last_read~0); {60776#false} is VALID [2022-02-20 20:00:33,994 INFO L272 TraceCheckUtils]: 89: Hoare triple {60776#false} call error1(); {60776#false} is VALID [2022-02-20 20:00:33,994 INFO L290 TraceCheckUtils]: 90: Hoare triple {60776#false} assume !false; {60776#false} is VALID [2022-02-20 20:00:33,994 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:33,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:33,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936853328] [2022-02-20 20:00:33,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936853328] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:33,995 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:33,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:33,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922988948] [2022-02-20 20:00:33,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:33,996 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:33,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:33,996 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:34,048 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:34,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:34,048 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:34,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:34,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:34,049 INFO L87 Difference]: Start difference. First operand 1681 states and 2185 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:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:36,894 INFO L93 Difference]: Finished difference Result 4833 states and 6297 transitions. [2022-02-20 20:00:36,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:00:36,894 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:36,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:36,896 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:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 773 transitions. [2022-02-20 20:00:36,901 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:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 773 transitions. [2022-02-20 20:00:36,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 773 transitions. [2022-02-20 20:00:37,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 773 edges. 773 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:37,918 INFO L225 Difference]: With dead ends: 4833 [2022-02-20 20:00:37,918 INFO L226 Difference]: Without dead ends: 3364 [2022-02-20 20:00:37,921 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:37,921 INFO L933 BasicCegarLoop]: 475 mSDtfsCounter, 832 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:37,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 1418 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 20:00:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2022-02-20 20:00:38,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 3150. [2022-02-20 20:00:38,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:38,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3364 states. Second operand has 3150 states, 2492 states have (on average 1.2837078651685394) internal successors, (3199), 2541 states have internal predecessors, (3199), 344 states have call successors, (344), 233 states have call predecessors, (344), 312 states have return successors, (514), 378 states have call predecessors, (514), 342 states have call successors, (514) [2022-02-20 20:00:38,088 INFO L74 IsIncluded]: Start isIncluded. First operand 3364 states. Second operand has 3150 states, 2492 states have (on average 1.2837078651685394) internal successors, (3199), 2541 states have internal predecessors, (3199), 344 states have call successors, (344), 233 states have call predecessors, (344), 312 states have return successors, (514), 378 states have call predecessors, (514), 342 states have call successors, (514) [2022-02-20 20:00:38,093 INFO L87 Difference]: Start difference. First operand 3364 states. Second operand has 3150 states, 2492 states have (on average 1.2837078651685394) internal successors, (3199), 2541 states have internal predecessors, (3199), 344 states have call successors, (344), 233 states have call predecessors, (344), 312 states have return successors, (514), 378 states have call predecessors, (514), 342 states have call successors, (514) [2022-02-20 20:00:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:38,470 INFO L93 Difference]: Finished difference Result 3364 states and 4353 transitions. [2022-02-20 20:00:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 4353 transitions. [2022-02-20 20:00:38,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:38,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:38,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 3150 states, 2492 states have (on average 1.2837078651685394) internal successors, (3199), 2541 states have internal predecessors, (3199), 344 states have call successors, (344), 233 states have call predecessors, (344), 312 states have return successors, (514), 378 states have call predecessors, (514), 342 states have call successors, (514) Second operand 3364 states. [2022-02-20 20:00:38,483 INFO L87 Difference]: Start difference. First operand has 3150 states, 2492 states have (on average 1.2837078651685394) internal successors, (3199), 2541 states have internal predecessors, (3199), 344 states have call successors, (344), 233 states have call predecessors, (344), 312 states have return successors, (514), 378 states have call predecessors, (514), 342 states have call successors, (514) Second operand 3364 states. [2022-02-20 20:00:38,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:38,860 INFO L93 Difference]: Finished difference Result 3364 states and 4353 transitions. [2022-02-20 20:00:38,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 4353 transitions. [2022-02-20 20:00:38,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:38,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:38,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:38,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3150 states, 2492 states have (on average 1.2837078651685394) internal successors, (3199), 2541 states have internal predecessors, (3199), 344 states have call successors, (344), 233 states have call predecessors, (344), 312 states have return successors, (514), 378 states have call predecessors, (514), 342 states have call successors, (514) [2022-02-20 20:00:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 3150 states and 4057 transitions. [2022-02-20 20:00:39,350 INFO L78 Accepts]: Start accepts. Automaton has 3150 states and 4057 transitions. Word has length 91 [2022-02-20 20:00:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:39,350 INFO L470 AbstractCegarLoop]: Abstraction has 3150 states and 4057 transitions. [2022-02-20 20:00:39,350 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:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 4057 transitions. [2022-02-20 20:00:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:39,351 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:39,352 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:39,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:00:39,352 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:39,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:39,352 INFO L85 PathProgramCache]: Analyzing trace with hash 404562374, now seen corresponding path program 1 times [2022-02-20 20:00:39,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:39,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714466018] [2022-02-20 20:00:39,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:39,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {78328#(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); {78281#true} is VALID [2022-02-20 20:00:39,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78281#true} {78283#(= 1 ~c_dr_i~0)} #1161#return; {78283#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:39,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {78329#(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); {78281#true} is VALID [2022-02-20 20:00:39,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {78281#true} assume !(0 == ~q_write_ev~0); {78281#true} is VALID [2022-02-20 20:00:39,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78281#true} {78282#false} #1163#return; {78282#false} is VALID [2022-02-20 20:00:39,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {78281#true} havoc ~__retres1~0; {78281#true} is VALID [2022-02-20 20:00:39,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {78281#true} assume !(1 == ~p_dw_pc~0); {78281#true} is VALID [2022-02-20 20:00:39,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {78281#true} assume !(2 == ~p_dw_pc~0); {78281#true} is VALID [2022-02-20 20:00:39,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {78281#true} ~__retres1~0 := 0; {78281#true} is VALID [2022-02-20 20:00:39,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {78281#true} #res := ~__retres1~0; {78281#true} is VALID [2022-02-20 20:00:39,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,405 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {78281#true} {78281#true} #1157#return; {78281#true} is VALID [2022-02-20 20:00:39,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {78281#true} havoc ~__retres1~1; {78281#true} is VALID [2022-02-20 20:00:39,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {78281#true} assume !(1 == ~c_dr_pc~0); {78281#true} is VALID [2022-02-20 20:00:39,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {78281#true} assume !(2 == ~c_dr_pc~0); {78281#true} is VALID [2022-02-20 20:00:39,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {78281#true} ~__retres1~1 := 0; {78281#true} is VALID [2022-02-20 20:00:39,409 INFO L290 TraceCheckUtils]: 4: Hoare triple {78281#true} #res := ~__retres1~1; {78281#true} is VALID [2022-02-20 20:00:39,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,409 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {78281#true} {78281#true} #1159#return; {78281#true} is VALID [2022-02-20 20:00:39,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {78330#(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; {78281#true} is VALID [2022-02-20 20:00:39,409 INFO L272 TraceCheckUtils]: 1: Hoare triple {78281#true} call #t~ret8 := is_do_write_p_triggered(); {78281#true} is VALID [2022-02-20 20:00:39,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {78281#true} havoc ~__retres1~0; {78281#true} is VALID [2022-02-20 20:00:39,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {78281#true} assume !(1 == ~p_dw_pc~0); {78281#true} is VALID [2022-02-20 20:00:39,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {78281#true} assume !(2 == ~p_dw_pc~0); {78281#true} is VALID [2022-02-20 20:00:39,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {78281#true} ~__retres1~0 := 0; {78281#true} is VALID [2022-02-20 20:00:39,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {78281#true} #res := ~__retres1~0; {78281#true} is VALID [2022-02-20 20:00:39,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,410 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {78281#true} {78281#true} #1157#return; {78281#true} is VALID [2022-02-20 20:00:39,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {78281#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {78281#true} is VALID [2022-02-20 20:00:39,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {78281#true} assume !(0 != ~tmp~1); {78281#true} is VALID [2022-02-20 20:00:39,410 INFO L272 TraceCheckUtils]: 11: Hoare triple {78281#true} call #t~ret9 := is_do_read_c_triggered(); {78281#true} is VALID [2022-02-20 20:00:39,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {78281#true} havoc ~__retres1~1; {78281#true} is VALID [2022-02-20 20:00:39,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {78281#true} assume !(1 == ~c_dr_pc~0); {78281#true} is VALID [2022-02-20 20:00:39,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {78281#true} assume !(2 == ~c_dr_pc~0); {78281#true} is VALID [2022-02-20 20:00:39,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {78281#true} ~__retres1~1 := 0; {78281#true} is VALID [2022-02-20 20:00:39,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {78281#true} #res := ~__retres1~1; {78281#true} is VALID [2022-02-20 20:00:39,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,411 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {78281#true} {78281#true} #1159#return; {78281#true} is VALID [2022-02-20 20:00:39,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {78281#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {78281#true} is VALID [2022-02-20 20:00:39,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {78281#true} assume !(0 != ~tmp___0~1); {78281#true} is VALID [2022-02-20 20:00:39,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,412 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {78281#true} {78282#false} #1165#return; {78282#false} is VALID [2022-02-20 20:00:39,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {78329#(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); {78281#true} is VALID [2022-02-20 20:00:39,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {78281#true} assume !(1 == ~q_write_ev~0); {78281#true} is VALID [2022-02-20 20:00:39,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78281#true} {78282#false} #1167#return; {78282#false} is VALID [2022-02-20 20:00:39,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {78281#true} havoc ~__retres1~2; {78281#true} is VALID [2022-02-20 20:00:39,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {78281#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {78281#true} is VALID [2022-02-20 20:00:39,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {78281#true} #res := ~__retres1~2; {78281#true} is VALID [2022-02-20 20:00:39,418 INFO L290 TraceCheckUtils]: 3: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,419 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {78281#true} {78282#false} #1169#return; {78282#false} is VALID [2022-02-20 20:00:39,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:39,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {78281#true} havoc ~__retres1~2; {78281#true} is VALID [2022-02-20 20:00:39,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {78281#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {78281#true} is VALID [2022-02-20 20:00:39,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {78281#true} #res := ~__retres1~2; {78281#true} is VALID [2022-02-20 20:00:39,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,422 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {78281#true} {78282#false} #1169#return; {78282#false} is VALID [2022-02-20 20:00:39,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {78281#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {78281#true} is VALID [2022-02-20 20:00:39,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {78281#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {78281#true} is VALID [2022-02-20 20:00:39,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {78281#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#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; {78283#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:39,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {78283#(= 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; {78283#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:39,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {78283#(= 1 ~c_dr_i~0)} call update_channels1(); {78328#(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:39,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {78328#(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); {78281#true} is VALID [2022-02-20 20:00:39,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,424 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {78281#true} {78283#(= 1 ~c_dr_i~0)} #1161#return; {78283#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:39,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {78283#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {78283#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:39,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {78283#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {78283#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:39,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {78283#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {78282#false} is VALID [2022-02-20 20:00:39,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {78282#false} assume { :end_inline_init_threads1 } true; {78282#false} is VALID [2022-02-20 20:00:39,425 INFO L272 TraceCheckUtils]: 12: Hoare triple {78282#false} call fire_delta_events1(); {78329#(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:39,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {78329#(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); {78281#true} is VALID [2022-02-20 20:00:39,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {78281#true} assume !(0 == ~q_write_ev~0); {78281#true} is VALID [2022-02-20 20:00:39,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,426 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {78281#true} {78282#false} #1163#return; {78282#false} is VALID [2022-02-20 20:00:39,426 INFO L272 TraceCheckUtils]: 17: Hoare triple {78282#false} call activate_threads1(); {78330#(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:39,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {78330#(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; {78281#true} is VALID [2022-02-20 20:00:39,426 INFO L272 TraceCheckUtils]: 19: Hoare triple {78281#true} call #t~ret8 := is_do_write_p_triggered(); {78281#true} is VALID [2022-02-20 20:00:39,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {78281#true} havoc ~__retres1~0; {78281#true} is VALID [2022-02-20 20:00:39,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {78281#true} assume !(1 == ~p_dw_pc~0); {78281#true} is VALID [2022-02-20 20:00:39,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {78281#true} assume !(2 == ~p_dw_pc~0); {78281#true} is VALID [2022-02-20 20:00:39,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {78281#true} ~__retres1~0 := 0; {78281#true} is VALID [2022-02-20 20:00:39,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {78281#true} #res := ~__retres1~0; {78281#true} is VALID [2022-02-20 20:00:39,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,427 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {78281#true} {78281#true} #1157#return; {78281#true} is VALID [2022-02-20 20:00:39,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {78281#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {78281#true} is VALID [2022-02-20 20:00:39,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {78281#true} assume !(0 != ~tmp~1); {78281#true} is VALID [2022-02-20 20:00:39,427 INFO L272 TraceCheckUtils]: 29: Hoare triple {78281#true} call #t~ret9 := is_do_read_c_triggered(); {78281#true} is VALID [2022-02-20 20:00:39,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {78281#true} havoc ~__retres1~1; {78281#true} is VALID [2022-02-20 20:00:39,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {78281#true} assume !(1 == ~c_dr_pc~0); {78281#true} is VALID [2022-02-20 20:00:39,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {78281#true} assume !(2 == ~c_dr_pc~0); {78281#true} is VALID [2022-02-20 20:00:39,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {78281#true} ~__retres1~1 := 0; {78281#true} is VALID [2022-02-20 20:00:39,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {78281#true} #res := ~__retres1~1; {78281#true} is VALID [2022-02-20 20:00:39,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,428 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {78281#true} {78281#true} #1159#return; {78281#true} is VALID [2022-02-20 20:00:39,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {78281#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {78281#true} is VALID [2022-02-20 20:00:39,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {78281#true} assume !(0 != ~tmp___0~1); {78281#true} is VALID [2022-02-20 20:00:39,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,428 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {78281#true} {78282#false} #1165#return; {78282#false} is VALID [2022-02-20 20:00:39,429 INFO L272 TraceCheckUtils]: 41: Hoare triple {78282#false} call reset_delta_events1(); {78329#(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:39,429 INFO L290 TraceCheckUtils]: 42: Hoare triple {78329#(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); {78281#true} is VALID [2022-02-20 20:00:39,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {78281#true} assume !(1 == ~q_write_ev~0); {78281#true} is VALID [2022-02-20 20:00:39,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,429 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {78281#true} {78282#false} #1167#return; {78282#false} is VALID [2022-02-20 20:00:39,429 INFO L290 TraceCheckUtils]: 46: Hoare triple {78282#false} assume !false; {78282#false} is VALID [2022-02-20 20:00:39,429 INFO L290 TraceCheckUtils]: 47: Hoare triple {78282#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; {78282#false} is VALID [2022-02-20 20:00:39,429 INFO L290 TraceCheckUtils]: 48: Hoare triple {78282#false} assume !false; {78282#false} is VALID [2022-02-20 20:00:39,429 INFO L272 TraceCheckUtils]: 49: Hoare triple {78282#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {78281#true} is VALID [2022-02-20 20:00:39,430 INFO L290 TraceCheckUtils]: 50: Hoare triple {78281#true} havoc ~__retres1~2; {78281#true} is VALID [2022-02-20 20:00:39,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {78281#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {78281#true} is VALID [2022-02-20 20:00:39,430 INFO L290 TraceCheckUtils]: 52: Hoare triple {78281#true} #res := ~__retres1~2; {78281#true} is VALID [2022-02-20 20:00:39,430 INFO L290 TraceCheckUtils]: 53: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,430 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {78281#true} {78282#false} #1169#return; {78282#false} is VALID [2022-02-20 20:00:39,430 INFO L290 TraceCheckUtils]: 55: Hoare triple {78282#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; {78282#false} is VALID [2022-02-20 20:00:39,430 INFO L290 TraceCheckUtils]: 56: Hoare triple {78282#false} assume 0 != eval1_~tmp___1~0#1; {78282#false} is VALID [2022-02-20 20:00:39,430 INFO L290 TraceCheckUtils]: 57: Hoare triple {78282#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; {78282#false} is VALID [2022-02-20 20:00:39,431 INFO L290 TraceCheckUtils]: 58: Hoare triple {78282#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; {78282#false} is VALID [2022-02-20 20:00:39,431 INFO L290 TraceCheckUtils]: 59: Hoare triple {78282#false} assume 0 == ~p_dw_pc~0; {78282#false} is VALID [2022-02-20 20:00:39,431 INFO L290 TraceCheckUtils]: 60: Hoare triple {78282#false} assume !false; {78282#false} is VALID [2022-02-20 20:00:39,431 INFO L290 TraceCheckUtils]: 61: Hoare triple {78282#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {78282#false} is VALID [2022-02-20 20:00:39,431 INFO L290 TraceCheckUtils]: 62: Hoare triple {78282#false} assume { :end_inline_do_write_p } true; {78282#false} is VALID [2022-02-20 20:00:39,431 INFO L290 TraceCheckUtils]: 63: Hoare triple {78282#false} assume !(0 == ~c_dr_st~0); {78282#false} is VALID [2022-02-20 20:00:39,431 INFO L290 TraceCheckUtils]: 64: Hoare triple {78282#false} assume !false; {78282#false} is VALID [2022-02-20 20:00:39,431 INFO L272 TraceCheckUtils]: 65: Hoare triple {78282#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {78281#true} is VALID [2022-02-20 20:00:39,432 INFO L290 TraceCheckUtils]: 66: Hoare triple {78281#true} havoc ~__retres1~2; {78281#true} is VALID [2022-02-20 20:00:39,432 INFO L290 TraceCheckUtils]: 67: Hoare triple {78281#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {78281#true} is VALID [2022-02-20 20:00:39,432 INFO L290 TraceCheckUtils]: 68: Hoare triple {78281#true} #res := ~__retres1~2; {78281#true} is VALID [2022-02-20 20:00:39,432 INFO L290 TraceCheckUtils]: 69: Hoare triple {78281#true} assume true; {78281#true} is VALID [2022-02-20 20:00:39,432 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {78281#true} {78282#false} #1169#return; {78282#false} is VALID [2022-02-20 20:00:39,432 INFO L290 TraceCheckUtils]: 71: Hoare triple {78282#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; {78282#false} is VALID [2022-02-20 20:00:39,432 INFO L290 TraceCheckUtils]: 72: Hoare triple {78282#false} assume 0 != eval1_~tmp___1~0#1; {78282#false} is VALID [2022-02-20 20:00:39,432 INFO L290 TraceCheckUtils]: 73: Hoare triple {78282#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; {78282#false} is VALID [2022-02-20 20:00:39,432 INFO L290 TraceCheckUtils]: 74: Hoare triple {78282#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; {78282#false} is VALID [2022-02-20 20:00:39,433 INFO L290 TraceCheckUtils]: 75: Hoare triple {78282#false} assume !(0 == ~p_dw_pc~0); {78282#false} is VALID [2022-02-20 20:00:39,433 INFO L290 TraceCheckUtils]: 76: Hoare triple {78282#false} assume 1 == ~p_dw_pc~0; {78282#false} is VALID [2022-02-20 20:00:39,433 INFO L290 TraceCheckUtils]: 77: Hoare triple {78282#false} assume !(0 == ~q_free~0); {78282#false} is VALID [2022-02-20 20:00:39,433 INFO L290 TraceCheckUtils]: 78: Hoare triple {78282#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; {78282#false} is VALID [2022-02-20 20:00:39,433 INFO L290 TraceCheckUtils]: 79: Hoare triple {78282#false} assume !false; {78282#false} is VALID [2022-02-20 20:00:39,433 INFO L290 TraceCheckUtils]: 80: Hoare triple {78282#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {78282#false} is VALID [2022-02-20 20:00:39,433 INFO L290 TraceCheckUtils]: 81: Hoare triple {78282#false} assume { :end_inline_do_write_p } true; {78282#false} is VALID [2022-02-20 20:00:39,433 INFO L290 TraceCheckUtils]: 82: Hoare triple {78282#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; {78282#false} is VALID [2022-02-20 20:00:39,434 INFO L290 TraceCheckUtils]: 83: Hoare triple {78282#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; {78282#false} is VALID [2022-02-20 20:00:39,434 INFO L290 TraceCheckUtils]: 84: Hoare triple {78282#false} assume !(0 == ~c_dr_pc~0); {78282#false} is VALID [2022-02-20 20:00:39,434 INFO L290 TraceCheckUtils]: 85: Hoare triple {78282#false} assume 2 == ~c_dr_pc~0; {78282#false} is VALID [2022-02-20 20:00:39,434 INFO L290 TraceCheckUtils]: 86: Hoare triple {78282#false} do_read_c_~a~0#1 := ~a_t~0; {78282#false} is VALID [2022-02-20 20:00:39,434 INFO L290 TraceCheckUtils]: 87: Hoare triple {78282#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; {78282#false} is VALID [2022-02-20 20:00:39,434 INFO L290 TraceCheckUtils]: 88: Hoare triple {78282#false} assume !(~p_last_write~0 == ~c_last_read~0); {78282#false} is VALID [2022-02-20 20:00:39,434 INFO L272 TraceCheckUtils]: 89: Hoare triple {78282#false} call error1(); {78282#false} is VALID [2022-02-20 20:00:39,434 INFO L290 TraceCheckUtils]: 90: Hoare triple {78282#false} assume !false; {78282#false} is VALID [2022-02-20 20:00:39,435 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:39,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:39,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714466018] [2022-02-20 20:00:39,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714466018] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:39,435 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:39,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:39,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68908974] [2022-02-20 20:00:39,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:39,436 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:39,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:39,437 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:39,480 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:39,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:39,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:39,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:39,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:39,481 INFO L87 Difference]: Start difference. First operand 3150 states and 4057 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:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:41,753 INFO L93 Difference]: Finished difference Result 4734 states and 6041 transitions. [2022-02-20 20:00:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:00:41,754 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:41,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:41,754 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:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 618 transitions. [2022-02-20 20:00:41,757 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:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 618 transitions. [2022-02-20 20:00:41,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 618 transitions. [2022-02-20 20:00:42,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 618 edges. 618 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:42,313 INFO L225 Difference]: With dead ends: 4734 [2022-02-20 20:00:42,313 INFO L226 Difference]: Without dead ends: 1796 [2022-02-20 20:00:42,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:00:42,318 INFO L933 BasicCegarLoop]: 441 mSDtfsCounter, 496 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:42,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [510 Valid, 1191 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 20:00:42,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2022-02-20 20:00:42,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1681. [2022-02-20 20:00:42,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:42,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1796 states. Second operand has 1681 states, 1343 states have (on average 1.2911392405063291) internal successors, (1734), 1363 states have internal predecessors, (1734), 183 states have call successors, (183), 120 states have call predecessors, (183), 153 states have return successors, (231), 199 states have call predecessors, (231), 181 states have call successors, (231) [2022-02-20 20:00:42,425 INFO L74 IsIncluded]: Start isIncluded. First operand 1796 states. Second operand has 1681 states, 1343 states have (on average 1.2911392405063291) internal successors, (1734), 1363 states have internal predecessors, (1734), 183 states have call successors, (183), 120 states have call predecessors, (183), 153 states have return successors, (231), 199 states have call predecessors, (231), 181 states have call successors, (231) [2022-02-20 20:00:42,426 INFO L87 Difference]: Start difference. First operand 1796 states. Second operand has 1681 states, 1343 states have (on average 1.2911392405063291) internal successors, (1734), 1363 states have internal predecessors, (1734), 183 states have call successors, (183), 120 states have call predecessors, (183), 153 states have return successors, (231), 199 states have call predecessors, (231), 181 states have call successors, (231) [2022-02-20 20:00:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:42,527 INFO L93 Difference]: Finished difference Result 1796 states and 2308 transitions. [2022-02-20 20:00:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2308 transitions. [2022-02-20 20:00:42,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:42,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:42,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 1681 states, 1343 states have (on average 1.2911392405063291) internal successors, (1734), 1363 states have internal predecessors, (1734), 183 states have call successors, (183), 120 states have call predecessors, (183), 153 states have return successors, (231), 199 states have call predecessors, (231), 181 states have call successors, (231) Second operand 1796 states. [2022-02-20 20:00:42,534 INFO L87 Difference]: Start difference. First operand has 1681 states, 1343 states have (on average 1.2911392405063291) internal successors, (1734), 1363 states have internal predecessors, (1734), 183 states have call successors, (183), 120 states have call predecessors, (183), 153 states have return successors, (231), 199 states have call predecessors, (231), 181 states have call successors, (231) Second operand 1796 states. [2022-02-20 20:00:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:42,638 INFO L93 Difference]: Finished difference Result 1796 states and 2308 transitions. [2022-02-20 20:00:42,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2308 transitions. [2022-02-20 20:00:42,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:42,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:42,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:42,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:42,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1343 states have (on average 1.2911392405063291) internal successors, (1734), 1363 states have internal predecessors, (1734), 183 states have call successors, (183), 120 states have call predecessors, (183), 153 states have return successors, (231), 199 states have call predecessors, (231), 181 states have call successors, (231) [2022-02-20 20:00:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2148 transitions. [2022-02-20 20:00:42,771 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2148 transitions. Word has length 91 [2022-02-20 20:00:42,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:42,771 INFO L470 AbstractCegarLoop]: Abstraction has 1681 states and 2148 transitions. [2022-02-20 20:00:42,771 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:42,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2148 transitions. [2022-02-20 20:00:42,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 20:00:42,772 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:42,772 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:42,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:00:42,773 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:42,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:42,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1171182892, now seen corresponding path program 1 times [2022-02-20 20:00:42,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:42,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735906855] [2022-02-20 20:00:42,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:42,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {90603#(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); {90604#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:42,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {90604#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {90604#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:42,829 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90604#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {90557#(= ~q_read_ev~0 2)} #1161#return; {90557#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:42,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {90605#(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); {90555#true} is VALID [2022-02-20 20:00:42,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {90555#true} assume !(0 == ~q_write_ev~0); {90555#true} is VALID [2022-02-20 20:00:42,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {90555#true} assume true; {90555#true} is VALID [2022-02-20 20:00:42,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90555#true} {90557#(= ~q_read_ev~0 2)} #1163#return; {90555#true} is VALID [2022-02-20 20:00:42,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {90555#true} havoc ~__retres1~0; {90555#true} is VALID [2022-02-20 20:00:42,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {90555#true} assume !(1 == ~p_dw_pc~0); {90555#true} is VALID [2022-02-20 20:00:42,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {90555#true} assume !(2 == ~p_dw_pc~0); {90555#true} is VALID [2022-02-20 20:00:42,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {90555#true} ~__retres1~0 := 0; {90555#true} is VALID [2022-02-20 20:00:42,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {90555#true} #res := ~__retres1~0; {90555#true} is VALID [2022-02-20 20:00:42,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {90555#true} assume true; {90555#true} is VALID [2022-02-20 20:00:42,850 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {90555#true} {90555#true} #1157#return; {90555#true} is VALID [2022-02-20 20:00:42,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {90555#true} havoc ~__retres1~1; {90555#true} is VALID [2022-02-20 20:00:42,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {90555#true} assume !(1 == ~c_dr_pc~0); {90555#true} is VALID [2022-02-20 20:00:42,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {90555#true} assume !(2 == ~c_dr_pc~0); {90555#true} is VALID [2022-02-20 20:00:42,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {90555#true} ~__retres1~1 := 0; {90555#true} is VALID [2022-02-20 20:00:42,852 INFO L290 TraceCheckUtils]: 4: Hoare triple {90555#true} #res := ~__retres1~1; {90555#true} is VALID [2022-02-20 20:00:42,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {90555#true} assume true; {90555#true} is VALID [2022-02-20 20:00:42,852 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {90555#true} {90555#true} #1159#return; {90555#true} is VALID [2022-02-20 20:00:42,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {90606#(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; {90555#true} is VALID [2022-02-20 20:00:42,853 INFO L272 TraceCheckUtils]: 1: Hoare triple {90555#true} call #t~ret8 := is_do_write_p_triggered(); {90555#true} is VALID [2022-02-20 20:00:42,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {90555#true} havoc ~__retres1~0; {90555#true} is VALID [2022-02-20 20:00:42,853 INFO L290 TraceCheckUtils]: 3: Hoare triple {90555#true} assume !(1 == ~p_dw_pc~0); {90555#true} is VALID [2022-02-20 20:00:42,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {90555#true} assume !(2 == ~p_dw_pc~0); {90555#true} is VALID [2022-02-20 20:00:42,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {90555#true} ~__retres1~0 := 0; {90555#true} is VALID [2022-02-20 20:00:42,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {90555#true} #res := ~__retres1~0; {90555#true} is VALID [2022-02-20 20:00:42,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {90555#true} assume true; {90555#true} is VALID [2022-02-20 20:00:42,853 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {90555#true} {90555#true} #1157#return; {90555#true} is VALID [2022-02-20 20:00:42,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {90555#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {90555#true} is VALID [2022-02-20 20:00:42,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {90555#true} assume !(0 != ~tmp~1); {90555#true} is VALID [2022-02-20 20:00:42,854 INFO L272 TraceCheckUtils]: 11: Hoare triple {90555#true} call #t~ret9 := is_do_read_c_triggered(); {90555#true} is VALID [2022-02-20 20:00:42,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {90555#true} havoc ~__retres1~1; {90555#true} is VALID [2022-02-20 20:00:42,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {90555#true} assume !(1 == ~c_dr_pc~0); {90555#true} is VALID [2022-02-20 20:00:42,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {90555#true} assume !(2 == ~c_dr_pc~0); {90555#true} is VALID [2022-02-20 20:00:42,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {90555#true} ~__retres1~1 := 0; {90555#true} is VALID [2022-02-20 20:00:42,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {90555#true} #res := ~__retres1~1; {90555#true} is VALID [2022-02-20 20:00:42,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {90555#true} assume true; {90555#true} is VALID [2022-02-20 20:00:42,855 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {90555#true} {90555#true} #1159#return; {90555#true} is VALID [2022-02-20 20:00:42,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {90555#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {90555#true} is VALID [2022-02-20 20:00:42,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {90555#true} assume !(0 != ~tmp___0~1); {90555#true} is VALID [2022-02-20 20:00:42,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {90555#true} assume true; {90555#true} is VALID [2022-02-20 20:00:42,855 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {90555#true} {90555#true} #1165#return; {90555#true} is VALID [2022-02-20 20:00:42,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {90605#(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); {90555#true} is VALID [2022-02-20 20:00:42,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {90555#true} assume !(1 == ~q_write_ev~0); {90555#true} is VALID [2022-02-20 20:00:42,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {90555#true} assume true; {90555#true} is VALID [2022-02-20 20:00:42,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90555#true} {90555#true} #1167#return; {90555#true} is VALID [2022-02-20 20:00:42,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {90555#true} havoc ~__retres1~2; {90555#true} is VALID [2022-02-20 20:00:42,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {90555#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {90555#true} is VALID [2022-02-20 20:00:42,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {90555#true} #res := ~__retres1~2; {90555#true} is VALID [2022-02-20 20:00:42,861 INFO L290 TraceCheckUtils]: 3: Hoare triple {90555#true} assume true; {90555#true} is VALID [2022-02-20 20:00:42,861 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {90555#true} {90555#true} #1169#return; {90555#true} is VALID [2022-02-20 20:00:42,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:00:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {90555#true} havoc ~__retres1~2; {90555#true} is VALID [2022-02-20 20:00:42,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {90555#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {90621#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:42,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {90621#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {90621#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:42,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {90621#(= ~p_dw_st~0 0)} assume true; {90621#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:42,869 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {90621#(= ~p_dw_st~0 0)} {90597#(not (= ~p_dw_st~0 0))} #1169#return; {90556#false} is VALID [2022-02-20 20:00:42,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {90555#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {90555#true} is VALID [2022-02-20 20:00:42,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {90555#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {90555#true} is VALID [2022-02-20 20:00:42,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {90555#true} assume 0 != main_#t~nondet37#1;havoc main_#t~nondet37#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; {90557#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:42,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {90557#(= ~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; {90557#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:42,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {90557#(= ~q_read_ev~0 2)} call update_channels1(); {90603#(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:42,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {90603#(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); {90604#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:42,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {90604#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {90604#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:42,872 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {90604#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {90557#(= ~q_read_ev~0 2)} #1161#return; {90557#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:42,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {90557#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {90557#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:42,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {90557#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {90557#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:42,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {90557#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {90557#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:42,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {90557#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {90557#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:42,874 INFO L272 TraceCheckUtils]: 12: Hoare triple {90557#(= ~q_read_ev~0 2)} call fire_delta_events1(); {90605#(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:42,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {90605#(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); {90555#true} is VALID [2022-02-20 20:00:42,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {90555#true} assume !(0 == ~q_write_ev~0); {90555#true} is VALID [2022-02-20 20:00:42,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {90555#true} assume true; {90555#true} is VALID [2022-02-20 20:00:42,874 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {90555#true} {90557#(= ~q_read_ev~0 2)} #1163#return; {90555#true} is VALID [2022-02-20 20:00:42,874 INFO L272 TraceCheckUtils]: 17: Hoare triple {90555#true} call activate_threads1(); {90606#(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:42,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {90606#(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; {90555#true} is VALID [2022-02-20 20:00:42,875 INFO L272 TraceCheckUtils]: 19: Hoare triple {90555#true} call #t~ret8 := is_do_write_p_triggered(); {90555#true} is VALID [2022-02-20 20:00:42,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {90555#true} havoc ~__retres1~0; {90555#true} is VALID [2022-02-20 20:00:42,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {90555#true} assume !(1 == ~p_dw_pc~0); {90555#true} is VALID [2022-02-20 20:00:42,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {90555#true} assume !(2 == ~p_dw_pc~0); {90555#true} is VALID [2022-02-20 20:00:42,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {90555#true} ~__retres1~0 := 0; {90555#true} is VALID [2022-02-20 20:00:42,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {90555#true} #res := ~__retres1~0; {90555#true} is VALID [2022-02-20 20:00:42,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {90555#true} assume true; {90555#true} is VALID [2022-02-20 20:00:42,876 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {90555#true} {90555#true} #1157#return; {90555#true} is VALID [2022-02-20 20:00:42,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {90555#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {90555#true} is VALID [2022-02-20 20:00:42,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {90555#true} assume !(0 != ~tmp~1); {90555#true} is VALID [2022-02-20 20:00:42,876 INFO L272 TraceCheckUtils]: 29: Hoare triple {90555#true} call #t~ret9 := is_do_read_c_triggered(); {90555#true} is VALID [2022-02-20 20:00:42,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {90555#true} havoc ~__retres1~1; {90555#true} is VALID [2022-02-20 20:00:42,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {90555#true} assume !(1 == ~c_dr_pc~0); {90555#true} is VALID [2022-02-20 20:00:42,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {90555#true} assume !(2 == ~c_dr_pc~0); {90555#true} is VALID [2022-02-20 20:00:42,876 INFO L290 TraceCheckUtils]: 33: Hoare triple {90555#true} ~__retres1~1 := 0; {90555#true} is VALID [2022-02-20 20:00:42,876 INFO L290 TraceCheckUtils]: 34: Hoare triple {90555#true} #res := ~__retres1~1; {90555#true} is VALID [2022-02-20 20:00:42,877 INFO L290 TraceCheckUtils]: 35: Hoare triple {90555#true} assume true; {90555#true} is VALID [2022-02-20 20:00:42,877 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {90555#true} {90555#true} #1159#return; {90555#true} is VALID [2022-02-20 20:00:42,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {90555#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {90555#true} is VALID [2022-02-20 20:00:42,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {90555#true} assume !(0 != ~tmp___0~1); {90555#true} is VALID [2022-02-20 20:00:42,877 INFO L290 TraceCheckUtils]: 39: Hoare triple {90555#true} assume true; {90555#true} is VALID [2022-02-20 20:00:42,877 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {90555#true} {90555#true} #1165#return; {90555#true} is VALID [2022-02-20 20:00:42,878 INFO L272 TraceCheckUtils]: 41: Hoare triple {90555#true} call reset_delta_events1(); {90605#(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:42,878 INFO L290 TraceCheckUtils]: 42: Hoare triple {90605#(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); {90555#true} is VALID [2022-02-20 20:00:42,878 INFO L290 TraceCheckUtils]: 43: Hoare triple {90555#true} assume !(1 == ~q_write_ev~0); {90555#true} is VALID [2022-02-20 20:00:42,878 INFO L290 TraceCheckUtils]: 44: Hoare triple {90555#true} assume true; {90555#true} is VALID [2022-02-20 20:00:42,878 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {90555#true} {90555#true} #1167#return; {90555#true} is VALID [2022-02-20 20:00:42,878 INFO L290 TraceCheckUtils]: 46: Hoare triple {90555#true} assume !false; {90555#true} is VALID [2022-02-20 20:00:42,878 INFO L290 TraceCheckUtils]: 47: Hoare triple {90555#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; {90555#true} is VALID [2022-02-20 20:00:42,878 INFO L290 TraceCheckUtils]: 48: Hoare triple {90555#true} assume !false; {90555#true} is VALID [2022-02-20 20:00:42,879 INFO L272 TraceCheckUtils]: 49: Hoare triple {90555#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {90555#true} is VALID [2022-02-20 20:00:42,879 INFO L290 TraceCheckUtils]: 50: Hoare triple {90555#true} havoc ~__retres1~2; {90555#true} is VALID [2022-02-20 20:00:42,879 INFO L290 TraceCheckUtils]: 51: Hoare triple {90555#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {90555#true} is VALID [2022-02-20 20:00:42,879 INFO L290 TraceCheckUtils]: 52: Hoare triple {90555#true} #res := ~__retres1~2; {90555#true} is VALID [2022-02-20 20:00:42,879 INFO L290 TraceCheckUtils]: 53: Hoare triple {90555#true} assume true; {90555#true} is VALID [2022-02-20 20:00:42,879 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {90555#true} {90555#true} #1169#return; {90555#true} is VALID [2022-02-20 20:00:42,879 INFO L290 TraceCheckUtils]: 55: Hoare triple {90555#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; {90555#true} is VALID [2022-02-20 20:00:42,879 INFO L290 TraceCheckUtils]: 56: Hoare triple {90555#true} assume 0 != eval1_~tmp___1~0#1; {90555#true} is VALID [2022-02-20 20:00:42,879 INFO L290 TraceCheckUtils]: 57: Hoare triple {90555#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; {90555#true} is VALID [2022-02-20 20:00:42,880 INFO L290 TraceCheckUtils]: 58: Hoare triple {90555#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; {90555#true} is VALID [2022-02-20 20:00:42,880 INFO L290 TraceCheckUtils]: 59: Hoare triple {90555#true} assume 0 == ~p_dw_pc~0; {90555#true} is VALID [2022-02-20 20:00:42,880 INFO L290 TraceCheckUtils]: 60: Hoare triple {90555#true} assume !false; {90555#true} is VALID [2022-02-20 20:00:42,880 INFO L290 TraceCheckUtils]: 61: Hoare triple {90555#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {90597#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:42,880 INFO L290 TraceCheckUtils]: 62: Hoare triple {90597#(not (= ~p_dw_st~0 0))} assume { :end_inline_do_write_p } true; {90597#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:42,881 INFO L290 TraceCheckUtils]: 63: Hoare triple {90597#(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; {90597#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:42,881 INFO L290 TraceCheckUtils]: 64: Hoare triple {90597#(not (= ~p_dw_st~0 0))} assume !(0 != eval1_~tmp___0~2#1); {90597#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:42,881 INFO L290 TraceCheckUtils]: 65: Hoare triple {90597#(not (= ~p_dw_st~0 0))} assume !false; {90597#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:42,881 INFO L272 TraceCheckUtils]: 66: Hoare triple {90597#(not (= ~p_dw_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {90555#true} is VALID [2022-02-20 20:00:42,882 INFO L290 TraceCheckUtils]: 67: Hoare triple {90555#true} havoc ~__retres1~2; {90555#true} is VALID [2022-02-20 20:00:42,882 INFO L290 TraceCheckUtils]: 68: Hoare triple {90555#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {90621#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:42,882 INFO L290 TraceCheckUtils]: 69: Hoare triple {90621#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {90621#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:42,882 INFO L290 TraceCheckUtils]: 70: Hoare triple {90621#(= ~p_dw_st~0 0)} assume true; {90621#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:42,883 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {90621#(= ~p_dw_st~0 0)} {90597#(not (= ~p_dw_st~0 0))} #1169#return; {90556#false} is VALID [2022-02-20 20:00:42,883 INFO L290 TraceCheckUtils]: 72: Hoare triple {90556#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; {90556#false} is VALID [2022-02-20 20:00:42,883 INFO L290 TraceCheckUtils]: 73: Hoare triple {90556#false} assume 0 != eval1_~tmp___1~0#1; {90556#false} is VALID [2022-02-20 20:00:42,883 INFO L290 TraceCheckUtils]: 74: Hoare triple {90556#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; {90556#false} is VALID [2022-02-20 20:00:42,883 INFO L290 TraceCheckUtils]: 75: Hoare triple {90556#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; {90556#false} is VALID [2022-02-20 20:00:42,883 INFO L290 TraceCheckUtils]: 76: Hoare triple {90556#false} assume !(0 == ~p_dw_pc~0); {90556#false} is VALID [2022-02-20 20:00:42,884 INFO L290 TraceCheckUtils]: 77: Hoare triple {90556#false} assume 1 == ~p_dw_pc~0; {90556#false} is VALID [2022-02-20 20:00:42,884 INFO L290 TraceCheckUtils]: 78: Hoare triple {90556#false} assume !(0 == ~q_free~0); {90556#false} is VALID [2022-02-20 20:00:42,884 INFO L290 TraceCheckUtils]: 79: Hoare triple {90556#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; {90556#false} is VALID [2022-02-20 20:00:42,884 INFO L290 TraceCheckUtils]: 80: Hoare triple {90556#false} assume !false; {90556#false} is VALID [2022-02-20 20:00:42,884 INFO L290 TraceCheckUtils]: 81: Hoare triple {90556#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {90556#false} is VALID [2022-02-20 20:00:42,884 INFO L290 TraceCheckUtils]: 82: Hoare triple {90556#false} assume { :end_inline_do_write_p } true; {90556#false} is VALID [2022-02-20 20:00:42,884 INFO L290 TraceCheckUtils]: 83: Hoare triple {90556#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; {90556#false} is VALID [2022-02-20 20:00:42,884 INFO L290 TraceCheckUtils]: 84: Hoare triple {90556#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; {90556#false} is VALID [2022-02-20 20:00:42,885 INFO L290 TraceCheckUtils]: 85: Hoare triple {90556#false} assume !(0 == ~c_dr_pc~0); {90556#false} is VALID [2022-02-20 20:00:42,885 INFO L290 TraceCheckUtils]: 86: Hoare triple {90556#false} assume 2 == ~c_dr_pc~0; {90556#false} is VALID [2022-02-20 20:00:42,885 INFO L290 TraceCheckUtils]: 87: Hoare triple {90556#false} do_read_c_~a~0#1 := ~a_t~0; {90556#false} is VALID [2022-02-20 20:00:42,885 INFO L290 TraceCheckUtils]: 88: Hoare triple {90556#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; {90556#false} is VALID [2022-02-20 20:00:42,885 INFO L290 TraceCheckUtils]: 89: Hoare triple {90556#false} assume !(~p_last_write~0 == ~c_last_read~0); {90556#false} is VALID [2022-02-20 20:00:42,885 INFO L272 TraceCheckUtils]: 90: Hoare triple {90556#false} call error1(); {90556#false} is VALID [2022-02-20 20:00:42,885 INFO L290 TraceCheckUtils]: 91: Hoare triple {90556#false} assume !false; {90556#false} is VALID [2022-02-20 20:00:42,886 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:42,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:42,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735906855] [2022-02-20 20:00:42,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735906855] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:42,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:42,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:42,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733349075] [2022-02-20 20:00:42,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:42,887 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:42,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:42,887 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:42,942 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:42,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:42,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:42,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:42,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:42,943 INFO L87 Difference]: Start difference. First operand 1681 states and 2148 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:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:47,526 INFO L93 Difference]: Finished difference Result 4099 states and 5231 transitions. [2022-02-20 20:00:47,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 20:00:47,527 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:47,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:47,527 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:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1058 transitions. [2022-02-20 20:00:47,532 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:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1058 transitions. [2022-02-20 20:00:47,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 1058 transitions. [2022-02-20 20:00:48,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1058 edges. 1058 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:48,550 INFO L225 Difference]: With dead ends: 4099 [2022-02-20 20:00:48,551 INFO L226 Difference]: Without dead ends: 2479 [2022-02-20 20:00:48,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-02-20 20:00:48,554 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 1777 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1812 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:48,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1812 Valid, 1793 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 20:00:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2022-02-20 20:00:48,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2302. [2022-02-20 20:00:48,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:48,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2479 states. Second operand has 2302 states, 1810 states have (on average 1.2574585635359117) internal successors, (2276), 1838 states have internal predecessors, (2276), 260 states have call successors, (260), 168 states have call predecessors, (260), 230 states have return successors, (362), 297 states have call predecessors, (362), 258 states have call successors, (362) [2022-02-20 20:00:48,703 INFO L74 IsIncluded]: Start isIncluded. First operand 2479 states. Second operand has 2302 states, 1810 states have (on average 1.2574585635359117) internal successors, (2276), 1838 states have internal predecessors, (2276), 260 states have call successors, (260), 168 states have call predecessors, (260), 230 states have return successors, (362), 297 states have call predecessors, (362), 258 states have call successors, (362) [2022-02-20 20:00:48,705 INFO L87 Difference]: Start difference. First operand 2479 states. Second operand has 2302 states, 1810 states have (on average 1.2574585635359117) internal successors, (2276), 1838 states have internal predecessors, (2276), 260 states have call successors, (260), 168 states have call predecessors, (260), 230 states have return successors, (362), 297 states have call predecessors, (362), 258 states have call successors, (362) [2022-02-20 20:00:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:48,887 INFO L93 Difference]: Finished difference Result 2479 states and 3103 transitions. [2022-02-20 20:00:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3103 transitions. [2022-02-20 20:00:48,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:48,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:48,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 2302 states, 1810 states have (on average 1.2574585635359117) internal successors, (2276), 1838 states have internal predecessors, (2276), 260 states have call successors, (260), 168 states have call predecessors, (260), 230 states have return successors, (362), 297 states have call predecessors, (362), 258 states have call successors, (362) Second operand 2479 states. [2022-02-20 20:00:48,895 INFO L87 Difference]: Start difference. First operand has 2302 states, 1810 states have (on average 1.2574585635359117) internal successors, (2276), 1838 states have internal predecessors, (2276), 260 states have call successors, (260), 168 states have call predecessors, (260), 230 states have return successors, (362), 297 states have call predecessors, (362), 258 states have call successors, (362) Second operand 2479 states. [2022-02-20 20:00:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:49,086 INFO L93 Difference]: Finished difference Result 2479 states and 3103 transitions. [2022-02-20 20:00:49,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3103 transitions. [2022-02-20 20:00:49,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:49,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:49,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:49,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 1810 states have (on average 1.2574585635359117) internal successors, (2276), 1838 states have internal predecessors, (2276), 260 states have call successors, (260), 168 states have call predecessors, (260), 230 states have return successors, (362), 297 states have call predecessors, (362), 258 states have call successors, (362) [2022-02-20 20:00:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 2898 transitions. [2022-02-20 20:00:49,340 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 2898 transitions. Word has length 92 [2022-02-20 20:00:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:49,340 INFO L470 AbstractCegarLoop]: Abstraction has 2302 states and 2898 transitions. [2022-02-20 20:00:49,340 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:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 2898 transitions. [2022-02-20 20:00:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 20:00:49,341 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:49,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 20:00:49,342 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:49,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:49,344 INFO L85 PathProgramCache]: Analyzing trace with hash 972429717, now seen corresponding path program 1 times [2022-02-20 20:00:49,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:49,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136195602] [2022-02-20 20:00:49,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:49,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:49,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:49,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {104196#true} assume true; {104196#true} is VALID [2022-02-20 20:00:49,375 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {104196#true} {104198#(= ~t1_i~0 1)} #1189#return; {104198#(= ~t1_i~0 1)} is VALID [2022-02-20 20:00:49,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 20:00:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:49,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {104272#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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; {104196#true} is VALID [2022-02-20 20:00:49,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {104196#true} assume !(0 == ~T1_E~0); {104196#true} is VALID [2022-02-20 20:00:49,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {104196#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {104196#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,398 INFO L290 TraceCheckUtils]: 4: Hoare triple {104196#true} assume 0 == ~T4_E~0;~T4_E~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {104196#true} assume 0 == ~T5_E~0;~T5_E~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {104196#true} assume 0 == ~E_M~0;~E_M~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {104196#true} assume 0 == ~E_1~0;~E_1~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {104196#true} assume 0 == ~E_2~0;~E_2~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {104196#true} assume !(0 == ~E_3~0); {104196#true} is VALID [2022-02-20 20:00:49,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {104196#true} assume 0 == ~E_4~0;~E_4~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {104196#true} assume 0 == ~E_5~0;~E_5~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {104196#true} assume true; {104196#true} is VALID [2022-02-20 20:00:49,400 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {104196#true} {104197#false} #1191#return; {104197#false} is VALID [2022-02-20 20:00:49,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 20:00:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:49,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {104273#(and (= |old(~t5_st~0)| ~t5_st~0) (= |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;havoc ~tmp___4~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; {104196#true} is VALID [2022-02-20 20:00:49,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {104196#true} assume !(1 == ~m_pc~0); {104196#true} is VALID [2022-02-20 20:00:49,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {104196#true} is_master_triggered_~__retres1~4#1 := 0; {104196#true} is VALID [2022-02-20 20:00:49,426 INFO L290 TraceCheckUtils]: 3: Hoare triple {104196#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {104196#true} is VALID [2022-02-20 20:00:49,427 INFO L290 TraceCheckUtils]: 4: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {104196#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {104196#true} is VALID [2022-02-20 20:00:49,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {104196#true} assume 1 == ~t1_pc~0; {104196#true} is VALID [2022-02-20 20:00:49,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {104196#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {104196#true} is VALID [2022-02-20 20:00:49,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {104196#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {104196#true} is VALID [2022-02-20 20:00:49,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {104196#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {104196#true} is VALID [2022-02-20 20:00:49,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {104196#true} assume !(1 == ~t2_pc~0); {104196#true} is VALID [2022-02-20 20:00:49,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {104196#true} is_transmit2_triggered_~__retres1~6#1 := 0; {104196#true} is VALID [2022-02-20 20:00:49,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {104196#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {104196#true} is VALID [2022-02-20 20:00:49,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {104196#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {104196#true} is VALID [2022-02-20 20:00:49,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {104196#true} assume 1 == ~t3_pc~0; {104196#true} is VALID [2022-02-20 20:00:49,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {104196#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {104196#true} is VALID [2022-02-20 20:00:49,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {104196#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {104196#true} is VALID [2022-02-20 20:00:49,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {104196#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {104196#true} is VALID [2022-02-20 20:00:49,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {104196#true} assume 1 == ~t4_pc~0; {104196#true} is VALID [2022-02-20 20:00:49,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {104196#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {104196#true} is VALID [2022-02-20 20:00:49,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {104196#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {104196#true} is VALID [2022-02-20 20:00:49,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {104196#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {104196#true} is VALID [2022-02-20 20:00:49,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {104196#true} assume { :begin_inline_is_transmit5_triggered } true;havoc is_transmit5_triggered_#res#1;havoc is_transmit5_triggered_~__retres1~9#1;havoc is_transmit5_triggered_~__retres1~9#1; {104196#true} is VALID [2022-02-20 20:00:49,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {104196#true} assume !(1 == ~t5_pc~0); {104196#true} is VALID [2022-02-20 20:00:49,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {104196#true} is_transmit5_triggered_~__retres1~9#1 := 0; {104196#true} is VALID [2022-02-20 20:00:49,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {104196#true} is_transmit5_triggered_#res#1 := is_transmit5_triggered_~__retres1~9#1; {104196#true} is VALID [2022-02-20 20:00:49,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {104196#true} #t~ret33#1 := is_transmit5_triggered_#res#1;assume { :end_inline_is_transmit5_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___4~0#1 := #t~ret33#1;havoc #t~ret33#1; {104196#true} is VALID [2022-02-20 20:00:49,435 INFO L290 TraceCheckUtils]: 35: Hoare triple {104196#true} assume !(0 != ~tmp___4~0#1); {104196#true} is VALID [2022-02-20 20:00:49,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {104196#true} assume true; {104196#true} is VALID [2022-02-20 20:00:49,435 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {104196#true} {104197#false} #1193#return; {104197#false} is VALID [2022-02-20 20:00:49,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-20 20:00:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:49,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {104272#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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; {104196#true} is VALID [2022-02-20 20:00:49,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {104196#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {104196#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {104196#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {104196#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {104196#true} assume 1 == ~T5_E~0;~T5_E~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {104196#true} assume !(1 == ~E_M~0); {104196#true} is VALID [2022-02-20 20:00:49,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {104196#true} assume 1 == ~E_1~0;~E_1~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {104196#true} assume 1 == ~E_2~0;~E_2~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {104196#true} assume 1 == ~E_3~0;~E_3~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {104196#true} assume 1 == ~E_4~0;~E_4~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {104196#true} assume 1 == ~E_5~0;~E_5~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {104196#true} assume true; {104196#true} is VALID [2022-02-20 20:00:49,441 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {104196#true} {104197#false} #1195#return; {104197#false} is VALID [2022-02-20 20:00:49,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-02-20 20:00:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:49,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {104196#true} havoc ~__retres1~10; {104196#true} is VALID [2022-02-20 20:00:49,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {104196#true} assume 0 == ~m_st~0;~__retres1~10 := 1; {104196#true} is VALID [2022-02-20 20:00:49,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {104196#true} #res := ~__retres1~10; {104196#true} is VALID [2022-02-20 20:00:49,444 INFO L290 TraceCheckUtils]: 3: Hoare triple {104196#true} assume true; {104196#true} is VALID [2022-02-20 20:00:49,444 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {104196#true} {104197#false} #1197#return; {104197#false} is VALID [2022-02-20 20:00:49,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {104196#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {104196#true} is VALID [2022-02-20 20:00:49,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {104196#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {104196#true} is VALID [2022-02-20 20:00:49,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {104196#true} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~11#1;havoc main2_~__retres1~11#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;~t5_i~0 := 1; {104198#(= ~t1_i~0 1)} is VALID [2022-02-20 20:00:49,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {104198#(= ~t1_i~0 1)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret35#1, start_simulation2_#t~ret36#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; {104198#(= ~t1_i~0 1)} is VALID [2022-02-20 20:00:49,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {104198#(= ~t1_i~0 1)} call update_channels2(); {104196#true} is VALID [2022-02-20 20:00:49,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {104196#true} assume true; {104196#true} is VALID [2022-02-20 20:00:49,446 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {104196#true} {104198#(= ~t1_i~0 1)} #1189#return; {104198#(= ~t1_i~0 1)} is VALID [2022-02-20 20:00:49,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {104198#(= ~t1_i~0 1)} assume { :begin_inline_init_threads2 } true; {104198#(= ~t1_i~0 1)} is VALID [2022-02-20 20:00:49,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {104198#(= ~t1_i~0 1)} assume 1 == ~m_i~0;~m_st~0 := 0; {104198#(= ~t1_i~0 1)} is VALID [2022-02-20 20:00:49,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {104198#(= ~t1_i~0 1)} assume !(1 == ~t1_i~0);~t1_st~0 := 2; {104197#false} is VALID [2022-02-20 20:00:49,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {104197#false} assume 1 == ~t2_i~0;~t2_st~0 := 0; {104197#false} is VALID [2022-02-20 20:00:49,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {104197#false} assume 1 == ~t3_i~0;~t3_st~0 := 0; {104197#false} is VALID [2022-02-20 20:00:49,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {104197#false} assume 1 == ~t4_i~0;~t4_st~0 := 0; {104197#false} is VALID [2022-02-20 20:00:49,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {104197#false} assume 1 == ~t5_i~0;~t5_st~0 := 0; {104197#false} is VALID [2022-02-20 20:00:49,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {104197#false} assume { :end_inline_init_threads2 } true; {104197#false} is VALID [2022-02-20 20:00:49,448 INFO L272 TraceCheckUtils]: 15: Hoare triple {104197#false} call fire_delta_events2(); {104272#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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:49,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {104272#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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; {104196#true} is VALID [2022-02-20 20:00:49,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {104196#true} assume !(0 == ~T1_E~0); {104196#true} is VALID [2022-02-20 20:00:49,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {104196#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {104196#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {104196#true} assume 0 == ~T4_E~0;~T4_E~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {104196#true} assume 0 == ~T5_E~0;~T5_E~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {104196#true} assume 0 == ~E_M~0;~E_M~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {104196#true} assume 0 == ~E_1~0;~E_1~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {104196#true} assume 0 == ~E_2~0;~E_2~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {104196#true} assume !(0 == ~E_3~0); {104196#true} is VALID [2022-02-20 20:00:49,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {104196#true} assume 0 == ~E_4~0;~E_4~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {104196#true} assume 0 == ~E_5~0;~E_5~0 := 1; {104196#true} is VALID [2022-02-20 20:00:49,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {104196#true} assume true; {104196#true} is VALID [2022-02-20 20:00:49,450 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {104196#true} {104197#false} #1191#return; {104197#false} is VALID [2022-02-20 20:00:49,450 INFO L272 TraceCheckUtils]: 30: Hoare triple {104197#false} call activate_threads2(); {104273#(and (= |old(~t5_st~0)| ~t5_st~0) (= |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:49,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {104273#(and (= |old(~t5_st~0)| ~t5_st~0) (= |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;havoc ~tmp___4~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; {104196#true} is VALID [2022-02-20 20:00:49,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {104196#true} assume !(1 == ~m_pc~0); {104196#true} is VALID [2022-02-20 20:00:49,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {104196#true} is_master_triggered_~__retres1~4#1 := 0; {104196#true} is VALID [2022-02-20 20:00:49,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {104196#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {104196#true} is VALID [2022-02-20 20:00:49,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,450 INFO L290 TraceCheckUtils]: 36: Hoare triple {104196#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {104196#true} is VALID [2022-02-20 20:00:49,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {104196#true} assume 1 == ~t1_pc~0; {104196#true} is VALID [2022-02-20 20:00:49,451 INFO L290 TraceCheckUtils]: 39: Hoare triple {104196#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {104196#true} is VALID [2022-02-20 20:00:49,451 INFO L290 TraceCheckUtils]: 40: Hoare triple {104196#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {104196#true} is VALID [2022-02-20 20:00:49,451 INFO L290 TraceCheckUtils]: 41: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {104196#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {104196#true} is VALID [2022-02-20 20:00:49,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {104196#true} assume !(1 == ~t2_pc~0); {104196#true} is VALID [2022-02-20 20:00:49,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {104196#true} is_transmit2_triggered_~__retres1~6#1 := 0; {104196#true} is VALID [2022-02-20 20:00:49,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {104196#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {104196#true} is VALID [2022-02-20 20:00:49,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {104196#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {104196#true} is VALID [2022-02-20 20:00:49,452 INFO L290 TraceCheckUtils]: 49: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,452 INFO L290 TraceCheckUtils]: 50: Hoare triple {104196#true} assume 1 == ~t3_pc~0; {104196#true} is VALID [2022-02-20 20:00:49,452 INFO L290 TraceCheckUtils]: 51: Hoare triple {104196#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {104196#true} is VALID [2022-02-20 20:00:49,452 INFO L290 TraceCheckUtils]: 52: Hoare triple {104196#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {104196#true} is VALID [2022-02-20 20:00:49,452 INFO L290 TraceCheckUtils]: 53: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,453 INFO L290 TraceCheckUtils]: 54: Hoare triple {104196#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {104196#true} is VALID [2022-02-20 20:00:49,453 INFO L290 TraceCheckUtils]: 55: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,453 INFO L290 TraceCheckUtils]: 56: Hoare triple {104196#true} assume 1 == ~t4_pc~0; {104196#true} is VALID [2022-02-20 20:00:49,453 INFO L290 TraceCheckUtils]: 57: Hoare triple {104196#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {104196#true} is VALID [2022-02-20 20:00:49,453 INFO L290 TraceCheckUtils]: 58: Hoare triple {104196#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {104196#true} is VALID [2022-02-20 20:00:49,453 INFO L290 TraceCheckUtils]: 59: Hoare triple {104196#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; {104196#true} is VALID [2022-02-20 20:00:49,453 INFO L290 TraceCheckUtils]: 60: Hoare triple {104196#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {104196#true} is VALID [2022-02-20 20:00:49,453 INFO L290 TraceCheckUtils]: 61: Hoare triple {104196#true} assume { :begin_inline_is_transmit5_triggered } true;havoc is_transmit5_triggered_#res#1;havoc is_transmit5_triggered_~__retres1~9#1;havoc is_transmit5_triggered_~__retres1~9#1; {104196#true} is VALID [2022-02-20 20:00:49,453 INFO L290 TraceCheckUtils]: 62: Hoare triple {104196#true} assume !(1 == ~t5_pc~0); {104196#true} is VALID [2022-02-20 20:00:49,454 INFO L290 TraceCheckUtils]: 63: Hoare triple {104196#true} is_transmit5_triggered_~__retres1~9#1 := 0; {104196#true} is VALID [2022-02-20 20:00:49,454 INFO L290 TraceCheckUtils]: 64: Hoare triple {104196#true} is_transmit5_triggered_#res#1 := is_transmit5_triggered_~__retres1~9#1; {104196#true} is VALID [2022-02-20 20:00:49,454 INFO L290 TraceCheckUtils]: 65: Hoare triple {104196#true} #t~ret33#1 := is_transmit5_triggered_#res#1;assume { :end_inline_is_transmit5_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___4~0#1 := #t~ret33#1;havoc #t~ret33#1; {104196#true} is VALID [2022-02-20 20:00:49,454 INFO L290 TraceCheckUtils]: 66: Hoare triple {104196#true} assume !(0 != ~tmp___4~0#1); {104196#true} is VALID [2022-02-20 20:00:49,454 INFO L290 TraceCheckUtils]: 67: Hoare triple {104196#true} assume true; {104196#true} is VALID [2022-02-20 20:00:49,454 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {104196#true} {104197#false} #1193#return; {104197#false} is VALID [2022-02-20 20:00:49,454 INFO L272 TraceCheckUtils]: 69: Hoare triple {104197#false} call reset_delta_events2(); {104272#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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:49,454 INFO L290 TraceCheckUtils]: 70: Hoare triple {104272#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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; {104196#true} is VALID [2022-02-20 20:00:49,454 INFO L290 TraceCheckUtils]: 71: Hoare triple {104196#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,455 INFO L290 TraceCheckUtils]: 72: Hoare triple {104196#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,455 INFO L290 TraceCheckUtils]: 73: Hoare triple {104196#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,455 INFO L290 TraceCheckUtils]: 74: Hoare triple {104196#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,455 INFO L290 TraceCheckUtils]: 75: Hoare triple {104196#true} assume 1 == ~T5_E~0;~T5_E~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,455 INFO L290 TraceCheckUtils]: 76: Hoare triple {104196#true} assume !(1 == ~E_M~0); {104196#true} is VALID [2022-02-20 20:00:49,455 INFO L290 TraceCheckUtils]: 77: Hoare triple {104196#true} assume 1 == ~E_1~0;~E_1~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,455 INFO L290 TraceCheckUtils]: 78: Hoare triple {104196#true} assume 1 == ~E_2~0;~E_2~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,455 INFO L290 TraceCheckUtils]: 79: Hoare triple {104196#true} assume 1 == ~E_3~0;~E_3~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,456 INFO L290 TraceCheckUtils]: 80: Hoare triple {104196#true} assume 1 == ~E_4~0;~E_4~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,456 INFO L290 TraceCheckUtils]: 81: Hoare triple {104196#true} assume 1 == ~E_5~0;~E_5~0 := 2; {104196#true} is VALID [2022-02-20 20:00:49,456 INFO L290 TraceCheckUtils]: 82: Hoare triple {104196#true} assume true; {104196#true} is VALID [2022-02-20 20:00:49,456 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {104196#true} {104197#false} #1195#return; {104197#false} is VALID [2022-02-20 20:00:49,456 INFO L290 TraceCheckUtils]: 84: Hoare triple {104197#false} assume !false; {104197#false} is VALID [2022-02-20 20:00:49,456 INFO L290 TraceCheckUtils]: 85: Hoare triple {104197#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_4~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_5~0#1, eval2_#t~nondet27#1, eval2_~tmp_ndt_6~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {104197#false} is VALID [2022-02-20 20:00:49,456 INFO L290 TraceCheckUtils]: 86: Hoare triple {104197#false} assume !false; {104197#false} is VALID [2022-02-20 20:00:49,456 INFO L272 TraceCheckUtils]: 87: Hoare triple {104197#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {104196#true} is VALID [2022-02-20 20:00:49,456 INFO L290 TraceCheckUtils]: 88: Hoare triple {104196#true} havoc ~__retres1~10; {104196#true} is VALID [2022-02-20 20:00:49,457 INFO L290 TraceCheckUtils]: 89: Hoare triple {104196#true} assume 0 == ~m_st~0;~__retres1~10 := 1; {104196#true} is VALID [2022-02-20 20:00:49,457 INFO L290 TraceCheckUtils]: 90: Hoare triple {104196#true} #res := ~__retres1~10; {104196#true} is VALID [2022-02-20 20:00:49,457 INFO L290 TraceCheckUtils]: 91: Hoare triple {104196#true} assume true; {104196#true} is VALID [2022-02-20 20:00:49,457 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {104196#true} {104197#false} #1197#return; {104197#false} is VALID [2022-02-20 20:00:49,457 INFO L290 TraceCheckUtils]: 93: Hoare triple {104197#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {104197#false} is VALID [2022-02-20 20:00:49,457 INFO L290 TraceCheckUtils]: 94: Hoare triple {104197#false} assume 0 != eval2_~tmp~5#1; {104197#false} is VALID [2022-02-20 20:00:49,457 INFO L290 TraceCheckUtils]: 95: Hoare triple {104197#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {104197#false} is VALID [2022-02-20 20:00:49,457 INFO L290 TraceCheckUtils]: 96: Hoare triple {104197#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {104197#false} is VALID [2022-02-20 20:00:49,458 INFO L290 TraceCheckUtils]: 97: Hoare triple {104197#false} assume !(0 == ~m_pc~0); {104197#false} is VALID [2022-02-20 20:00:49,458 INFO L290 TraceCheckUtils]: 98: Hoare triple {104197#false} assume 1 == ~m_pc~0; {104197#false} is VALID [2022-02-20 20:00:49,458 INFO L290 TraceCheckUtils]: 99: Hoare triple {104197#false} assume ~token~0 != 5 + ~local~0;assume { :begin_inline_error2 } true; {104197#false} is VALID [2022-02-20 20:00:49,458 INFO L290 TraceCheckUtils]: 100: Hoare triple {104197#false} assume !false; {104197#false} is VALID [2022-02-20 20:00:49,458 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:49,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:49,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136195602] [2022-02-20 20:00:49,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136195602] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:49,459 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:49,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:00:49,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394168698] [2022-02-20 20:00:49,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:49,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-02-20 20:00:49,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:49,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:49,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:49,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:00:49,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:49,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:00:49,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:00:49,522 INFO L87 Difference]: Start difference. First operand 2302 states and 2898 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:51,575 INFO L93 Difference]: Finished difference Result 2562 states and 3308 transitions. [2022-02-20 20:00:51,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:00:51,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-02-20 20:00:51,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:51,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 863 transitions. [2022-02-20 20:00:51,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 863 transitions. [2022-02-20 20:00:51,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 863 transitions. [2022-02-20 20:00:52,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 863 edges. 863 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:52,303 INFO L225 Difference]: With dead ends: 2562 [2022-02-20 20:00:52,303 INFO L226 Difference]: Without dead ends: 2367 [2022-02-20 20:00:52,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:52,306 INFO L933 BasicCegarLoop]: 477 mSDtfsCounter, 614 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:52,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 878 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 20:00:52,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2022-02-20 20:00:52,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2302. [2022-02-20 20:00:52,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:52,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2367 states. Second operand has 2302 states, 1810 states have (on average 1.2569060773480663) internal successors, (2275), 1838 states have internal predecessors, (2275), 260 states have call successors, (260), 168 states have call predecessors, (260), 230 states have return successors, (362), 297 states have call predecessors, (362), 258 states have call successors, (362) [2022-02-20 20:00:52,554 INFO L74 IsIncluded]: Start isIncluded. First operand 2367 states. Second operand has 2302 states, 1810 states have (on average 1.2569060773480663) internal successors, (2275), 1838 states have internal predecessors, (2275), 260 states have call successors, (260), 168 states have call predecessors, (260), 230 states have return successors, (362), 297 states have call predecessors, (362), 258 states have call successors, (362) [2022-02-20 20:00:52,560 INFO L87 Difference]: Start difference. First operand 2367 states. Second operand has 2302 states, 1810 states have (on average 1.2569060773480663) internal successors, (2275), 1838 states have internal predecessors, (2275), 260 states have call successors, (260), 168 states have call predecessors, (260), 230 states have return successors, (362), 297 states have call predecessors, (362), 258 states have call successors, (362) [2022-02-20 20:00:52,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:52,726 INFO L93 Difference]: Finished difference Result 2367 states and 3009 transitions. [2022-02-20 20:00:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 3009 transitions. [2022-02-20 20:00:52,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:52,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:52,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 2302 states, 1810 states have (on average 1.2569060773480663) internal successors, (2275), 1838 states have internal predecessors, (2275), 260 states have call successors, (260), 168 states have call predecessors, (260), 230 states have return successors, (362), 297 states have call predecessors, (362), 258 states have call successors, (362) Second operand 2367 states. [2022-02-20 20:00:52,734 INFO L87 Difference]: Start difference. First operand has 2302 states, 1810 states have (on average 1.2569060773480663) internal successors, (2275), 1838 states have internal predecessors, (2275), 260 states have call successors, (260), 168 states have call predecessors, (260), 230 states have return successors, (362), 297 states have call predecessors, (362), 258 states have call successors, (362) Second operand 2367 states. [2022-02-20 20:00:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:52,902 INFO L93 Difference]: Finished difference Result 2367 states and 3009 transitions. [2022-02-20 20:00:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 3009 transitions. [2022-02-20 20:00:52,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:52,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:52,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:52,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 1810 states have (on average 1.2569060773480663) internal successors, (2275), 1838 states have internal predecessors, (2275), 260 states have call successors, (260), 168 states have call predecessors, (260), 230 states have return successors, (362), 297 states have call predecessors, (362), 258 states have call successors, (362) [2022-02-20 20:00:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 2897 transitions. [2022-02-20 20:00:53,164 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 2897 transitions. Word has length 101 [2022-02-20 20:00:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:53,164 INFO L470 AbstractCegarLoop]: Abstraction has 2302 states and 2897 transitions. [2022-02-20 20:00:53,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 2897 transitions. [2022-02-20 20:00:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 20:00:53,165 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:53,166 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:53,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 20:00:53,166 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:53,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:53,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1000930007, now seen corresponding path program 1 times [2022-02-20 20:00:53,166 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:53,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713403542] [2022-02-20 20:00:53,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:53,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {115521#true} assume true; {115521#true} is VALID [2022-02-20 20:00:53,201 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {115521#true} {115523#(= ~M_E~0 2)} #1189#return; {115523#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:53,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 20:00:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {115597#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume !(0 == ~T1_E~0); {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~T4_E~0;~T4_E~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~T5_E~0;~T5_E~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume !(0 == ~E_3~0); {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~E_4~0;~E_4~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~E_5~0;~E_5~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume true; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,237 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {115598#(= |old(~M_E~0)| 0)} {115523#(= ~M_E~0 2)} #1191#return; {115522#false} is VALID [2022-02-20 20:00:53,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 20:00:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {115599#(and (= |old(~t5_st~0)| ~t5_st~0) (= |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;havoc ~tmp___4~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; {115521#true} is VALID [2022-02-20 20:00:53,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {115521#true} assume !(1 == ~m_pc~0); {115521#true} is VALID [2022-02-20 20:00:53,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {115521#true} is_master_triggered_~__retres1~4#1 := 0; {115521#true} is VALID [2022-02-20 20:00:53,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {115521#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {115521#true} is VALID [2022-02-20 20:00:53,254 INFO L290 TraceCheckUtils]: 4: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {115521#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {115521#true} is VALID [2022-02-20 20:00:53,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {115521#true} assume 1 == ~t1_pc~0; {115521#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {115521#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {115521#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {115521#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {115521#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {115521#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {115521#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {115521#true} assume !(1 == ~t2_pc~0); {115521#true} is VALID [2022-02-20 20:00:53,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {115521#true} is_transmit2_triggered_~__retres1~6#1 := 0; {115521#true} is VALID [2022-02-20 20:00:53,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {115521#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {115521#true} is VALID [2022-02-20 20:00:53,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {115521#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {115521#true} is VALID [2022-02-20 20:00:53,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {115521#true} assume 1 == ~t3_pc~0; {115521#true} is VALID [2022-02-20 20:00:53,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {115521#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {115521#true} is VALID [2022-02-20 20:00:53,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {115521#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {115521#true} is VALID [2022-02-20 20:00:53,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {115521#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {115521#true} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {115521#true} assume 1 == ~t4_pc~0; {115521#true} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {115521#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {115521#true} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 27: Hoare triple {115521#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {115521#true} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 28: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {115521#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {115521#true} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {115521#true} assume { :begin_inline_is_transmit5_triggered } true;havoc is_transmit5_triggered_#res#1;havoc is_transmit5_triggered_~__retres1~9#1;havoc is_transmit5_triggered_~__retres1~9#1; {115521#true} is VALID [2022-02-20 20:00:53,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {115521#true} assume !(1 == ~t5_pc~0); {115521#true} is VALID [2022-02-20 20:00:53,258 INFO L290 TraceCheckUtils]: 32: Hoare triple {115521#true} is_transmit5_triggered_~__retres1~9#1 := 0; {115521#true} is VALID [2022-02-20 20:00:53,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {115521#true} is_transmit5_triggered_#res#1 := is_transmit5_triggered_~__retres1~9#1; {115521#true} is VALID [2022-02-20 20:00:53,258 INFO L290 TraceCheckUtils]: 34: Hoare triple {115521#true} #t~ret33#1 := is_transmit5_triggered_#res#1;assume { :end_inline_is_transmit5_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___4~0#1 := #t~ret33#1;havoc #t~ret33#1; {115521#true} is VALID [2022-02-20 20:00:53,258 INFO L290 TraceCheckUtils]: 35: Hoare triple {115521#true} assume !(0 != ~tmp___4~0#1); {115521#true} is VALID [2022-02-20 20:00:53,258 INFO L290 TraceCheckUtils]: 36: Hoare triple {115521#true} assume true; {115521#true} is VALID [2022-02-20 20:00:53,258 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {115521#true} {115522#false} #1193#return; {115522#false} is VALID [2022-02-20 20:00:53,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-20 20:00:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {115597#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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; {115521#true} is VALID [2022-02-20 20:00:53,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {115521#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {115521#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,263 INFO L290 TraceCheckUtils]: 3: Hoare triple {115521#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,263 INFO L290 TraceCheckUtils]: 4: Hoare triple {115521#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {115521#true} assume 1 == ~T5_E~0;~T5_E~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {115521#true} assume !(1 == ~E_M~0); {115521#true} is VALID [2022-02-20 20:00:53,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {115521#true} assume 1 == ~E_1~0;~E_1~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {115521#true} assume 1 == ~E_2~0;~E_2~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {115521#true} assume 1 == ~E_3~0;~E_3~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {115521#true} assume 1 == ~E_4~0;~E_4~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {115521#true} assume 1 == ~E_5~0;~E_5~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {115521#true} assume true; {115521#true} is VALID [2022-02-20 20:00:53,264 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {115521#true} {115522#false} #1195#return; {115522#false} is VALID [2022-02-20 20:00:53,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-02-20 20:00:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:53,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {115521#true} havoc ~__retres1~10; {115521#true} is VALID [2022-02-20 20:00:53,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {115521#true} assume 0 == ~m_st~0;~__retres1~10 := 1; {115521#true} is VALID [2022-02-20 20:00:53,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {115521#true} #res := ~__retres1~10; {115521#true} is VALID [2022-02-20 20:00:53,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {115521#true} assume true; {115521#true} is VALID [2022-02-20 20:00:53,267 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {115521#true} {115522#false} #1197#return; {115522#false} is VALID [2022-02-20 20:00:53,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {115521#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {115523#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:53,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {115523#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {115523#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:53,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {115523#(= ~M_E~0 2)} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~11#1;havoc main2_~__retres1~11#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;~t5_i~0 := 1; {115523#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:53,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {115523#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret35#1, start_simulation2_#t~ret36#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; {115523#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:53,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {115523#(= ~M_E~0 2)} call update_channels2(); {115521#true} is VALID [2022-02-20 20:00:53,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {115521#true} assume true; {115521#true} is VALID [2022-02-20 20:00:53,269 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {115521#true} {115523#(= ~M_E~0 2)} #1189#return; {115523#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:53,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {115523#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {115523#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:53,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {115523#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {115523#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:53,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {115523#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {115523#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:53,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {115523#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {115523#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:53,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {115523#(= ~M_E~0 2)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {115523#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:53,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {115523#(= ~M_E~0 2)} assume 1 == ~t4_i~0;~t4_st~0 := 0; {115523#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:53,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {115523#(= ~M_E~0 2)} assume 1 == ~t5_i~0;~t5_st~0 := 0; {115523#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:53,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {115523#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {115523#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:53,272 INFO L272 TraceCheckUtils]: 15: Hoare triple {115523#(= ~M_E~0 2)} call fire_delta_events2(); {115597#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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:53,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {115597#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume !(0 == ~T1_E~0); {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~T4_E~0;~T4_E~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~T5_E~0;~T5_E~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume !(0 == ~E_3~0); {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~E_4~0;~E_4~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume 0 == ~E_5~0;~E_5~0 := 1; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {115598#(= |old(~M_E~0)| 0)} assume true; {115598#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:53,276 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {115598#(= |old(~M_E~0)| 0)} {115523#(= ~M_E~0 2)} #1191#return; {115522#false} is VALID [2022-02-20 20:00:53,277 INFO L272 TraceCheckUtils]: 30: Hoare triple {115522#false} call activate_threads2(); {115599#(and (= |old(~t5_st~0)| ~t5_st~0) (= |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:53,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {115599#(and (= |old(~t5_st~0)| ~t5_st~0) (= |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;havoc ~tmp___4~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; {115521#true} is VALID [2022-02-20 20:00:53,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {115521#true} assume !(1 == ~m_pc~0); {115521#true} is VALID [2022-02-20 20:00:53,277 INFO L290 TraceCheckUtils]: 33: Hoare triple {115521#true} is_master_triggered_~__retres1~4#1 := 0; {115521#true} is VALID [2022-02-20 20:00:53,277 INFO L290 TraceCheckUtils]: 34: Hoare triple {115521#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {115521#true} is VALID [2022-02-20 20:00:53,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {115521#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {115521#true} is VALID [2022-02-20 20:00:53,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {115521#true} assume 1 == ~t1_pc~0; {115521#true} is VALID [2022-02-20 20:00:53,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {115521#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {115521#true} is VALID [2022-02-20 20:00:53,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {115521#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {115521#true} is VALID [2022-02-20 20:00:53,278 INFO L290 TraceCheckUtils]: 41: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {115521#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {115521#true} is VALID [2022-02-20 20:00:53,278 INFO L290 TraceCheckUtils]: 43: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {115521#true} assume !(1 == ~t2_pc~0); {115521#true} is VALID [2022-02-20 20:00:53,278 INFO L290 TraceCheckUtils]: 45: Hoare triple {115521#true} is_transmit2_triggered_~__retres1~6#1 := 0; {115521#true} is VALID [2022-02-20 20:00:53,278 INFO L290 TraceCheckUtils]: 46: Hoare triple {115521#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {115521#true} is VALID [2022-02-20 20:00:53,279 INFO L290 TraceCheckUtils]: 47: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,279 INFO L290 TraceCheckUtils]: 48: Hoare triple {115521#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {115521#true} is VALID [2022-02-20 20:00:53,279 INFO L290 TraceCheckUtils]: 49: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,279 INFO L290 TraceCheckUtils]: 50: Hoare triple {115521#true} assume 1 == ~t3_pc~0; {115521#true} is VALID [2022-02-20 20:00:53,279 INFO L290 TraceCheckUtils]: 51: Hoare triple {115521#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {115521#true} is VALID [2022-02-20 20:00:53,279 INFO L290 TraceCheckUtils]: 52: Hoare triple {115521#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {115521#true} is VALID [2022-02-20 20:00:53,279 INFO L290 TraceCheckUtils]: 53: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,279 INFO L290 TraceCheckUtils]: 54: Hoare triple {115521#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {115521#true} is VALID [2022-02-20 20:00:53,280 INFO L290 TraceCheckUtils]: 55: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,280 INFO L290 TraceCheckUtils]: 56: Hoare triple {115521#true} assume 1 == ~t4_pc~0; {115521#true} is VALID [2022-02-20 20:00:53,280 INFO L290 TraceCheckUtils]: 57: Hoare triple {115521#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {115521#true} is VALID [2022-02-20 20:00:53,280 INFO L290 TraceCheckUtils]: 58: Hoare triple {115521#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {115521#true} is VALID [2022-02-20 20:00:53,280 INFO L290 TraceCheckUtils]: 59: Hoare triple {115521#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; {115521#true} is VALID [2022-02-20 20:00:53,280 INFO L290 TraceCheckUtils]: 60: Hoare triple {115521#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {115521#true} is VALID [2022-02-20 20:00:53,280 INFO L290 TraceCheckUtils]: 61: Hoare triple {115521#true} assume { :begin_inline_is_transmit5_triggered } true;havoc is_transmit5_triggered_#res#1;havoc is_transmit5_triggered_~__retres1~9#1;havoc is_transmit5_triggered_~__retres1~9#1; {115521#true} is VALID [2022-02-20 20:00:53,280 INFO L290 TraceCheckUtils]: 62: Hoare triple {115521#true} assume !(1 == ~t5_pc~0); {115521#true} is VALID [2022-02-20 20:00:53,281 INFO L290 TraceCheckUtils]: 63: Hoare triple {115521#true} is_transmit5_triggered_~__retres1~9#1 := 0; {115521#true} is VALID [2022-02-20 20:00:53,281 INFO L290 TraceCheckUtils]: 64: Hoare triple {115521#true} is_transmit5_triggered_#res#1 := is_transmit5_triggered_~__retres1~9#1; {115521#true} is VALID [2022-02-20 20:00:53,281 INFO L290 TraceCheckUtils]: 65: Hoare triple {115521#true} #t~ret33#1 := is_transmit5_triggered_#res#1;assume { :end_inline_is_transmit5_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___4~0#1 := #t~ret33#1;havoc #t~ret33#1; {115521#true} is VALID [2022-02-20 20:00:53,281 INFO L290 TraceCheckUtils]: 66: Hoare triple {115521#true} assume !(0 != ~tmp___4~0#1); {115521#true} is VALID [2022-02-20 20:00:53,281 INFO L290 TraceCheckUtils]: 67: Hoare triple {115521#true} assume true; {115521#true} is VALID [2022-02-20 20:00:53,281 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {115521#true} {115522#false} #1193#return; {115522#false} is VALID [2022-02-20 20:00:53,281 INFO L272 TraceCheckUtils]: 69: Hoare triple {115522#false} call reset_delta_events2(); {115597#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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:53,281 INFO L290 TraceCheckUtils]: 70: Hoare triple {115597#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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; {115521#true} is VALID [2022-02-20 20:00:53,281 INFO L290 TraceCheckUtils]: 71: Hoare triple {115521#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,282 INFO L290 TraceCheckUtils]: 72: Hoare triple {115521#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,282 INFO L290 TraceCheckUtils]: 73: Hoare triple {115521#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,282 INFO L290 TraceCheckUtils]: 74: Hoare triple {115521#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,282 INFO L290 TraceCheckUtils]: 75: Hoare triple {115521#true} assume 1 == ~T5_E~0;~T5_E~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,282 INFO L290 TraceCheckUtils]: 76: Hoare triple {115521#true} assume !(1 == ~E_M~0); {115521#true} is VALID [2022-02-20 20:00:53,282 INFO L290 TraceCheckUtils]: 77: Hoare triple {115521#true} assume 1 == ~E_1~0;~E_1~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,282 INFO L290 TraceCheckUtils]: 78: Hoare triple {115521#true} assume 1 == ~E_2~0;~E_2~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,282 INFO L290 TraceCheckUtils]: 79: Hoare triple {115521#true} assume 1 == ~E_3~0;~E_3~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,283 INFO L290 TraceCheckUtils]: 80: Hoare triple {115521#true} assume 1 == ~E_4~0;~E_4~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,283 INFO L290 TraceCheckUtils]: 81: Hoare triple {115521#true} assume 1 == ~E_5~0;~E_5~0 := 2; {115521#true} is VALID [2022-02-20 20:00:53,283 INFO L290 TraceCheckUtils]: 82: Hoare triple {115521#true} assume true; {115521#true} is VALID [2022-02-20 20:00:53,283 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {115521#true} {115522#false} #1195#return; {115522#false} is VALID [2022-02-20 20:00:53,283 INFO L290 TraceCheckUtils]: 84: Hoare triple {115522#false} assume !false; {115522#false} is VALID [2022-02-20 20:00:53,283 INFO L290 TraceCheckUtils]: 85: Hoare triple {115522#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_4~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_5~0#1, eval2_#t~nondet27#1, eval2_~tmp_ndt_6~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {115522#false} is VALID [2022-02-20 20:00:53,283 INFO L290 TraceCheckUtils]: 86: Hoare triple {115522#false} assume !false; {115522#false} is VALID [2022-02-20 20:00:53,283 INFO L272 TraceCheckUtils]: 87: Hoare triple {115522#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {115521#true} is VALID [2022-02-20 20:00:53,284 INFO L290 TraceCheckUtils]: 88: Hoare triple {115521#true} havoc ~__retres1~10; {115521#true} is VALID [2022-02-20 20:00:53,284 INFO L290 TraceCheckUtils]: 89: Hoare triple {115521#true} assume 0 == ~m_st~0;~__retres1~10 := 1; {115521#true} is VALID [2022-02-20 20:00:53,284 INFO L290 TraceCheckUtils]: 90: Hoare triple {115521#true} #res := ~__retres1~10; {115521#true} is VALID [2022-02-20 20:00:53,284 INFO L290 TraceCheckUtils]: 91: Hoare triple {115521#true} assume true; {115521#true} is VALID [2022-02-20 20:00:53,284 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {115521#true} {115522#false} #1197#return; {115522#false} is VALID [2022-02-20 20:00:53,284 INFO L290 TraceCheckUtils]: 93: Hoare triple {115522#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {115522#false} is VALID [2022-02-20 20:00:53,284 INFO L290 TraceCheckUtils]: 94: Hoare triple {115522#false} assume 0 != eval2_~tmp~5#1; {115522#false} is VALID [2022-02-20 20:00:53,284 INFO L290 TraceCheckUtils]: 95: Hoare triple {115522#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {115522#false} is VALID [2022-02-20 20:00:53,285 INFO L290 TraceCheckUtils]: 96: Hoare triple {115522#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {115522#false} is VALID [2022-02-20 20:00:53,285 INFO L290 TraceCheckUtils]: 97: Hoare triple {115522#false} assume !(0 == ~m_pc~0); {115522#false} is VALID [2022-02-20 20:00:53,285 INFO L290 TraceCheckUtils]: 98: Hoare triple {115522#false} assume 1 == ~m_pc~0; {115522#false} is VALID [2022-02-20 20:00:53,285 INFO L290 TraceCheckUtils]: 99: Hoare triple {115522#false} assume ~token~0 != 5 + ~local~0;assume { :begin_inline_error2 } true; {115522#false} is VALID [2022-02-20 20:00:53,285 INFO L290 TraceCheckUtils]: 100: Hoare triple {115522#false} assume !false; {115522#false} is VALID [2022-02-20 20:00:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:53,285 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:53,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713403542] [2022-02-20 20:00:53,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713403542] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:53,286 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:53,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:53,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801247766] [2022-02-20 20:00:53,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:53,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-02-20 20:00:53,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:53,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:53,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:53,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:53,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:53,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:53,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:53,338 INFO L87 Difference]: Start difference. First operand 2302 states and 2897 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:56,781 INFO L93 Difference]: Finished difference Result 2814 states and 3704 transitions. [2022-02-20 20:00:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 20:00:56,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-02-20 20:00:56,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1259 transitions. [2022-02-20 20:00:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:56,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1259 transitions. [2022-02-20 20:00:56,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1259 transitions. [2022-02-20 20:00:57,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1259 edges. 1259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:58,026 INFO L225 Difference]: With dead ends: 2814 [2022-02-20 20:00:58,027 INFO L226 Difference]: Without dead ends: 2625 [2022-02-20 20:00:58,028 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:58,028 INFO L933 BasicCegarLoop]: 487 mSDtfsCounter, 989 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:58,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1013 Valid, 1170 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:00:58,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2022-02-20 20:00:58,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2496. [2022-02-20 20:00:58,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:58,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2625 states. Second operand has 2496 states, 1983 states have (on average 1.2829046898638428) internal successors, (2544), 2012 states have internal predecessors, (2544), 274 states have call successors, (274), 174 states have call predecessors, (274), 237 states have return successors, (379), 311 states have call predecessors, (379), 272 states have call successors, (379) [2022-02-20 20:00:58,193 INFO L74 IsIncluded]: Start isIncluded. First operand 2625 states. Second operand has 2496 states, 1983 states have (on average 1.2829046898638428) internal successors, (2544), 2012 states have internal predecessors, (2544), 274 states have call successors, (274), 174 states have call predecessors, (274), 237 states have return successors, (379), 311 states have call predecessors, (379), 272 states have call successors, (379) [2022-02-20 20:00:58,194 INFO L87 Difference]: Start difference. First operand 2625 states. Second operand has 2496 states, 1983 states have (on average 1.2829046898638428) internal successors, (2544), 2012 states have internal predecessors, (2544), 274 states have call successors, (274), 174 states have call predecessors, (274), 237 states have return successors, (379), 311 states have call predecessors, (379), 272 states have call successors, (379) [2022-02-20 20:00:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:58,412 INFO L93 Difference]: Finished difference Result 2625 states and 3411 transitions. [2022-02-20 20:00:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3411 transitions. [2022-02-20 20:00:58,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:58,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:58,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 2496 states, 1983 states have (on average 1.2829046898638428) internal successors, (2544), 2012 states have internal predecessors, (2544), 274 states have call successors, (274), 174 states have call predecessors, (274), 237 states have return successors, (379), 311 states have call predecessors, (379), 272 states have call successors, (379) Second operand 2625 states. [2022-02-20 20:00:58,419 INFO L87 Difference]: Start difference. First operand has 2496 states, 1983 states have (on average 1.2829046898638428) internal successors, (2544), 2012 states have internal predecessors, (2544), 274 states have call successors, (274), 174 states have call predecessors, (274), 237 states have return successors, (379), 311 states have call predecessors, (379), 272 states have call successors, (379) Second operand 2625 states. [2022-02-20 20:00:58,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:58,621 INFO L93 Difference]: Finished difference Result 2625 states and 3411 transitions. [2022-02-20 20:00:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3411 transitions. [2022-02-20 20:00:58,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:58,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:58,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:58,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:58,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 1983 states have (on average 1.2829046898638428) internal successors, (2544), 2012 states have internal predecessors, (2544), 274 states have call successors, (274), 174 states have call predecessors, (274), 237 states have return successors, (379), 311 states have call predecessors, (379), 272 states have call successors, (379) [2022-02-20 20:00:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3197 transitions. [2022-02-20 20:00:58,940 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3197 transitions. Word has length 101 [2022-02-20 20:00:58,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:58,940 INFO L470 AbstractCegarLoop]: Abstraction has 2496 states and 3197 transitions. [2022-02-20 20:00:58,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3197 transitions. [2022-02-20 20:00:58,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 20:00:58,941 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:58,942 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:58,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 20:00:58,942 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:58,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:58,942 INFO L85 PathProgramCache]: Analyzing trace with hash -715954597, now seen corresponding path program 1 times [2022-02-20 20:00:58,942 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:58,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966477011] [2022-02-20 20:00:58,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:58,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:58,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {127932#true} assume true; {127932#true} is VALID [2022-02-20 20:00:58,973 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {127932#true} {127934#(= ~T2_E~0 ~M_E~0)} #1189#return; {127934#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:58,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 20:00:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {128008#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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); {128009#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:59,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {128009#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {128009#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:59,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {128009#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~T4_E~0;~T4_E~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~T5_E~0;~T5_E~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_3~0); {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_4~0;~E_4~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_5~0;~E_5~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,007 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {127934#(= ~T2_E~0 ~M_E~0)} #1191#return; {127933#false} is VALID [2022-02-20 20:00:59,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 20:00:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {128011#(and (= |old(~t5_st~0)| ~t5_st~0) (= |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;havoc ~tmp___4~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; {127932#true} is VALID [2022-02-20 20:00:59,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {127932#true} assume !(1 == ~m_pc~0); {127932#true} is VALID [2022-02-20 20:00:59,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {127932#true} is_master_triggered_~__retres1~4#1 := 0; {127932#true} is VALID [2022-02-20 20:00:59,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {127932#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {127932#true} is VALID [2022-02-20 20:00:59,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {127932#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {127932#true} is VALID [2022-02-20 20:00:59,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {127932#true} assume 1 == ~t1_pc~0; {127932#true} is VALID [2022-02-20 20:00:59,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {127932#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {127932#true} is VALID [2022-02-20 20:00:59,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {127932#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {127932#true} is VALID [2022-02-20 20:00:59,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {127932#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {127932#true} is VALID [2022-02-20 20:00:59,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {127932#true} assume !(1 == ~t2_pc~0); {127932#true} is VALID [2022-02-20 20:00:59,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {127932#true} is_transmit2_triggered_~__retres1~6#1 := 0; {127932#true} is VALID [2022-02-20 20:00:59,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {127932#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {127932#true} is VALID [2022-02-20 20:00:59,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {127932#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {127932#true} is VALID [2022-02-20 20:00:59,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {127932#true} assume 1 == ~t3_pc~0; {127932#true} is VALID [2022-02-20 20:00:59,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {127932#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {127932#true} is VALID [2022-02-20 20:00:59,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {127932#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {127932#true} is VALID [2022-02-20 20:00:59,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {127932#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {127932#true} is VALID [2022-02-20 20:00:59,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {127932#true} assume 1 == ~t4_pc~0; {127932#true} is VALID [2022-02-20 20:00:59,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {127932#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {127932#true} is VALID [2022-02-20 20:00:59,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {127932#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {127932#true} is VALID [2022-02-20 20:00:59,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {127932#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {127932#true} is VALID [2022-02-20 20:00:59,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {127932#true} assume { :begin_inline_is_transmit5_triggered } true;havoc is_transmit5_triggered_#res#1;havoc is_transmit5_triggered_~__retres1~9#1;havoc is_transmit5_triggered_~__retres1~9#1; {127932#true} is VALID [2022-02-20 20:00:59,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {127932#true} assume !(1 == ~t5_pc~0); {127932#true} is VALID [2022-02-20 20:00:59,030 INFO L290 TraceCheckUtils]: 32: Hoare triple {127932#true} is_transmit5_triggered_~__retres1~9#1 := 0; {127932#true} is VALID [2022-02-20 20:00:59,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {127932#true} is_transmit5_triggered_#res#1 := is_transmit5_triggered_~__retres1~9#1; {127932#true} is VALID [2022-02-20 20:00:59,030 INFO L290 TraceCheckUtils]: 34: Hoare triple {127932#true} #t~ret33#1 := is_transmit5_triggered_#res#1;assume { :end_inline_is_transmit5_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___4~0#1 := #t~ret33#1;havoc #t~ret33#1; {127932#true} is VALID [2022-02-20 20:00:59,030 INFO L290 TraceCheckUtils]: 35: Hoare triple {127932#true} assume !(0 != ~tmp___4~0#1); {127932#true} is VALID [2022-02-20 20:00:59,030 INFO L290 TraceCheckUtils]: 36: Hoare triple {127932#true} assume true; {127932#true} is VALID [2022-02-20 20:00:59,030 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {127932#true} {127933#false} #1193#return; {127933#false} is VALID [2022-02-20 20:00:59,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-20 20:00:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {128008#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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); {127932#true} is VALID [2022-02-20 20:00:59,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {127932#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {127932#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,035 INFO L290 TraceCheckUtils]: 3: Hoare triple {127932#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,035 INFO L290 TraceCheckUtils]: 4: Hoare triple {127932#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {127932#true} assume 1 == ~T5_E~0;~T5_E~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {127932#true} assume !(1 == ~E_M~0); {127932#true} is VALID [2022-02-20 20:00:59,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {127932#true} assume 1 == ~E_1~0;~E_1~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {127932#true} assume 1 == ~E_2~0;~E_2~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {127932#true} assume 1 == ~E_3~0;~E_3~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {127932#true} assume 1 == ~E_4~0;~E_4~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {127932#true} assume 1 == ~E_5~0;~E_5~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {127932#true} assume true; {127932#true} is VALID [2022-02-20 20:00:59,036 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {127932#true} {127933#false} #1195#return; {127933#false} is VALID [2022-02-20 20:00:59,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-02-20 20:00:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {127932#true} havoc ~__retres1~10; {127932#true} is VALID [2022-02-20 20:00:59,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {127932#true} assume 0 == ~m_st~0;~__retres1~10 := 1; {127932#true} is VALID [2022-02-20 20:00:59,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {127932#true} #res := ~__retres1~10; {127932#true} is VALID [2022-02-20 20:00:59,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {127932#true} assume true; {127932#true} is VALID [2022-02-20 20:00:59,039 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {127932#true} {127933#false} #1197#return; {127933#false} is VALID [2022-02-20 20:00:59,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {127932#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~token~0 := 0;~local~0 := 0; {127934#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:59,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {127934#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet37#1, main_#t~ret38#1, main_#t~ret39#1;assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {127934#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:59,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {127934#(= ~T2_E~0 ~M_E~0)} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~11#1;havoc main2_~__retres1~11#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;~t5_i~0 := 1; {127934#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:59,041 INFO L290 TraceCheckUtils]: 3: Hoare triple {127934#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret35#1, start_simulation2_#t~ret36#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; {127934#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:59,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {127934#(= ~T2_E~0 ~M_E~0)} call update_channels2(); {127932#true} is VALID [2022-02-20 20:00:59,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {127932#true} assume true; {127932#true} is VALID [2022-02-20 20:00:59,042 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {127932#true} {127934#(= ~T2_E~0 ~M_E~0)} #1189#return; {127934#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:59,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {127934#(= ~T2_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {127934#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:59,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {127934#(= ~T2_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {127934#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:59,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {127934#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {127934#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:59,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {127934#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {127934#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:59,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {127934#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {127934#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:59,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {127934#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t4_i~0;~t4_st~0 := 0; {127934#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:59,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {127934#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t5_i~0;~t5_st~0 := 0; {127934#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:59,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {127934#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {127934#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:59,045 INFO L272 TraceCheckUtils]: 15: Hoare triple {127934#(= ~T2_E~0 ~M_E~0)} call fire_delta_events2(); {128008#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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:59,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {128008#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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); {128009#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:59,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {128009#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {128009#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:59,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {128009#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~T4_E~0;~T4_E~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~T5_E~0;~T5_E~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_3~0); {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_4~0;~E_4~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_5~0;~E_5~0 := 1; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:59,049 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {128010#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {127934#(= ~T2_E~0 ~M_E~0)} #1191#return; {127933#false} is VALID [2022-02-20 20:00:59,049 INFO L272 TraceCheckUtils]: 30: Hoare triple {127933#false} call activate_threads2(); {128011#(and (= |old(~t5_st~0)| ~t5_st~0) (= |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:59,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {128011#(and (= |old(~t5_st~0)| ~t5_st~0) (= |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;havoc ~tmp___4~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; {127932#true} is VALID [2022-02-20 20:00:59,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {127932#true} assume !(1 == ~m_pc~0); {127932#true} is VALID [2022-02-20 20:00:59,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {127932#true} is_master_triggered_~__retres1~4#1 := 0; {127932#true} is VALID [2022-02-20 20:00:59,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {127932#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {127932#true} is VALID [2022-02-20 20:00:59,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {127932#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {127932#true} is VALID [2022-02-20 20:00:59,050 INFO L290 TraceCheckUtils]: 37: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,050 INFO L290 TraceCheckUtils]: 38: Hoare triple {127932#true} assume 1 == ~t1_pc~0; {127932#true} is VALID [2022-02-20 20:00:59,050 INFO L290 TraceCheckUtils]: 39: Hoare triple {127932#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {127932#true} is VALID [2022-02-20 20:00:59,050 INFO L290 TraceCheckUtils]: 40: Hoare triple {127932#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {127932#true} is VALID [2022-02-20 20:00:59,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {127932#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {127932#true} is VALID [2022-02-20 20:00:59,051 INFO L290 TraceCheckUtils]: 43: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,051 INFO L290 TraceCheckUtils]: 44: Hoare triple {127932#true} assume !(1 == ~t2_pc~0); {127932#true} is VALID [2022-02-20 20:00:59,051 INFO L290 TraceCheckUtils]: 45: Hoare triple {127932#true} is_transmit2_triggered_~__retres1~6#1 := 0; {127932#true} is VALID [2022-02-20 20:00:59,051 INFO L290 TraceCheckUtils]: 46: Hoare triple {127932#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {127932#true} is VALID [2022-02-20 20:00:59,051 INFO L290 TraceCheckUtils]: 47: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {127932#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {127932#true} is VALID [2022-02-20 20:00:59,051 INFO L290 TraceCheckUtils]: 49: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,052 INFO L290 TraceCheckUtils]: 50: Hoare triple {127932#true} assume 1 == ~t3_pc~0; {127932#true} is VALID [2022-02-20 20:00:59,052 INFO L290 TraceCheckUtils]: 51: Hoare triple {127932#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {127932#true} is VALID [2022-02-20 20:00:59,052 INFO L290 TraceCheckUtils]: 52: Hoare triple {127932#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {127932#true} is VALID [2022-02-20 20:00:59,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,052 INFO L290 TraceCheckUtils]: 54: Hoare triple {127932#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {127932#true} is VALID [2022-02-20 20:00:59,052 INFO L290 TraceCheckUtils]: 55: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,052 INFO L290 TraceCheckUtils]: 56: Hoare triple {127932#true} assume 1 == ~t4_pc~0; {127932#true} is VALID [2022-02-20 20:00:59,052 INFO L290 TraceCheckUtils]: 57: Hoare triple {127932#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {127932#true} is VALID [2022-02-20 20:00:59,053 INFO L290 TraceCheckUtils]: 58: Hoare triple {127932#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {127932#true} is VALID [2022-02-20 20:00:59,053 INFO L290 TraceCheckUtils]: 59: Hoare triple {127932#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; {127932#true} is VALID [2022-02-20 20:00:59,053 INFO L290 TraceCheckUtils]: 60: Hoare triple {127932#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {127932#true} is VALID [2022-02-20 20:00:59,053 INFO L290 TraceCheckUtils]: 61: Hoare triple {127932#true} assume { :begin_inline_is_transmit5_triggered } true;havoc is_transmit5_triggered_#res#1;havoc is_transmit5_triggered_~__retres1~9#1;havoc is_transmit5_triggered_~__retres1~9#1; {127932#true} is VALID [2022-02-20 20:00:59,053 INFO L290 TraceCheckUtils]: 62: Hoare triple {127932#true} assume !(1 == ~t5_pc~0); {127932#true} is VALID [2022-02-20 20:00:59,053 INFO L290 TraceCheckUtils]: 63: Hoare triple {127932#true} is_transmit5_triggered_~__retres1~9#1 := 0; {127932#true} is VALID [2022-02-20 20:00:59,053 INFO L290 TraceCheckUtils]: 64: Hoare triple {127932#true} is_transmit5_triggered_#res#1 := is_transmit5_triggered_~__retres1~9#1; {127932#true} is VALID [2022-02-20 20:00:59,053 INFO L290 TraceCheckUtils]: 65: Hoare triple {127932#true} #t~ret33#1 := is_transmit5_triggered_#res#1;assume { :end_inline_is_transmit5_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___4~0#1 := #t~ret33#1;havoc #t~ret33#1; {127932#true} is VALID [2022-02-20 20:00:59,053 INFO L290 TraceCheckUtils]: 66: Hoare triple {127932#true} assume !(0 != ~tmp___4~0#1); {127932#true} is VALID [2022-02-20 20:00:59,054 INFO L290 TraceCheckUtils]: 67: Hoare triple {127932#true} assume true; {127932#true} is VALID [2022-02-20 20:00:59,054 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {127932#true} {127933#false} #1193#return; {127933#false} is VALID [2022-02-20 20:00:59,054 INFO L272 TraceCheckUtils]: 69: Hoare triple {127933#false} call reset_delta_events2(); {128008#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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:59,054 INFO L290 TraceCheckUtils]: 70: Hoare triple {128008#(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) (= |old(~T5_E~0)| ~T5_E~0) (= ~E_5~0 |old(~E_5~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); {127932#true} is VALID [2022-02-20 20:00:59,054 INFO L290 TraceCheckUtils]: 71: Hoare triple {127932#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,054 INFO L290 TraceCheckUtils]: 72: Hoare triple {127932#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,054 INFO L290 TraceCheckUtils]: 73: Hoare triple {127932#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,054 INFO L290 TraceCheckUtils]: 74: Hoare triple {127932#true} assume 1 == ~T4_E~0;~T4_E~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,055 INFO L290 TraceCheckUtils]: 75: Hoare triple {127932#true} assume 1 == ~T5_E~0;~T5_E~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,055 INFO L290 TraceCheckUtils]: 76: Hoare triple {127932#true} assume !(1 == ~E_M~0); {127932#true} is VALID [2022-02-20 20:00:59,055 INFO L290 TraceCheckUtils]: 77: Hoare triple {127932#true} assume 1 == ~E_1~0;~E_1~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,055 INFO L290 TraceCheckUtils]: 78: Hoare triple {127932#true} assume 1 == ~E_2~0;~E_2~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,055 INFO L290 TraceCheckUtils]: 79: Hoare triple {127932#true} assume 1 == ~E_3~0;~E_3~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,055 INFO L290 TraceCheckUtils]: 80: Hoare triple {127932#true} assume 1 == ~E_4~0;~E_4~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,055 INFO L290 TraceCheckUtils]: 81: Hoare triple {127932#true} assume 1 == ~E_5~0;~E_5~0 := 2; {127932#true} is VALID [2022-02-20 20:00:59,055 INFO L290 TraceCheckUtils]: 82: Hoare triple {127932#true} assume true; {127932#true} is VALID [2022-02-20 20:00:59,055 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {127932#true} {127933#false} #1195#return; {127933#false} is VALID [2022-02-20 20:00:59,056 INFO L290 TraceCheckUtils]: 84: Hoare triple {127933#false} assume !false; {127933#false} is VALID [2022-02-20 20:00:59,056 INFO L290 TraceCheckUtils]: 85: Hoare triple {127933#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_4~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_5~0#1, eval2_#t~nondet27#1, eval2_~tmp_ndt_6~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {127933#false} is VALID [2022-02-20 20:00:59,056 INFO L290 TraceCheckUtils]: 86: Hoare triple {127933#false} assume !false; {127933#false} is VALID [2022-02-20 20:00:59,056 INFO L272 TraceCheckUtils]: 87: Hoare triple {127933#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {127932#true} is VALID [2022-02-20 20:00:59,056 INFO L290 TraceCheckUtils]: 88: Hoare triple {127932#true} havoc ~__retres1~10; {127932#true} is VALID [2022-02-20 20:00:59,056 INFO L290 TraceCheckUtils]: 89: Hoare triple {127932#true} assume 0 == ~m_st~0;~__retres1~10 := 1; {127932#true} is VALID [2022-02-20 20:00:59,056 INFO L290 TraceCheckUtils]: 90: Hoare triple {127932#true} #res := ~__retres1~10; {127932#true} is VALID [2022-02-20 20:00:59,056 INFO L290 TraceCheckUtils]: 91: Hoare triple {127932#true} assume true; {127932#true} is VALID [2022-02-20 20:00:59,057 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {127932#true} {127933#false} #1197#return; {127933#false} is VALID [2022-02-20 20:00:59,057 INFO L290 TraceCheckUtils]: 93: Hoare triple {127933#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {127933#false} is VALID [2022-02-20 20:00:59,057 INFO L290 TraceCheckUtils]: 94: Hoare triple {127933#false} assume 0 != eval2_~tmp~5#1; {127933#false} is VALID [2022-02-20 20:00:59,057 INFO L290 TraceCheckUtils]: 95: Hoare triple {127933#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {127933#false} is VALID [2022-02-20 20:00:59,057 INFO L290 TraceCheckUtils]: 96: Hoare triple {127933#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {127933#false} is VALID [2022-02-20 20:00:59,057 INFO L290 TraceCheckUtils]: 97: Hoare triple {127933#false} assume !(0 == ~m_pc~0); {127933#false} is VALID [2022-02-20 20:00:59,057 INFO L290 TraceCheckUtils]: 98: Hoare triple {127933#false} assume 1 == ~m_pc~0; {127933#false} is VALID [2022-02-20 20:00:59,057 INFO L290 TraceCheckUtils]: 99: Hoare triple {127933#false} assume ~token~0 != 5 + ~local~0;assume { :begin_inline_error2 } true; {127933#false} is VALID [2022-02-20 20:00:59,057 INFO L290 TraceCheckUtils]: 100: Hoare triple {127933#false} assume !false; {127933#false} is VALID [2022-02-20 20:00:59,058 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:59,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:59,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966477011] [2022-02-20 20:00:59,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966477011] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:59,058 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:59,058 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:59,058 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571900585] [2022-02-20 20:00:59,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:59,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-02-20 20:00:59,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:59,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:59,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:59,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:59,120 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:59,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:59,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:59,121 INFO L87 Difference]: Start difference. First operand 2496 states and 3197 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)