./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:27,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:27,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:27,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:27,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:27,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:27,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:27,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:27,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:27,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:27,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:27,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:27,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:27,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:27,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:27,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:27,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:27,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:27,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:27,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:27,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:27,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:27,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:27,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:27,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:27,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:27,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:27,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:27,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:27,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:27,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:27,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:27,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:27,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:27,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:27,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:27,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:27,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:27,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:27,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:27,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:27,116 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:27,136 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:27,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:27,137 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:27,137 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:27,138 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:27,138 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:27,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:27,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:27,139 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:27,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:27,140 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:27,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:27,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:27,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:27,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:27,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:27,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:27,141 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:27,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:27,142 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:27,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:27,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:27,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:27,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:27,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:27,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:27,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:27,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:27,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:27,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:27,145 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:27,145 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:27,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:27,145 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 -> d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae [2022-02-20 19:59:27,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:27,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:27,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:27,401 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:27,402 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:27,403 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.02.cil-2.c [2022-02-20 19:59:27,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1ff9088/2e522f828db84cc8908b6dafb8942c40/FLAG2e482e1bd [2022-02-20 19:59:27,934 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:27,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2022-02-20 19:59:27,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1ff9088/2e522f828db84cc8908b6dafb8942c40/FLAG2e482e1bd [2022-02-20 19:59:27,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1ff9088/2e522f828db84cc8908b6dafb8942c40 [2022-02-20 19:59:27,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:27,975 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:27,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:27,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:27,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:27,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:27" (1/1) ... [2022-02-20 19:59:27,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61366aa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:27, skipping insertion in model container [2022-02-20 19:59:27,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:27" (1/1) ... [2022-02-20 19:59:27,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:28,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:28,178 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.02.cil-2.c[911,924] [2022-02-20 19:59:28,228 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.02.cil-2.c[8416,8429] [2022-02-20 19:59:28,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:28,267 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:28,277 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.02.cil-2.c[911,924] [2022-02-20 19:59:28,300 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.02.cil-2.c[8416,8429] [2022-02-20 19:59:28,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:28,359 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:28,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:28 WrapperNode [2022-02-20 19:59:28,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:28,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:28,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:28,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:28,369 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:28" (1/1) ... [2022-02-20 19:59:28,380 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:28" (1/1) ... [2022-02-20 19:59:28,424 INFO L137 Inliner]: procedures = 59, calls = 68, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 503 [2022-02-20 19:59:28,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:28,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:28,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:28,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:28,434 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:28" (1/1) ... [2022-02-20 19:59:28,434 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:28" (1/1) ... [2022-02-20 19:59:28,438 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:28" (1/1) ... [2022-02-20 19:59:28,438 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:28" (1/1) ... [2022-02-20 19:59:28,447 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:28" (1/1) ... [2022-02-20 19:59:28,456 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:28" (1/1) ... [2022-02-20 19:59:28,459 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:28" (1/1) ... [2022-02-20 19:59:28,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:28,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:28,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:28,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:28,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:28" (1/1) ... [2022-02-20 19:59:28,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:28,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:28,503 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:28,513 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:28,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:28,532 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:28,532 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:28,532 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:28,532 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:28,533 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:28,533 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:28,533 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:28,533 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:28,533 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:28,534 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:28,534 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:28,534 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:28,534 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:28,534 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:28,534 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:28,535 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:28,535 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:28,535 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:28,535 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:28,536 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:28,536 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:28,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:28,536 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:28,537 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:28,537 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:28,537 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:28,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:28,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:28,537 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:28,538 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:28,538 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:59:28,538 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:59:28,624 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:28,626 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:29,211 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 19:59:29,211 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:29,271 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:29,290 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:29,293 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-20 19:59:29,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:29 BoogieIcfgContainer [2022-02-20 19:59:29,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:29,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:29,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:29,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:29,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:27" (1/3) ... [2022-02-20 19:59:29,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5603cf39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:29, skipping insertion in model container [2022-02-20 19:59:29,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:28" (2/3) ... [2022-02-20 19:59:29,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5603cf39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:29, skipping insertion in model container [2022-02-20 19:59:29,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:29" (3/3) ... [2022-02-20 19:59:29,304 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-2.c [2022-02-20 19:59:29,309 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:29,310 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:29,367 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:29,374 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:29,375 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 257 states, 205 states have (on average 1.5658536585365854) internal successors, (321), 213 states have internal predecessors, (321), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2022-02-20 19:59:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:29,423 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:29,424 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:29,424 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:29,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:29,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1020803089, now seen corresponding path program 1 times [2022-02-20 19:59:29,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:29,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495502571] [2022-02-20 19:59:29,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:29,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:29,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:29,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {300#(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); {301#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:29,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {301#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:29,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {262#(= ~q_read_ev~0 2)} #854#return; {262#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:29,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:29,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#(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; {303#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:29,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {303#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {303#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:29,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {303#(= |old(~q_read_ev~0)| 0)} assume true; {303#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:29,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {303#(= |old(~q_read_ev~0)| 0)} {262#(= ~q_read_ev~0 2)} #856#return; {261#false} is VALID [2022-02-20 19:59:29,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:29,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:29,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {260#true} havoc ~__retres1~0; {260#true} is VALID [2022-02-20 19:59:29,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#true} assume 1 == ~p_dw_pc~0; {260#true} is VALID [2022-02-20 19:59:29,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {260#true} is VALID [2022-02-20 19:59:29,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {260#true} #res := ~__retres1~0; {260#true} is VALID [2022-02-20 19:59:29,820 INFO L290 TraceCheckUtils]: 4: Hoare triple {260#true} assume true; {260#true} is VALID [2022-02-20 19:59:29,821 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {260#true} {260#true} #850#return; {260#true} is VALID [2022-02-20 19:59:29,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:29,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {260#true} havoc ~__retres1~1; {260#true} is VALID [2022-02-20 19:59:29,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#true} assume 1 == ~c_dr_pc~0; {260#true} is VALID [2022-02-20 19:59:29,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {260#true} is VALID [2022-02-20 19:59:29,828 INFO L290 TraceCheckUtils]: 3: Hoare triple {260#true} #res := ~__retres1~1; {260#true} is VALID [2022-02-20 19:59:29,828 INFO L290 TraceCheckUtils]: 4: Hoare triple {260#true} assume true; {260#true} is VALID [2022-02-20 19:59:29,829 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {260#true} {260#true} #852#return; {260#true} is VALID [2022-02-20 19:59:29,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {304#(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; {260#true} is VALID [2022-02-20 19:59:29,830 INFO L272 TraceCheckUtils]: 1: Hoare triple {260#true} call #t~ret8 := is_do_write_p_triggered(); {260#true} is VALID [2022-02-20 19:59:29,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#true} havoc ~__retres1~0; {260#true} is VALID [2022-02-20 19:59:29,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {260#true} assume 1 == ~p_dw_pc~0; {260#true} is VALID [2022-02-20 19:59:29,831 INFO L290 TraceCheckUtils]: 4: Hoare triple {260#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {260#true} is VALID [2022-02-20 19:59:29,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#true} #res := ~__retres1~0; {260#true} is VALID [2022-02-20 19:59:29,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {260#true} assume true; {260#true} is VALID [2022-02-20 19:59:29,832 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {260#true} {260#true} #850#return; {260#true} is VALID [2022-02-20 19:59:29,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {260#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {260#true} is VALID [2022-02-20 19:59:29,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {260#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {260#true} is VALID [2022-02-20 19:59:29,833 INFO L272 TraceCheckUtils]: 10: Hoare triple {260#true} call #t~ret9 := is_do_read_c_triggered(); {260#true} is VALID [2022-02-20 19:59:29,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {260#true} havoc ~__retres1~1; {260#true} is VALID [2022-02-20 19:59:29,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {260#true} assume 1 == ~c_dr_pc~0; {260#true} is VALID [2022-02-20 19:59:29,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {260#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {260#true} is VALID [2022-02-20 19:59:29,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {260#true} #res := ~__retres1~1; {260#true} is VALID [2022-02-20 19:59:29,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {260#true} assume true; {260#true} is VALID [2022-02-20 19:59:29,836 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {260#true} {260#true} #852#return; {260#true} is VALID [2022-02-20 19:59:29,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {260#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {260#true} is VALID [2022-02-20 19:59:29,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {260#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {260#true} is VALID [2022-02-20 19:59:29,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {260#true} assume true; {260#true} is VALID [2022-02-20 19:59:29,839 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {260#true} {261#false} #858#return; {261#false} is VALID [2022-02-20 19:59:29,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:29,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {260#true} is VALID [2022-02-20 19:59:29,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {260#true} is VALID [2022-02-20 19:59:29,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#true} assume true; {260#true} is VALID [2022-02-20 19:59:29,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {260#true} {261#false} #860#return; {261#false} is VALID [2022-02-20 19:59:29,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:29,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {260#true} havoc ~__retres1~2; {260#true} is VALID [2022-02-20 19:59:29,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {260#true} is VALID [2022-02-20 19:59:29,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#true} #res := ~__retres1~2; {260#true} is VALID [2022-02-20 19:59:29,861 INFO L290 TraceCheckUtils]: 3: Hoare triple {260#true} assume true; {260#true} is VALID [2022-02-20 19:59:29,861 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {260#true} {261#false} #862#return; {261#false} is VALID [2022-02-20 19:59:29,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {260#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {260#true} is VALID [2022-02-20 19:59:29,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {260#true} is VALID [2022-02-20 19:59:29,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {262#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:29,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {262#(= ~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; {262#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:29,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#(= ~q_read_ev~0 2)} call update_channels1(); {300#(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:29,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {300#(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); {301#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:29,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {301#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {301#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:29,870 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {301#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {262#(= ~q_read_ev~0 2)} #854#return; {262#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:29,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {262#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {262#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:29,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {262#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {262#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:29,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {262#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {262#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:29,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {262#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:29,874 INFO L272 TraceCheckUtils]: 12: Hoare triple {262#(= ~q_read_ev~0 2)} call fire_delta_events1(); {302#(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:29,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {302#(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; {303#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:29,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {303#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {303#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:29,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {303#(= |old(~q_read_ev~0)| 0)} assume true; {303#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:29,876 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {303#(= |old(~q_read_ev~0)| 0)} {262#(= ~q_read_ev~0 2)} #856#return; {261#false} is VALID [2022-02-20 19:59:29,876 INFO L272 TraceCheckUtils]: 17: Hoare triple {261#false} call activate_threads1(); {304#(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:29,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {304#(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; {260#true} is VALID [2022-02-20 19:59:29,876 INFO L272 TraceCheckUtils]: 19: Hoare triple {260#true} call #t~ret8 := is_do_write_p_triggered(); {260#true} is VALID [2022-02-20 19:59:29,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {260#true} havoc ~__retres1~0; {260#true} is VALID [2022-02-20 19:59:29,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {260#true} assume 1 == ~p_dw_pc~0; {260#true} is VALID [2022-02-20 19:59:29,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {260#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {260#true} is VALID [2022-02-20 19:59:29,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {260#true} #res := ~__retres1~0; {260#true} is VALID [2022-02-20 19:59:29,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {260#true} assume true; {260#true} is VALID [2022-02-20 19:59:29,878 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {260#true} {260#true} #850#return; {260#true} is VALID [2022-02-20 19:59:29,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {260#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {260#true} is VALID [2022-02-20 19:59:29,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {260#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {260#true} is VALID [2022-02-20 19:59:29,879 INFO L272 TraceCheckUtils]: 28: Hoare triple {260#true} call #t~ret9 := is_do_read_c_triggered(); {260#true} is VALID [2022-02-20 19:59:29,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {260#true} havoc ~__retres1~1; {260#true} is VALID [2022-02-20 19:59:29,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {260#true} assume 1 == ~c_dr_pc~0; {260#true} is VALID [2022-02-20 19:59:29,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {260#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {260#true} is VALID [2022-02-20 19:59:29,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {260#true} #res := ~__retres1~1; {260#true} is VALID [2022-02-20 19:59:29,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {260#true} assume true; {260#true} is VALID [2022-02-20 19:59:29,880 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {260#true} {260#true} #852#return; {260#true} is VALID [2022-02-20 19:59:29,880 INFO L290 TraceCheckUtils]: 35: Hoare triple {260#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {260#true} is VALID [2022-02-20 19:59:29,880 INFO L290 TraceCheckUtils]: 36: Hoare triple {260#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {260#true} is VALID [2022-02-20 19:59:29,881 INFO L290 TraceCheckUtils]: 37: Hoare triple {260#true} assume true; {260#true} is VALID [2022-02-20 19:59:29,881 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {260#true} {261#false} #858#return; {261#false} is VALID [2022-02-20 19:59:29,881 INFO L272 TraceCheckUtils]: 39: Hoare triple {261#false} call reset_delta_events1(); {302#(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:29,881 INFO L290 TraceCheckUtils]: 40: Hoare triple {302#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {260#true} is VALID [2022-02-20 19:59:29,882 INFO L290 TraceCheckUtils]: 41: Hoare triple {260#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {260#true} is VALID [2022-02-20 19:59:29,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {260#true} assume true; {260#true} is VALID [2022-02-20 19:59:29,882 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {260#true} {261#false} #860#return; {261#false} is VALID [2022-02-20 19:59:29,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {261#false} assume !false; {261#false} is VALID [2022-02-20 19:59:29,883 INFO L290 TraceCheckUtils]: 45: Hoare triple {261#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; {261#false} is VALID [2022-02-20 19:59:29,883 INFO L290 TraceCheckUtils]: 46: Hoare triple {261#false} assume !false; {261#false} is VALID [2022-02-20 19:59:29,883 INFO L272 TraceCheckUtils]: 47: Hoare triple {261#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {260#true} is VALID [2022-02-20 19:59:29,884 INFO L290 TraceCheckUtils]: 48: Hoare triple {260#true} havoc ~__retres1~2; {260#true} is VALID [2022-02-20 19:59:29,884 INFO L290 TraceCheckUtils]: 49: Hoare triple {260#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {260#true} is VALID [2022-02-20 19:59:29,884 INFO L290 TraceCheckUtils]: 50: Hoare triple {260#true} #res := ~__retres1~2; {260#true} is VALID [2022-02-20 19:59:29,885 INFO L290 TraceCheckUtils]: 51: Hoare triple {260#true} assume true; {260#true} is VALID [2022-02-20 19:59:29,885 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {260#true} {261#false} #862#return; {261#false} is VALID [2022-02-20 19:59:29,887 INFO L290 TraceCheckUtils]: 53: Hoare triple {261#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; {261#false} is VALID [2022-02-20 19:59:29,887 INFO L290 TraceCheckUtils]: 54: Hoare triple {261#false} assume 0 != eval1_~tmp___1~0#1; {261#false} is VALID [2022-02-20 19:59:29,887 INFO L290 TraceCheckUtils]: 55: Hoare triple {261#false} assume !(0 == ~p_dw_st~0); {261#false} is VALID [2022-02-20 19:59:29,889 INFO L290 TraceCheckUtils]: 56: Hoare triple {261#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; {261#false} is VALID [2022-02-20 19:59:29,889 INFO L290 TraceCheckUtils]: 57: Hoare triple {261#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; {261#false} is VALID [2022-02-20 19:59:29,889 INFO L290 TraceCheckUtils]: 58: Hoare triple {261#false} assume !(0 == ~c_dr_pc~0); {261#false} is VALID [2022-02-20 19:59:29,889 INFO L290 TraceCheckUtils]: 59: Hoare triple {261#false} assume 2 == ~c_dr_pc~0; {261#false} is VALID [2022-02-20 19:59:29,890 INFO L290 TraceCheckUtils]: 60: Hoare triple {261#false} do_read_c_~a~0#1 := ~a_t~0; {261#false} is VALID [2022-02-20 19:59:29,890 INFO L290 TraceCheckUtils]: 61: Hoare triple {261#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; {261#false} is VALID [2022-02-20 19:59:29,890 INFO L290 TraceCheckUtils]: 62: Hoare triple {261#false} assume !(~p_last_write~0 == ~c_last_read~0); {261#false} is VALID [2022-02-20 19:59:29,890 INFO L272 TraceCheckUtils]: 63: Hoare triple {261#false} call error1(); {261#false} is VALID [2022-02-20 19:59:29,891 INFO L290 TraceCheckUtils]: 64: Hoare triple {261#false} assume !false; {261#false} is VALID [2022-02-20 19:59:29,891 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:29,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:29,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495502571] [2022-02-20 19:59:29,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495502571] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:29,894 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:29,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:29,896 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635059393] [2022-02-20 19:59:29,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:29,902 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:29,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:29,907 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:29,971 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:29,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:29,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:29,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:29,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:30,002 INFO L87 Difference]: Start difference. First operand has 257 states, 205 states have (on average 1.5658536585365854) internal successors, (321), 213 states have internal predecessors, (321), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:32,769 INFO L93 Difference]: Finished difference Result 646 states and 985 transitions. [2022-02-20 19:59:32,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:32,770 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:32,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:32,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 985 transitions. [2022-02-20 19:59:32,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:32,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 985 transitions. [2022-02-20 19:59:32,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 985 transitions. [2022-02-20 19:59:33,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 985 edges. 985 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:33,631 INFO L225 Difference]: With dead ends: 646 [2022-02-20 19:59:33,632 INFO L226 Difference]: Without dead ends: 397 [2022-02-20 19:59:33,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:59:33,639 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 678 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:33,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [685 Valid, 1237 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:59:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-02-20 19:59:33,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 358. [2022-02-20 19:59:33,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:33,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand has 358 states, 287 states have (on average 1.456445993031359) internal successors, (418), 294 states have internal predecessors, (418), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:59:33,697 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand has 358 states, 287 states have (on average 1.456445993031359) internal successors, (418), 294 states have internal predecessors, (418), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:59:33,698 INFO L87 Difference]: Start difference. First operand 397 states. Second operand has 358 states, 287 states have (on average 1.456445993031359) internal successors, (418), 294 states have internal predecessors, (418), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:59:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:33,724 INFO L93 Difference]: Finished difference Result 397 states and 569 transitions. [2022-02-20 19:59:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 569 transitions. [2022-02-20 19:59:33,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:33,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:33,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 358 states, 287 states have (on average 1.456445993031359) internal successors, (418), 294 states have internal predecessors, (418), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) Second operand 397 states. [2022-02-20 19:59:33,731 INFO L87 Difference]: Start difference. First operand has 358 states, 287 states have (on average 1.456445993031359) internal successors, (418), 294 states have internal predecessors, (418), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) Second operand 397 states. [2022-02-20 19:59:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:33,751 INFO L93 Difference]: Finished difference Result 397 states and 569 transitions. [2022-02-20 19:59:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 569 transitions. [2022-02-20 19:59:33,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:33,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:33,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:33,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 287 states have (on average 1.456445993031359) internal successors, (418), 294 states have internal predecessors, (418), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-02-20 19:59:33,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 513 transitions. [2022-02-20 19:59:33,773 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 513 transitions. Word has length 65 [2022-02-20 19:59:33,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:33,774 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 513 transitions. [2022-02-20 19:59:33,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 513 transitions. [2022-02-20 19:59:33,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:33,776 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:33,776 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:33,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:59:33,777 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:33,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:33,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1595275567, now seen corresponding path program 1 times [2022-02-20 19:59:33,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:33,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348065422] [2022-02-20 19:59:33,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:33,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:33,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:33,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {2549#(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); {2550#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:33,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {2550#(not (= |old(~q_req_up~0)| 1))} assume true; {2550#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:33,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2550#(not (= |old(~q_req_up~0)| 1))} {2510#(= ~q_req_up~0 ~p_dw_pc~0)} #854#return; {2514#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:33,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:33,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {2551#(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); {2507#true} is VALID [2022-02-20 19:59:33,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {2507#true} assume !(0 == ~q_write_ev~0); {2507#true} is VALID [2022-02-20 19:59:33,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {2507#true} assume true; {2507#true} is VALID [2022-02-20 19:59:33,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2507#true} {2514#(not (= ~p_dw_pc~0 1))} #856#return; {2514#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:33,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:33,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:33,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {2507#true} havoc ~__retres1~0; {2507#true} is VALID [2022-02-20 19:59:33,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {2507#true} assume 1 == ~p_dw_pc~0; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,893 INFO L290 TraceCheckUtils]: 3: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,893 INFO L290 TraceCheckUtils]: 4: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,894 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} {2507#true} #850#return; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:33,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {2507#true} havoc ~__retres1~1; {2507#true} is VALID [2022-02-20 19:59:33,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {2507#true} assume 1 == ~c_dr_pc~0; {2507#true} is VALID [2022-02-20 19:59:33,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {2507#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2507#true} is VALID [2022-02-20 19:59:33,899 INFO L290 TraceCheckUtils]: 3: Hoare triple {2507#true} #res := ~__retres1~1; {2507#true} is VALID [2022-02-20 19:59:33,899 INFO L290 TraceCheckUtils]: 4: Hoare triple {2507#true} assume true; {2507#true} is VALID [2022-02-20 19:59:33,900 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2507#true} {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} #852#return; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {2552#(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; {2507#true} is VALID [2022-02-20 19:59:33,900 INFO L272 TraceCheckUtils]: 1: Hoare triple {2507#true} call #t~ret8 := is_do_write_p_triggered(); {2507#true} is VALID [2022-02-20 19:59:33,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {2507#true} havoc ~__retres1~0; {2507#true} is VALID [2022-02-20 19:59:33,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {2507#true} assume 1 == ~p_dw_pc~0; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,903 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} {2507#true} #850#return; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,904 INFO L272 TraceCheckUtils]: 10: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {2507#true} is VALID [2022-02-20 19:59:33,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {2507#true} havoc ~__retres1~1; {2507#true} is VALID [2022-02-20 19:59:33,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {2507#true} assume 1 == ~c_dr_pc~0; {2507#true} is VALID [2022-02-20 19:59:33,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {2507#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2507#true} is VALID [2022-02-20 19:59:33,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {2507#true} #res := ~__retres1~1; {2507#true} is VALID [2022-02-20 19:59:33,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {2507#true} assume true; {2507#true} is VALID [2022-02-20 19:59:33,906 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2507#true} {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} #852#return; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,908 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} {2514#(not (= ~p_dw_pc~0 1))} #858#return; {2508#false} is VALID [2022-02-20 19:59:33,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:33,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {2551#(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); {2507#true} is VALID [2022-02-20 19:59:33,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {2507#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2507#true} is VALID [2022-02-20 19:59:33,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {2507#true} assume true; {2507#true} is VALID [2022-02-20 19:59:33,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2507#true} {2508#false} #860#return; {2508#false} is VALID [2022-02-20 19:59:33,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:33,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {2507#true} havoc ~__retres1~2; {2507#true} is VALID [2022-02-20 19:59:33,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {2507#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2507#true} is VALID [2022-02-20 19:59:33,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {2507#true} #res := ~__retres1~2; {2507#true} is VALID [2022-02-20 19:59:33,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {2507#true} assume true; {2507#true} is VALID [2022-02-20 19:59:33,918 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2507#true} {2508#false} #862#return; {2508#false} is VALID [2022-02-20 19:59:33,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {2507#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {2509#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:33,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {2509#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {2509#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:33,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {2509#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {2510#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:33,920 INFO L290 TraceCheckUtils]: 3: Hoare triple {2510#(= ~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; {2510#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:33,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {2510#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {2549#(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:33,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {2549#(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); {2550#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:33,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {2550#(not (= |old(~q_req_up~0)| 1))} assume true; {2550#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:33,922 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2550#(not (= |old(~q_req_up~0)| 1))} {2510#(= ~q_req_up~0 ~p_dw_pc~0)} #854#return; {2514#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:33,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {2514#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {2514#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:33,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {2514#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2514#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:33,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {2514#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2514#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:33,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {2514#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {2514#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:33,925 INFO L272 TraceCheckUtils]: 12: Hoare triple {2514#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {2551#(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:33,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {2551#(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); {2507#true} is VALID [2022-02-20 19:59:33,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {2507#true} assume !(0 == ~q_write_ev~0); {2507#true} is VALID [2022-02-20 19:59:33,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {2507#true} assume true; {2507#true} is VALID [2022-02-20 19:59:33,926 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2507#true} {2514#(not (= ~p_dw_pc~0 1))} #856#return; {2514#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:33,926 INFO L272 TraceCheckUtils]: 17: Hoare triple {2514#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {2552#(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:33,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {2552#(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; {2507#true} is VALID [2022-02-20 19:59:33,927 INFO L272 TraceCheckUtils]: 19: Hoare triple {2507#true} call #t~ret8 := is_do_write_p_triggered(); {2507#true} is VALID [2022-02-20 19:59:33,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {2507#true} havoc ~__retres1~0; {2507#true} is VALID [2022-02-20 19:59:33,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {2507#true} assume 1 == ~p_dw_pc~0; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,929 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} {2507#true} #850#return; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,930 INFO L272 TraceCheckUtils]: 28: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {2507#true} is VALID [2022-02-20 19:59:33,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {2507#true} havoc ~__retres1~1; {2507#true} is VALID [2022-02-20 19:59:33,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {2507#true} assume 1 == ~c_dr_pc~0; {2507#true} is VALID [2022-02-20 19:59:33,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {2507#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2507#true} is VALID [2022-02-20 19:59:33,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {2507#true} #res := ~__retres1~1; {2507#true} is VALID [2022-02-20 19:59:33,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {2507#true} assume true; {2507#true} is VALID [2022-02-20 19:59:33,932 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2507#true} {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} #852#return; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:33,934 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2559#(= (+ (- 1) ~p_dw_pc~0) 0)} {2514#(not (= ~p_dw_pc~0 1))} #858#return; {2508#false} is VALID [2022-02-20 19:59:33,934 INFO L272 TraceCheckUtils]: 39: Hoare triple {2508#false} call reset_delta_events1(); {2551#(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:33,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {2551#(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); {2507#true} is VALID [2022-02-20 19:59:33,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {2507#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2507#true} is VALID [2022-02-20 19:59:33,934 INFO L290 TraceCheckUtils]: 42: Hoare triple {2507#true} assume true; {2507#true} is VALID [2022-02-20 19:59:33,935 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2507#true} {2508#false} #860#return; {2508#false} is VALID [2022-02-20 19:59:33,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {2508#false} assume !false; {2508#false} is VALID [2022-02-20 19:59:33,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {2508#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; {2508#false} is VALID [2022-02-20 19:59:33,935 INFO L290 TraceCheckUtils]: 46: Hoare triple {2508#false} assume !false; {2508#false} is VALID [2022-02-20 19:59:33,935 INFO L272 TraceCheckUtils]: 47: Hoare triple {2508#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2507#true} is VALID [2022-02-20 19:59:33,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {2507#true} havoc ~__retres1~2; {2507#true} is VALID [2022-02-20 19:59:33,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {2507#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2507#true} is VALID [2022-02-20 19:59:33,936 INFO L290 TraceCheckUtils]: 50: Hoare triple {2507#true} #res := ~__retres1~2; {2507#true} is VALID [2022-02-20 19:59:33,936 INFO L290 TraceCheckUtils]: 51: Hoare triple {2507#true} assume true; {2507#true} is VALID [2022-02-20 19:59:33,936 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2507#true} {2508#false} #862#return; {2508#false} is VALID [2022-02-20 19:59:33,937 INFO L290 TraceCheckUtils]: 53: Hoare triple {2508#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; {2508#false} is VALID [2022-02-20 19:59:33,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {2508#false} assume 0 != eval1_~tmp___1~0#1; {2508#false} is VALID [2022-02-20 19:59:33,937 INFO L290 TraceCheckUtils]: 55: Hoare triple {2508#false} assume !(0 == ~p_dw_st~0); {2508#false} is VALID [2022-02-20 19:59:33,937 INFO L290 TraceCheckUtils]: 56: Hoare triple {2508#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; {2508#false} is VALID [2022-02-20 19:59:33,937 INFO L290 TraceCheckUtils]: 57: Hoare triple {2508#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; {2508#false} is VALID [2022-02-20 19:59:33,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {2508#false} assume !(0 == ~c_dr_pc~0); {2508#false} is VALID [2022-02-20 19:59:33,938 INFO L290 TraceCheckUtils]: 59: Hoare triple {2508#false} assume 2 == ~c_dr_pc~0; {2508#false} is VALID [2022-02-20 19:59:33,938 INFO L290 TraceCheckUtils]: 60: Hoare triple {2508#false} do_read_c_~a~0#1 := ~a_t~0; {2508#false} is VALID [2022-02-20 19:59:33,938 INFO L290 TraceCheckUtils]: 61: Hoare triple {2508#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; {2508#false} is VALID [2022-02-20 19:59:33,938 INFO L290 TraceCheckUtils]: 62: Hoare triple {2508#false} assume !(~p_last_write~0 == ~c_last_read~0); {2508#false} is VALID [2022-02-20 19:59:33,939 INFO L272 TraceCheckUtils]: 63: Hoare triple {2508#false} call error1(); {2508#false} is VALID [2022-02-20 19:59:33,939 INFO L290 TraceCheckUtils]: 64: Hoare triple {2508#false} assume !false; {2508#false} is VALID [2022-02-20 19:59:33,939 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:33,940 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:33,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348065422] [2022-02-20 19:59:33,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348065422] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:33,940 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:33,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:33,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823929330] [2022-02-20 19:59:33,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:33,942 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 19:59:33,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:33,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:33,990 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:33,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:33,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:33,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:33,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:33,992 INFO L87 Difference]: Start difference. First operand 358 states and 513 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:39,725 INFO L93 Difference]: Finished difference Result 1391 states and 1973 transitions. [2022-02-20 19:59:39,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:39,725 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 19:59:39,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:39,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1161 transitions. [2022-02-20 19:59:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1161 transitions. [2022-02-20 19:59:39,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1161 transitions. [2022-02-20 19:59:40,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1161 edges. 1161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:40,749 INFO L225 Difference]: With dead ends: 1391 [2022-02-20 19:59:40,749 INFO L226 Difference]: Without dead ends: 1170 [2022-02-20 19:59:40,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:59:40,752 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 2383 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 653 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2403 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 653 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:40,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2403 Valid, 1718 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [653 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 19:59:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2022-02-20 19:59:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1031. [2022-02-20 19:59:40,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:40,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1170 states. Second operand has 1031 states, 830 states have (on average 1.393975903614458) internal successors, (1157), 845 states have internal predecessors, (1157), 118 states have call successors, (118), 75 states have call predecessors, (118), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) [2022-02-20 19:59:40,812 INFO L74 IsIncluded]: Start isIncluded. First operand 1170 states. Second operand has 1031 states, 830 states have (on average 1.393975903614458) internal successors, (1157), 845 states have internal predecessors, (1157), 118 states have call successors, (118), 75 states have call predecessors, (118), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) [2022-02-20 19:59:40,814 INFO L87 Difference]: Start difference. First operand 1170 states. Second operand has 1031 states, 830 states have (on average 1.393975903614458) internal successors, (1157), 845 states have internal predecessors, (1157), 118 states have call successors, (118), 75 states have call predecessors, (118), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) [2022-02-20 19:59:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:40,885 INFO L93 Difference]: Finished difference Result 1170 states and 1583 transitions. [2022-02-20 19:59:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1583 transitions. [2022-02-20 19:59:40,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:40,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:40,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 1031 states, 830 states have (on average 1.393975903614458) internal successors, (1157), 845 states have internal predecessors, (1157), 118 states have call successors, (118), 75 states have call predecessors, (118), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) Second operand 1170 states. [2022-02-20 19:59:40,894 INFO L87 Difference]: Start difference. First operand has 1031 states, 830 states have (on average 1.393975903614458) internal successors, (1157), 845 states have internal predecessors, (1157), 118 states have call successors, (118), 75 states have call predecessors, (118), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) Second operand 1170 states. [2022-02-20 19:59:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:40,965 INFO L93 Difference]: Finished difference Result 1170 states and 1583 transitions. [2022-02-20 19:59:40,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1583 transitions. [2022-02-20 19:59:40,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:40,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:40,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:40,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 830 states have (on average 1.393975903614458) internal successors, (1157), 845 states have internal predecessors, (1157), 118 states have call successors, (118), 75 states have call predecessors, (118), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) [2022-02-20 19:59:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1403 transitions. [2022-02-20 19:59:41,051 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1403 transitions. Word has length 65 [2022-02-20 19:59:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:41,053 INFO L470 AbstractCegarLoop]: Abstraction has 1031 states and 1403 transitions. [2022-02-20 19:59:41,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1403 transitions. [2022-02-20 19:59:41,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:59:41,055 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:41,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:41,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:59:41,056 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:41,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:41,056 INFO L85 PathProgramCache]: Analyzing trace with hash -306777911, now seen corresponding path program 1 times [2022-02-20 19:59:41,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:41,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006792553] [2022-02-20 19:59:41,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:41,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {8292#(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); {8252#true} is VALID [2022-02-20 19:59:41,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {8252#true} assume true; {8252#true} is VALID [2022-02-20 19:59:41,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8252#true} {8252#true} #854#return; {8252#true} is VALID [2022-02-20 19:59:41,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {8293#(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); {8252#true} is VALID [2022-02-20 19:59:41,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {8252#true} assume !(0 == ~q_write_ev~0); {8252#true} is VALID [2022-02-20 19:59:41,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {8252#true} assume true; {8252#true} is VALID [2022-02-20 19:59:41,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8252#true} {8252#true} #856#return; {8252#true} is VALID [2022-02-20 19:59:41,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {8252#true} havoc ~__retres1~0; {8252#true} is VALID [2022-02-20 19:59:41,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {8252#true} assume !(1 == ~p_dw_pc~0); {8252#true} is VALID [2022-02-20 19:59:41,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {8252#true} assume !(2 == ~p_dw_pc~0); {8252#true} is VALID [2022-02-20 19:59:41,232 INFO L290 TraceCheckUtils]: 3: Hoare triple {8252#true} ~__retres1~0 := 0; {8310#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:41,232 INFO L290 TraceCheckUtils]: 4: Hoare triple {8310#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {8311#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:41,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {8311#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {8311#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:41,233 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8311#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {8252#true} #850#return; {8302#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:41,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {8252#true} havoc ~__retres1~1; {8252#true} is VALID [2022-02-20 19:59:41,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {8252#true} assume 1 == ~c_dr_pc~0; {8252#true} is VALID [2022-02-20 19:59:41,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {8252#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {8252#true} is VALID [2022-02-20 19:59:41,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {8252#true} #res := ~__retres1~1; {8252#true} is VALID [2022-02-20 19:59:41,238 INFO L290 TraceCheckUtils]: 4: Hoare triple {8252#true} assume true; {8252#true} is VALID [2022-02-20 19:59:41,238 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8252#true} {8253#false} #852#return; {8253#false} is VALID [2022-02-20 19:59:41,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {8294#(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; {8252#true} is VALID [2022-02-20 19:59:41,239 INFO L272 TraceCheckUtils]: 1: Hoare triple {8252#true} call #t~ret8 := is_do_write_p_triggered(); {8252#true} is VALID [2022-02-20 19:59:41,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {8252#true} havoc ~__retres1~0; {8252#true} is VALID [2022-02-20 19:59:41,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {8252#true} assume !(1 == ~p_dw_pc~0); {8252#true} is VALID [2022-02-20 19:59:41,239 INFO L290 TraceCheckUtils]: 4: Hoare triple {8252#true} assume !(2 == ~p_dw_pc~0); {8252#true} is VALID [2022-02-20 19:59:41,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {8252#true} ~__retres1~0 := 0; {8310#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:41,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {8310#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {8311#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:41,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {8311#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {8311#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:41,241 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {8311#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {8252#true} #850#return; {8302#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:41,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {8302#(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; {8303#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:41,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {8303#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8253#false} is VALID [2022-02-20 19:59:41,243 INFO L272 TraceCheckUtils]: 11: Hoare triple {8253#false} call #t~ret9 := is_do_read_c_triggered(); {8252#true} is VALID [2022-02-20 19:59:41,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {8252#true} havoc ~__retres1~1; {8252#true} is VALID [2022-02-20 19:59:41,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {8252#true} assume 1 == ~c_dr_pc~0; {8252#true} is VALID [2022-02-20 19:59:41,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {8252#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {8252#true} is VALID [2022-02-20 19:59:41,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {8252#true} #res := ~__retres1~1; {8252#true} is VALID [2022-02-20 19:59:41,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {8252#true} assume true; {8252#true} is VALID [2022-02-20 19:59:41,244 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8252#true} {8253#false} #852#return; {8253#false} is VALID [2022-02-20 19:59:41,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {8253#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8253#false} is VALID [2022-02-20 19:59:41,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {8253#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {8253#false} is VALID [2022-02-20 19:59:41,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {8253#false} assume true; {8253#false} is VALID [2022-02-20 19:59:41,244 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8253#false} {8252#true} #858#return; {8253#false} is VALID [2022-02-20 19:59:41,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 19:59:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {8293#(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); {8252#true} is VALID [2022-02-20 19:59:41,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {8252#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {8252#true} is VALID [2022-02-20 19:59:41,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {8252#true} assume true; {8252#true} is VALID [2022-02-20 19:59:41,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8252#true} {8253#false} #860#return; {8253#false} is VALID [2022-02-20 19:59:41,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:59:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {8252#true} havoc ~__retres1~2; {8252#true} is VALID [2022-02-20 19:59:41,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {8252#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8252#true} is VALID [2022-02-20 19:59:41,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {8252#true} #res := ~__retres1~2; {8252#true} is VALID [2022-02-20 19:59:41,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {8252#true} assume true; {8252#true} is VALID [2022-02-20 19:59:41,254 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8252#true} {8253#false} #862#return; {8253#false} is VALID [2022-02-20 19:59:41,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {8252#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {8252#true} is VALID [2022-02-20 19:59:41,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {8252#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {8252#true} is VALID [2022-02-20 19:59:41,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {8252#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {8252#true} is VALID [2022-02-20 19:59:41,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {8252#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; {8252#true} is VALID [2022-02-20 19:59:41,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {8252#true} call update_channels1(); {8292#(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:41,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {8292#(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); {8252#true} is VALID [2022-02-20 19:59:41,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {8252#true} assume true; {8252#true} is VALID [2022-02-20 19:59:41,256 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8252#true} {8252#true} #854#return; {8252#true} is VALID [2022-02-20 19:59:41,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {8252#true} assume { :begin_inline_init_threads1 } true; {8252#true} is VALID [2022-02-20 19:59:41,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {8252#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {8252#true} is VALID [2022-02-20 19:59:41,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {8252#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {8252#true} is VALID [2022-02-20 19:59:41,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {8252#true} assume { :end_inline_init_threads1 } true; {8252#true} is VALID [2022-02-20 19:59:41,257 INFO L272 TraceCheckUtils]: 12: Hoare triple {8252#true} call fire_delta_events1(); {8293#(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:41,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {8293#(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); {8252#true} is VALID [2022-02-20 19:59:41,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {8252#true} assume !(0 == ~q_write_ev~0); {8252#true} is VALID [2022-02-20 19:59:41,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {8252#true} assume true; {8252#true} is VALID [2022-02-20 19:59:41,258 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8252#true} {8252#true} #856#return; {8252#true} is VALID [2022-02-20 19:59:41,258 INFO L272 TraceCheckUtils]: 17: Hoare triple {8252#true} call activate_threads1(); {8294#(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:41,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {8294#(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; {8252#true} is VALID [2022-02-20 19:59:41,259 INFO L272 TraceCheckUtils]: 19: Hoare triple {8252#true} call #t~ret8 := is_do_write_p_triggered(); {8252#true} is VALID [2022-02-20 19:59:41,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {8252#true} havoc ~__retres1~0; {8252#true} is VALID [2022-02-20 19:59:41,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {8252#true} assume !(1 == ~p_dw_pc~0); {8252#true} is VALID [2022-02-20 19:59:41,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {8252#true} assume !(2 == ~p_dw_pc~0); {8252#true} is VALID [2022-02-20 19:59:41,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {8252#true} ~__retres1~0 := 0; {8310#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:41,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {8310#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {8311#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:41,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {8311#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {8311#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:41,261 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8311#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {8252#true} #850#return; {8302#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:41,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {8302#(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; {8303#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:41,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {8303#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8253#false} is VALID [2022-02-20 19:59:41,265 INFO L272 TraceCheckUtils]: 29: Hoare triple {8253#false} call #t~ret9 := is_do_read_c_triggered(); {8252#true} is VALID [2022-02-20 19:59:41,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {8252#true} havoc ~__retres1~1; {8252#true} is VALID [2022-02-20 19:59:41,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {8252#true} assume 1 == ~c_dr_pc~0; {8252#true} is VALID [2022-02-20 19:59:41,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {8252#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {8252#true} is VALID [2022-02-20 19:59:41,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {8252#true} #res := ~__retres1~1; {8252#true} is VALID [2022-02-20 19:59:41,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {8252#true} assume true; {8252#true} is VALID [2022-02-20 19:59:41,266 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8252#true} {8253#false} #852#return; {8253#false} is VALID [2022-02-20 19:59:41,266 INFO L290 TraceCheckUtils]: 36: Hoare triple {8253#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8253#false} is VALID [2022-02-20 19:59:41,266 INFO L290 TraceCheckUtils]: 37: Hoare triple {8253#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {8253#false} is VALID [2022-02-20 19:59:41,266 INFO L290 TraceCheckUtils]: 38: Hoare triple {8253#false} assume true; {8253#false} is VALID [2022-02-20 19:59:41,266 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8253#false} {8252#true} #858#return; {8253#false} is VALID [2022-02-20 19:59:41,267 INFO L272 TraceCheckUtils]: 40: Hoare triple {8253#false} call reset_delta_events1(); {8293#(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:41,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {8293#(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); {8252#true} is VALID [2022-02-20 19:59:41,267 INFO L290 TraceCheckUtils]: 42: Hoare triple {8252#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {8252#true} is VALID [2022-02-20 19:59:41,267 INFO L290 TraceCheckUtils]: 43: Hoare triple {8252#true} assume true; {8252#true} is VALID [2022-02-20 19:59:41,267 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8252#true} {8253#false} #860#return; {8253#false} is VALID [2022-02-20 19:59:41,268 INFO L290 TraceCheckUtils]: 45: Hoare triple {8253#false} assume !false; {8253#false} is VALID [2022-02-20 19:59:41,268 INFO L290 TraceCheckUtils]: 46: Hoare triple {8253#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; {8253#false} is VALID [2022-02-20 19:59:41,268 INFO L290 TraceCheckUtils]: 47: Hoare triple {8253#false} assume !false; {8253#false} is VALID [2022-02-20 19:59:41,268 INFO L272 TraceCheckUtils]: 48: Hoare triple {8253#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {8252#true} is VALID [2022-02-20 19:59:41,268 INFO L290 TraceCheckUtils]: 49: Hoare triple {8252#true} havoc ~__retres1~2; {8252#true} is VALID [2022-02-20 19:59:41,271 INFO L290 TraceCheckUtils]: 50: Hoare triple {8252#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8252#true} is VALID [2022-02-20 19:59:41,271 INFO L290 TraceCheckUtils]: 51: Hoare triple {8252#true} #res := ~__retres1~2; {8252#true} is VALID [2022-02-20 19:59:41,271 INFO L290 TraceCheckUtils]: 52: Hoare triple {8252#true} assume true; {8252#true} is VALID [2022-02-20 19:59:41,272 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {8252#true} {8253#false} #862#return; {8253#false} is VALID [2022-02-20 19:59:41,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {8253#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; {8253#false} is VALID [2022-02-20 19:59:41,272 INFO L290 TraceCheckUtils]: 55: Hoare triple {8253#false} assume 0 != eval1_~tmp___1~0#1; {8253#false} is VALID [2022-02-20 19:59:41,272 INFO L290 TraceCheckUtils]: 56: Hoare triple {8253#false} assume !(0 == ~p_dw_st~0); {8253#false} is VALID [2022-02-20 19:59:41,272 INFO L290 TraceCheckUtils]: 57: Hoare triple {8253#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; {8253#false} is VALID [2022-02-20 19:59:41,273 INFO L290 TraceCheckUtils]: 58: Hoare triple {8253#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; {8253#false} is VALID [2022-02-20 19:59:41,273 INFO L290 TraceCheckUtils]: 59: Hoare triple {8253#false} assume !(0 == ~c_dr_pc~0); {8253#false} is VALID [2022-02-20 19:59:41,273 INFO L290 TraceCheckUtils]: 60: Hoare triple {8253#false} assume 2 == ~c_dr_pc~0; {8253#false} is VALID [2022-02-20 19:59:41,273 INFO L290 TraceCheckUtils]: 61: Hoare triple {8253#false} do_read_c_~a~0#1 := ~a_t~0; {8253#false} is VALID [2022-02-20 19:59:41,273 INFO L290 TraceCheckUtils]: 62: Hoare triple {8253#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; {8253#false} is VALID [2022-02-20 19:59:41,273 INFO L290 TraceCheckUtils]: 63: Hoare triple {8253#false} assume !(~p_last_write~0 == ~c_last_read~0); {8253#false} is VALID [2022-02-20 19:59:41,275 INFO L272 TraceCheckUtils]: 64: Hoare triple {8253#false} call error1(); {8253#false} is VALID [2022-02-20 19:59:41,275 INFO L290 TraceCheckUtils]: 65: Hoare triple {8253#false} assume !false; {8253#false} is VALID [2022-02-20 19:59:41,275 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:41,275 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:41,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006792553] [2022-02-20 19:59:41,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006792553] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:41,276 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:41,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:41,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626549593] [2022-02-20 19:59:41,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:41,277 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:59:41,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:41,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:41,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:41,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:41,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:41,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:41,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:41,319 INFO L87 Difference]: Start difference. First operand 1031 states and 1403 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:43,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:43,912 INFO L93 Difference]: Finished difference Result 2057 states and 2797 transitions. [2022-02-20 19:59:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:43,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:59:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 537 transitions. [2022-02-20 19:59:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 537 transitions. [2022-02-20 19:59:43,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 537 transitions. [2022-02-20 19:59:44,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 537 edges. 537 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:44,397 INFO L225 Difference]: With dead ends: 2057 [2022-02-20 19:59:44,397 INFO L226 Difference]: Without dead ends: 1169 [2022-02-20 19:59:44,399 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 19:59:44,400 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 268 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:44,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 1587 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:59:44,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-02-20 19:59:44,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1061. [2022-02-20 19:59:44,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:44,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1169 states. Second operand has 1061 states, 854 states have (on average 1.379391100702576) internal successors, (1178), 869 states have internal predecessors, (1178), 118 states have call successors, (118), 75 states have call predecessors, (118), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) [2022-02-20 19:59:44,473 INFO L74 IsIncluded]: Start isIncluded. First operand 1169 states. Second operand has 1061 states, 854 states have (on average 1.379391100702576) internal successors, (1178), 869 states have internal predecessors, (1178), 118 states have call successors, (118), 75 states have call predecessors, (118), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) [2022-02-20 19:59:44,475 INFO L87 Difference]: Start difference. First operand 1169 states. Second operand has 1061 states, 854 states have (on average 1.379391100702576) internal successors, (1178), 869 states have internal predecessors, (1178), 118 states have call successors, (118), 75 states have call predecessors, (118), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) [2022-02-20 19:59:44,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:44,545 INFO L93 Difference]: Finished difference Result 1169 states and 1578 transitions. [2022-02-20 19:59:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1578 transitions. [2022-02-20 19:59:44,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:44,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:44,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 1061 states, 854 states have (on average 1.379391100702576) internal successors, (1178), 869 states have internal predecessors, (1178), 118 states have call successors, (118), 75 states have call predecessors, (118), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) Second operand 1169 states. [2022-02-20 19:59:44,554 INFO L87 Difference]: Start difference. First operand has 1061 states, 854 states have (on average 1.379391100702576) internal successors, (1178), 869 states have internal predecessors, (1178), 118 states have call successors, (118), 75 states have call predecessors, (118), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) Second operand 1169 states. [2022-02-20 19:59:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:44,624 INFO L93 Difference]: Finished difference Result 1169 states and 1578 transitions. [2022-02-20 19:59:44,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1578 transitions. [2022-02-20 19:59:44,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:44,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:44,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:44,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 854 states have (on average 1.379391100702576) internal successors, (1178), 869 states have internal predecessors, (1178), 118 states have call successors, (118), 75 states have call predecessors, (118), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) [2022-02-20 19:59:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1430 transitions. [2022-02-20 19:59:44,703 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1430 transitions. Word has length 66 [2022-02-20 19:59:44,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:44,704 INFO L470 AbstractCegarLoop]: Abstraction has 1061 states and 1430 transitions. [2022-02-20 19:59:44,704 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 19:59:44,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1430 transitions. [2022-02-20 19:59:44,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:59:44,706 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:44,706 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:44,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:59:44,707 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:44,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1336137209, now seen corresponding path program 1 times [2022-02-20 19:59:44,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:44,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258964950] [2022-02-20 19:59:44,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:44,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:44,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:44,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {14910#(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); {14911#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:44,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {14911#(not (= |old(~q_req_up~0)| 1))} assume true; {14911#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:44,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14911#(not (= |old(~q_req_up~0)| 1))} {14870#(= ~c_dr_pc~0 ~q_req_up~0)} #854#return; {14874#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:44,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:44,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {14912#(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); {14867#true} is VALID [2022-02-20 19:59:44,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {14867#true} assume !(0 == ~q_write_ev~0); {14867#true} is VALID [2022-02-20 19:59:44,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {14867#true} assume true; {14867#true} is VALID [2022-02-20 19:59:44,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14867#true} {14874#(not (= ~c_dr_pc~0 1))} #856#return; {14874#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:44,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:44,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:44,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {14867#true} havoc ~__retres1~0; {14867#true} is VALID [2022-02-20 19:59:44,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {14867#true} assume !(1 == ~p_dw_pc~0); {14867#true} is VALID [2022-02-20 19:59:44,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {14867#true} assume !(2 == ~p_dw_pc~0); {14867#true} is VALID [2022-02-20 19:59:44,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {14867#true} ~__retres1~0 := 0; {14867#true} is VALID [2022-02-20 19:59:44,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {14867#true} #res := ~__retres1~0; {14867#true} is VALID [2022-02-20 19:59:44,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {14867#true} assume true; {14867#true} is VALID [2022-02-20 19:59:44,849 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {14867#true} {14867#true} #850#return; {14867#true} is VALID [2022-02-20 19:59:44,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:44,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {14867#true} havoc ~__retres1~1; {14867#true} is VALID [2022-02-20 19:59:44,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {14867#true} assume 1 == ~c_dr_pc~0; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,856 INFO L290 TraceCheckUtils]: 4: Hoare triple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,856 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} {14867#true} #852#return; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {14913#(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; {14867#true} is VALID [2022-02-20 19:59:44,857 INFO L272 TraceCheckUtils]: 1: Hoare triple {14867#true} call #t~ret8 := is_do_write_p_triggered(); {14867#true} is VALID [2022-02-20 19:59:44,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {14867#true} havoc ~__retres1~0; {14867#true} is VALID [2022-02-20 19:59:44,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {14867#true} assume !(1 == ~p_dw_pc~0); {14867#true} is VALID [2022-02-20 19:59:44,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {14867#true} assume !(2 == ~p_dw_pc~0); {14867#true} is VALID [2022-02-20 19:59:44,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {14867#true} ~__retres1~0 := 0; {14867#true} is VALID [2022-02-20 19:59:44,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {14867#true} #res := ~__retres1~0; {14867#true} is VALID [2022-02-20 19:59:44,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {14867#true} assume true; {14867#true} is VALID [2022-02-20 19:59:44,858 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {14867#true} {14867#true} #850#return; {14867#true} is VALID [2022-02-20 19:59:44,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {14867#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14867#true} is VALID [2022-02-20 19:59:44,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {14867#true} assume !(0 != ~tmp~1); {14867#true} is VALID [2022-02-20 19:59:44,858 INFO L272 TraceCheckUtils]: 11: Hoare triple {14867#true} call #t~ret9 := is_do_read_c_triggered(); {14867#true} is VALID [2022-02-20 19:59:44,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {14867#true} havoc ~__retres1~1; {14867#true} is VALID [2022-02-20 19:59:44,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {14867#true} assume 1 == ~c_dr_pc~0; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,861 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} {14867#true} #852#return; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,862 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} {14874#(not (= ~c_dr_pc~0 1))} #858#return; {14868#false} is VALID [2022-02-20 19:59:44,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 19:59:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:44,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {14912#(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); {14867#true} is VALID [2022-02-20 19:59:44,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {14867#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14867#true} is VALID [2022-02-20 19:59:44,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {14867#true} assume true; {14867#true} is VALID [2022-02-20 19:59:44,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14867#true} {14868#false} #860#return; {14868#false} is VALID [2022-02-20 19:59:44,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:59:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:44,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {14867#true} havoc ~__retres1~2; {14867#true} is VALID [2022-02-20 19:59:44,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {14867#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14867#true} is VALID [2022-02-20 19:59:44,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {14867#true} #res := ~__retres1~2; {14867#true} is VALID [2022-02-20 19:59:44,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {14867#true} assume true; {14867#true} is VALID [2022-02-20 19:59:44,870 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14867#true} {14868#false} #862#return; {14868#false} is VALID [2022-02-20 19:59:44,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {14867#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {14869#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:44,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {14869#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {14869#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:44,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {14869#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {14870#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:44,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {14870#(= ~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; {14870#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:44,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {14870#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {14910#(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:44,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {14910#(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); {14911#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:44,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {14911#(not (= |old(~q_req_up~0)| 1))} assume true; {14911#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:44,874 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14911#(not (= |old(~q_req_up~0)| 1))} {14870#(= ~c_dr_pc~0 ~q_req_up~0)} #854#return; {14874#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:44,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {14874#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {14874#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:44,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {14874#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {14874#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:44,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {14874#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {14874#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:44,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {14874#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {14874#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:44,876 INFO L272 TraceCheckUtils]: 12: Hoare triple {14874#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {14912#(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:44,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {14912#(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); {14867#true} is VALID [2022-02-20 19:59:44,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {14867#true} assume !(0 == ~q_write_ev~0); {14867#true} is VALID [2022-02-20 19:59:44,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {14867#true} assume true; {14867#true} is VALID [2022-02-20 19:59:44,877 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14867#true} {14874#(not (= ~c_dr_pc~0 1))} #856#return; {14874#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:44,877 INFO L272 TraceCheckUtils]: 17: Hoare triple {14874#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {14913#(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:44,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {14913#(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; {14867#true} is VALID [2022-02-20 19:59:44,878 INFO L272 TraceCheckUtils]: 19: Hoare triple {14867#true} call #t~ret8 := is_do_write_p_triggered(); {14867#true} is VALID [2022-02-20 19:59:44,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {14867#true} havoc ~__retres1~0; {14867#true} is VALID [2022-02-20 19:59:44,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {14867#true} assume !(1 == ~p_dw_pc~0); {14867#true} is VALID [2022-02-20 19:59:44,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {14867#true} assume !(2 == ~p_dw_pc~0); {14867#true} is VALID [2022-02-20 19:59:44,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {14867#true} ~__retres1~0 := 0; {14867#true} is VALID [2022-02-20 19:59:44,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {14867#true} #res := ~__retres1~0; {14867#true} is VALID [2022-02-20 19:59:44,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {14867#true} assume true; {14867#true} is VALID [2022-02-20 19:59:44,879 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14867#true} {14867#true} #850#return; {14867#true} is VALID [2022-02-20 19:59:44,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {14867#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14867#true} is VALID [2022-02-20 19:59:44,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {14867#true} assume !(0 != ~tmp~1); {14867#true} is VALID [2022-02-20 19:59:44,879 INFO L272 TraceCheckUtils]: 29: Hoare triple {14867#true} call #t~ret9 := is_do_read_c_triggered(); {14867#true} is VALID [2022-02-20 19:59:44,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {14867#true} havoc ~__retres1~1; {14867#true} is VALID [2022-02-20 19:59:44,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {14867#true} assume 1 == ~c_dr_pc~0; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,881 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} {14867#true} #852#return; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,881 INFO L290 TraceCheckUtils]: 36: Hoare triple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:44,883 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14927#(= (+ (- 1) ~c_dr_pc~0) 0)} {14874#(not (= ~c_dr_pc~0 1))} #858#return; {14868#false} is VALID [2022-02-20 19:59:44,883 INFO L272 TraceCheckUtils]: 40: Hoare triple {14868#false} call reset_delta_events1(); {14912#(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:44,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {14912#(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); {14867#true} is VALID [2022-02-20 19:59:44,883 INFO L290 TraceCheckUtils]: 42: Hoare triple {14867#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14867#true} is VALID [2022-02-20 19:59:44,883 INFO L290 TraceCheckUtils]: 43: Hoare triple {14867#true} assume true; {14867#true} is VALID [2022-02-20 19:59:44,883 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14867#true} {14868#false} #860#return; {14868#false} is VALID [2022-02-20 19:59:44,884 INFO L290 TraceCheckUtils]: 45: Hoare triple {14868#false} assume !false; {14868#false} is VALID [2022-02-20 19:59:44,884 INFO L290 TraceCheckUtils]: 46: Hoare triple {14868#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; {14868#false} is VALID [2022-02-20 19:59:44,884 INFO L290 TraceCheckUtils]: 47: Hoare triple {14868#false} assume !false; {14868#false} is VALID [2022-02-20 19:59:44,884 INFO L272 TraceCheckUtils]: 48: Hoare triple {14868#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {14867#true} is VALID [2022-02-20 19:59:44,884 INFO L290 TraceCheckUtils]: 49: Hoare triple {14867#true} havoc ~__retres1~2; {14867#true} is VALID [2022-02-20 19:59:44,884 INFO L290 TraceCheckUtils]: 50: Hoare triple {14867#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14867#true} is VALID [2022-02-20 19:59:44,885 INFO L290 TraceCheckUtils]: 51: Hoare triple {14867#true} #res := ~__retres1~2; {14867#true} is VALID [2022-02-20 19:59:44,885 INFO L290 TraceCheckUtils]: 52: Hoare triple {14867#true} assume true; {14867#true} is VALID [2022-02-20 19:59:44,885 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {14867#true} {14868#false} #862#return; {14868#false} is VALID [2022-02-20 19:59:44,885 INFO L290 TraceCheckUtils]: 54: Hoare triple {14868#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; {14868#false} is VALID [2022-02-20 19:59:44,885 INFO L290 TraceCheckUtils]: 55: Hoare triple {14868#false} assume 0 != eval1_~tmp___1~0#1; {14868#false} is VALID [2022-02-20 19:59:44,885 INFO L290 TraceCheckUtils]: 56: Hoare triple {14868#false} assume !(0 == ~p_dw_st~0); {14868#false} is VALID [2022-02-20 19:59:44,885 INFO L290 TraceCheckUtils]: 57: Hoare triple {14868#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; {14868#false} is VALID [2022-02-20 19:59:44,886 INFO L290 TraceCheckUtils]: 58: Hoare triple {14868#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; {14868#false} is VALID [2022-02-20 19:59:44,886 INFO L290 TraceCheckUtils]: 59: Hoare triple {14868#false} assume !(0 == ~c_dr_pc~0); {14868#false} is VALID [2022-02-20 19:59:44,886 INFO L290 TraceCheckUtils]: 60: Hoare triple {14868#false} assume 2 == ~c_dr_pc~0; {14868#false} is VALID [2022-02-20 19:59:44,886 INFO L290 TraceCheckUtils]: 61: Hoare triple {14868#false} do_read_c_~a~0#1 := ~a_t~0; {14868#false} is VALID [2022-02-20 19:59:44,886 INFO L290 TraceCheckUtils]: 62: Hoare triple {14868#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; {14868#false} is VALID [2022-02-20 19:59:44,886 INFO L290 TraceCheckUtils]: 63: Hoare triple {14868#false} assume !(~p_last_write~0 == ~c_last_read~0); {14868#false} is VALID [2022-02-20 19:59:44,887 INFO L272 TraceCheckUtils]: 64: Hoare triple {14868#false} call error1(); {14868#false} is VALID [2022-02-20 19:59:44,887 INFO L290 TraceCheckUtils]: 65: Hoare triple {14868#false} assume !false; {14868#false} is VALID [2022-02-20 19:59:44,887 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:44,887 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:44,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258964950] [2022-02-20 19:59:44,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258964950] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:44,888 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:44,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:44,888 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533165545] [2022-02-20 19:59:44,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:44,889 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 19:59:44,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:44,889 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 19:59:44,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:44,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:44,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:44,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:44,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:44,930 INFO L87 Difference]: Start difference. First operand 1061 states and 1430 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 19:59:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:50,830 INFO L93 Difference]: Finished difference Result 3399 states and 4617 transitions. [2022-02-20 19:59:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:50,831 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 19:59:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:50,832 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 19:59:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1150 transitions. [2022-02-20 19:59:50,843 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 19:59:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1150 transitions. [2022-02-20 19:59:50,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1150 transitions. [2022-02-20 19:59:51,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1150 edges. 1150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:51,799 INFO L225 Difference]: With dead ends: 3399 [2022-02-20 19:59:51,800 INFO L226 Difference]: Without dead ends: 1304 [2022-02-20 19:59:51,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:59:51,805 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 2479 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 690 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2499 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 2126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 690 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:51,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2499 Valid, 1739 Invalid, 2126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [690 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 19:59:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-02-20 19:59:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1149. [2022-02-20 19:59:51,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:51,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1304 states. Second operand has 1149 states, 907 states have (on average 1.3395810363836824) internal successors, (1215), 922 states have internal predecessors, (1215), 138 states have call successors, (138), 89 states have call predecessors, (138), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) [2022-02-20 19:59:51,881 INFO L74 IsIncluded]: Start isIncluded. First operand 1304 states. Second operand has 1149 states, 907 states have (on average 1.3395810363836824) internal successors, (1215), 922 states have internal predecessors, (1215), 138 states have call successors, (138), 89 states have call predecessors, (138), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) [2022-02-20 19:59:51,883 INFO L87 Difference]: Start difference. First operand 1304 states. Second operand has 1149 states, 907 states have (on average 1.3395810363836824) internal successors, (1215), 922 states have internal predecessors, (1215), 138 states have call successors, (138), 89 states have call predecessors, (138), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) [2022-02-20 19:59:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:51,960 INFO L93 Difference]: Finished difference Result 1304 states and 1704 transitions. [2022-02-20 19:59:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1704 transitions. [2022-02-20 19:59:51,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:51,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:51,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 1149 states, 907 states have (on average 1.3395810363836824) internal successors, (1215), 922 states have internal predecessors, (1215), 138 states have call successors, (138), 89 states have call predecessors, (138), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) Second operand 1304 states. [2022-02-20 19:59:51,983 INFO L87 Difference]: Start difference. First operand has 1149 states, 907 states have (on average 1.3395810363836824) internal successors, (1215), 922 states have internal predecessors, (1215), 138 states have call successors, (138), 89 states have call predecessors, (138), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) Second operand 1304 states. [2022-02-20 19:59:52,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:52,065 INFO L93 Difference]: Finished difference Result 1304 states and 1704 transitions. [2022-02-20 19:59:52,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1704 transitions. [2022-02-20 19:59:52,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:52,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:52,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:52,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 907 states have (on average 1.3395810363836824) internal successors, (1215), 922 states have internal predecessors, (1215), 138 states have call successors, (138), 89 states have call predecessors, (138), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) [2022-02-20 19:59:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1508 transitions. [2022-02-20 19:59:52,155 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1508 transitions. Word has length 66 [2022-02-20 19:59:52,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:52,156 INFO L470 AbstractCegarLoop]: Abstraction has 1149 states and 1508 transitions. [2022-02-20 19:59:52,156 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 19:59:52,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1508 transitions. [2022-02-20 19:59:52,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 19:59:52,157 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:52,157 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] [2022-02-20 19:59:52,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:59:52,158 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:52,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:52,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1682176981, now seen corresponding path program 1 times [2022-02-20 19:59:52,158 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:52,159 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285815334] [2022-02-20 19:59:52,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:52,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:52,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:52,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {23730#true} assume true; {23730#true} is VALID [2022-02-20 19:59:52,200 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {23730#true} {23732#(= ~M_E~0 2)} #882#return; {23732#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:52,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:52,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {23776#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {23777#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:52,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {23777#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {23777#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:52,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {23777#(= |old(~M_E~0)| 0)} assume !(0 == ~T2_E~0); {23777#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:52,222 INFO L290 TraceCheckUtils]: 3: Hoare triple {23777#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {23777#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:52,222 INFO L290 TraceCheckUtils]: 4: Hoare triple {23777#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {23777#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:52,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {23777#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {23777#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:52,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {23777#(= |old(~M_E~0)| 0)} assume true; {23777#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:52,224 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23777#(= |old(~M_E~0)| 0)} {23732#(= ~M_E~0 2)} #884#return; {23731#false} is VALID [2022-02-20 19:59:52,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:59:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:52,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {23778#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {23730#true} is VALID [2022-02-20 19:59:52,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {23730#true} assume !(1 == ~m_pc~0); {23730#true} is VALID [2022-02-20 19:59:52,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {23730#true} is_master_triggered_~__retres1~4#1 := 0; {23730#true} is VALID [2022-02-20 19:59:52,240 INFO L290 TraceCheckUtils]: 3: Hoare triple {23730#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {23730#true} is VALID [2022-02-20 19:59:52,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {23730#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {23730#true} is VALID [2022-02-20 19:59:52,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {23730#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {23730#true} is VALID [2022-02-20 19:59:52,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {23730#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; {23730#true} is VALID [2022-02-20 19:59:52,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {23730#true} assume 1 == ~t1_pc~0; {23730#true} is VALID [2022-02-20 19:59:52,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {23730#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {23730#true} is VALID [2022-02-20 19:59:52,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {23730#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {23730#true} is VALID [2022-02-20 19:59:52,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {23730#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {23730#true} is VALID [2022-02-20 19:59:52,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {23730#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {23730#true} is VALID [2022-02-20 19:59:52,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {23730#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; {23730#true} is VALID [2022-02-20 19:59:52,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {23730#true} assume !(1 == ~t2_pc~0); {23730#true} is VALID [2022-02-20 19:59:52,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {23730#true} is_transmit2_triggered_~__retres1~6#1 := 0; {23730#true} is VALID [2022-02-20 19:59:52,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {23730#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {23730#true} is VALID [2022-02-20 19:59:52,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {23730#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {23730#true} is VALID [2022-02-20 19:59:52,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {23730#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {23730#true} is VALID [2022-02-20 19:59:52,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {23730#true} assume true; {23730#true} is VALID [2022-02-20 19:59:52,243 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {23730#true} {23731#false} #886#return; {23731#false} is VALID [2022-02-20 19:59:52,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:59:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:52,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {23776#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {23730#true} is VALID [2022-02-20 19:59:52,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {23730#true} assume !(1 == ~T1_E~0); {23730#true} is VALID [2022-02-20 19:59:52,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {23730#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {23730#true} is VALID [2022-02-20 19:59:52,249 INFO L290 TraceCheckUtils]: 3: Hoare triple {23730#true} assume 1 == ~E_M~0;~E_M~0 := 2; {23730#true} is VALID [2022-02-20 19:59:52,250 INFO L290 TraceCheckUtils]: 4: Hoare triple {23730#true} assume 1 == ~E_1~0;~E_1~0 := 2; {23730#true} is VALID [2022-02-20 19:59:52,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {23730#true} assume 1 == ~E_2~0;~E_2~0 := 2; {23730#true} is VALID [2022-02-20 19:59:52,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {23730#true} assume true; {23730#true} is VALID [2022-02-20 19:59:52,250 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23730#true} {23731#false} #888#return; {23731#false} is VALID [2022-02-20 19:59:52,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:59:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:52,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {23730#true} havoc ~__retres1~7; {23730#true} is VALID [2022-02-20 19:59:52,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {23730#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {23730#true} is VALID [2022-02-20 19:59:52,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {23730#true} #res := ~__retres1~7; {23730#true} is VALID [2022-02-20 19:59:52,258 INFO L290 TraceCheckUtils]: 3: Hoare triple {23730#true} assume true; {23730#true} is VALID [2022-02-20 19:59:52,259 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {23730#true} {23731#false} #890#return; {23731#false} is VALID [2022-02-20 19:59:52,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {23730#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {23732#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:52,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {23732#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {23732#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:52,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {23732#(= ~M_E~0 2)} assume !(0 != main_#t~nondet32#1);havoc main_#t~nondet32#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {23732#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:52,263 INFO L290 TraceCheckUtils]: 3: Hoare triple {23732#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret30#1, start_simulation2_#t~ret31#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; {23732#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:52,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {23732#(= ~M_E~0 2)} call update_channels2(); {23730#true} is VALID [2022-02-20 19:59:52,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {23730#true} assume true; {23730#true} is VALID [2022-02-20 19:59:52,266 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {23730#true} {23732#(= ~M_E~0 2)} #882#return; {23732#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:52,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {23732#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {23732#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:52,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {23732#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {23732#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:52,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {23732#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {23732#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:52,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {23732#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {23732#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:52,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {23732#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {23732#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:52,268 INFO L272 TraceCheckUtils]: 12: Hoare triple {23732#(= ~M_E~0 2)} call fire_delta_events2(); {23776#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:52,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {23776#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {23777#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:52,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {23777#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {23777#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:52,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {23777#(= |old(~M_E~0)| 0)} assume !(0 == ~T2_E~0); {23777#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:52,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {23777#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {23777#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:52,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {23777#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {23777#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:52,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {23777#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {23777#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:52,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {23777#(= |old(~M_E~0)| 0)} assume true; {23777#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:52,271 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {23777#(= |old(~M_E~0)| 0)} {23732#(= ~M_E~0 2)} #884#return; {23731#false} is VALID [2022-02-20 19:59:52,272 INFO L272 TraceCheckUtils]: 21: Hoare triple {23731#false} call activate_threads2(); {23778#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:59:52,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {23778#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {23730#true} is VALID [2022-02-20 19:59:52,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {23730#true} assume !(1 == ~m_pc~0); {23730#true} is VALID [2022-02-20 19:59:52,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {23730#true} is_master_triggered_~__retres1~4#1 := 0; {23730#true} is VALID [2022-02-20 19:59:52,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {23730#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {23730#true} is VALID [2022-02-20 19:59:52,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {23730#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {23730#true} is VALID [2022-02-20 19:59:52,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {23730#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {23730#true} is VALID [2022-02-20 19:59:52,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {23730#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; {23730#true} is VALID [2022-02-20 19:59:52,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {23730#true} assume 1 == ~t1_pc~0; {23730#true} is VALID [2022-02-20 19:59:52,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {23730#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {23730#true} is VALID [2022-02-20 19:59:52,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {23730#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {23730#true} is VALID [2022-02-20 19:59:52,274 INFO L290 TraceCheckUtils]: 32: Hoare triple {23730#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {23730#true} is VALID [2022-02-20 19:59:52,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {23730#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {23730#true} is VALID [2022-02-20 19:59:52,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {23730#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; {23730#true} is VALID [2022-02-20 19:59:52,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {23730#true} assume !(1 == ~t2_pc~0); {23730#true} is VALID [2022-02-20 19:59:52,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {23730#true} is_transmit2_triggered_~__retres1~6#1 := 0; {23730#true} is VALID [2022-02-20 19:59:52,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {23730#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {23730#true} is VALID [2022-02-20 19:59:52,275 INFO L290 TraceCheckUtils]: 38: Hoare triple {23730#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {23730#true} is VALID [2022-02-20 19:59:52,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {23730#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {23730#true} is VALID [2022-02-20 19:59:52,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {23730#true} assume true; {23730#true} is VALID [2022-02-20 19:59:52,275 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {23730#true} {23731#false} #886#return; {23731#false} is VALID [2022-02-20 19:59:52,275 INFO L272 TraceCheckUtils]: 42: Hoare triple {23731#false} call reset_delta_events2(); {23776#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:52,276 INFO L290 TraceCheckUtils]: 43: Hoare triple {23776#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {23730#true} is VALID [2022-02-20 19:59:52,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {23730#true} assume !(1 == ~T1_E~0); {23730#true} is VALID [2022-02-20 19:59:52,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {23730#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {23730#true} is VALID [2022-02-20 19:59:52,276 INFO L290 TraceCheckUtils]: 46: Hoare triple {23730#true} assume 1 == ~E_M~0;~E_M~0 := 2; {23730#true} is VALID [2022-02-20 19:59:52,276 INFO L290 TraceCheckUtils]: 47: Hoare triple {23730#true} assume 1 == ~E_1~0;~E_1~0 := 2; {23730#true} is VALID [2022-02-20 19:59:52,276 INFO L290 TraceCheckUtils]: 48: Hoare triple {23730#true} assume 1 == ~E_2~0;~E_2~0 := 2; {23730#true} is VALID [2022-02-20 19:59:52,277 INFO L290 TraceCheckUtils]: 49: Hoare triple {23730#true} assume true; {23730#true} is VALID [2022-02-20 19:59:52,277 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23730#true} {23731#false} #888#return; {23731#false} is VALID [2022-02-20 19:59:52,277 INFO L290 TraceCheckUtils]: 51: Hoare triple {23731#false} assume !false; {23731#false} is VALID [2022-02-20 19:59:52,277 INFO L290 TraceCheckUtils]: 52: Hoare triple {23731#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {23731#false} is VALID [2022-02-20 19:59:52,277 INFO L290 TraceCheckUtils]: 53: Hoare triple {23731#false} assume !false; {23731#false} is VALID [2022-02-20 19:59:52,277 INFO L272 TraceCheckUtils]: 54: Hoare triple {23731#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {23730#true} is VALID [2022-02-20 19:59:52,279 INFO L290 TraceCheckUtils]: 55: Hoare triple {23730#true} havoc ~__retres1~7; {23730#true} is VALID [2022-02-20 19:59:52,279 INFO L290 TraceCheckUtils]: 56: Hoare triple {23730#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {23730#true} is VALID [2022-02-20 19:59:52,280 INFO L290 TraceCheckUtils]: 57: Hoare triple {23730#true} #res := ~__retres1~7; {23730#true} is VALID [2022-02-20 19:59:52,281 INFO L290 TraceCheckUtils]: 58: Hoare triple {23730#true} assume true; {23730#true} is VALID [2022-02-20 19:59:52,281 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23730#true} {23731#false} #890#return; {23731#false} is VALID [2022-02-20 19:59:52,281 INFO L290 TraceCheckUtils]: 60: Hoare triple {23731#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {23731#false} is VALID [2022-02-20 19:59:52,281 INFO L290 TraceCheckUtils]: 61: Hoare triple {23731#false} assume 0 != eval2_~tmp~5#1; {23731#false} is VALID [2022-02-20 19:59:52,281 INFO L290 TraceCheckUtils]: 62: Hoare triple {23731#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {23731#false} is VALID [2022-02-20 19:59:52,286 INFO L290 TraceCheckUtils]: 63: Hoare triple {23731#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {23731#false} is VALID [2022-02-20 19:59:52,286 INFO L290 TraceCheckUtils]: 64: Hoare triple {23731#false} assume !(0 == ~m_pc~0); {23731#false} is VALID [2022-02-20 19:59:52,286 INFO L290 TraceCheckUtils]: 65: Hoare triple {23731#false} assume 1 == ~m_pc~0; {23731#false} is VALID [2022-02-20 19:59:52,287 INFO L290 TraceCheckUtils]: 66: Hoare triple {23731#false} assume ~token~0 != 2 + ~local~0; {23731#false} is VALID [2022-02-20 19:59:52,287 INFO L272 TraceCheckUtils]: 67: Hoare triple {23731#false} call error2(); {23731#false} is VALID [2022-02-20 19:59:52,287 INFO L290 TraceCheckUtils]: 68: Hoare triple {23731#false} assume !false; {23731#false} is VALID [2022-02-20 19:59:52,288 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:52,288 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:52,289 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285815334] [2022-02-20 19:59:52,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285815334] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:52,290 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:52,290 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:52,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932347057] [2022-02-20 19:59:52,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:52,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:59:52,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:52,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:52,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:52,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:52,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:52,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:52,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:52,334 INFO L87 Difference]: Start difference. First operand 1149 states and 1508 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:54,391 INFO L93 Difference]: Finished difference Result 1459 states and 1979 transitions. [2022-02-20 19:59:54,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:59:54,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:59:54,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 817 transitions. [2022-02-20 19:59:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:54,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 817 transitions. [2022-02-20 19:59:54,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 817 transitions. [2022-02-20 19:59:55,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 817 edges. 817 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:55,142 INFO L225 Difference]: With dead ends: 1459 [2022-02-20 19:59:55,142 INFO L226 Difference]: Without dead ends: 1335 [2022-02-20 19:59:55,143 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 19:59:55,144 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 667 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:55,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [688 Valid, 897 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:55,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-02-20 19:59:55,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1270. [2022-02-20 19:59:55,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:55,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1335 states. Second operand has 1270 states, 1010 states have (on average 1.3574257425742575) internal successors, (1371), 1026 states have internal predecessors, (1371), 149 states have call successors, (149), 95 states have call predecessors, (149), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2022-02-20 19:59:55,219 INFO L74 IsIncluded]: Start isIncluded. First operand 1335 states. Second operand has 1270 states, 1010 states have (on average 1.3574257425742575) internal successors, (1371), 1026 states have internal predecessors, (1371), 149 states have call successors, (149), 95 states have call predecessors, (149), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2022-02-20 19:59:55,220 INFO L87 Difference]: Start difference. First operand 1335 states. Second operand has 1270 states, 1010 states have (on average 1.3574257425742575) internal successors, (1371), 1026 states have internal predecessors, (1371), 149 states have call successors, (149), 95 states have call predecessors, (149), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2022-02-20 19:59:55,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:55,314 INFO L93 Difference]: Finished difference Result 1335 states and 1791 transitions. [2022-02-20 19:59:55,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1791 transitions. [2022-02-20 19:59:55,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:55,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:55,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 1270 states, 1010 states have (on average 1.3574257425742575) internal successors, (1371), 1026 states have internal predecessors, (1371), 149 states have call successors, (149), 95 states have call predecessors, (149), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) Second operand 1335 states. [2022-02-20 19:59:55,321 INFO L87 Difference]: Start difference. First operand has 1270 states, 1010 states have (on average 1.3574257425742575) internal successors, (1371), 1026 states have internal predecessors, (1371), 149 states have call successors, (149), 95 states have call predecessors, (149), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) Second operand 1335 states. [2022-02-20 19:59:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:55,423 INFO L93 Difference]: Finished difference Result 1335 states and 1791 transitions. [2022-02-20 19:59:55,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1791 transitions. [2022-02-20 19:59:55,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:55,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:55,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:55,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1010 states have (on average 1.3574257425742575) internal successors, (1371), 1026 states have internal predecessors, (1371), 149 states have call successors, (149), 95 states have call predecessors, (149), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2022-02-20 19:59:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1689 transitions. [2022-02-20 19:59:55,543 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1689 transitions. Word has length 69 [2022-02-20 19:59:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:55,543 INFO L470 AbstractCegarLoop]: Abstraction has 1270 states and 1689 transitions. [2022-02-20 19:59:55,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1689 transitions. [2022-02-20 19:59:55,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 19:59:55,544 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:55,544 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] [2022-02-20 19:59:55,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:55,545 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:55,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:55,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1579462617, now seen corresponding path program 1 times [2022-02-20 19:59:55,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:55,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295328937] [2022-02-20 19:59:55,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:55,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {30148#true} assume true; {30148#true} is VALID [2022-02-20 19:59:55,587 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {30148#true} {30150#(= ~T1_E~0 ~M_E~0)} #882#return; {30150#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {30194#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {30195#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:55,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {30195#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:55,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~T2_E~0); {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:55,616 INFO L290 TraceCheckUtils]: 3: Hoare triple {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:55,617 INFO L290 TraceCheckUtils]: 4: Hoare triple {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:55,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:55,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:55,618 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {30150#(= ~T1_E~0 ~M_E~0)} #884#return; {30149#false} is VALID [2022-02-20 19:59:55,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:59:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {30197#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {30148#true} is VALID [2022-02-20 19:59:55,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {30148#true} assume !(1 == ~m_pc~0); {30148#true} is VALID [2022-02-20 19:59:55,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {30148#true} is_master_triggered_~__retres1~4#1 := 0; {30148#true} is VALID [2022-02-20 19:59:55,647 INFO L290 TraceCheckUtils]: 3: Hoare triple {30148#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {30148#true} is VALID [2022-02-20 19:59:55,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {30148#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {30148#true} is VALID [2022-02-20 19:59:55,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {30148#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {30148#true} is VALID [2022-02-20 19:59:55,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {30148#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; {30148#true} is VALID [2022-02-20 19:59:55,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {30148#true} assume 1 == ~t1_pc~0; {30148#true} is VALID [2022-02-20 19:59:55,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {30148#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {30148#true} is VALID [2022-02-20 19:59:55,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {30148#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {30148#true} is VALID [2022-02-20 19:59:55,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {30148#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {30148#true} is VALID [2022-02-20 19:59:55,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {30148#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {30148#true} is VALID [2022-02-20 19:59:55,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {30148#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; {30148#true} is VALID [2022-02-20 19:59:55,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {30148#true} assume !(1 == ~t2_pc~0); {30148#true} is VALID [2022-02-20 19:59:55,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {30148#true} is_transmit2_triggered_~__retres1~6#1 := 0; {30148#true} is VALID [2022-02-20 19:59:55,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {30148#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {30148#true} is VALID [2022-02-20 19:59:55,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {30148#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {30148#true} is VALID [2022-02-20 19:59:55,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {30148#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {30148#true} is VALID [2022-02-20 19:59:55,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {30148#true} assume true; {30148#true} is VALID [2022-02-20 19:59:55,653 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {30148#true} {30149#false} #886#return; {30149#false} is VALID [2022-02-20 19:59:55,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:59:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {30194#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {30148#true} is VALID [2022-02-20 19:59:55,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {30148#true} assume !(1 == ~T1_E~0); {30148#true} is VALID [2022-02-20 19:59:55,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {30148#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {30148#true} is VALID [2022-02-20 19:59:55,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {30148#true} assume 1 == ~E_M~0;~E_M~0 := 2; {30148#true} is VALID [2022-02-20 19:59:55,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {30148#true} assume 1 == ~E_1~0;~E_1~0 := 2; {30148#true} is VALID [2022-02-20 19:59:55,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {30148#true} assume 1 == ~E_2~0;~E_2~0 := 2; {30148#true} is VALID [2022-02-20 19:59:55,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {30148#true} assume true; {30148#true} is VALID [2022-02-20 19:59:55,662 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30148#true} {30149#false} #888#return; {30149#false} is VALID [2022-02-20 19:59:55,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:59:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {30148#true} havoc ~__retres1~7; {30148#true} is VALID [2022-02-20 19:59:55,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {30148#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {30148#true} is VALID [2022-02-20 19:59:55,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {30148#true} #res := ~__retres1~7; {30148#true} is VALID [2022-02-20 19:59:55,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {30148#true} assume true; {30148#true} is VALID [2022-02-20 19:59:55,666 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30148#true} {30149#false} #890#return; {30149#false} is VALID [2022-02-20 19:59:55,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {30148#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {30150#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {30150#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {30150#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {30150#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet32#1);havoc main_#t~nondet32#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {30150#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,668 INFO L290 TraceCheckUtils]: 3: Hoare triple {30150#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret30#1, start_simulation2_#t~ret31#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; {30150#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {30150#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {30148#true} is VALID [2022-02-20 19:59:55,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {30148#true} assume true; {30148#true} is VALID [2022-02-20 19:59:55,669 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {30148#true} {30150#(= ~T1_E~0 ~M_E~0)} #882#return; {30150#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {30150#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {30150#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {30150#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {30150#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {30150#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {30150#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {30150#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {30150#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {30150#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {30150#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:55,672 INFO L272 TraceCheckUtils]: 12: Hoare triple {30150#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {30194#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:55,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {30194#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {30195#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:55,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {30195#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:55,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~T2_E~0); {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:55,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:55,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:55,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:55,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:55,677 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {30196#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {30150#(= ~T1_E~0 ~M_E~0)} #884#return; {30149#false} is VALID [2022-02-20 19:59:55,677 INFO L272 TraceCheckUtils]: 21: Hoare triple {30149#false} call activate_threads2(); {30197#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:59:55,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {30197#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {30148#true} is VALID [2022-02-20 19:59:55,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {30148#true} assume !(1 == ~m_pc~0); {30148#true} is VALID [2022-02-20 19:59:55,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {30148#true} is_master_triggered_~__retres1~4#1 := 0; {30148#true} is VALID [2022-02-20 19:59:55,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {30148#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {30148#true} is VALID [2022-02-20 19:59:55,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {30148#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {30148#true} is VALID [2022-02-20 19:59:55,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {30148#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {30148#true} is VALID [2022-02-20 19:59:55,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {30148#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; {30148#true} is VALID [2022-02-20 19:59:55,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {30148#true} assume 1 == ~t1_pc~0; {30148#true} is VALID [2022-02-20 19:59:55,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {30148#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {30148#true} is VALID [2022-02-20 19:59:55,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {30148#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {30148#true} is VALID [2022-02-20 19:59:55,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {30148#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {30148#true} is VALID [2022-02-20 19:59:55,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {30148#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {30148#true} is VALID [2022-02-20 19:59:55,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {30148#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; {30148#true} is VALID [2022-02-20 19:59:55,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {30148#true} assume !(1 == ~t2_pc~0); {30148#true} is VALID [2022-02-20 19:59:55,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {30148#true} is_transmit2_triggered_~__retres1~6#1 := 0; {30148#true} is VALID [2022-02-20 19:59:55,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {30148#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {30148#true} is VALID [2022-02-20 19:59:55,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {30148#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {30148#true} is VALID [2022-02-20 19:59:55,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {30148#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {30148#true} is VALID [2022-02-20 19:59:55,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {30148#true} assume true; {30148#true} is VALID [2022-02-20 19:59:55,679 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {30148#true} {30149#false} #886#return; {30149#false} is VALID [2022-02-20 19:59:55,681 INFO L272 TraceCheckUtils]: 42: Hoare triple {30149#false} call reset_delta_events2(); {30194#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:55,681 INFO L290 TraceCheckUtils]: 43: Hoare triple {30194#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {30148#true} is VALID [2022-02-20 19:59:55,681 INFO L290 TraceCheckUtils]: 44: Hoare triple {30148#true} assume !(1 == ~T1_E~0); {30148#true} is VALID [2022-02-20 19:59:55,681 INFO L290 TraceCheckUtils]: 45: Hoare triple {30148#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {30148#true} is VALID [2022-02-20 19:59:55,681 INFO L290 TraceCheckUtils]: 46: Hoare triple {30148#true} assume 1 == ~E_M~0;~E_M~0 := 2; {30148#true} is VALID [2022-02-20 19:59:55,682 INFO L290 TraceCheckUtils]: 47: Hoare triple {30148#true} assume 1 == ~E_1~0;~E_1~0 := 2; {30148#true} is VALID [2022-02-20 19:59:55,682 INFO L290 TraceCheckUtils]: 48: Hoare triple {30148#true} assume 1 == ~E_2~0;~E_2~0 := 2; {30148#true} is VALID [2022-02-20 19:59:55,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {30148#true} assume true; {30148#true} is VALID [2022-02-20 19:59:55,682 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {30148#true} {30149#false} #888#return; {30149#false} is VALID [2022-02-20 19:59:55,682 INFO L290 TraceCheckUtils]: 51: Hoare triple {30149#false} assume !false; {30149#false} is VALID [2022-02-20 19:59:55,682 INFO L290 TraceCheckUtils]: 52: Hoare triple {30149#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {30149#false} is VALID [2022-02-20 19:59:55,682 INFO L290 TraceCheckUtils]: 53: Hoare triple {30149#false} assume !false; {30149#false} is VALID [2022-02-20 19:59:55,682 INFO L272 TraceCheckUtils]: 54: Hoare triple {30149#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {30148#true} is VALID [2022-02-20 19:59:55,682 INFO L290 TraceCheckUtils]: 55: Hoare triple {30148#true} havoc ~__retres1~7; {30148#true} is VALID [2022-02-20 19:59:55,683 INFO L290 TraceCheckUtils]: 56: Hoare triple {30148#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {30148#true} is VALID [2022-02-20 19:59:55,683 INFO L290 TraceCheckUtils]: 57: Hoare triple {30148#true} #res := ~__retres1~7; {30148#true} is VALID [2022-02-20 19:59:55,683 INFO L290 TraceCheckUtils]: 58: Hoare triple {30148#true} assume true; {30148#true} is VALID [2022-02-20 19:59:55,683 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {30148#true} {30149#false} #890#return; {30149#false} is VALID [2022-02-20 19:59:55,683 INFO L290 TraceCheckUtils]: 60: Hoare triple {30149#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {30149#false} is VALID [2022-02-20 19:59:55,683 INFO L290 TraceCheckUtils]: 61: Hoare triple {30149#false} assume 0 != eval2_~tmp~5#1; {30149#false} is VALID [2022-02-20 19:59:55,683 INFO L290 TraceCheckUtils]: 62: Hoare triple {30149#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {30149#false} is VALID [2022-02-20 19:59:55,684 INFO L290 TraceCheckUtils]: 63: Hoare triple {30149#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {30149#false} is VALID [2022-02-20 19:59:55,684 INFO L290 TraceCheckUtils]: 64: Hoare triple {30149#false} assume !(0 == ~m_pc~0); {30149#false} is VALID [2022-02-20 19:59:55,684 INFO L290 TraceCheckUtils]: 65: Hoare triple {30149#false} assume 1 == ~m_pc~0; {30149#false} is VALID [2022-02-20 19:59:55,684 INFO L290 TraceCheckUtils]: 66: Hoare triple {30149#false} assume ~token~0 != 2 + ~local~0; {30149#false} is VALID [2022-02-20 19:59:55,684 INFO L272 TraceCheckUtils]: 67: Hoare triple {30149#false} call error2(); {30149#false} is VALID [2022-02-20 19:59:55,684 INFO L290 TraceCheckUtils]: 68: Hoare triple {30149#false} assume !false; {30149#false} is VALID [2022-02-20 19:59:55,685 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:55,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:55,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295328937] [2022-02-20 19:59:55,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295328937] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:55,687 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:55,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:55,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841482031] [2022-02-20 19:59:55,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:55,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:59:55,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:55,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:55,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:55,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:55,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:55,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:55,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:55,740 INFO L87 Difference]: Start difference. First operand 1270 states and 1689 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:58,297 INFO L93 Difference]: Finished difference Result 1732 states and 2383 transitions. [2022-02-20 19:59:58,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:58,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:59:58,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 817 transitions. [2022-02-20 19:59:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:58,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 817 transitions. [2022-02-20 19:59:58,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 817 transitions. [2022-02-20 19:59:58,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 817 edges. 817 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:59,068 INFO L225 Difference]: With dead ends: 1732 [2022-02-20 19:59:59,068 INFO L226 Difference]: Without dead ends: 1487 [2022-02-20 19:59:59,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:59:59,069 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 684 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:59,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [705 Valid, 1103 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:59:59,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2022-02-20 19:59:59,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1384. [2022-02-20 19:59:59,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:59,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1487 states. Second operand has 1384 states, 1106 states have (on average 1.367992766726944) internal successors, (1513), 1123 states have internal predecessors, (1513), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-02-20 19:59:59,164 INFO L74 IsIncluded]: Start isIncluded. First operand 1487 states. Second operand has 1384 states, 1106 states have (on average 1.367992766726944) internal successors, (1513), 1123 states have internal predecessors, (1513), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-02-20 19:59:59,166 INFO L87 Difference]: Start difference. First operand 1487 states. Second operand has 1384 states, 1106 states have (on average 1.367992766726944) internal successors, (1513), 1123 states have internal predecessors, (1513), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-02-20 19:59:59,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:59,265 INFO L93 Difference]: Finished difference Result 1487 states and 2017 transitions. [2022-02-20 19:59:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2017 transitions. [2022-02-20 19:59:59,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:59,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:59,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 1384 states, 1106 states have (on average 1.367992766726944) internal successors, (1513), 1123 states have internal predecessors, (1513), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) Second operand 1487 states. [2022-02-20 19:59:59,273 INFO L87 Difference]: Start difference. First operand has 1384 states, 1106 states have (on average 1.367992766726944) internal successors, (1513), 1123 states have internal predecessors, (1513), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) Second operand 1487 states. [2022-02-20 19:59:59,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:59,374 INFO L93 Difference]: Finished difference Result 1487 states and 2017 transitions. [2022-02-20 19:59:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2017 transitions. [2022-02-20 19:59:59,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:59,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:59,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:59,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1106 states have (on average 1.367992766726944) internal successors, (1513), 1123 states have internal predecessors, (1513), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-02-20 19:59:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1855 transitions. [2022-02-20 19:59:59,501 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1855 transitions. Word has length 69 [2022-02-20 19:59:59,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:59,501 INFO L470 AbstractCegarLoop]: Abstraction has 1384 states and 1855 transitions. [2022-02-20 19:59:59,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1855 transitions. [2022-02-20 19:59:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 19:59:59,503 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:59,503 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] [2022-02-20 19:59:59,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:59:59,504 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:59,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:59,504 INFO L85 PathProgramCache]: Analyzing trace with hash -192677207, now seen corresponding path program 1 times [2022-02-20 19:59:59,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:59,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022523153] [2022-02-20 19:59:59,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:59,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {37383#true} assume true; {37383#true} is VALID [2022-02-20 19:59:59,545 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {37383#true} {37385#(not (= ~E_M~0 0))} #882#return; {37385#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:59,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {37429#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {37430#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:59:59,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {37430#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {37430#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:59:59,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {37430#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T2_E~0); {37430#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:59:59,570 INFO L290 TraceCheckUtils]: 3: Hoare triple {37430#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {37431#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:59,570 INFO L290 TraceCheckUtils]: 4: Hoare triple {37431#(= |old(~E_M~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {37431#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:59,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {37431#(= |old(~E_M~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {37431#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:59,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {37431#(= |old(~E_M~0)| 0)} assume true; {37431#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:59,571 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {37431#(= |old(~E_M~0)| 0)} {37385#(not (= ~E_M~0 0))} #884#return; {37384#false} is VALID [2022-02-20 19:59:59,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:59:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {37432#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {37383#true} is VALID [2022-02-20 19:59:59,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {37383#true} assume !(1 == ~m_pc~0); {37383#true} is VALID [2022-02-20 19:59:59,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {37383#true} is_master_triggered_~__retres1~4#1 := 0; {37383#true} is VALID [2022-02-20 19:59:59,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {37383#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {37383#true} is VALID [2022-02-20 19:59:59,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {37383#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {37383#true} is VALID [2022-02-20 19:59:59,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {37383#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {37383#true} is VALID [2022-02-20 19:59:59,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {37383#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; {37383#true} is VALID [2022-02-20 19:59:59,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {37383#true} assume 1 == ~t1_pc~0; {37383#true} is VALID [2022-02-20 19:59:59,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {37383#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {37383#true} is VALID [2022-02-20 19:59:59,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {37383#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {37383#true} is VALID [2022-02-20 19:59:59,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {37383#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {37383#true} is VALID [2022-02-20 19:59:59,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {37383#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {37383#true} is VALID [2022-02-20 19:59:59,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {37383#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; {37383#true} is VALID [2022-02-20 19:59:59,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {37383#true} assume !(1 == ~t2_pc~0); {37383#true} is VALID [2022-02-20 19:59:59,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {37383#true} is_transmit2_triggered_~__retres1~6#1 := 0; {37383#true} is VALID [2022-02-20 19:59:59,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {37383#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {37383#true} is VALID [2022-02-20 19:59:59,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {37383#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {37383#true} is VALID [2022-02-20 19:59:59,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {37383#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {37383#true} is VALID [2022-02-20 19:59:59,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {37383#true} assume true; {37383#true} is VALID [2022-02-20 19:59:59,589 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {37383#true} {37384#false} #886#return; {37384#false} is VALID [2022-02-20 19:59:59,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:59:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {37429#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {37383#true} is VALID [2022-02-20 19:59:59,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {37383#true} assume !(1 == ~T1_E~0); {37383#true} is VALID [2022-02-20 19:59:59,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {37383#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {37383#true} is VALID [2022-02-20 19:59:59,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {37383#true} assume 1 == ~E_M~0;~E_M~0 := 2; {37383#true} is VALID [2022-02-20 19:59:59,595 INFO L290 TraceCheckUtils]: 4: Hoare triple {37383#true} assume 1 == ~E_1~0;~E_1~0 := 2; {37383#true} is VALID [2022-02-20 19:59:59,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {37383#true} assume 1 == ~E_2~0;~E_2~0 := 2; {37383#true} is VALID [2022-02-20 19:59:59,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {37383#true} assume true; {37383#true} is VALID [2022-02-20 19:59:59,596 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {37383#true} {37384#false} #888#return; {37384#false} is VALID [2022-02-20 19:59:59,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:59:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {37383#true} havoc ~__retres1~7; {37383#true} is VALID [2022-02-20 19:59:59,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {37383#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {37383#true} is VALID [2022-02-20 19:59:59,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {37383#true} #res := ~__retres1~7; {37383#true} is VALID [2022-02-20 19:59:59,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {37383#true} assume true; {37383#true} is VALID [2022-02-20 19:59:59,601 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37383#true} {37384#false} #890#return; {37384#false} is VALID [2022-02-20 19:59:59,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {37383#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {37385#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:59,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {37385#(not (= ~E_M~0 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {37385#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:59,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {37385#(not (= ~E_M~0 0))} assume !(0 != main_#t~nondet32#1);havoc main_#t~nondet32#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {37385#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:59,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {37385#(not (= ~E_M~0 0))} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret30#1, start_simulation2_#t~ret31#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; {37385#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:59,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {37385#(not (= ~E_M~0 0))} call update_channels2(); {37383#true} is VALID [2022-02-20 19:59:59,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {37383#true} assume true; {37383#true} is VALID [2022-02-20 19:59:59,603 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {37383#true} {37385#(not (= ~E_M~0 0))} #882#return; {37385#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:59,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {37385#(not (= ~E_M~0 0))} assume { :begin_inline_init_threads2 } true; {37385#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:59,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {37385#(not (= ~E_M~0 0))} assume 1 == ~m_i~0;~m_st~0 := 0; {37385#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:59,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {37385#(not (= ~E_M~0 0))} assume 1 == ~t1_i~0;~t1_st~0 := 0; {37385#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:59,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {37385#(not (= ~E_M~0 0))} assume 1 == ~t2_i~0;~t2_st~0 := 0; {37385#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:59,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {37385#(not (= ~E_M~0 0))} assume { :end_inline_init_threads2 } true; {37385#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:59,606 INFO L272 TraceCheckUtils]: 12: Hoare triple {37385#(not (= ~E_M~0 0))} call fire_delta_events2(); {37429#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:59,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {37429#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {37430#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:59:59,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {37430#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {37430#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:59:59,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {37430#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T2_E~0); {37430#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:59:59,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {37430#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {37431#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:59,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {37431#(= |old(~E_M~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {37431#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:59,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {37431#(= |old(~E_M~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {37431#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:59,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {37431#(= |old(~E_M~0)| 0)} assume true; {37431#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:59,609 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37431#(= |old(~E_M~0)| 0)} {37385#(not (= ~E_M~0 0))} #884#return; {37384#false} is VALID [2022-02-20 19:59:59,609 INFO L272 TraceCheckUtils]: 21: Hoare triple {37384#false} call activate_threads2(); {37432#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:59:59,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {37432#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {37383#true} is VALID [2022-02-20 19:59:59,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {37383#true} assume !(1 == ~m_pc~0); {37383#true} is VALID [2022-02-20 19:59:59,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {37383#true} is_master_triggered_~__retres1~4#1 := 0; {37383#true} is VALID [2022-02-20 19:59:59,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {37383#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {37383#true} is VALID [2022-02-20 19:59:59,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {37383#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {37383#true} is VALID [2022-02-20 19:59:59,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {37383#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {37383#true} is VALID [2022-02-20 19:59:59,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {37383#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; {37383#true} is VALID [2022-02-20 19:59:59,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {37383#true} assume 1 == ~t1_pc~0; {37383#true} is VALID [2022-02-20 19:59:59,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {37383#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {37383#true} is VALID [2022-02-20 19:59:59,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {37383#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {37383#true} is VALID [2022-02-20 19:59:59,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {37383#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {37383#true} is VALID [2022-02-20 19:59:59,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {37383#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {37383#true} is VALID [2022-02-20 19:59:59,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {37383#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; {37383#true} is VALID [2022-02-20 19:59:59,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {37383#true} assume !(1 == ~t2_pc~0); {37383#true} is VALID [2022-02-20 19:59:59,611 INFO L290 TraceCheckUtils]: 36: Hoare triple {37383#true} is_transmit2_triggered_~__retres1~6#1 := 0; {37383#true} is VALID [2022-02-20 19:59:59,611 INFO L290 TraceCheckUtils]: 37: Hoare triple {37383#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {37383#true} is VALID [2022-02-20 19:59:59,611 INFO L290 TraceCheckUtils]: 38: Hoare triple {37383#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {37383#true} is VALID [2022-02-20 19:59:59,611 INFO L290 TraceCheckUtils]: 39: Hoare triple {37383#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {37383#true} is VALID [2022-02-20 19:59:59,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {37383#true} assume true; {37383#true} is VALID [2022-02-20 19:59:59,611 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37383#true} {37384#false} #886#return; {37384#false} is VALID [2022-02-20 19:59:59,612 INFO L272 TraceCheckUtils]: 42: Hoare triple {37384#false} call reset_delta_events2(); {37429#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:59:59,612 INFO L290 TraceCheckUtils]: 43: Hoare triple {37429#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {37383#true} is VALID [2022-02-20 19:59:59,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {37383#true} assume !(1 == ~T1_E~0); {37383#true} is VALID [2022-02-20 19:59:59,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {37383#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {37383#true} is VALID [2022-02-20 19:59:59,612 INFO L290 TraceCheckUtils]: 46: Hoare triple {37383#true} assume 1 == ~E_M~0;~E_M~0 := 2; {37383#true} is VALID [2022-02-20 19:59:59,612 INFO L290 TraceCheckUtils]: 47: Hoare triple {37383#true} assume 1 == ~E_1~0;~E_1~0 := 2; {37383#true} is VALID [2022-02-20 19:59:59,612 INFO L290 TraceCheckUtils]: 48: Hoare triple {37383#true} assume 1 == ~E_2~0;~E_2~0 := 2; {37383#true} is VALID [2022-02-20 19:59:59,612 INFO L290 TraceCheckUtils]: 49: Hoare triple {37383#true} assume true; {37383#true} is VALID [2022-02-20 19:59:59,613 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {37383#true} {37384#false} #888#return; {37384#false} is VALID [2022-02-20 19:59:59,613 INFO L290 TraceCheckUtils]: 51: Hoare triple {37384#false} assume !false; {37384#false} is VALID [2022-02-20 19:59:59,613 INFO L290 TraceCheckUtils]: 52: Hoare triple {37384#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {37384#false} is VALID [2022-02-20 19:59:59,613 INFO L290 TraceCheckUtils]: 53: Hoare triple {37384#false} assume !false; {37384#false} is VALID [2022-02-20 19:59:59,613 INFO L272 TraceCheckUtils]: 54: Hoare triple {37384#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {37383#true} is VALID [2022-02-20 19:59:59,613 INFO L290 TraceCheckUtils]: 55: Hoare triple {37383#true} havoc ~__retres1~7; {37383#true} is VALID [2022-02-20 19:59:59,613 INFO L290 TraceCheckUtils]: 56: Hoare triple {37383#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {37383#true} is VALID [2022-02-20 19:59:59,614 INFO L290 TraceCheckUtils]: 57: Hoare triple {37383#true} #res := ~__retres1~7; {37383#true} is VALID [2022-02-20 19:59:59,614 INFO L290 TraceCheckUtils]: 58: Hoare triple {37383#true} assume true; {37383#true} is VALID [2022-02-20 19:59:59,614 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {37383#true} {37384#false} #890#return; {37384#false} is VALID [2022-02-20 19:59:59,614 INFO L290 TraceCheckUtils]: 60: Hoare triple {37384#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {37384#false} is VALID [2022-02-20 19:59:59,614 INFO L290 TraceCheckUtils]: 61: Hoare triple {37384#false} assume 0 != eval2_~tmp~5#1; {37384#false} is VALID [2022-02-20 19:59:59,614 INFO L290 TraceCheckUtils]: 62: Hoare triple {37384#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {37384#false} is VALID [2022-02-20 19:59:59,614 INFO L290 TraceCheckUtils]: 63: Hoare triple {37384#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {37384#false} is VALID [2022-02-20 19:59:59,614 INFO L290 TraceCheckUtils]: 64: Hoare triple {37384#false} assume !(0 == ~m_pc~0); {37384#false} is VALID [2022-02-20 19:59:59,615 INFO L290 TraceCheckUtils]: 65: Hoare triple {37384#false} assume 1 == ~m_pc~0; {37384#false} is VALID [2022-02-20 19:59:59,615 INFO L290 TraceCheckUtils]: 66: Hoare triple {37384#false} assume ~token~0 != 2 + ~local~0; {37384#false} is VALID [2022-02-20 19:59:59,615 INFO L272 TraceCheckUtils]: 67: Hoare triple {37384#false} call error2(); {37384#false} is VALID [2022-02-20 19:59:59,615 INFO L290 TraceCheckUtils]: 68: Hoare triple {37384#false} assume !false; {37384#false} is VALID [2022-02-20 19:59:59,616 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:59,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:59,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022523153] [2022-02-20 19:59:59,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022523153] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:59,616 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:59,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:59,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770740515] [2022-02-20 19:59:59,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:59,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:59:59,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:59,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:59,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:59,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:59,658 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:59,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:59,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:59,659 INFO L87 Difference]: Start difference. First operand 1384 states and 1855 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:01,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:01,261 INFO L93 Difference]: Finished difference Result 1842 states and 2549 transitions. [2022-02-20 20:00:01,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:00:01,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 20:00:01,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 592 transitions. [2022-02-20 20:00:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 592 transitions. [2022-02-20 20:00:01,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 592 transitions. [2022-02-20 20:00:01,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 592 edges. 592 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:01,823 INFO L225 Difference]: With dead ends: 1842 [2022-02-20 20:00:01,823 INFO L226 Difference]: Without dead ends: 1483 [2022-02-20 20:00:01,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:00:01,825 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 662 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:01,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [684 Valid, 753 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 20:00:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2022-02-20 20:00:01,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1384. [2022-02-20 20:00:01,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:01,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1483 states. Second operand has 1384 states, 1106 states have (on average 1.3652802893309222) internal successors, (1510), 1123 states have internal predecessors, (1510), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-02-20 20:00:01,919 INFO L74 IsIncluded]: Start isIncluded. First operand 1483 states. Second operand has 1384 states, 1106 states have (on average 1.3652802893309222) internal successors, (1510), 1123 states have internal predecessors, (1510), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-02-20 20:00:01,921 INFO L87 Difference]: Start difference. First operand 1483 states. Second operand has 1384 states, 1106 states have (on average 1.3652802893309222) internal successors, (1510), 1123 states have internal predecessors, (1510), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-02-20 20:00:02,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:02,018 INFO L93 Difference]: Finished difference Result 1483 states and 2010 transitions. [2022-02-20 20:00:02,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 2010 transitions. [2022-02-20 20:00:02,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:02,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:02,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 1384 states, 1106 states have (on average 1.3652802893309222) internal successors, (1510), 1123 states have internal predecessors, (1510), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) Second operand 1483 states. [2022-02-20 20:00:02,026 INFO L87 Difference]: Start difference. First operand has 1384 states, 1106 states have (on average 1.3652802893309222) internal successors, (1510), 1123 states have internal predecessors, (1510), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) Second operand 1483 states. [2022-02-20 20:00:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:02,122 INFO L93 Difference]: Finished difference Result 1483 states and 2010 transitions. [2022-02-20 20:00:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 2010 transitions. [2022-02-20 20:00:02,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:02,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:02,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:02,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1106 states have (on average 1.3652802893309222) internal successors, (1510), 1123 states have internal predecessors, (1510), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-02-20 20:00:02,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1852 transitions. [2022-02-20 20:00:02,248 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1852 transitions. Word has length 69 [2022-02-20 20:00:02,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:02,249 INFO L470 AbstractCegarLoop]: Abstraction has 1384 states and 1852 transitions. [2022-02-20 20:00:02,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:02,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1852 transitions. [2022-02-20 20:00:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 20:00:02,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:02,255 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] [2022-02-20 20:00:02,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:00:02,255 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash 251223467, now seen corresponding path program 1 times [2022-02-20 20:00:02,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:02,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609267439] [2022-02-20 20:00:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:02,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:02,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:02,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {44743#true} assume true; {44743#true} is VALID [2022-02-20 20:00:02,293 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {44743#true} {44745#(= ~E_1~0 ~M_E~0)} #882#return; {44745#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:02,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:02,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {44789#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {44790#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:02,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {44790#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {44790#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:02,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {44790#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {44790#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:02,322 INFO L290 TraceCheckUtils]: 3: Hoare triple {44790#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {44790#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:02,322 INFO L290 TraceCheckUtils]: 4: Hoare triple {44790#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {44791#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:02,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {44791#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {44791#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:02,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {44791#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {44791#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:02,324 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {44791#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {44745#(= ~E_1~0 ~M_E~0)} #884#return; {44744#false} is VALID [2022-02-20 20:00:02,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 20:00:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:02,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {44792#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {44743#true} is VALID [2022-02-20 20:00:02,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {44743#true} assume !(1 == ~m_pc~0); {44743#true} is VALID [2022-02-20 20:00:02,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {44743#true} is_master_triggered_~__retres1~4#1 := 0; {44743#true} is VALID [2022-02-20 20:00:02,343 INFO L290 TraceCheckUtils]: 3: Hoare triple {44743#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {44743#true} is VALID [2022-02-20 20:00:02,343 INFO L290 TraceCheckUtils]: 4: Hoare triple {44743#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {44743#true} is VALID [2022-02-20 20:00:02,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {44743#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {44743#true} is VALID [2022-02-20 20:00:02,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {44743#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; {44743#true} is VALID [2022-02-20 20:00:02,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {44743#true} assume 1 == ~t1_pc~0; {44743#true} is VALID [2022-02-20 20:00:02,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {44743#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {44743#true} is VALID [2022-02-20 20:00:02,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {44743#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {44743#true} is VALID [2022-02-20 20:00:02,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {44743#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {44743#true} is VALID [2022-02-20 20:00:02,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {44743#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {44743#true} is VALID [2022-02-20 20:00:02,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {44743#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; {44743#true} is VALID [2022-02-20 20:00:02,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {44743#true} assume !(1 == ~t2_pc~0); {44743#true} is VALID [2022-02-20 20:00:02,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {44743#true} is_transmit2_triggered_~__retres1~6#1 := 0; {44743#true} is VALID [2022-02-20 20:00:02,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {44743#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {44743#true} is VALID [2022-02-20 20:00:02,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {44743#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {44743#true} is VALID [2022-02-20 20:00:02,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {44743#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {44743#true} is VALID [2022-02-20 20:00:02,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {44743#true} assume true; {44743#true} is VALID [2022-02-20 20:00:02,345 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {44743#true} {44744#false} #886#return; {44744#false} is VALID [2022-02-20 20:00:02,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 20:00:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:02,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {44789#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {44743#true} is VALID [2022-02-20 20:00:02,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {44743#true} assume !(1 == ~T1_E~0); {44743#true} is VALID [2022-02-20 20:00:02,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {44743#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {44743#true} is VALID [2022-02-20 20:00:02,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {44743#true} assume 1 == ~E_M~0;~E_M~0 := 2; {44743#true} is VALID [2022-02-20 20:00:02,352 INFO L290 TraceCheckUtils]: 4: Hoare triple {44743#true} assume 1 == ~E_1~0;~E_1~0 := 2; {44743#true} is VALID [2022-02-20 20:00:02,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {44743#true} assume 1 == ~E_2~0;~E_2~0 := 2; {44743#true} is VALID [2022-02-20 20:00:02,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {44743#true} assume true; {44743#true} is VALID [2022-02-20 20:00:02,352 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {44743#true} {44744#false} #888#return; {44744#false} is VALID [2022-02-20 20:00:02,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 20:00:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:02,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {44743#true} havoc ~__retres1~7; {44743#true} is VALID [2022-02-20 20:00:02,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {44743#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {44743#true} is VALID [2022-02-20 20:00:02,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {44743#true} #res := ~__retres1~7; {44743#true} is VALID [2022-02-20 20:00:02,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {44743#true} assume true; {44743#true} is VALID [2022-02-20 20:00:02,357 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {44743#true} {44744#false} #890#return; {44744#false} is VALID [2022-02-20 20:00:02,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {44743#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {44745#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:02,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {44745#(= ~E_1~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {44745#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:02,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {44745#(= ~E_1~0 ~M_E~0)} assume !(0 != main_#t~nondet32#1);havoc main_#t~nondet32#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {44745#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:02,359 INFO L290 TraceCheckUtils]: 3: Hoare triple {44745#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret30#1, start_simulation2_#t~ret31#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; {44745#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:02,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {44745#(= ~E_1~0 ~M_E~0)} call update_channels2(); {44743#true} is VALID [2022-02-20 20:00:02,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {44743#true} assume true; {44743#true} is VALID [2022-02-20 20:00:02,359 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {44743#true} {44745#(= ~E_1~0 ~M_E~0)} #882#return; {44745#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:02,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {44745#(= ~E_1~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {44745#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:02,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {44745#(= ~E_1~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {44745#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:02,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {44745#(= ~E_1~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {44745#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:02,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {44745#(= ~E_1~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {44745#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:02,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {44745#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {44745#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:02,361 INFO L272 TraceCheckUtils]: 12: Hoare triple {44745#(= ~E_1~0 ~M_E~0)} call fire_delta_events2(); {44789#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 20:00:02,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {44789#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {44790#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:02,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {44790#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {44790#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:02,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {44790#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {44790#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:02,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {44790#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {44790#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:02,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {44790#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {44791#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:02,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {44791#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {44791#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:02,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {44791#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {44791#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:02,365 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {44791#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {44745#(= ~E_1~0 ~M_E~0)} #884#return; {44744#false} is VALID [2022-02-20 20:00:02,365 INFO L272 TraceCheckUtils]: 21: Hoare triple {44744#false} call activate_threads2(); {44792#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 20:00:02,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {44792#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {44743#true} is VALID [2022-02-20 20:00:02,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {44743#true} assume !(1 == ~m_pc~0); {44743#true} is VALID [2022-02-20 20:00:02,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {44743#true} is_master_triggered_~__retres1~4#1 := 0; {44743#true} is VALID [2022-02-20 20:00:02,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {44743#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {44743#true} is VALID [2022-02-20 20:00:02,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {44743#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {44743#true} is VALID [2022-02-20 20:00:02,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {44743#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {44743#true} is VALID [2022-02-20 20:00:02,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {44743#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; {44743#true} is VALID [2022-02-20 20:00:02,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {44743#true} assume 1 == ~t1_pc~0; {44743#true} is VALID [2022-02-20 20:00:02,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {44743#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {44743#true} is VALID [2022-02-20 20:00:02,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {44743#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {44743#true} is VALID [2022-02-20 20:00:02,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {44743#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {44743#true} is VALID [2022-02-20 20:00:02,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {44743#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {44743#true} is VALID [2022-02-20 20:00:02,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {44743#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; {44743#true} is VALID [2022-02-20 20:00:02,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {44743#true} assume !(1 == ~t2_pc~0); {44743#true} is VALID [2022-02-20 20:00:02,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {44743#true} is_transmit2_triggered_~__retres1~6#1 := 0; {44743#true} is VALID [2022-02-20 20:00:02,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {44743#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {44743#true} is VALID [2022-02-20 20:00:02,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {44743#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {44743#true} is VALID [2022-02-20 20:00:02,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {44743#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {44743#true} is VALID [2022-02-20 20:00:02,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {44743#true} assume true; {44743#true} is VALID [2022-02-20 20:00:02,367 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {44743#true} {44744#false} #886#return; {44744#false} is VALID [2022-02-20 20:00:02,368 INFO L272 TraceCheckUtils]: 42: Hoare triple {44744#false} call reset_delta_events2(); {44789#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 20:00:02,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {44789#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {44743#true} is VALID [2022-02-20 20:00:02,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {44743#true} assume !(1 == ~T1_E~0); {44743#true} is VALID [2022-02-20 20:00:02,368 INFO L290 TraceCheckUtils]: 45: Hoare triple {44743#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {44743#true} is VALID [2022-02-20 20:00:02,368 INFO L290 TraceCheckUtils]: 46: Hoare triple {44743#true} assume 1 == ~E_M~0;~E_M~0 := 2; {44743#true} is VALID [2022-02-20 20:00:02,368 INFO L290 TraceCheckUtils]: 47: Hoare triple {44743#true} assume 1 == ~E_1~0;~E_1~0 := 2; {44743#true} is VALID [2022-02-20 20:00:02,368 INFO L290 TraceCheckUtils]: 48: Hoare triple {44743#true} assume 1 == ~E_2~0;~E_2~0 := 2; {44743#true} is VALID [2022-02-20 20:00:02,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {44743#true} assume true; {44743#true} is VALID [2022-02-20 20:00:02,369 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {44743#true} {44744#false} #888#return; {44744#false} is VALID [2022-02-20 20:00:02,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {44744#false} assume !false; {44744#false} is VALID [2022-02-20 20:00:02,369 INFO L290 TraceCheckUtils]: 52: Hoare triple {44744#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {44744#false} is VALID [2022-02-20 20:00:02,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {44744#false} assume !false; {44744#false} is VALID [2022-02-20 20:00:02,369 INFO L272 TraceCheckUtils]: 54: Hoare triple {44744#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {44743#true} is VALID [2022-02-20 20:00:02,369 INFO L290 TraceCheckUtils]: 55: Hoare triple {44743#true} havoc ~__retres1~7; {44743#true} is VALID [2022-02-20 20:00:02,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {44743#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {44743#true} is VALID [2022-02-20 20:00:02,370 INFO L290 TraceCheckUtils]: 57: Hoare triple {44743#true} #res := ~__retres1~7; {44743#true} is VALID [2022-02-20 20:00:02,370 INFO L290 TraceCheckUtils]: 58: Hoare triple {44743#true} assume true; {44743#true} is VALID [2022-02-20 20:00:02,370 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {44743#true} {44744#false} #890#return; {44744#false} is VALID [2022-02-20 20:00:02,370 INFO L290 TraceCheckUtils]: 60: Hoare triple {44744#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {44744#false} is VALID [2022-02-20 20:00:02,370 INFO L290 TraceCheckUtils]: 61: Hoare triple {44744#false} assume 0 != eval2_~tmp~5#1; {44744#false} is VALID [2022-02-20 20:00:02,370 INFO L290 TraceCheckUtils]: 62: Hoare triple {44744#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {44744#false} is VALID [2022-02-20 20:00:02,370 INFO L290 TraceCheckUtils]: 63: Hoare triple {44744#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {44744#false} is VALID [2022-02-20 20:00:02,370 INFO L290 TraceCheckUtils]: 64: Hoare triple {44744#false} assume !(0 == ~m_pc~0); {44744#false} is VALID [2022-02-20 20:00:02,371 INFO L290 TraceCheckUtils]: 65: Hoare triple {44744#false} assume 1 == ~m_pc~0; {44744#false} is VALID [2022-02-20 20:00:02,371 INFO L290 TraceCheckUtils]: 66: Hoare triple {44744#false} assume ~token~0 != 2 + ~local~0; {44744#false} is VALID [2022-02-20 20:00:02,371 INFO L272 TraceCheckUtils]: 67: Hoare triple {44744#false} call error2(); {44744#false} is VALID [2022-02-20 20:00:02,371 INFO L290 TraceCheckUtils]: 68: Hoare triple {44744#false} assume !false; {44744#false} is VALID [2022-02-20 20:00:02,371 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:02,372 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:02,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609267439] [2022-02-20 20:00:02,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609267439] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:02,372 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:02,372 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:02,372 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784803087] [2022-02-20 20:00:02,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:02,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 20:00:02,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:02,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:02,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:02,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:02,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:02,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:02,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:02,417 INFO L87 Difference]: Start difference. First operand 1384 states and 1852 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:05,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:05,081 INFO L93 Difference]: Finished difference Result 2178 states and 3027 transitions. [2022-02-20 20:00:05,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 20:00:05,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 20:00:05,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 850 transitions. [2022-02-20 20:00:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 850 transitions. [2022-02-20 20:00:05,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 850 transitions. [2022-02-20 20:00:05,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 850 edges. 850 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:05,986 INFO L225 Difference]: With dead ends: 2178 [2022-02-20 20:00:05,986 INFO L226 Difference]: Without dead ends: 1819 [2022-02-20 20:00:05,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:00:05,989 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 708 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:05,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [732 Valid, 1343 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 20:00:05,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2022-02-20 20:00:06,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1593. [2022-02-20 20:00:06,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:06,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1819 states. Second operand has 1593 states, 1281 states have (on average 1.3762685402029664) internal successors, (1763), 1300 states have internal predecessors, (1763), 180 states have call successors, (180), 113 states have call predecessors, (180), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) [2022-02-20 20:00:06,089 INFO L74 IsIncluded]: Start isIncluded. First operand 1819 states. Second operand has 1593 states, 1281 states have (on average 1.3762685402029664) internal successors, (1763), 1300 states have internal predecessors, (1763), 180 states have call successors, (180), 113 states have call predecessors, (180), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) [2022-02-20 20:00:06,096 INFO L87 Difference]: Start difference. First operand 1819 states. Second operand has 1593 states, 1281 states have (on average 1.3762685402029664) internal successors, (1763), 1300 states have internal predecessors, (1763), 180 states have call successors, (180), 113 states have call predecessors, (180), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) [2022-02-20 20:00:06,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:06,239 INFO L93 Difference]: Finished difference Result 1819 states and 2493 transitions. [2022-02-20 20:00:06,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2493 transitions. [2022-02-20 20:00:06,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:06,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:06,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 1593 states, 1281 states have (on average 1.3762685402029664) internal successors, (1763), 1300 states have internal predecessors, (1763), 180 states have call successors, (180), 113 states have call predecessors, (180), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) Second operand 1819 states. [2022-02-20 20:00:06,250 INFO L87 Difference]: Start difference. First operand has 1593 states, 1281 states have (on average 1.3762685402029664) internal successors, (1763), 1300 states have internal predecessors, (1763), 180 states have call successors, (180), 113 states have call predecessors, (180), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) Second operand 1819 states. [2022-02-20 20:00:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:06,383 INFO L93 Difference]: Finished difference Result 1819 states and 2493 transitions. [2022-02-20 20:00:06,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2493 transitions. [2022-02-20 20:00:06,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:06,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:06,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:06,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1281 states have (on average 1.3762685402029664) internal successors, (1763), 1300 states have internal predecessors, (1763), 180 states have call successors, (180), 113 states have call predecessors, (180), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) [2022-02-20 20:00:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2153 transitions. [2022-02-20 20:00:06,550 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2153 transitions. Word has length 69 [2022-02-20 20:00:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:06,550 INFO L470 AbstractCegarLoop]: Abstraction has 1593 states and 2153 transitions. [2022-02-20 20:00:06,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2153 transitions. [2022-02-20 20:00:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 20:00:06,552 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:06,552 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] [2022-02-20 20:00:06,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:00:06,552 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:06,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1789563497, now seen corresponding path program 1 times [2022-02-20 20:00:06,553 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:06,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151815073] [2022-02-20 20:00:06,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:06,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {53498#true} assume true; {53498#true} is VALID [2022-02-20 20:00:06,580 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {53498#true} {53500#(= ~E_2~0 ~M_E~0)} #882#return; {53500#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 20:00:06,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {53544#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:06,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:06,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:06,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:06,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:06,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_2~0;~E_2~0 := 1; {53546#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:06,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {53546#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume true; {53546#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:06,616 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {53546#(not (= |old(~E_2~0)| |old(~M_E~0)|))} {53500#(= ~E_2~0 ~M_E~0)} #884#return; {53499#false} is VALID [2022-02-20 20:00:06,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 20:00:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {53547#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {53498#true} is VALID [2022-02-20 20:00:06,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {53498#true} assume !(1 == ~m_pc~0); {53498#true} is VALID [2022-02-20 20:00:06,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {53498#true} is_master_triggered_~__retres1~4#1 := 0; {53498#true} is VALID [2022-02-20 20:00:06,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {53498#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {53498#true} is VALID [2022-02-20 20:00:06,630 INFO L290 TraceCheckUtils]: 4: Hoare triple {53498#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {53498#true} is VALID [2022-02-20 20:00:06,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {53498#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {53498#true} is VALID [2022-02-20 20:00:06,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {53498#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; {53498#true} is VALID [2022-02-20 20:00:06,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {53498#true} assume 1 == ~t1_pc~0; {53498#true} is VALID [2022-02-20 20:00:06,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {53498#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {53498#true} is VALID [2022-02-20 20:00:06,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {53498#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {53498#true} is VALID [2022-02-20 20:00:06,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {53498#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {53498#true} is VALID [2022-02-20 20:00:06,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {53498#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {53498#true} is VALID [2022-02-20 20:00:06,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {53498#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; {53498#true} is VALID [2022-02-20 20:00:06,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {53498#true} assume !(1 == ~t2_pc~0); {53498#true} is VALID [2022-02-20 20:00:06,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {53498#true} is_transmit2_triggered_~__retres1~6#1 := 0; {53498#true} is VALID [2022-02-20 20:00:06,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {53498#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {53498#true} is VALID [2022-02-20 20:00:06,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {53498#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {53498#true} is VALID [2022-02-20 20:00:06,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {53498#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {53498#true} is VALID [2022-02-20 20:00:06,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {53498#true} assume true; {53498#true} is VALID [2022-02-20 20:00:06,632 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {53498#true} {53499#false} #886#return; {53499#false} is VALID [2022-02-20 20:00:06,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 20:00:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {53544#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {53498#true} is VALID [2022-02-20 20:00:06,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {53498#true} assume !(1 == ~T1_E~0); {53498#true} is VALID [2022-02-20 20:00:06,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {53498#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {53498#true} is VALID [2022-02-20 20:00:06,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {53498#true} assume 1 == ~E_M~0;~E_M~0 := 2; {53498#true} is VALID [2022-02-20 20:00:06,637 INFO L290 TraceCheckUtils]: 4: Hoare triple {53498#true} assume 1 == ~E_1~0;~E_1~0 := 2; {53498#true} is VALID [2022-02-20 20:00:06,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {53498#true} assume 1 == ~E_2~0;~E_2~0 := 2; {53498#true} is VALID [2022-02-20 20:00:06,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {53498#true} assume true; {53498#true} is VALID [2022-02-20 20:00:06,637 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {53498#true} {53499#false} #888#return; {53499#false} is VALID [2022-02-20 20:00:06,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 20:00:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {53498#true} havoc ~__retres1~7; {53498#true} is VALID [2022-02-20 20:00:06,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {53498#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {53498#true} is VALID [2022-02-20 20:00:06,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {53498#true} #res := ~__retres1~7; {53498#true} is VALID [2022-02-20 20:00:06,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {53498#true} assume true; {53498#true} is VALID [2022-02-20 20:00:06,640 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53498#true} {53499#false} #890#return; {53499#false} is VALID [2022-02-20 20:00:06,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {53498#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {53500#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 20:00:06,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {53500#(= ~E_2~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {53500#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 20:00:06,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {53500#(= ~E_2~0 ~M_E~0)} assume !(0 != main_#t~nondet32#1);havoc main_#t~nondet32#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {53500#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 20:00:06,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {53500#(= ~E_2~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret30#1, start_simulation2_#t~ret31#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; {53500#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 20:00:06,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {53500#(= ~E_2~0 ~M_E~0)} call update_channels2(); {53498#true} is VALID [2022-02-20 20:00:06,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {53498#true} assume true; {53498#true} is VALID [2022-02-20 20:00:06,643 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {53498#true} {53500#(= ~E_2~0 ~M_E~0)} #882#return; {53500#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 20:00:06,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {53500#(= ~E_2~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {53500#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 20:00:06,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {53500#(= ~E_2~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {53500#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 20:00:06,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {53500#(= ~E_2~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {53500#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 20:00:06,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {53500#(= ~E_2~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {53500#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 20:00:06,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {53500#(= ~E_2~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {53500#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 20:00:06,645 INFO L272 TraceCheckUtils]: 12: Hoare triple {53500#(= ~E_2~0 ~M_E~0)} call fire_delta_events2(); {53544#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 20:00:06,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {53544#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:06,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:06,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:06,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:06,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:06,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {53545#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_2~0;~E_2~0 := 1; {53546#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:06,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {53546#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume true; {53546#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:06,649 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {53546#(not (= |old(~E_2~0)| |old(~M_E~0)|))} {53500#(= ~E_2~0 ~M_E~0)} #884#return; {53499#false} is VALID [2022-02-20 20:00:06,649 INFO L272 TraceCheckUtils]: 21: Hoare triple {53499#false} call activate_threads2(); {53547#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 20:00:06,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {53547#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {53498#true} is VALID [2022-02-20 20:00:06,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {53498#true} assume !(1 == ~m_pc~0); {53498#true} is VALID [2022-02-20 20:00:06,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {53498#true} is_master_triggered_~__retres1~4#1 := 0; {53498#true} is VALID [2022-02-20 20:00:06,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {53498#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {53498#true} is VALID [2022-02-20 20:00:06,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {53498#true} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {53498#true} is VALID [2022-02-20 20:00:06,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {53498#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {53498#true} is VALID [2022-02-20 20:00:06,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {53498#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; {53498#true} is VALID [2022-02-20 20:00:06,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {53498#true} assume 1 == ~t1_pc~0; {53498#true} is VALID [2022-02-20 20:00:06,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {53498#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {53498#true} is VALID [2022-02-20 20:00:06,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {53498#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {53498#true} is VALID [2022-02-20 20:00:06,650 INFO L290 TraceCheckUtils]: 32: Hoare triple {53498#true} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {53498#true} is VALID [2022-02-20 20:00:06,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {53498#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {53498#true} is VALID [2022-02-20 20:00:06,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {53498#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; {53498#true} is VALID [2022-02-20 20:00:06,650 INFO L290 TraceCheckUtils]: 35: Hoare triple {53498#true} assume !(1 == ~t2_pc~0); {53498#true} is VALID [2022-02-20 20:00:06,651 INFO L290 TraceCheckUtils]: 36: Hoare triple {53498#true} is_transmit2_triggered_~__retres1~6#1 := 0; {53498#true} is VALID [2022-02-20 20:00:06,651 INFO L290 TraceCheckUtils]: 37: Hoare triple {53498#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {53498#true} is VALID [2022-02-20 20:00:06,651 INFO L290 TraceCheckUtils]: 38: Hoare triple {53498#true} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {53498#true} is VALID [2022-02-20 20:00:06,651 INFO L290 TraceCheckUtils]: 39: Hoare triple {53498#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {53498#true} is VALID [2022-02-20 20:00:06,651 INFO L290 TraceCheckUtils]: 40: Hoare triple {53498#true} assume true; {53498#true} is VALID [2022-02-20 20:00:06,651 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {53498#true} {53499#false} #886#return; {53499#false} is VALID [2022-02-20 20:00:06,651 INFO L272 TraceCheckUtils]: 42: Hoare triple {53499#false} call reset_delta_events2(); {53544#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 20:00:06,652 INFO L290 TraceCheckUtils]: 43: Hoare triple {53544#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {53498#true} is VALID [2022-02-20 20:00:06,652 INFO L290 TraceCheckUtils]: 44: Hoare triple {53498#true} assume !(1 == ~T1_E~0); {53498#true} is VALID [2022-02-20 20:00:06,652 INFO L290 TraceCheckUtils]: 45: Hoare triple {53498#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {53498#true} is VALID [2022-02-20 20:00:06,652 INFO L290 TraceCheckUtils]: 46: Hoare triple {53498#true} assume 1 == ~E_M~0;~E_M~0 := 2; {53498#true} is VALID [2022-02-20 20:00:06,652 INFO L290 TraceCheckUtils]: 47: Hoare triple {53498#true} assume 1 == ~E_1~0;~E_1~0 := 2; {53498#true} is VALID [2022-02-20 20:00:06,652 INFO L290 TraceCheckUtils]: 48: Hoare triple {53498#true} assume 1 == ~E_2~0;~E_2~0 := 2; {53498#true} is VALID [2022-02-20 20:00:06,652 INFO L290 TraceCheckUtils]: 49: Hoare triple {53498#true} assume true; {53498#true} is VALID [2022-02-20 20:00:06,652 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {53498#true} {53499#false} #888#return; {53499#false} is VALID [2022-02-20 20:00:06,653 INFO L290 TraceCheckUtils]: 51: Hoare triple {53499#false} assume !false; {53499#false} is VALID [2022-02-20 20:00:06,653 INFO L290 TraceCheckUtils]: 52: Hoare triple {53499#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {53499#false} is VALID [2022-02-20 20:00:06,653 INFO L290 TraceCheckUtils]: 53: Hoare triple {53499#false} assume !false; {53499#false} is VALID [2022-02-20 20:00:06,653 INFO L272 TraceCheckUtils]: 54: Hoare triple {53499#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {53498#true} is VALID [2022-02-20 20:00:06,653 INFO L290 TraceCheckUtils]: 55: Hoare triple {53498#true} havoc ~__retres1~7; {53498#true} is VALID [2022-02-20 20:00:06,653 INFO L290 TraceCheckUtils]: 56: Hoare triple {53498#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {53498#true} is VALID [2022-02-20 20:00:06,653 INFO L290 TraceCheckUtils]: 57: Hoare triple {53498#true} #res := ~__retres1~7; {53498#true} is VALID [2022-02-20 20:00:06,653 INFO L290 TraceCheckUtils]: 58: Hoare triple {53498#true} assume true; {53498#true} is VALID [2022-02-20 20:00:06,654 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {53498#true} {53499#false} #890#return; {53499#false} is VALID [2022-02-20 20:00:06,654 INFO L290 TraceCheckUtils]: 60: Hoare triple {53499#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {53499#false} is VALID [2022-02-20 20:00:06,654 INFO L290 TraceCheckUtils]: 61: Hoare triple {53499#false} assume 0 != eval2_~tmp~5#1; {53499#false} is VALID [2022-02-20 20:00:06,654 INFO L290 TraceCheckUtils]: 62: Hoare triple {53499#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {53499#false} is VALID [2022-02-20 20:00:06,654 INFO L290 TraceCheckUtils]: 63: Hoare triple {53499#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {53499#false} is VALID [2022-02-20 20:00:06,654 INFO L290 TraceCheckUtils]: 64: Hoare triple {53499#false} assume !(0 == ~m_pc~0); {53499#false} is VALID [2022-02-20 20:00:06,654 INFO L290 TraceCheckUtils]: 65: Hoare triple {53499#false} assume 1 == ~m_pc~0; {53499#false} is VALID [2022-02-20 20:00:06,654 INFO L290 TraceCheckUtils]: 66: Hoare triple {53499#false} assume ~token~0 != 2 + ~local~0; {53499#false} is VALID [2022-02-20 20:00:06,655 INFO L272 TraceCheckUtils]: 67: Hoare triple {53499#false} call error2(); {53499#false} is VALID [2022-02-20 20:00:06,655 INFO L290 TraceCheckUtils]: 68: Hoare triple {53499#false} assume !false; {53499#false} is VALID [2022-02-20 20:00:06,655 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:06,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:06,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151815073] [2022-02-20 20:00:06,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151815073] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:06,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:06,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:06,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174963586] [2022-02-20 20:00:06,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:06,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 20:00:06,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:06,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:06,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:06,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:06,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:06,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:06,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:06,715 INFO L87 Difference]: Start difference. First operand 1593 states and 2153 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:09,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:09,691 INFO L93 Difference]: Finished difference Result 2881 states and 4034 transitions. [2022-02-20 20:00:09,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 20:00:09,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 20:00:09,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 829 transitions. [2022-02-20 20:00:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 829 transitions. [2022-02-20 20:00:09,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 829 transitions. [2022-02-20 20:00:10,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 829 edges. 829 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:10,535 INFO L225 Difference]: With dead ends: 2881 [2022-02-20 20:00:10,535 INFO L226 Difference]: Without dead ends: 2313 [2022-02-20 20:00:10,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:00:10,537 INFO L933 BasicCegarLoop]: 433 mSDtfsCounter, 651 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:10,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [671 Valid, 1355 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:00:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2022-02-20 20:00:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 2024. [2022-02-20 20:00:10,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:10,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2313 states. Second operand has 2024 states, 1646 states have (on average 1.3955042527339003) internal successors, (2297), 1669 states have internal predecessors, (2297), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-02-20 20:00:10,662 INFO L74 IsIncluded]: Start isIncluded. First operand 2313 states. Second operand has 2024 states, 1646 states have (on average 1.3955042527339003) internal successors, (2297), 1669 states have internal predecessors, (2297), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-02-20 20:00:10,664 INFO L87 Difference]: Start difference. First operand 2313 states. Second operand has 2024 states, 1646 states have (on average 1.3955042527339003) internal successors, (2297), 1669 states have internal predecessors, (2297), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-02-20 20:00:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:10,891 INFO L93 Difference]: Finished difference Result 2313 states and 3193 transitions. [2022-02-20 20:00:10,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3193 transitions. [2022-02-20 20:00:10,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:10,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:10,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 2024 states, 1646 states have (on average 1.3955042527339003) internal successors, (2297), 1669 states have internal predecessors, (2297), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) Second operand 2313 states. [2022-02-20 20:00:10,904 INFO L87 Difference]: Start difference. First operand has 2024 states, 1646 states have (on average 1.3955042527339003) internal successors, (2297), 1669 states have internal predecessors, (2297), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) Second operand 2313 states. [2022-02-20 20:00:11,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:11,126 INFO L93 Difference]: Finished difference Result 2313 states and 3193 transitions. [2022-02-20 20:00:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3193 transitions. [2022-02-20 20:00:11,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:11,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:11,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:11,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1646 states have (on average 1.3955042527339003) internal successors, (2297), 1669 states have internal predecessors, (2297), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-02-20 20:00:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2785 transitions. [2022-02-20 20:00:11,385 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2785 transitions. Word has length 69 [2022-02-20 20:00:11,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:11,385 INFO L470 AbstractCegarLoop]: Abstraction has 2024 states and 2785 transitions. [2022-02-20 20:00:11,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2785 transitions. [2022-02-20 20:00:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 20:00:11,387 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:11,387 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] [2022-02-20 20:00:11,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:00:11,387 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:11,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:11,388 INFO L85 PathProgramCache]: Analyzing trace with hash -239022613, now seen corresponding path program 1 times [2022-02-20 20:00:11,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:11,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677465246] [2022-02-20 20:00:11,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:11,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {64721#true} assume true; {64721#true} is VALID [2022-02-20 20:00:11,435 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {64721#true} {64721#true} #882#return; {64721#true} is VALID [2022-02-20 20:00:11,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {64766#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {64721#true} is VALID [2022-02-20 20:00:11,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {64721#true} assume !(0 == ~T1_E~0); {64721#true} is VALID [2022-02-20 20:00:11,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {64721#true} assume !(0 == ~T2_E~0); {64721#true} is VALID [2022-02-20 20:00:11,445 INFO L290 TraceCheckUtils]: 3: Hoare triple {64721#true} assume !(0 == ~E_M~0); {64721#true} is VALID [2022-02-20 20:00:11,445 INFO L290 TraceCheckUtils]: 4: Hoare triple {64721#true} assume !(0 == ~E_1~0); {64721#true} is VALID [2022-02-20 20:00:11,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {64721#true} assume !(0 == ~E_2~0); {64721#true} is VALID [2022-02-20 20:00:11,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {64721#true} assume true; {64721#true} is VALID [2022-02-20 20:00:11,445 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {64721#true} {64721#true} #884#return; {64721#true} is VALID [2022-02-20 20:00:11,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 20:00:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {64767#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {64721#true} is VALID [2022-02-20 20:00:11,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {64721#true} assume !(1 == ~m_pc~0); {64721#true} is VALID [2022-02-20 20:00:11,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {64721#true} is_master_triggered_~__retres1~4#1 := 0; {64768#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is VALID [2022-02-20 20:00:11,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {64768#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {64769#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} is VALID [2022-02-20 20:00:11,499 INFO L290 TraceCheckUtils]: 4: Hoare triple {64769#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {64770#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} is VALID [2022-02-20 20:00:11,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {64770#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} assume 0 != ~tmp~6#1;~m_st~0 := 0; {64722#false} is VALID [2022-02-20 20:00:11,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {64722#false} 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; {64722#false} is VALID [2022-02-20 20:00:11,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {64722#false} assume 1 == ~t1_pc~0; {64722#false} is VALID [2022-02-20 20:00:11,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {64722#false} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {64722#false} is VALID [2022-02-20 20:00:11,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {64722#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {64722#false} is VALID [2022-02-20 20:00:11,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {64722#false} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {64722#false} is VALID [2022-02-20 20:00:11,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {64722#false} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {64722#false} is VALID [2022-02-20 20:00:11,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {64722#false} 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; {64722#false} is VALID [2022-02-20 20:00:11,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {64722#false} assume !(1 == ~t2_pc~0); {64722#false} is VALID [2022-02-20 20:00:11,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {64722#false} is_transmit2_triggered_~__retres1~6#1 := 0; {64722#false} is VALID [2022-02-20 20:00:11,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {64722#false} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {64722#false} is VALID [2022-02-20 20:00:11,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {64722#false} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {64722#false} is VALID [2022-02-20 20:00:11,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {64722#false} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {64722#false} is VALID [2022-02-20 20:00:11,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {64722#false} assume true; {64722#false} is VALID [2022-02-20 20:00:11,502 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {64722#false} {64721#true} #886#return; {64722#false} is VALID [2022-02-20 20:00:11,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 20:00:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {64766#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {64721#true} is VALID [2022-02-20 20:00:11,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {64721#true} assume !(1 == ~T1_E~0); {64721#true} is VALID [2022-02-20 20:00:11,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {64721#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {64721#true} is VALID [2022-02-20 20:00:11,506 INFO L290 TraceCheckUtils]: 3: Hoare triple {64721#true} assume 1 == ~E_M~0;~E_M~0 := 2; {64721#true} is VALID [2022-02-20 20:00:11,506 INFO L290 TraceCheckUtils]: 4: Hoare triple {64721#true} assume 1 == ~E_1~0;~E_1~0 := 2; {64721#true} is VALID [2022-02-20 20:00:11,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {64721#true} assume 1 == ~E_2~0;~E_2~0 := 2; {64721#true} is VALID [2022-02-20 20:00:11,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {64721#true} assume true; {64721#true} is VALID [2022-02-20 20:00:11,507 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {64721#true} {64722#false} #888#return; {64722#false} is VALID [2022-02-20 20:00:11,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 20:00:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:11,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {64721#true} havoc ~__retres1~7; {64721#true} is VALID [2022-02-20 20:00:11,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {64721#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {64721#true} is VALID [2022-02-20 20:00:11,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {64721#true} #res := ~__retres1~7; {64721#true} is VALID [2022-02-20 20:00:11,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {64721#true} assume true; {64721#true} is VALID [2022-02-20 20:00:11,510 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {64721#true} {64722#false} #890#return; {64722#false} is VALID [2022-02-20 20:00:11,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {64721#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {64721#true} is VALID [2022-02-20 20:00:11,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {64721#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {64721#true} is VALID [2022-02-20 20:00:11,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {64721#true} assume !(0 != main_#t~nondet32#1);havoc main_#t~nondet32#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {64721#true} is VALID [2022-02-20 20:00:11,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {64721#true} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret30#1, start_simulation2_#t~ret31#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; {64721#true} is VALID [2022-02-20 20:00:11,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {64721#true} call update_channels2(); {64721#true} is VALID [2022-02-20 20:00:11,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {64721#true} assume true; {64721#true} is VALID [2022-02-20 20:00:11,511 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {64721#true} {64721#true} #882#return; {64721#true} is VALID [2022-02-20 20:00:11,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {64721#true} assume { :begin_inline_init_threads2 } true; {64721#true} is VALID [2022-02-20 20:00:11,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {64721#true} assume 1 == ~m_i~0;~m_st~0 := 0; {64721#true} is VALID [2022-02-20 20:00:11,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {64721#true} assume 1 == ~t1_i~0;~t1_st~0 := 0; {64721#true} is VALID [2022-02-20 20:00:11,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {64721#true} assume 1 == ~t2_i~0;~t2_st~0 := 0; {64721#true} is VALID [2022-02-20 20:00:11,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {64721#true} assume { :end_inline_init_threads2 } true; {64721#true} is VALID [2022-02-20 20:00:11,512 INFO L272 TraceCheckUtils]: 12: Hoare triple {64721#true} call fire_delta_events2(); {64766#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 20:00:11,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {64766#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {64721#true} is VALID [2022-02-20 20:00:11,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {64721#true} assume !(0 == ~T1_E~0); {64721#true} is VALID [2022-02-20 20:00:11,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {64721#true} assume !(0 == ~T2_E~0); {64721#true} is VALID [2022-02-20 20:00:11,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {64721#true} assume !(0 == ~E_M~0); {64721#true} is VALID [2022-02-20 20:00:11,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {64721#true} assume !(0 == ~E_1~0); {64721#true} is VALID [2022-02-20 20:00:11,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {64721#true} assume !(0 == ~E_2~0); {64721#true} is VALID [2022-02-20 20:00:11,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {64721#true} assume true; {64721#true} is VALID [2022-02-20 20:00:11,513 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {64721#true} {64721#true} #884#return; {64721#true} is VALID [2022-02-20 20:00:11,513 INFO L272 TraceCheckUtils]: 21: Hoare triple {64721#true} call activate_threads2(); {64767#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 20:00:11,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {64767#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {64721#true} is VALID [2022-02-20 20:00:11,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {64721#true} assume !(1 == ~m_pc~0); {64721#true} is VALID [2022-02-20 20:00:11,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {64721#true} is_master_triggered_~__retres1~4#1 := 0; {64768#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is VALID [2022-02-20 20:00:11,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {64768#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {64769#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} is VALID [2022-02-20 20:00:11,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {64769#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {64770#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} is VALID [2022-02-20 20:00:11,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {64770#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} assume 0 != ~tmp~6#1;~m_st~0 := 0; {64722#false} is VALID [2022-02-20 20:00:11,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {64722#false} 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; {64722#false} is VALID [2022-02-20 20:00:11,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {64722#false} assume 1 == ~t1_pc~0; {64722#false} is VALID [2022-02-20 20:00:11,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {64722#false} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {64722#false} is VALID [2022-02-20 20:00:11,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {64722#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {64722#false} is VALID [2022-02-20 20:00:11,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {64722#false} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {64722#false} is VALID [2022-02-20 20:00:11,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {64722#false} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {64722#false} is VALID [2022-02-20 20:00:11,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {64722#false} 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; {64722#false} is VALID [2022-02-20 20:00:11,517 INFO L290 TraceCheckUtils]: 35: Hoare triple {64722#false} assume !(1 == ~t2_pc~0); {64722#false} is VALID [2022-02-20 20:00:11,517 INFO L290 TraceCheckUtils]: 36: Hoare triple {64722#false} is_transmit2_triggered_~__retres1~6#1 := 0; {64722#false} is VALID [2022-02-20 20:00:11,517 INFO L290 TraceCheckUtils]: 37: Hoare triple {64722#false} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {64722#false} is VALID [2022-02-20 20:00:11,517 INFO L290 TraceCheckUtils]: 38: Hoare triple {64722#false} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {64722#false} is VALID [2022-02-20 20:00:11,517 INFO L290 TraceCheckUtils]: 39: Hoare triple {64722#false} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {64722#false} is VALID [2022-02-20 20:00:11,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {64722#false} assume true; {64722#false} is VALID [2022-02-20 20:00:11,517 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {64722#false} {64721#true} #886#return; {64722#false} is VALID [2022-02-20 20:00:11,518 INFO L272 TraceCheckUtils]: 42: Hoare triple {64722#false} call reset_delta_events2(); {64766#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 20:00:11,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {64766#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {64721#true} is VALID [2022-02-20 20:00:11,518 INFO L290 TraceCheckUtils]: 44: Hoare triple {64721#true} assume !(1 == ~T1_E~0); {64721#true} is VALID [2022-02-20 20:00:11,518 INFO L290 TraceCheckUtils]: 45: Hoare triple {64721#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {64721#true} is VALID [2022-02-20 20:00:11,518 INFO L290 TraceCheckUtils]: 46: Hoare triple {64721#true} assume 1 == ~E_M~0;~E_M~0 := 2; {64721#true} is VALID [2022-02-20 20:00:11,518 INFO L290 TraceCheckUtils]: 47: Hoare triple {64721#true} assume 1 == ~E_1~0;~E_1~0 := 2; {64721#true} is VALID [2022-02-20 20:00:11,518 INFO L290 TraceCheckUtils]: 48: Hoare triple {64721#true} assume 1 == ~E_2~0;~E_2~0 := 2; {64721#true} is VALID [2022-02-20 20:00:11,518 INFO L290 TraceCheckUtils]: 49: Hoare triple {64721#true} assume true; {64721#true} is VALID [2022-02-20 20:00:11,519 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {64721#true} {64722#false} #888#return; {64722#false} is VALID [2022-02-20 20:00:11,519 INFO L290 TraceCheckUtils]: 51: Hoare triple {64722#false} assume !false; {64722#false} is VALID [2022-02-20 20:00:11,519 INFO L290 TraceCheckUtils]: 52: Hoare triple {64722#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {64722#false} is VALID [2022-02-20 20:00:11,519 INFO L290 TraceCheckUtils]: 53: Hoare triple {64722#false} assume !false; {64722#false} is VALID [2022-02-20 20:00:11,519 INFO L272 TraceCheckUtils]: 54: Hoare triple {64722#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {64721#true} is VALID [2022-02-20 20:00:11,519 INFO L290 TraceCheckUtils]: 55: Hoare triple {64721#true} havoc ~__retres1~7; {64721#true} is VALID [2022-02-20 20:00:11,519 INFO L290 TraceCheckUtils]: 56: Hoare triple {64721#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {64721#true} is VALID [2022-02-20 20:00:11,520 INFO L290 TraceCheckUtils]: 57: Hoare triple {64721#true} #res := ~__retres1~7; {64721#true} is VALID [2022-02-20 20:00:11,520 INFO L290 TraceCheckUtils]: 58: Hoare triple {64721#true} assume true; {64721#true} is VALID [2022-02-20 20:00:11,520 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {64721#true} {64722#false} #890#return; {64722#false} is VALID [2022-02-20 20:00:11,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {64722#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {64722#false} is VALID [2022-02-20 20:00:11,520 INFO L290 TraceCheckUtils]: 61: Hoare triple {64722#false} assume 0 != eval2_~tmp~5#1; {64722#false} is VALID [2022-02-20 20:00:11,520 INFO L290 TraceCheckUtils]: 62: Hoare triple {64722#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {64722#false} is VALID [2022-02-20 20:00:11,520 INFO L290 TraceCheckUtils]: 63: Hoare triple {64722#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {64722#false} is VALID [2022-02-20 20:00:11,520 INFO L290 TraceCheckUtils]: 64: Hoare triple {64722#false} assume !(0 == ~m_pc~0); {64722#false} is VALID [2022-02-20 20:00:11,521 INFO L290 TraceCheckUtils]: 65: Hoare triple {64722#false} assume 1 == ~m_pc~0; {64722#false} is VALID [2022-02-20 20:00:11,521 INFO L290 TraceCheckUtils]: 66: Hoare triple {64722#false} assume ~token~0 != 2 + ~local~0; {64722#false} is VALID [2022-02-20 20:00:11,521 INFO L272 TraceCheckUtils]: 67: Hoare triple {64722#false} call error2(); {64722#false} is VALID [2022-02-20 20:00:11,521 INFO L290 TraceCheckUtils]: 68: Hoare triple {64722#false} assume !false; {64722#false} is VALID [2022-02-20 20:00:11,521 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,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:11,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677465246] [2022-02-20 20:00:11,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677465246] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:11,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:11,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:11,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521688507] [2022-02-20 20:00:11,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:11,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 20:00:11,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:11,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:11,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:11,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:11,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:11,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:11,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:11,564 INFO L87 Difference]: Start difference. First operand 2024 states and 2785 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:14,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:14,414 INFO L93 Difference]: Finished difference Result 3560 states and 5064 transitions. [2022-02-20 20:00:14,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:00:14,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 20:00:14,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:14,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 644 transitions. [2022-02-20 20:00:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 644 transitions. [2022-02-20 20:00:14,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 644 transitions. [2022-02-20 20:00:14,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 644 edges. 644 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:15,166 INFO L225 Difference]: With dead ends: 3560 [2022-02-20 20:00:15,166 INFO L226 Difference]: Without dead ends: 2562 [2022-02-20 20:00:15,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-02-20 20:00:15,169 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 376 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:15,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 1169 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 20:00:15,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2022-02-20 20:00:15,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2051. [2022-02-20 20:00:15,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:15,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2562 states. Second operand has 2051 states, 1673 states have (on average 1.389121338912134) internal successors, (2324), 1696 states have internal predecessors, (2324), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-02-20 20:00:15,410 INFO L74 IsIncluded]: Start isIncluded. First operand 2562 states. Second operand has 2051 states, 1673 states have (on average 1.389121338912134) internal successors, (2324), 1696 states have internal predecessors, (2324), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-02-20 20:00:15,414 INFO L87 Difference]: Start difference. First operand 2562 states. Second operand has 2051 states, 1673 states have (on average 1.389121338912134) internal successors, (2324), 1696 states have internal predecessors, (2324), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-02-20 20:00:15,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:15,675 INFO L93 Difference]: Finished difference Result 2562 states and 3559 transitions. [2022-02-20 20:00:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3559 transitions. [2022-02-20 20:00:15,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:15,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:15,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 2051 states, 1673 states have (on average 1.389121338912134) internal successors, (2324), 1696 states have internal predecessors, (2324), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) Second operand 2562 states. [2022-02-20 20:00:15,688 INFO L87 Difference]: Start difference. First operand has 2051 states, 1673 states have (on average 1.389121338912134) internal successors, (2324), 1696 states have internal predecessors, (2324), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) Second operand 2562 states. [2022-02-20 20:00:15,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:15,958 INFO L93 Difference]: Finished difference Result 2562 states and 3559 transitions. [2022-02-20 20:00:15,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3559 transitions. [2022-02-20 20:00:15,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:15,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:15,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:15,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2051 states, 1673 states have (on average 1.389121338912134) internal successors, (2324), 1696 states have internal predecessors, (2324), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-02-20 20:00:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 2812 transitions. [2022-02-20 20:00:16,217 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 2812 transitions. Word has length 69 [2022-02-20 20:00:16,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:16,217 INFO L470 AbstractCegarLoop]: Abstraction has 2051 states and 2812 transitions. [2022-02-20 20:00:16,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2812 transitions. [2022-02-20 20:00:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 20:00:16,219 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:16,219 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] [2022-02-20 20:00:16,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 20:00:16,219 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:16,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:16,220 INFO L85 PathProgramCache]: Analyzing trace with hash 9123881, now seen corresponding path program 1 times [2022-02-20 20:00:16,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:16,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434478162] [2022-02-20 20:00:16,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:16,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {77352#true} assume true; {77352#true} is VALID [2022-02-20 20:00:16,255 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {77352#true} {77354#(= ~m_pc~0 ~t1_pc~0)} #882#return; {77354#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:16,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {77398#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {77352#true} is VALID [2022-02-20 20:00:16,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {77352#true} assume !(0 == ~T1_E~0); {77352#true} is VALID [2022-02-20 20:00:16,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {77352#true} assume !(0 == ~T2_E~0); {77352#true} is VALID [2022-02-20 20:00:16,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {77352#true} assume !(0 == ~E_M~0); {77352#true} is VALID [2022-02-20 20:00:16,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {77352#true} assume !(0 == ~E_1~0); {77352#true} is VALID [2022-02-20 20:00:16,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {77352#true} assume !(0 == ~E_2~0); {77352#true} is VALID [2022-02-20 20:00:16,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {77352#true} assume true; {77352#true} is VALID [2022-02-20 20:00:16,270 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77352#true} {77354#(= ~m_pc~0 ~t1_pc~0)} #884#return; {77354#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 20:00:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {77399#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {77352#true} is VALID [2022-02-20 20:00:16,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {77352#true} assume !(1 == ~m_pc~0); {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:16,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_~__retres1~4#1 := 0; {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:16,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:16,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:16,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp~6#1); {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:16,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} 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; {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:16,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume 1 == ~t1_pc~0; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} 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; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume !(1 == ~t2_pc~0); {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is_transmit2_triggered_~__retres1~6#1 := 0; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume true; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,349 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} {77354#(= ~m_pc~0 ~t1_pc~0)} #886#return; {77353#false} is VALID [2022-02-20 20:00:16,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 20:00:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {77398#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {77352#true} is VALID [2022-02-20 20:00:16,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {77352#true} assume !(1 == ~T1_E~0); {77352#true} is VALID [2022-02-20 20:00:16,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {77352#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {77352#true} is VALID [2022-02-20 20:00:16,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {77352#true} assume 1 == ~E_M~0;~E_M~0 := 2; {77352#true} is VALID [2022-02-20 20:00:16,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {77352#true} assume 1 == ~E_1~0;~E_1~0 := 2; {77352#true} is VALID [2022-02-20 20:00:16,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {77352#true} assume 1 == ~E_2~0;~E_2~0 := 2; {77352#true} is VALID [2022-02-20 20:00:16,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {77352#true} assume true; {77352#true} is VALID [2022-02-20 20:00:16,354 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77352#true} {77353#false} #888#return; {77353#false} is VALID [2022-02-20 20:00:16,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 20:00:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:16,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {77352#true} havoc ~__retres1~7; {77352#true} is VALID [2022-02-20 20:00:16,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {77352#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {77352#true} is VALID [2022-02-20 20:00:16,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {77352#true} #res := ~__retres1~7; {77352#true} is VALID [2022-02-20 20:00:16,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {77352#true} assume true; {77352#true} is VALID [2022-02-20 20:00:16,358 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {77352#true} {77353#false} #890#return; {77353#false} is VALID [2022-02-20 20:00:16,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {77352#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {77354#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:16,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {77354#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {77354#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:16,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {77354#(= ~m_pc~0 ~t1_pc~0)} assume !(0 != main_#t~nondet32#1);havoc main_#t~nondet32#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~8#1;havoc main2_~__retres1~8#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {77354#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:16,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {77354#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret30#1, start_simulation2_#t~ret31#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; {77354#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:16,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {77354#(= ~m_pc~0 ~t1_pc~0)} call update_channels2(); {77352#true} is VALID [2022-02-20 20:00:16,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {77352#true} assume true; {77352#true} is VALID [2022-02-20 20:00:16,360 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {77352#true} {77354#(= ~m_pc~0 ~t1_pc~0)} #882#return; {77354#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:16,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {77354#(= ~m_pc~0 ~t1_pc~0)} assume { :begin_inline_init_threads2 } true; {77354#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:16,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {77354#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {77354#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:16,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {77354#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {77354#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:16,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {77354#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {77354#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:16,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {77354#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_init_threads2 } true; {77354#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:16,363 INFO L272 TraceCheckUtils]: 12: Hoare triple {77354#(= ~m_pc~0 ~t1_pc~0)} call fire_delta_events2(); {77398#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 20:00:16,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {77398#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {77352#true} is VALID [2022-02-20 20:00:16,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {77352#true} assume !(0 == ~T1_E~0); {77352#true} is VALID [2022-02-20 20:00:16,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {77352#true} assume !(0 == ~T2_E~0); {77352#true} is VALID [2022-02-20 20:00:16,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {77352#true} assume !(0 == ~E_M~0); {77352#true} is VALID [2022-02-20 20:00:16,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {77352#true} assume !(0 == ~E_1~0); {77352#true} is VALID [2022-02-20 20:00:16,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {77352#true} assume !(0 == ~E_2~0); {77352#true} is VALID [2022-02-20 20:00:16,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {77352#true} assume true; {77352#true} is VALID [2022-02-20 20:00:16,364 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {77352#true} {77354#(= ~m_pc~0 ~t1_pc~0)} #884#return; {77354#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 20:00:16,365 INFO L272 TraceCheckUtils]: 21: Hoare triple {77354#(= ~m_pc~0 ~t1_pc~0)} call activate_threads2(); {77399#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 20:00:16,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {77399#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#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; {77352#true} is VALID [2022-02-20 20:00:16,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {77352#true} assume !(1 == ~m_pc~0); {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:16,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_~__retres1~4#1 := 0; {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:16,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:16,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret26#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp~6#1 := #t~ret26#1;havoc #t~ret26#1; {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:16,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp~6#1); {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:16,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} 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; {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 20:00:16,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {77400#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume 1 == ~t1_pc~0; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} #t~ret27#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___0~4#1 := #t~ret27#1;havoc #t~ret27#1; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} 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; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume !(1 == ~t2_pc~0); {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is_transmit2_triggered_~__retres1~6#1 := 0; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} #t~ret28#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___1~1#1 := #t~ret28#1;havoc #t~ret28#1; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume true; {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 20:00:16,375 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {77401#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} {77354#(= ~m_pc~0 ~t1_pc~0)} #886#return; {77353#false} is VALID [2022-02-20 20:00:16,375 INFO L272 TraceCheckUtils]: 42: Hoare triple {77353#false} call reset_delta_events2(); {77398#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 20:00:16,375 INFO L290 TraceCheckUtils]: 43: Hoare triple {77398#(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) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {77352#true} is VALID [2022-02-20 20:00:16,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {77352#true} assume !(1 == ~T1_E~0); {77352#true} is VALID [2022-02-20 20:00:16,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {77352#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {77352#true} is VALID [2022-02-20 20:00:16,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {77352#true} assume 1 == ~E_M~0;~E_M~0 := 2; {77352#true} is VALID [2022-02-20 20:00:16,375 INFO L290 TraceCheckUtils]: 47: Hoare triple {77352#true} assume 1 == ~E_1~0;~E_1~0 := 2; {77352#true} is VALID [2022-02-20 20:00:16,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {77352#true} assume 1 == ~E_2~0;~E_2~0 := 2; {77352#true} is VALID [2022-02-20 20:00:16,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {77352#true} assume true; {77352#true} is VALID [2022-02-20 20:00:16,376 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {77352#true} {77353#false} #888#return; {77353#false} is VALID [2022-02-20 20:00:16,376 INFO L290 TraceCheckUtils]: 51: Hoare triple {77353#false} assume !false; {77353#false} is VALID [2022-02-20 20:00:16,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {77353#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {77353#false} is VALID [2022-02-20 20:00:16,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {77353#false} assume !false; {77353#false} is VALID [2022-02-20 20:00:16,376 INFO L272 TraceCheckUtils]: 54: Hoare triple {77353#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {77352#true} is VALID [2022-02-20 20:00:16,376 INFO L290 TraceCheckUtils]: 55: Hoare triple {77352#true} havoc ~__retres1~7; {77352#true} is VALID [2022-02-20 20:00:16,377 INFO L290 TraceCheckUtils]: 56: Hoare triple {77352#true} assume 0 == ~m_st~0;~__retres1~7 := 1; {77352#true} is VALID [2022-02-20 20:00:16,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {77352#true} #res := ~__retres1~7; {77352#true} is VALID [2022-02-20 20:00:16,377 INFO L290 TraceCheckUtils]: 58: Hoare triple {77352#true} assume true; {77352#true} is VALID [2022-02-20 20:00:16,377 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {77352#true} {77353#false} #890#return; {77353#false} is VALID [2022-02-20 20:00:16,377 INFO L290 TraceCheckUtils]: 60: Hoare triple {77353#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {77353#false} is VALID [2022-02-20 20:00:16,377 INFO L290 TraceCheckUtils]: 61: Hoare triple {77353#false} assume 0 != eval2_~tmp~5#1; {77353#false} is VALID [2022-02-20 20:00:16,378 INFO L290 TraceCheckUtils]: 62: Hoare triple {77353#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {77353#false} is VALID [2022-02-20 20:00:16,378 INFO L290 TraceCheckUtils]: 63: Hoare triple {77353#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {77353#false} is VALID [2022-02-20 20:00:16,378 INFO L290 TraceCheckUtils]: 64: Hoare triple {77353#false} assume !(0 == ~m_pc~0); {77353#false} is VALID [2022-02-20 20:00:16,378 INFO L290 TraceCheckUtils]: 65: Hoare triple {77353#false} assume 1 == ~m_pc~0; {77353#false} is VALID [2022-02-20 20:00:16,378 INFO L290 TraceCheckUtils]: 66: Hoare triple {77353#false} assume ~token~0 != 2 + ~local~0; {77353#false} is VALID [2022-02-20 20:00:16,378 INFO L272 TraceCheckUtils]: 67: Hoare triple {77353#false} call error2(); {77353#false} is VALID [2022-02-20 20:00:16,378 INFO L290 TraceCheckUtils]: 68: Hoare triple {77353#false} assume !false; {77353#false} is VALID [2022-02-20 20:00:16,379 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,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:16,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434478162] [2022-02-20 20:00:16,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434478162] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:16,379 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:16,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:16,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358273815] [2022-02-20 20:00:16,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:16,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 20:00:16,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:16,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:16,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:16,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:16,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:16,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:16,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:16,433 INFO L87 Difference]: Start difference. First operand 2051 states and 2812 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)