./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bad4bd14ff0d6303c86b61698001b4d4d1f47b3200dad5c7d05f11b8899f8627 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:28,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:28,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:28,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:28,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:28,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:28,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:28,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:28,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:28,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:28,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:28,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:28,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:28,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:28,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:28,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:28,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:28,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:28,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:28,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:28,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:28,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:28,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:28,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:28,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:28,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:28,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:28,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:28,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:28,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:28,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:28,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:28,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:28,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:28,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:28,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:28,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:28,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:28,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:28,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:28,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:28,556 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:28,596 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:28,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:28,597 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:28,597 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:28,598 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:28,598 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:28,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:28,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:28,599 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:28,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:28,600 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:28,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:28,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:28,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:28,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:28,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:28,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:28,601 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:28,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:28,602 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:28,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:28,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:28,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:28,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:28,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:28,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:28,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:28,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:28,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:28,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:28,605 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:28,605 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:28,605 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:28,605 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 -> bad4bd14ff0d6303c86b61698001b4d4d1f47b3200dad5c7d05f11b8899f8627 [2022-02-20 19:59:28,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:28,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:28,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:28,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:28,831 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:28,832 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.03.cil-1.c [2022-02-20 19:59:28,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a62e5f4/7f461235fc57491cacc305966ef244d1/FLAG9ebcc6447 [2022-02-20 19:59:29,252 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:29,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c [2022-02-20 19:59:29,273 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a62e5f4/7f461235fc57491cacc305966ef244d1/FLAG9ebcc6447 [2022-02-20 19:59:29,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a62e5f4/7f461235fc57491cacc305966ef244d1 [2022-02-20 19:59:29,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:29,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:29,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:29,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:29,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:29,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:29" (1/1) ... [2022-02-20 19:59:29,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5504be72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:29, skipping insertion in model container [2022-02-20 19:59:29,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:29" (1/1) ... [2022-02-20 19:59:29,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:29,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:29,857 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.03.cil-1.c[911,924] [2022-02-20 19:59:29,928 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.03.cil-1.c[8416,8429] [2022-02-20 19:59:29,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:29,985 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:29,993 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.03.cil-1.c[911,924] [2022-02-20 19:59:30,030 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.03.cil-1.c[8416,8429] [2022-02-20 19:59:30,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:30,064 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:30,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:30 WrapperNode [2022-02-20 19:59:30,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:30,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:30,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:30,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:30,072 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:30" (1/1) ... [2022-02-20 19:59:30,091 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:30" (1/1) ... [2022-02-20 19:59:30,127 INFO L137 Inliner]: procedures = 61, calls = 71, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 561 [2022-02-20 19:59:30,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:30,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:30,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:30,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:30,136 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:30" (1/1) ... [2022-02-20 19:59:30,136 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:30" (1/1) ... [2022-02-20 19:59:30,142 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:30" (1/1) ... [2022-02-20 19:59:30,143 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:30" (1/1) ... [2022-02-20 19:59:30,155 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:30" (1/1) ... [2022-02-20 19:59:30,164 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:30" (1/1) ... [2022-02-20 19:59:30,174 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:30" (1/1) ... [2022-02-20 19:59:30,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:30,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:30,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:30,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:30,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:30" (1/1) ... [2022-02-20 19:59:30,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:30,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:30,202 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:30,218 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:30,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:30,247 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:30,247 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:30,247 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:30,247 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:30,247 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:30,247 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:30,247 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:30,247 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:30,247 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:30,247 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:30,248 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:30,248 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:30,248 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:30,248 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:30,248 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:30,248 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:30,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:30,248 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:30,249 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:30,249 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:30,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:30,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:30,249 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:30,249 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:30,249 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:59:30,249 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:59:30,375 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:30,376 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:30,870 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 19:59:30,873 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:30,908 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:30,915 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:30,915 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 19:59:30,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:30 BoogieIcfgContainer [2022-02-20 19:59:30,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:30,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:30,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:30,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:30,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:29" (1/3) ... [2022-02-20 19:59:30,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcf705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:30, skipping insertion in model container [2022-02-20 19:59:30,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:30" (2/3) ... [2022-02-20 19:59:30,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcf705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:30, skipping insertion in model container [2022-02-20 19:59:30,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:30" (3/3) ... [2022-02-20 19:59:30,931 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.03.cil-1.c [2022-02-20 19:59:30,934 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:30,934 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:30,981 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:30,986 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:30,986 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 282 states, 229 states have (on average 1.5807860262008733) internal successors, (362), 237 states have internal predecessors, (362), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 19:59:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:31,017 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:31,017 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:31,018 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:31,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:31,021 INFO L85 PathProgramCache]: Analyzing trace with hash 806435038, now seen corresponding path program 1 times [2022-02-20 19:59:31,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:31,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003719830] [2022-02-20 19:59:31,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:31,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {325#(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); {326#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:31,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {326#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:31,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {326#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {287#(= ~q_read_ev~0 2)} #966#return; {287#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:31,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#(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; {328#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:31,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {328#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:31,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {328#(= |old(~q_read_ev~0)| 0)} assume true; {328#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:31,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {328#(= |old(~q_read_ev~0)| 0)} {287#(= ~q_read_ev~0 2)} #968#return; {286#false} is VALID [2022-02-20 19:59:31,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {285#true} havoc ~__retres1~0; {285#true} is VALID [2022-02-20 19:59:31,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#true} assume 1 == ~p_dw_pc~0; {285#true} is VALID [2022-02-20 19:59:31,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {285#true} is VALID [2022-02-20 19:59:31,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {285#true} #res := ~__retres1~0; {285#true} is VALID [2022-02-20 19:59:31,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {285#true} assume true; {285#true} is VALID [2022-02-20 19:59:31,284 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {285#true} {285#true} #962#return; {285#true} is VALID [2022-02-20 19:59:31,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {285#true} havoc ~__retres1~1; {285#true} is VALID [2022-02-20 19:59:31,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#true} assume 1 == ~c_dr_pc~0; {285#true} is VALID [2022-02-20 19:59:31,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {285#true} is VALID [2022-02-20 19:59:31,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {285#true} #res := ~__retres1~1; {285#true} is VALID [2022-02-20 19:59:31,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {285#true} assume true; {285#true} is VALID [2022-02-20 19:59:31,291 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {285#true} {285#true} #964#return; {285#true} is VALID [2022-02-20 19:59:31,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {329#(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; {285#true} is VALID [2022-02-20 19:59:31,291 INFO L272 TraceCheckUtils]: 1: Hoare triple {285#true} call #t~ret8 := is_do_write_p_triggered(); {285#true} is VALID [2022-02-20 19:59:31,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} havoc ~__retres1~0; {285#true} is VALID [2022-02-20 19:59:31,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {285#true} assume 1 == ~p_dw_pc~0; {285#true} is VALID [2022-02-20 19:59:31,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {285#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {285#true} is VALID [2022-02-20 19:59:31,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#true} #res := ~__retres1~0; {285#true} is VALID [2022-02-20 19:59:31,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {285#true} assume true; {285#true} is VALID [2022-02-20 19:59:31,293 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {285#true} {285#true} #962#return; {285#true} is VALID [2022-02-20 19:59:31,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {285#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {285#true} is VALID [2022-02-20 19:59:31,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {285#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {285#true} is VALID [2022-02-20 19:59:31,293 INFO L272 TraceCheckUtils]: 10: Hoare triple {285#true} call #t~ret9 := is_do_read_c_triggered(); {285#true} is VALID [2022-02-20 19:59:31,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {285#true} havoc ~__retres1~1; {285#true} is VALID [2022-02-20 19:59:31,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {285#true} assume 1 == ~c_dr_pc~0; {285#true} is VALID [2022-02-20 19:59:31,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {285#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {285#true} is VALID [2022-02-20 19:59:31,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {285#true} #res := ~__retres1~1; {285#true} is VALID [2022-02-20 19:59:31,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {285#true} assume true; {285#true} is VALID [2022-02-20 19:59:31,295 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {285#true} {285#true} #964#return; {285#true} is VALID [2022-02-20 19:59:31,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {285#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {285#true} is VALID [2022-02-20 19:59:31,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {285#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {285#true} is VALID [2022-02-20 19:59:31,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {285#true} assume true; {285#true} is VALID [2022-02-20 19:59:31,296 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {285#true} {286#false} #970#return; {286#false} is VALID [2022-02-20 19:59:31,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#(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; {285#true} is VALID [2022-02-20 19:59:31,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {285#true} is VALID [2022-02-20 19:59:31,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2022-02-20 19:59:31,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {285#true} {286#false} #972#return; {286#false} is VALID [2022-02-20 19:59:31,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {285#true} havoc ~__retres1~2; {285#true} is VALID [2022-02-20 19:59:31,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {285#true} is VALID [2022-02-20 19:59:31,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} #res := ~__retres1~2; {285#true} is VALID [2022-02-20 19:59:31,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {285#true} assume true; {285#true} is VALID [2022-02-20 19:59:31,308 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {285#true} {286#false} #974#return; {286#false} is VALID [2022-02-20 19:59:31,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {285#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {285#true} is VALID [2022-02-20 19:59:31,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {285#true} is VALID [2022-02-20 19:59:31,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {287#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:31,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {287#(= ~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; {287#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:31,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {287#(= ~q_read_ev~0 2)} call update_channels1(); {325#(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:31,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#(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); {326#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:31,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {326#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {326#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:31,312 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {326#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {287#(= ~q_read_ev~0 2)} #966#return; {287#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:31,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {287#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {287#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:31,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {287#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {287#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:31,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {287#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {287#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:31,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {287#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {287#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:31,315 INFO L272 TraceCheckUtils]: 12: Hoare triple {287#(= ~q_read_ev~0 2)} call fire_delta_events1(); {327#(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:31,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#(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; {328#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:31,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {328#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:31,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {328#(= |old(~q_read_ev~0)| 0)} assume true; {328#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:31,316 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {328#(= |old(~q_read_ev~0)| 0)} {287#(= ~q_read_ev~0 2)} #968#return; {286#false} is VALID [2022-02-20 19:59:31,316 INFO L272 TraceCheckUtils]: 17: Hoare triple {286#false} call activate_threads1(); {329#(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:31,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {329#(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; {285#true} is VALID [2022-02-20 19:59:31,317 INFO L272 TraceCheckUtils]: 19: Hoare triple {285#true} call #t~ret8 := is_do_write_p_triggered(); {285#true} is VALID [2022-02-20 19:59:31,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {285#true} havoc ~__retres1~0; {285#true} is VALID [2022-02-20 19:59:31,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {285#true} assume 1 == ~p_dw_pc~0; {285#true} is VALID [2022-02-20 19:59:31,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {285#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {285#true} is VALID [2022-02-20 19:59:31,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {285#true} #res := ~__retres1~0; {285#true} is VALID [2022-02-20 19:59:31,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {285#true} assume true; {285#true} is VALID [2022-02-20 19:59:31,318 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {285#true} {285#true} #962#return; {285#true} is VALID [2022-02-20 19:59:31,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {285#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {285#true} is VALID [2022-02-20 19:59:31,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {285#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {285#true} is VALID [2022-02-20 19:59:31,318 INFO L272 TraceCheckUtils]: 28: Hoare triple {285#true} call #t~ret9 := is_do_read_c_triggered(); {285#true} is VALID [2022-02-20 19:59:31,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {285#true} havoc ~__retres1~1; {285#true} is VALID [2022-02-20 19:59:31,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {285#true} assume 1 == ~c_dr_pc~0; {285#true} is VALID [2022-02-20 19:59:31,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {285#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {285#true} is VALID [2022-02-20 19:59:31,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {285#true} #res := ~__retres1~1; {285#true} is VALID [2022-02-20 19:59:31,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {285#true} assume true; {285#true} is VALID [2022-02-20 19:59:31,320 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {285#true} {285#true} #964#return; {285#true} is VALID [2022-02-20 19:59:31,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {285#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {285#true} is VALID [2022-02-20 19:59:31,320 INFO L290 TraceCheckUtils]: 36: Hoare triple {285#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {285#true} is VALID [2022-02-20 19:59:31,320 INFO L290 TraceCheckUtils]: 37: Hoare triple {285#true} assume true; {285#true} is VALID [2022-02-20 19:59:31,320 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {285#true} {286#false} #970#return; {286#false} is VALID [2022-02-20 19:59:31,337 INFO L272 TraceCheckUtils]: 39: Hoare triple {286#false} call reset_delta_events1(); {327#(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:31,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {327#(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; {285#true} is VALID [2022-02-20 19:59:31,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {285#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {285#true} is VALID [2022-02-20 19:59:31,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {285#true} assume true; {285#true} is VALID [2022-02-20 19:59:31,338 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {285#true} {286#false} #972#return; {286#false} is VALID [2022-02-20 19:59:31,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {286#false} assume !false; {286#false} is VALID [2022-02-20 19:59:31,339 INFO L290 TraceCheckUtils]: 45: Hoare triple {286#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; {286#false} is VALID [2022-02-20 19:59:31,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {286#false} assume !false; {286#false} is VALID [2022-02-20 19:59:31,339 INFO L272 TraceCheckUtils]: 47: Hoare triple {286#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {285#true} is VALID [2022-02-20 19:59:31,339 INFO L290 TraceCheckUtils]: 48: Hoare triple {285#true} havoc ~__retres1~2; {285#true} is VALID [2022-02-20 19:59:31,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {285#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {285#true} is VALID [2022-02-20 19:59:31,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {285#true} #res := ~__retres1~2; {285#true} is VALID [2022-02-20 19:59:31,340 INFO L290 TraceCheckUtils]: 51: Hoare triple {285#true} assume true; {285#true} is VALID [2022-02-20 19:59:31,340 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {285#true} {286#false} #974#return; {286#false} is VALID [2022-02-20 19:59:31,340 INFO L290 TraceCheckUtils]: 53: Hoare triple {286#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; {286#false} is VALID [2022-02-20 19:59:31,341 INFO L290 TraceCheckUtils]: 54: Hoare triple {286#false} assume 0 != eval1_~tmp___1~0#1; {286#false} is VALID [2022-02-20 19:59:31,341 INFO L290 TraceCheckUtils]: 55: Hoare triple {286#false} assume !(0 == ~p_dw_st~0); {286#false} is VALID [2022-02-20 19:59:31,341 INFO L290 TraceCheckUtils]: 56: Hoare triple {286#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; {286#false} is VALID [2022-02-20 19:59:31,341 INFO L290 TraceCheckUtils]: 57: Hoare triple {286#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; {286#false} is VALID [2022-02-20 19:59:31,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {286#false} assume !(0 == ~c_dr_pc~0); {286#false} is VALID [2022-02-20 19:59:31,342 INFO L290 TraceCheckUtils]: 59: Hoare triple {286#false} assume 2 == ~c_dr_pc~0; {286#false} is VALID [2022-02-20 19:59:31,342 INFO L290 TraceCheckUtils]: 60: Hoare triple {286#false} do_read_c_~a~0#1 := ~a_t~0; {286#false} is VALID [2022-02-20 19:59:31,342 INFO L290 TraceCheckUtils]: 61: Hoare triple {286#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; {286#false} is VALID [2022-02-20 19:59:31,342 INFO L290 TraceCheckUtils]: 62: Hoare triple {286#false} assume !(~p_last_write~0 == ~c_last_read~0); {286#false} is VALID [2022-02-20 19:59:31,343 INFO L272 TraceCheckUtils]: 63: Hoare triple {286#false} call error1(); {286#false} is VALID [2022-02-20 19:59:31,343 INFO L290 TraceCheckUtils]: 64: Hoare triple {286#false} assume !false; {286#false} is VALID [2022-02-20 19:59:31,344 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:31,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:31,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003719830] [2022-02-20 19:59:31,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003719830] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:31,345 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:31,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:31,346 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940587424] [2022-02-20 19:59:31,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:31,350 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:31,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:31,354 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:31,408 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:31,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:31,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:31,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:31,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:31,425 INFO L87 Difference]: Start difference. First operand has 282 states, 229 states have (on average 1.5807860262008733) internal successors, (362), 237 states have internal predecessors, (362), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:33,802 INFO L93 Difference]: Finished difference Result 695 states and 1069 transitions. [2022-02-20 19:59:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:33,802 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:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:33,804 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:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1069 transitions. [2022-02-20 19:59:33,822 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:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1069 transitions. [2022-02-20 19:59:33,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1069 transitions. [2022-02-20 19:59:34,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1069 edges. 1069 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:34,544 INFO L225 Difference]: With dead ends: 695 [2022-02-20 19:59:34,544 INFO L226 Difference]: Without dead ends: 422 [2022-02-20 19:59:34,547 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:34,550 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 731 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:34,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [738 Valid, 1188 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:59:34,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-02-20 19:59:34,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 383. [2022-02-20 19:59:34,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:34,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 422 states. Second operand has 383 states, 311 states have (on average 1.4694533762057878) internal successors, (457), 318 states have internal predecessors, (457), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:59:34,596 INFO L74 IsIncluded]: Start isIncluded. First operand 422 states. Second operand has 383 states, 311 states have (on average 1.4694533762057878) internal successors, (457), 318 states have internal predecessors, (457), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:59:34,598 INFO L87 Difference]: Start difference. First operand 422 states. Second operand has 383 states, 311 states have (on average 1.4694533762057878) internal successors, (457), 318 states have internal predecessors, (457), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:59:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:34,617 INFO L93 Difference]: Finished difference Result 422 states and 610 transitions. [2022-02-20 19:59:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 610 transitions. [2022-02-20 19:59:34,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:34,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:34,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 383 states, 311 states have (on average 1.4694533762057878) internal successors, (457), 318 states have internal predecessors, (457), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) Second operand 422 states. [2022-02-20 19:59:34,623 INFO L87 Difference]: Start difference. First operand has 383 states, 311 states have (on average 1.4694533762057878) internal successors, (457), 318 states have internal predecessors, (457), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) Second operand 422 states. [2022-02-20 19:59:34,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:34,641 INFO L93 Difference]: Finished difference Result 422 states and 610 transitions. [2022-02-20 19:59:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 610 transitions. [2022-02-20 19:59:34,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:34,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:34,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:34,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 311 states have (on average 1.4694533762057878) internal successors, (457), 318 states have internal predecessors, (457), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:59:34,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 554 transitions. [2022-02-20 19:59:34,658 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 554 transitions. Word has length 65 [2022-02-20 19:59:34,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:34,659 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 554 transitions. [2022-02-20 19:59:34,659 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:34,660 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 554 transitions. [2022-02-20 19:59:34,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:34,661 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:34,661 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:34,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:59:34,661 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:34,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:34,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1809643618, now seen corresponding path program 1 times [2022-02-20 19:59:34,662 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:34,662 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086126530] [2022-02-20 19:59:34,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:34,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:34,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:34,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {2714#(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); {2715#(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:34,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {2715#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2715#(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:34,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2715#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2676#(= ~q_write_ev~0 ~q_read_ev~0)} #966#return; {2676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:34,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:34,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {2715#(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); {2716#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:34,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {2716#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2717#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:34,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {2717#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2717#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:34,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2717#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2676#(= ~q_write_ev~0 ~q_read_ev~0)} #968#return; {2675#false} is VALID [2022-02-20 19:59:34,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:34,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:34,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {2674#true} havoc ~__retres1~0; {2674#true} is VALID [2022-02-20 19:59:34,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {2674#true} assume 1 == ~p_dw_pc~0; {2674#true} is VALID [2022-02-20 19:59:34,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {2674#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2674#true} is VALID [2022-02-20 19:59:34,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {2674#true} #res := ~__retres1~0; {2674#true} is VALID [2022-02-20 19:59:34,817 INFO L290 TraceCheckUtils]: 4: Hoare triple {2674#true} assume true; {2674#true} is VALID [2022-02-20 19:59:34,818 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2674#true} {2674#true} #962#return; {2674#true} is VALID [2022-02-20 19:59:34,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:34,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {2674#true} havoc ~__retres1~1; {2674#true} is VALID [2022-02-20 19:59:34,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {2674#true} assume 1 == ~c_dr_pc~0; {2674#true} is VALID [2022-02-20 19:59:34,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {2674#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2674#true} is VALID [2022-02-20 19:59:34,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {2674#true} #res := ~__retres1~1; {2674#true} is VALID [2022-02-20 19:59:34,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {2674#true} assume true; {2674#true} is VALID [2022-02-20 19:59:34,827 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2674#true} {2674#true} #964#return; {2674#true} is VALID [2022-02-20 19:59:34,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {2718#(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; {2674#true} is VALID [2022-02-20 19:59:34,829 INFO L272 TraceCheckUtils]: 1: Hoare triple {2674#true} call #t~ret8 := is_do_write_p_triggered(); {2674#true} is VALID [2022-02-20 19:59:34,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {2674#true} havoc ~__retres1~0; {2674#true} is VALID [2022-02-20 19:59:34,829 INFO L290 TraceCheckUtils]: 3: Hoare triple {2674#true} assume 1 == ~p_dw_pc~0; {2674#true} is VALID [2022-02-20 19:59:34,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {2674#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2674#true} is VALID [2022-02-20 19:59:34,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {2674#true} #res := ~__retres1~0; {2674#true} is VALID [2022-02-20 19:59:34,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {2674#true} assume true; {2674#true} is VALID [2022-02-20 19:59:34,830 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2674#true} {2674#true} #962#return; {2674#true} is VALID [2022-02-20 19:59:34,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {2674#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2674#true} is VALID [2022-02-20 19:59:34,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {2674#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2674#true} is VALID [2022-02-20 19:59:34,830 INFO L272 TraceCheckUtils]: 10: Hoare triple {2674#true} call #t~ret9 := is_do_read_c_triggered(); {2674#true} is VALID [2022-02-20 19:59:34,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {2674#true} havoc ~__retres1~1; {2674#true} is VALID [2022-02-20 19:59:34,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {2674#true} assume 1 == ~c_dr_pc~0; {2674#true} is VALID [2022-02-20 19:59:34,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {2674#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2674#true} is VALID [2022-02-20 19:59:34,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {2674#true} #res := ~__retres1~1; {2674#true} is VALID [2022-02-20 19:59:34,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {2674#true} assume true; {2674#true} is VALID [2022-02-20 19:59:34,834 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2674#true} {2674#true} #964#return; {2674#true} is VALID [2022-02-20 19:59:34,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {2674#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2674#true} is VALID [2022-02-20 19:59:34,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {2674#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2674#true} is VALID [2022-02-20 19:59:34,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {2674#true} assume true; {2674#true} is VALID [2022-02-20 19:59:34,836 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2674#true} {2675#false} #970#return; {2675#false} is VALID [2022-02-20 19:59:34,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:34,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {2715#(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); {2674#true} is VALID [2022-02-20 19:59:34,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {2674#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2674#true} is VALID [2022-02-20 19:59:34,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {2674#true} assume true; {2674#true} is VALID [2022-02-20 19:59:34,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2674#true} {2675#false} #972#return; {2675#false} is VALID [2022-02-20 19:59:34,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:34,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {2674#true} havoc ~__retres1~2; {2674#true} is VALID [2022-02-20 19:59:34,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {2674#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2674#true} is VALID [2022-02-20 19:59:34,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {2674#true} #res := ~__retres1~2; {2674#true} is VALID [2022-02-20 19:59:34,847 INFO L290 TraceCheckUtils]: 3: Hoare triple {2674#true} assume true; {2674#true} is VALID [2022-02-20 19:59:34,847 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2674#true} {2675#false} #974#return; {2675#false} is VALID [2022-02-20 19:59:34,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {2674#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {2674#true} is VALID [2022-02-20 19:59:34,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {2674#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {2674#true} is VALID [2022-02-20 19:59:34,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {2674#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {2676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:34,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {2676#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {2676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:34,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {2676#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {2714#(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:34,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {2714#(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); {2715#(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:34,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {2715#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2715#(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:34,851 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2715#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2676#(= ~q_write_ev~0 ~q_read_ev~0)} #966#return; {2676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:34,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {2676#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {2676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:34,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {2676#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:34,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {2676#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:34,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {2676#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {2676#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:34,853 INFO L272 TraceCheckUtils]: 12: Hoare triple {2676#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {2715#(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:34,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {2715#(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); {2716#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:34,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {2716#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2717#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:34,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {2717#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2717#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:34,855 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2717#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2676#(= ~q_write_ev~0 ~q_read_ev~0)} #968#return; {2675#false} is VALID [2022-02-20 19:59:34,855 INFO L272 TraceCheckUtils]: 17: Hoare triple {2675#false} call activate_threads1(); {2718#(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:34,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {2718#(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; {2674#true} is VALID [2022-02-20 19:59:34,855 INFO L272 TraceCheckUtils]: 19: Hoare triple {2674#true} call #t~ret8 := is_do_write_p_triggered(); {2674#true} is VALID [2022-02-20 19:59:34,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {2674#true} havoc ~__retres1~0; {2674#true} is VALID [2022-02-20 19:59:34,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {2674#true} assume 1 == ~p_dw_pc~0; {2674#true} is VALID [2022-02-20 19:59:34,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {2674#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2674#true} is VALID [2022-02-20 19:59:34,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {2674#true} #res := ~__retres1~0; {2674#true} is VALID [2022-02-20 19:59:34,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {2674#true} assume true; {2674#true} is VALID [2022-02-20 19:59:34,856 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2674#true} {2674#true} #962#return; {2674#true} is VALID [2022-02-20 19:59:34,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {2674#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2674#true} is VALID [2022-02-20 19:59:34,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {2674#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2674#true} is VALID [2022-02-20 19:59:34,857 INFO L272 TraceCheckUtils]: 28: Hoare triple {2674#true} call #t~ret9 := is_do_read_c_triggered(); {2674#true} is VALID [2022-02-20 19:59:34,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {2674#true} havoc ~__retres1~1; {2674#true} is VALID [2022-02-20 19:59:34,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {2674#true} assume 1 == ~c_dr_pc~0; {2674#true} is VALID [2022-02-20 19:59:34,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {2674#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2674#true} is VALID [2022-02-20 19:59:34,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {2674#true} #res := ~__retres1~1; {2674#true} is VALID [2022-02-20 19:59:34,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {2674#true} assume true; {2674#true} is VALID [2022-02-20 19:59:34,858 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2674#true} {2674#true} #964#return; {2674#true} is VALID [2022-02-20 19:59:34,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {2674#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2674#true} is VALID [2022-02-20 19:59:34,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {2674#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2674#true} is VALID [2022-02-20 19:59:34,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {2674#true} assume true; {2674#true} is VALID [2022-02-20 19:59:34,858 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2674#true} {2675#false} #970#return; {2675#false} is VALID [2022-02-20 19:59:34,859 INFO L272 TraceCheckUtils]: 39: Hoare triple {2675#false} call reset_delta_events1(); {2715#(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:34,859 INFO L290 TraceCheckUtils]: 40: Hoare triple {2715#(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); {2674#true} is VALID [2022-02-20 19:59:34,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {2674#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2674#true} is VALID [2022-02-20 19:59:34,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {2674#true} assume true; {2674#true} is VALID [2022-02-20 19:59:34,859 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2674#true} {2675#false} #972#return; {2675#false} is VALID [2022-02-20 19:59:34,860 INFO L290 TraceCheckUtils]: 44: Hoare triple {2675#false} assume !false; {2675#false} is VALID [2022-02-20 19:59:34,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {2675#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; {2675#false} is VALID [2022-02-20 19:59:34,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {2675#false} assume !false; {2675#false} is VALID [2022-02-20 19:59:34,860 INFO L272 TraceCheckUtils]: 47: Hoare triple {2675#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2674#true} is VALID [2022-02-20 19:59:34,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {2674#true} havoc ~__retres1~2; {2674#true} is VALID [2022-02-20 19:59:34,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {2674#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2674#true} is VALID [2022-02-20 19:59:34,861 INFO L290 TraceCheckUtils]: 50: Hoare triple {2674#true} #res := ~__retres1~2; {2674#true} is VALID [2022-02-20 19:59:34,861 INFO L290 TraceCheckUtils]: 51: Hoare triple {2674#true} assume true; {2674#true} is VALID [2022-02-20 19:59:34,861 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2674#true} {2675#false} #974#return; {2675#false} is VALID [2022-02-20 19:59:34,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {2675#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; {2675#false} is VALID [2022-02-20 19:59:34,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {2675#false} assume 0 != eval1_~tmp___1~0#1; {2675#false} is VALID [2022-02-20 19:59:34,861 INFO L290 TraceCheckUtils]: 55: Hoare triple {2675#false} assume !(0 == ~p_dw_st~0); {2675#false} is VALID [2022-02-20 19:59:34,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {2675#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; {2675#false} is VALID [2022-02-20 19:59:34,862 INFO L290 TraceCheckUtils]: 57: Hoare triple {2675#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; {2675#false} is VALID [2022-02-20 19:59:34,862 INFO L290 TraceCheckUtils]: 58: Hoare triple {2675#false} assume !(0 == ~c_dr_pc~0); {2675#false} is VALID [2022-02-20 19:59:34,862 INFO L290 TraceCheckUtils]: 59: Hoare triple {2675#false} assume 2 == ~c_dr_pc~0; {2675#false} is VALID [2022-02-20 19:59:34,862 INFO L290 TraceCheckUtils]: 60: Hoare triple {2675#false} do_read_c_~a~0#1 := ~a_t~0; {2675#false} is VALID [2022-02-20 19:59:34,862 INFO L290 TraceCheckUtils]: 61: Hoare triple {2675#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; {2675#false} is VALID [2022-02-20 19:59:34,863 INFO L290 TraceCheckUtils]: 62: Hoare triple {2675#false} assume !(~p_last_write~0 == ~c_last_read~0); {2675#false} is VALID [2022-02-20 19:59:34,863 INFO L272 TraceCheckUtils]: 63: Hoare triple {2675#false} call error1(); {2675#false} is VALID [2022-02-20 19:59:34,863 INFO L290 TraceCheckUtils]: 64: Hoare triple {2675#false} assume !false; {2675#false} is VALID [2022-02-20 19:59:34,863 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:34,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:34,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086126530] [2022-02-20 19:59:34,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086126530] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:34,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:34,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:34,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956325025] [2022-02-20 19:59:34,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:34,866 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:59:34,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:34,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:34,920 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:34,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:34,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:34,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:34,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:34,921 INFO L87 Difference]: Start difference. First operand 383 states and 554 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:39,148 INFO L93 Difference]: Finished difference Result 780 states and 1120 transitions. [2022-02-20 19:59:39,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:39,148 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:59:39,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 796 transitions. [2022-02-20 19:59:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 796 transitions. [2022-02-20 19:59:39,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 796 transitions. [2022-02-20 19:59:39,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 796 edges. 796 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:39,885 INFO L225 Difference]: With dead ends: 780 [2022-02-20 19:59:39,886 INFO L226 Difference]: Without dead ends: 571 [2022-02-20 19:59:39,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:39,888 INFO L933 BasicCegarLoop]: 488 mSDtfsCounter, 754 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:39,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [779 Valid, 1744 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 19:59:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-02-20 19:59:39,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 495. [2022-02-20 19:59:39,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:39,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 571 states. Second operand has 495 states, 401 states have (on average 1.453865336658354) internal successors, (583), 410 states have internal predecessors, (583), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:59:39,947 INFO L74 IsIncluded]: Start isIncluded. First operand 571 states. Second operand has 495 states, 401 states have (on average 1.453865336658354) internal successors, (583), 410 states have internal predecessors, (583), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:59:39,949 INFO L87 Difference]: Start difference. First operand 571 states. Second operand has 495 states, 401 states have (on average 1.453865336658354) internal successors, (583), 410 states have internal predecessors, (583), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:59:39,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:40,004 INFO L93 Difference]: Finished difference Result 571 states and 828 transitions. [2022-02-20 19:59:40,004 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 828 transitions. [2022-02-20 19:59:40,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:40,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:40,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 401 states have (on average 1.453865336658354) internal successors, (583), 410 states have internal predecessors, (583), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) Second operand 571 states. [2022-02-20 19:59:40,010 INFO L87 Difference]: Start difference. First operand has 495 states, 401 states have (on average 1.453865336658354) internal successors, (583), 410 states have internal predecessors, (583), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) Second operand 571 states. [2022-02-20 19:59:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:40,028 INFO L93 Difference]: Finished difference Result 571 states and 828 transitions. [2022-02-20 19:59:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 828 transitions. [2022-02-20 19:59:40,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:40,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:40,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:40,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 401 states have (on average 1.453865336658354) internal successors, (583), 410 states have internal predecessors, (583), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:59:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 714 transitions. [2022-02-20 19:59:40,045 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 714 transitions. Word has length 65 [2022-02-20 19:59:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:40,046 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 714 transitions. [2022-02-20 19:59:40,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:40,047 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 714 transitions. [2022-02-20 19:59:40,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:40,048 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:40,048 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:40,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:59:40,048 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:40,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:40,049 INFO L85 PathProgramCache]: Analyzing trace with hash 456737568, now seen corresponding path program 1 times [2022-02-20 19:59:40,049 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:40,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783566372] [2022-02-20 19:59:40,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:40,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {5669#(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); {5670#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:40,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {5670#(not (= |old(~q_req_up~0)| 1))} assume true; {5670#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:40,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5670#(not (= |old(~q_req_up~0)| 1))} {5630#(= ~q_req_up~0 ~p_dw_pc~0)} #966#return; {5634#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:40,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {5671#(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); {5627#true} is VALID [2022-02-20 19:59:40,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {5627#true} assume !(0 == ~q_write_ev~0); {5627#true} is VALID [2022-02-20 19:59:40,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {5627#true} assume true; {5627#true} is VALID [2022-02-20 19:59:40,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5627#true} {5634#(not (= ~p_dw_pc~0 1))} #968#return; {5634#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:40,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {5627#true} havoc ~__retres1~0; {5627#true} is VALID [2022-02-20 19:59:40,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {5627#true} assume 1 == ~p_dw_pc~0; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,201 INFO L290 TraceCheckUtils]: 4: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,202 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} {5627#true} #962#return; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {5627#true} havoc ~__retres1~1; {5627#true} is VALID [2022-02-20 19:59:40,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {5627#true} assume 1 == ~c_dr_pc~0; {5627#true} is VALID [2022-02-20 19:59:40,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {5627#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5627#true} is VALID [2022-02-20 19:59:40,208 INFO L290 TraceCheckUtils]: 3: Hoare triple {5627#true} #res := ~__retres1~1; {5627#true} is VALID [2022-02-20 19:59:40,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {5627#true} assume true; {5627#true} is VALID [2022-02-20 19:59:40,209 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5627#true} {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} #964#return; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {5672#(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; {5627#true} is VALID [2022-02-20 19:59:40,209 INFO L272 TraceCheckUtils]: 1: Hoare triple {5627#true} call #t~ret8 := is_do_write_p_triggered(); {5627#true} is VALID [2022-02-20 19:59:40,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {5627#true} havoc ~__retres1~0; {5627#true} is VALID [2022-02-20 19:59:40,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {5627#true} assume 1 == ~p_dw_pc~0; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,211 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} {5627#true} #962#return; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,212 INFO L272 TraceCheckUtils]: 10: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {5627#true} is VALID [2022-02-20 19:59:40,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {5627#true} havoc ~__retres1~1; {5627#true} is VALID [2022-02-20 19:59:40,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {5627#true} assume 1 == ~c_dr_pc~0; {5627#true} is VALID [2022-02-20 19:59:40,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {5627#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5627#true} is VALID [2022-02-20 19:59:40,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {5627#true} #res := ~__retres1~1; {5627#true} is VALID [2022-02-20 19:59:40,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {5627#true} assume true; {5627#true} is VALID [2022-02-20 19:59:40,214 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5627#true} {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} #964#return; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,215 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} {5634#(not (= ~p_dw_pc~0 1))} #970#return; {5628#false} is VALID [2022-02-20 19:59:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {5671#(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); {5627#true} is VALID [2022-02-20 19:59:40,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {5627#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5627#true} is VALID [2022-02-20 19:59:40,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {5627#true} assume true; {5627#true} is VALID [2022-02-20 19:59:40,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5627#true} {5628#false} #972#return; {5628#false} is VALID [2022-02-20 19:59:40,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {5627#true} havoc ~__retres1~2; {5627#true} is VALID [2022-02-20 19:59:40,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {5627#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5627#true} is VALID [2022-02-20 19:59:40,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {5627#true} #res := ~__retres1~2; {5627#true} is VALID [2022-02-20 19:59:40,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {5627#true} assume true; {5627#true} is VALID [2022-02-20 19:59:40,223 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5627#true} {5628#false} #974#return; {5628#false} is VALID [2022-02-20 19:59:40,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {5627#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {5629#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:40,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {5629#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {5629#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:40,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {5629#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {5630#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:40,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {5630#(= ~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; {5630#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:40,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {5630#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {5669#(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:40,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {5669#(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); {5670#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:40,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {5670#(not (= |old(~q_req_up~0)| 1))} assume true; {5670#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:40,229 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5670#(not (= |old(~q_req_up~0)| 1))} {5630#(= ~q_req_up~0 ~p_dw_pc~0)} #966#return; {5634#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:40,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {5634#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {5634#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:40,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {5634#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5634#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:40,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {5634#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5634#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:40,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {5634#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {5634#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:40,231 INFO L272 TraceCheckUtils]: 12: Hoare triple {5634#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {5671#(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:40,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {5671#(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); {5627#true} is VALID [2022-02-20 19:59:40,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {5627#true} assume !(0 == ~q_write_ev~0); {5627#true} is VALID [2022-02-20 19:59:40,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {5627#true} assume true; {5627#true} is VALID [2022-02-20 19:59:40,232 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5627#true} {5634#(not (= ~p_dw_pc~0 1))} #968#return; {5634#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:40,232 INFO L272 TraceCheckUtils]: 17: Hoare triple {5634#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {5672#(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:40,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {5672#(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; {5627#true} is VALID [2022-02-20 19:59:40,232 INFO L272 TraceCheckUtils]: 19: Hoare triple {5627#true} call #t~ret8 := is_do_write_p_triggered(); {5627#true} is VALID [2022-02-20 19:59:40,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {5627#true} havoc ~__retres1~0; {5627#true} is VALID [2022-02-20 19:59:40,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {5627#true} assume 1 == ~p_dw_pc~0; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,234 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} {5627#true} #962#return; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,235 INFO L272 TraceCheckUtils]: 28: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {5627#true} is VALID [2022-02-20 19:59:40,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {5627#true} havoc ~__retres1~1; {5627#true} is VALID [2022-02-20 19:59:40,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {5627#true} assume 1 == ~c_dr_pc~0; {5627#true} is VALID [2022-02-20 19:59:40,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {5627#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {5627#true} is VALID [2022-02-20 19:59:40,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {5627#true} #res := ~__retres1~1; {5627#true} is VALID [2022-02-20 19:59:40,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {5627#true} assume true; {5627#true} is VALID [2022-02-20 19:59:40,236 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5627#true} {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} #964#return; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:40,238 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5679#(= (+ (- 1) ~p_dw_pc~0) 0)} {5634#(not (= ~p_dw_pc~0 1))} #970#return; {5628#false} is VALID [2022-02-20 19:59:40,238 INFO L272 TraceCheckUtils]: 39: Hoare triple {5628#false} call reset_delta_events1(); {5671#(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:40,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {5671#(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); {5627#true} is VALID [2022-02-20 19:59:40,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {5627#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5627#true} is VALID [2022-02-20 19:59:40,238 INFO L290 TraceCheckUtils]: 42: Hoare triple {5627#true} assume true; {5627#true} is VALID [2022-02-20 19:59:40,239 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5627#true} {5628#false} #972#return; {5628#false} is VALID [2022-02-20 19:59:40,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {5628#false} assume !false; {5628#false} is VALID [2022-02-20 19:59:40,239 INFO L290 TraceCheckUtils]: 45: Hoare triple {5628#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; {5628#false} is VALID [2022-02-20 19:59:40,239 INFO L290 TraceCheckUtils]: 46: Hoare triple {5628#false} assume !false; {5628#false} is VALID [2022-02-20 19:59:40,239 INFO L272 TraceCheckUtils]: 47: Hoare triple {5628#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5627#true} is VALID [2022-02-20 19:59:40,239 INFO L290 TraceCheckUtils]: 48: Hoare triple {5627#true} havoc ~__retres1~2; {5627#true} is VALID [2022-02-20 19:59:40,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {5627#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5627#true} is VALID [2022-02-20 19:59:40,239 INFO L290 TraceCheckUtils]: 50: Hoare triple {5627#true} #res := ~__retres1~2; {5627#true} is VALID [2022-02-20 19:59:40,240 INFO L290 TraceCheckUtils]: 51: Hoare triple {5627#true} assume true; {5627#true} is VALID [2022-02-20 19:59:40,240 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5627#true} {5628#false} #974#return; {5628#false} is VALID [2022-02-20 19:59:40,240 INFO L290 TraceCheckUtils]: 53: Hoare triple {5628#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; {5628#false} is VALID [2022-02-20 19:59:40,240 INFO L290 TraceCheckUtils]: 54: Hoare triple {5628#false} assume 0 != eval1_~tmp___1~0#1; {5628#false} is VALID [2022-02-20 19:59:40,240 INFO L290 TraceCheckUtils]: 55: Hoare triple {5628#false} assume !(0 == ~p_dw_st~0); {5628#false} is VALID [2022-02-20 19:59:40,240 INFO L290 TraceCheckUtils]: 56: Hoare triple {5628#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; {5628#false} is VALID [2022-02-20 19:59:40,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {5628#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; {5628#false} is VALID [2022-02-20 19:59:40,241 INFO L290 TraceCheckUtils]: 58: Hoare triple {5628#false} assume !(0 == ~c_dr_pc~0); {5628#false} is VALID [2022-02-20 19:59:40,241 INFO L290 TraceCheckUtils]: 59: Hoare triple {5628#false} assume 2 == ~c_dr_pc~0; {5628#false} is VALID [2022-02-20 19:59:40,241 INFO L290 TraceCheckUtils]: 60: Hoare triple {5628#false} do_read_c_~a~0#1 := ~a_t~0; {5628#false} is VALID [2022-02-20 19:59:40,241 INFO L290 TraceCheckUtils]: 61: Hoare triple {5628#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; {5628#false} is VALID [2022-02-20 19:59:40,241 INFO L290 TraceCheckUtils]: 62: Hoare triple {5628#false} assume !(~p_last_write~0 == ~c_last_read~0); {5628#false} is VALID [2022-02-20 19:59:40,241 INFO L272 TraceCheckUtils]: 63: Hoare triple {5628#false} call error1(); {5628#false} is VALID [2022-02-20 19:59:40,241 INFO L290 TraceCheckUtils]: 64: Hoare triple {5628#false} assume !false; {5628#false} is VALID [2022-02-20 19:59:40,242 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:40,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:40,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783566372] [2022-02-20 19:59:40,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783566372] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:40,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:40,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:40,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968585027] [2022-02-20 19:59:40,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:40,243 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:40,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:40,244 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:40,292 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:40,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:40,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:40,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:40,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:40,293 INFO L87 Difference]: Start difference. First operand 495 states and 714 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:45,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:45,528 INFO L93 Difference]: Finished difference Result 2041 states and 2912 transitions. [2022-02-20 19:59:45,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:45,528 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:45,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:45,529 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:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1201 transitions. [2022-02-20 19:59:45,539 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:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1201 transitions. [2022-02-20 19:59:45,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1201 transitions. [2022-02-20 19:59:46,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1201 edges. 1201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:46,632 INFO L225 Difference]: With dead ends: 2041 [2022-02-20 19:59:46,632 INFO L226 Difference]: Without dead ends: 1708 [2022-02-20 19:59:46,634 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:46,635 INFO L933 BasicCegarLoop]: 535 mSDtfsCounter, 2298 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 600 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2316 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 600 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:46,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2316 Valid, 2084 Invalid, 2290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [600 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-20 19:59:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2022-02-20 19:59:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1548. [2022-02-20 19:59:46,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:46,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1708 states. Second operand has 1548 states, 1249 states have (on average 1.3827061649319456) internal successors, (1727), 1273 states have internal predecessors, (1727), 171 states have call successors, (171), 112 states have call predecessors, (171), 126 states have return successors, (203), 165 states have call predecessors, (203), 167 states have call successors, (203) [2022-02-20 19:59:46,725 INFO L74 IsIncluded]: Start isIncluded. First operand 1708 states. Second operand has 1548 states, 1249 states have (on average 1.3827061649319456) internal successors, (1727), 1273 states have internal predecessors, (1727), 171 states have call successors, (171), 112 states have call predecessors, (171), 126 states have return successors, (203), 165 states have call predecessors, (203), 167 states have call successors, (203) [2022-02-20 19:59:46,729 INFO L87 Difference]: Start difference. First operand 1708 states. Second operand has 1548 states, 1249 states have (on average 1.3827061649319456) internal successors, (1727), 1273 states have internal predecessors, (1727), 171 states have call successors, (171), 112 states have call predecessors, (171), 126 states have return successors, (203), 165 states have call predecessors, (203), 167 states have call successors, (203) [2022-02-20 19:59:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:46,857 INFO L93 Difference]: Finished difference Result 1708 states and 2313 transitions. [2022-02-20 19:59:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2313 transitions. [2022-02-20 19:59:46,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:46,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:46,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 1548 states, 1249 states have (on average 1.3827061649319456) internal successors, (1727), 1273 states have internal predecessors, (1727), 171 states have call successors, (171), 112 states have call predecessors, (171), 126 states have return successors, (203), 165 states have call predecessors, (203), 167 states have call successors, (203) Second operand 1708 states. [2022-02-20 19:59:46,871 INFO L87 Difference]: Start difference. First operand has 1548 states, 1249 states have (on average 1.3827061649319456) internal successors, (1727), 1273 states have internal predecessors, (1727), 171 states have call successors, (171), 112 states have call predecessors, (171), 126 states have return successors, (203), 165 states have call predecessors, (203), 167 states have call successors, (203) Second operand 1708 states. [2022-02-20 19:59:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:46,999 INFO L93 Difference]: Finished difference Result 1708 states and 2313 transitions. [2022-02-20 19:59:46,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2313 transitions. [2022-02-20 19:59:47,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:47,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:47,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:47,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1249 states have (on average 1.3827061649319456) internal successors, (1727), 1273 states have internal predecessors, (1727), 171 states have call successors, (171), 112 states have call predecessors, (171), 126 states have return successors, (203), 165 states have call predecessors, (203), 167 states have call successors, (203) [2022-02-20 19:59:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2101 transitions. [2022-02-20 19:59:47,122 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2101 transitions. Word has length 65 [2022-02-20 19:59:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:47,123 INFO L470 AbstractCegarLoop]: Abstraction has 1548 states and 2101 transitions. [2022-02-20 19:59:47,123 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:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2101 transitions. [2022-02-20 19:59:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:59:47,125 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:47,125 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:47,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:59:47,126 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:47,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:47,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1523190705, now seen corresponding path program 1 times [2022-02-20 19:59:47,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:47,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069434360] [2022-02-20 19:59:47,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:47,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:47,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:47,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {14063#(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); {14023#true} is VALID [2022-02-20 19:59:47,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {14023#true} assume true; {14023#true} is VALID [2022-02-20 19:59:47,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14023#true} {14023#true} #966#return; {14023#true} is VALID [2022-02-20 19:59:47,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:47,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {14064#(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); {14023#true} is VALID [2022-02-20 19:59:47,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {14023#true} assume !(0 == ~q_write_ev~0); {14023#true} is VALID [2022-02-20 19:59:47,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {14023#true} assume true; {14023#true} is VALID [2022-02-20 19:59:47,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14023#true} {14023#true} #968#return; {14023#true} is VALID [2022-02-20 19:59:47,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:47,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:47,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {14023#true} havoc ~__retres1~0; {14023#true} is VALID [2022-02-20 19:59:47,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {14023#true} assume !(1 == ~p_dw_pc~0); {14023#true} is VALID [2022-02-20 19:59:47,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {14023#true} assume !(2 == ~p_dw_pc~0); {14023#true} is VALID [2022-02-20 19:59:47,348 INFO L290 TraceCheckUtils]: 3: Hoare triple {14023#true} ~__retres1~0 := 0; {14081#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:47,348 INFO L290 TraceCheckUtils]: 4: Hoare triple {14081#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {14082#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:47,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {14082#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {14082#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:47,349 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {14082#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {14023#true} #962#return; {14073#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:47,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:47,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {14023#true} havoc ~__retres1~1; {14023#true} is VALID [2022-02-20 19:59:47,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {14023#true} assume 1 == ~c_dr_pc~0; {14023#true} is VALID [2022-02-20 19:59:47,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {14023#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {14023#true} is VALID [2022-02-20 19:59:47,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {14023#true} #res := ~__retres1~1; {14023#true} is VALID [2022-02-20 19:59:47,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {14023#true} assume true; {14023#true} is VALID [2022-02-20 19:59:47,355 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14023#true} {14024#false} #964#return; {14024#false} is VALID [2022-02-20 19:59:47,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {14065#(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; {14023#true} is VALID [2022-02-20 19:59:47,355 INFO L272 TraceCheckUtils]: 1: Hoare triple {14023#true} call #t~ret8 := is_do_write_p_triggered(); {14023#true} is VALID [2022-02-20 19:59:47,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {14023#true} havoc ~__retres1~0; {14023#true} is VALID [2022-02-20 19:59:47,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {14023#true} assume !(1 == ~p_dw_pc~0); {14023#true} is VALID [2022-02-20 19:59:47,355 INFO L290 TraceCheckUtils]: 4: Hoare triple {14023#true} assume !(2 == ~p_dw_pc~0); {14023#true} is VALID [2022-02-20 19:59:47,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {14023#true} ~__retres1~0 := 0; {14081#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:47,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {14081#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {14082#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:47,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {14082#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {14082#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:47,358 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {14082#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {14023#true} #962#return; {14073#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:47,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {14073#(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; {14074#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:47,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {14074#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {14024#false} is VALID [2022-02-20 19:59:47,359 INFO L272 TraceCheckUtils]: 11: Hoare triple {14024#false} call #t~ret9 := is_do_read_c_triggered(); {14023#true} is VALID [2022-02-20 19:59:47,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {14023#true} havoc ~__retres1~1; {14023#true} is VALID [2022-02-20 19:59:47,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {14023#true} assume 1 == ~c_dr_pc~0; {14023#true} is VALID [2022-02-20 19:59:47,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {14023#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {14023#true} is VALID [2022-02-20 19:59:47,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {14023#true} #res := ~__retres1~1; {14023#true} is VALID [2022-02-20 19:59:47,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {14023#true} assume true; {14023#true} is VALID [2022-02-20 19:59:47,368 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14023#true} {14024#false} #964#return; {14024#false} is VALID [2022-02-20 19:59:47,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {14024#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14024#false} is VALID [2022-02-20 19:59:47,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {14024#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14024#false} is VALID [2022-02-20 19:59:47,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {14024#false} assume true; {14024#false} is VALID [2022-02-20 19:59:47,371 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14024#false} {14023#true} #970#return; {14024#false} is VALID [2022-02-20 19:59:47,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 19:59:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:47,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {14064#(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); {14023#true} is VALID [2022-02-20 19:59:47,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {14023#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14023#true} is VALID [2022-02-20 19:59:47,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {14023#true} assume true; {14023#true} is VALID [2022-02-20 19:59:47,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14023#true} {14024#false} #972#return; {14024#false} is VALID [2022-02-20 19:59:47,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:59:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:47,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {14023#true} havoc ~__retres1~2; {14023#true} is VALID [2022-02-20 19:59:47,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {14023#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14023#true} is VALID [2022-02-20 19:59:47,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {14023#true} #res := ~__retres1~2; {14023#true} is VALID [2022-02-20 19:59:47,381 INFO L290 TraceCheckUtils]: 3: Hoare triple {14023#true} assume true; {14023#true} is VALID [2022-02-20 19:59:47,381 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14023#true} {14024#false} #974#return; {14024#false} is VALID [2022-02-20 19:59:47,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {14023#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {14023#true} is VALID [2022-02-20 19:59:47,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {14023#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {14023#true} is VALID [2022-02-20 19:59:47,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {14023#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {14023#true} is VALID [2022-02-20 19:59:47,382 INFO L290 TraceCheckUtils]: 3: Hoare triple {14023#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; {14023#true} is VALID [2022-02-20 19:59:47,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {14023#true} call update_channels1(); {14063#(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:47,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {14063#(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); {14023#true} is VALID [2022-02-20 19:59:47,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {14023#true} assume true; {14023#true} is VALID [2022-02-20 19:59:47,383 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14023#true} {14023#true} #966#return; {14023#true} is VALID [2022-02-20 19:59:47,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {14023#true} assume { :begin_inline_init_threads1 } true; {14023#true} is VALID [2022-02-20 19:59:47,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {14023#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {14023#true} is VALID [2022-02-20 19:59:47,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {14023#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {14023#true} is VALID [2022-02-20 19:59:47,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {14023#true} assume { :end_inline_init_threads1 } true; {14023#true} is VALID [2022-02-20 19:59:47,383 INFO L272 TraceCheckUtils]: 12: Hoare triple {14023#true} call fire_delta_events1(); {14064#(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:47,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {14064#(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); {14023#true} is VALID [2022-02-20 19:59:47,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {14023#true} assume !(0 == ~q_write_ev~0); {14023#true} is VALID [2022-02-20 19:59:47,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {14023#true} assume true; {14023#true} is VALID [2022-02-20 19:59:47,384 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14023#true} {14023#true} #968#return; {14023#true} is VALID [2022-02-20 19:59:47,384 INFO L272 TraceCheckUtils]: 17: Hoare triple {14023#true} call activate_threads1(); {14065#(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:47,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {14065#(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; {14023#true} is VALID [2022-02-20 19:59:47,384 INFO L272 TraceCheckUtils]: 19: Hoare triple {14023#true} call #t~ret8 := is_do_write_p_triggered(); {14023#true} is VALID [2022-02-20 19:59:47,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {14023#true} havoc ~__retres1~0; {14023#true} is VALID [2022-02-20 19:59:47,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {14023#true} assume !(1 == ~p_dw_pc~0); {14023#true} is VALID [2022-02-20 19:59:47,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {14023#true} assume !(2 == ~p_dw_pc~0); {14023#true} is VALID [2022-02-20 19:59:47,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {14023#true} ~__retres1~0 := 0; {14081#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:47,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {14081#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {14082#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:47,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {14082#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {14082#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:47,386 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14082#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {14023#true} #962#return; {14073#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:47,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {14073#(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; {14074#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:47,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {14074#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {14024#false} is VALID [2022-02-20 19:59:47,387 INFO L272 TraceCheckUtils]: 29: Hoare triple {14024#false} call #t~ret9 := is_do_read_c_triggered(); {14023#true} is VALID [2022-02-20 19:59:47,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {14023#true} havoc ~__retres1~1; {14023#true} is VALID [2022-02-20 19:59:47,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {14023#true} assume 1 == ~c_dr_pc~0; {14023#true} is VALID [2022-02-20 19:59:47,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {14023#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {14023#true} is VALID [2022-02-20 19:59:47,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {14023#true} #res := ~__retres1~1; {14023#true} is VALID [2022-02-20 19:59:47,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {14023#true} assume true; {14023#true} is VALID [2022-02-20 19:59:47,389 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {14023#true} {14024#false} #964#return; {14024#false} is VALID [2022-02-20 19:59:47,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {14024#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14024#false} is VALID [2022-02-20 19:59:47,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {14024#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14024#false} is VALID [2022-02-20 19:59:47,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {14024#false} assume true; {14024#false} is VALID [2022-02-20 19:59:47,389 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14024#false} {14023#true} #970#return; {14024#false} is VALID [2022-02-20 19:59:47,389 INFO L272 TraceCheckUtils]: 40: Hoare triple {14024#false} call reset_delta_events1(); {14064#(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:47,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {14064#(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); {14023#true} is VALID [2022-02-20 19:59:47,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {14023#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14023#true} is VALID [2022-02-20 19:59:47,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {14023#true} assume true; {14023#true} is VALID [2022-02-20 19:59:47,390 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14023#true} {14024#false} #972#return; {14024#false} is VALID [2022-02-20 19:59:47,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {14024#false} assume !false; {14024#false} is VALID [2022-02-20 19:59:47,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {14024#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; {14024#false} is VALID [2022-02-20 19:59:47,390 INFO L290 TraceCheckUtils]: 47: Hoare triple {14024#false} assume !false; {14024#false} is VALID [2022-02-20 19:59:47,390 INFO L272 TraceCheckUtils]: 48: Hoare triple {14024#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {14023#true} is VALID [2022-02-20 19:59:47,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {14023#true} havoc ~__retres1~2; {14023#true} is VALID [2022-02-20 19:59:47,391 INFO L290 TraceCheckUtils]: 50: Hoare triple {14023#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14023#true} is VALID [2022-02-20 19:59:47,391 INFO L290 TraceCheckUtils]: 51: Hoare triple {14023#true} #res := ~__retres1~2; {14023#true} is VALID [2022-02-20 19:59:47,391 INFO L290 TraceCheckUtils]: 52: Hoare triple {14023#true} assume true; {14023#true} is VALID [2022-02-20 19:59:47,391 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {14023#true} {14024#false} #974#return; {14024#false} is VALID [2022-02-20 19:59:47,391 INFO L290 TraceCheckUtils]: 54: Hoare triple {14024#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; {14024#false} is VALID [2022-02-20 19:59:47,391 INFO L290 TraceCheckUtils]: 55: Hoare triple {14024#false} assume 0 != eval1_~tmp___1~0#1; {14024#false} is VALID [2022-02-20 19:59:47,391 INFO L290 TraceCheckUtils]: 56: Hoare triple {14024#false} assume !(0 == ~p_dw_st~0); {14024#false} is VALID [2022-02-20 19:59:47,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {14024#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; {14024#false} is VALID [2022-02-20 19:59:47,391 INFO L290 TraceCheckUtils]: 58: Hoare triple {14024#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; {14024#false} is VALID [2022-02-20 19:59:47,392 INFO L290 TraceCheckUtils]: 59: Hoare triple {14024#false} assume !(0 == ~c_dr_pc~0); {14024#false} is VALID [2022-02-20 19:59:47,392 INFO L290 TraceCheckUtils]: 60: Hoare triple {14024#false} assume 2 == ~c_dr_pc~0; {14024#false} is VALID [2022-02-20 19:59:47,392 INFO L290 TraceCheckUtils]: 61: Hoare triple {14024#false} do_read_c_~a~0#1 := ~a_t~0; {14024#false} is VALID [2022-02-20 19:59:47,392 INFO L290 TraceCheckUtils]: 62: Hoare triple {14024#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; {14024#false} is VALID [2022-02-20 19:59:47,392 INFO L290 TraceCheckUtils]: 63: Hoare triple {14024#false} assume !(~p_last_write~0 == ~c_last_read~0); {14024#false} is VALID [2022-02-20 19:59:47,392 INFO L272 TraceCheckUtils]: 64: Hoare triple {14024#false} call error1(); {14024#false} is VALID [2022-02-20 19:59:47,392 INFO L290 TraceCheckUtils]: 65: Hoare triple {14024#false} assume !false; {14024#false} is VALID [2022-02-20 19:59:47,394 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:47,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:47,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069434360] [2022-02-20 19:59:47,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069434360] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:47,394 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:47,394 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:47,394 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664826226] [2022-02-20 19:59:47,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:47,396 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:47,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:47,397 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:47,434 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:47,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:47,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:47,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:47,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:47,436 INFO L87 Difference]: Start difference. First operand 1548 states and 2101 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:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:50,588 INFO L93 Difference]: Finished difference Result 3076 states and 4180 transitions. [2022-02-20 19:59:50,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:50,588 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:50,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:50,589 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:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 577 transitions. [2022-02-20 19:59:50,593 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:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 577 transitions. [2022-02-20 19:59:50,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 577 transitions. [2022-02-20 19:59:50,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:51,092 INFO L225 Difference]: With dead ends: 3076 [2022-02-20 19:59:51,093 INFO L226 Difference]: Without dead ends: 1696 [2022-02-20 19:59:51,095 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:51,101 INFO L933 BasicCegarLoop]: 383 mSDtfsCounter, 308 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:51,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 1765 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:59:51,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2022-02-20 19:59:51,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1588. [2022-02-20 19:59:51,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:51,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1696 states. Second operand has 1588 states, 1281 states have (on average 1.3684621389539422) internal successors, (1753), 1305 states have internal predecessors, (1753), 171 states have call successors, (171), 112 states have call predecessors, (171), 134 states have return successors, (211), 173 states have call predecessors, (211), 167 states have call successors, (211) [2022-02-20 19:59:51,178 INFO L74 IsIncluded]: Start isIncluded. First operand 1696 states. Second operand has 1588 states, 1281 states have (on average 1.3684621389539422) internal successors, (1753), 1305 states have internal predecessors, (1753), 171 states have call successors, (171), 112 states have call predecessors, (171), 134 states have return successors, (211), 173 states have call predecessors, (211), 167 states have call successors, (211) [2022-02-20 19:59:51,180 INFO L87 Difference]: Start difference. First operand 1696 states. Second operand has 1588 states, 1281 states have (on average 1.3684621389539422) internal successors, (1753), 1305 states have internal predecessors, (1753), 171 states have call successors, (171), 112 states have call predecessors, (171), 134 states have return successors, (211), 173 states have call predecessors, (211), 167 states have call successors, (211) [2022-02-20 19:59:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:51,266 INFO L93 Difference]: Finished difference Result 1696 states and 2289 transitions. [2022-02-20 19:59:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2289 transitions. [2022-02-20 19:59:51,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:51,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:51,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 1588 states, 1281 states have (on average 1.3684621389539422) internal successors, (1753), 1305 states have internal predecessors, (1753), 171 states have call successors, (171), 112 states have call predecessors, (171), 134 states have return successors, (211), 173 states have call predecessors, (211), 167 states have call successors, (211) Second operand 1696 states. [2022-02-20 19:59:51,288 INFO L87 Difference]: Start difference. First operand has 1588 states, 1281 states have (on average 1.3684621389539422) internal successors, (1753), 1305 states have internal predecessors, (1753), 171 states have call successors, (171), 112 states have call predecessors, (171), 134 states have return successors, (211), 173 states have call predecessors, (211), 167 states have call successors, (211) Second operand 1696 states. [2022-02-20 19:59:51,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:51,393 INFO L93 Difference]: Finished difference Result 1696 states and 2289 transitions. [2022-02-20 19:59:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2289 transitions. [2022-02-20 19:59:51,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:51,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:51,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:51,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:51,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1281 states have (on average 1.3684621389539422) internal successors, (1753), 1305 states have internal predecessors, (1753), 171 states have call successors, (171), 112 states have call predecessors, (171), 134 states have return successors, (211), 173 states have call predecessors, (211), 167 states have call successors, (211) [2022-02-20 19:59:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2135 transitions. [2022-02-20 19:59:51,509 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2135 transitions. Word has length 66 [2022-02-20 19:59:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:51,509 INFO L470 AbstractCegarLoop]: Abstraction has 1588 states and 2135 transitions. [2022-02-20 19:59:51,509 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:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2135 transitions. [2022-02-20 19:59:51,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:59:51,510 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:51,510 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:51,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:59:51,510 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:51,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:51,511 INFO L85 PathProgramCache]: Analyzing trace with hash 493831407, now seen corresponding path program 1 times [2022-02-20 19:59:51,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:51,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799367539] [2022-02-20 19:59:51,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:51,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {23813#(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); {23814#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:51,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {23814#(not (= |old(~q_req_up~0)| 1))} assume true; {23814#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:51,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23814#(not (= |old(~q_req_up~0)| 1))} {23773#(= ~c_dr_pc~0 ~q_req_up~0)} #966#return; {23777#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:51,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {23815#(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); {23770#true} is VALID [2022-02-20 19:59:51,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {23770#true} assume !(0 == ~q_write_ev~0); {23770#true} is VALID [2022-02-20 19:59:51,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {23770#true} assume true; {23770#true} is VALID [2022-02-20 19:59:51,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23770#true} {23777#(not (= ~c_dr_pc~0 1))} #968#return; {23777#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:51,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {23770#true} havoc ~__retres1~0; {23770#true} is VALID [2022-02-20 19:59:51,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {23770#true} assume !(1 == ~p_dw_pc~0); {23770#true} is VALID [2022-02-20 19:59:51,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {23770#true} assume !(2 == ~p_dw_pc~0); {23770#true} is VALID [2022-02-20 19:59:51,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {23770#true} ~__retres1~0 := 0; {23770#true} is VALID [2022-02-20 19:59:51,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {23770#true} #res := ~__retres1~0; {23770#true} is VALID [2022-02-20 19:59:51,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {23770#true} assume true; {23770#true} is VALID [2022-02-20 19:59:51,623 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {23770#true} {23770#true} #962#return; {23770#true} is VALID [2022-02-20 19:59:51,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {23770#true} havoc ~__retres1~1; {23770#true} is VALID [2022-02-20 19:59:51,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {23770#true} assume 1 == ~c_dr_pc~0; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,642 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} {23770#true} #964#return; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {23816#(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; {23770#true} is VALID [2022-02-20 19:59:51,646 INFO L272 TraceCheckUtils]: 1: Hoare triple {23770#true} call #t~ret8 := is_do_write_p_triggered(); {23770#true} is VALID [2022-02-20 19:59:51,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {23770#true} havoc ~__retres1~0; {23770#true} is VALID [2022-02-20 19:59:51,647 INFO L290 TraceCheckUtils]: 3: Hoare triple {23770#true} assume !(1 == ~p_dw_pc~0); {23770#true} is VALID [2022-02-20 19:59:51,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {23770#true} assume !(2 == ~p_dw_pc~0); {23770#true} is VALID [2022-02-20 19:59:51,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {23770#true} ~__retres1~0 := 0; {23770#true} is VALID [2022-02-20 19:59:51,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {23770#true} #res := ~__retres1~0; {23770#true} is VALID [2022-02-20 19:59:51,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {23770#true} assume true; {23770#true} is VALID [2022-02-20 19:59:51,647 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {23770#true} {23770#true} #962#return; {23770#true} is VALID [2022-02-20 19:59:51,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {23770#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {23770#true} is VALID [2022-02-20 19:59:51,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {23770#true} assume !(0 != ~tmp~1); {23770#true} is VALID [2022-02-20 19:59:51,648 INFO L272 TraceCheckUtils]: 11: Hoare triple {23770#true} call #t~ret9 := is_do_read_c_triggered(); {23770#true} is VALID [2022-02-20 19:59:51,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {23770#true} havoc ~__retres1~1; {23770#true} is VALID [2022-02-20 19:59:51,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {23770#true} assume 1 == ~c_dr_pc~0; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,651 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} {23770#true} #964#return; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,652 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} {23777#(not (= ~c_dr_pc~0 1))} #970#return; {23771#false} is VALID [2022-02-20 19:59:51,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 19:59:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {23815#(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); {23770#true} is VALID [2022-02-20 19:59:51,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {23770#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {23770#true} is VALID [2022-02-20 19:59:51,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {23770#true} assume true; {23770#true} is VALID [2022-02-20 19:59:51,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23770#true} {23771#false} #972#return; {23771#false} is VALID [2022-02-20 19:59:51,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:59:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {23770#true} havoc ~__retres1~2; {23770#true} is VALID [2022-02-20 19:59:51,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {23770#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {23770#true} is VALID [2022-02-20 19:59:51,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {23770#true} #res := ~__retres1~2; {23770#true} is VALID [2022-02-20 19:59:51,660 INFO L290 TraceCheckUtils]: 3: Hoare triple {23770#true} assume true; {23770#true} is VALID [2022-02-20 19:59:51,660 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {23770#true} {23771#false} #974#return; {23771#false} is VALID [2022-02-20 19:59:51,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {23770#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {23772#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:51,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {23772#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {23772#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:51,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {23772#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {23773#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:51,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {23773#(= ~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; {23773#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:51,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {23773#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {23813#(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:51,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {23813#(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); {23814#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:51,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {23814#(not (= |old(~q_req_up~0)| 1))} assume true; {23814#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:51,663 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23814#(not (= |old(~q_req_up~0)| 1))} {23773#(= ~c_dr_pc~0 ~q_req_up~0)} #966#return; {23777#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:51,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {23777#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {23777#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:51,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {23777#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {23777#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:51,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {23777#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {23777#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:51,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {23777#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {23777#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:51,664 INFO L272 TraceCheckUtils]: 12: Hoare triple {23777#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {23815#(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:51,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {23815#(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); {23770#true} is VALID [2022-02-20 19:59:51,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {23770#true} assume !(0 == ~q_write_ev~0); {23770#true} is VALID [2022-02-20 19:59:51,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {23770#true} assume true; {23770#true} is VALID [2022-02-20 19:59:51,665 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23770#true} {23777#(not (= ~c_dr_pc~0 1))} #968#return; {23777#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:51,665 INFO L272 TraceCheckUtils]: 17: Hoare triple {23777#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {23816#(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:51,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {23816#(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; {23770#true} is VALID [2022-02-20 19:59:51,666 INFO L272 TraceCheckUtils]: 19: Hoare triple {23770#true} call #t~ret8 := is_do_write_p_triggered(); {23770#true} is VALID [2022-02-20 19:59:51,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {23770#true} havoc ~__retres1~0; {23770#true} is VALID [2022-02-20 19:59:51,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {23770#true} assume !(1 == ~p_dw_pc~0); {23770#true} is VALID [2022-02-20 19:59:51,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {23770#true} assume !(2 == ~p_dw_pc~0); {23770#true} is VALID [2022-02-20 19:59:51,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {23770#true} ~__retres1~0 := 0; {23770#true} is VALID [2022-02-20 19:59:51,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {23770#true} #res := ~__retres1~0; {23770#true} is VALID [2022-02-20 19:59:51,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {23770#true} assume true; {23770#true} is VALID [2022-02-20 19:59:51,666 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23770#true} {23770#true} #962#return; {23770#true} is VALID [2022-02-20 19:59:51,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {23770#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {23770#true} is VALID [2022-02-20 19:59:51,667 INFO L290 TraceCheckUtils]: 28: Hoare triple {23770#true} assume !(0 != ~tmp~1); {23770#true} is VALID [2022-02-20 19:59:51,667 INFO L272 TraceCheckUtils]: 29: Hoare triple {23770#true} call #t~ret9 := is_do_read_c_triggered(); {23770#true} is VALID [2022-02-20 19:59:51,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {23770#true} havoc ~__retres1~1; {23770#true} is VALID [2022-02-20 19:59:51,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {23770#true} assume 1 == ~c_dr_pc~0; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,668 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} {23770#true} #964#return; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:51,669 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23830#(= (+ (- 1) ~c_dr_pc~0) 0)} {23777#(not (= ~c_dr_pc~0 1))} #970#return; {23771#false} is VALID [2022-02-20 19:59:51,669 INFO L272 TraceCheckUtils]: 40: Hoare triple {23771#false} call reset_delta_events1(); {23815#(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:51,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {23815#(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); {23770#true} is VALID [2022-02-20 19:59:51,670 INFO L290 TraceCheckUtils]: 42: Hoare triple {23770#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {23770#true} is VALID [2022-02-20 19:59:51,670 INFO L290 TraceCheckUtils]: 43: Hoare triple {23770#true} assume true; {23770#true} is VALID [2022-02-20 19:59:51,670 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {23770#true} {23771#false} #972#return; {23771#false} is VALID [2022-02-20 19:59:51,670 INFO L290 TraceCheckUtils]: 45: Hoare triple {23771#false} assume !false; {23771#false} is VALID [2022-02-20 19:59:51,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {23771#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; {23771#false} is VALID [2022-02-20 19:59:51,670 INFO L290 TraceCheckUtils]: 47: Hoare triple {23771#false} assume !false; {23771#false} is VALID [2022-02-20 19:59:51,670 INFO L272 TraceCheckUtils]: 48: Hoare triple {23771#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {23770#true} is VALID [2022-02-20 19:59:51,670 INFO L290 TraceCheckUtils]: 49: Hoare triple {23770#true} havoc ~__retres1~2; {23770#true} is VALID [2022-02-20 19:59:51,670 INFO L290 TraceCheckUtils]: 50: Hoare triple {23770#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {23770#true} is VALID [2022-02-20 19:59:51,671 INFO L290 TraceCheckUtils]: 51: Hoare triple {23770#true} #res := ~__retres1~2; {23770#true} is VALID [2022-02-20 19:59:51,671 INFO L290 TraceCheckUtils]: 52: Hoare triple {23770#true} assume true; {23770#true} is VALID [2022-02-20 19:59:51,671 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {23770#true} {23771#false} #974#return; {23771#false} is VALID [2022-02-20 19:59:51,671 INFO L290 TraceCheckUtils]: 54: Hoare triple {23771#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; {23771#false} is VALID [2022-02-20 19:59:51,671 INFO L290 TraceCheckUtils]: 55: Hoare triple {23771#false} assume 0 != eval1_~tmp___1~0#1; {23771#false} is VALID [2022-02-20 19:59:51,671 INFO L290 TraceCheckUtils]: 56: Hoare triple {23771#false} assume !(0 == ~p_dw_st~0); {23771#false} is VALID [2022-02-20 19:59:51,671 INFO L290 TraceCheckUtils]: 57: Hoare triple {23771#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; {23771#false} is VALID [2022-02-20 19:59:51,671 INFO L290 TraceCheckUtils]: 58: Hoare triple {23771#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; {23771#false} is VALID [2022-02-20 19:59:51,671 INFO L290 TraceCheckUtils]: 59: Hoare triple {23771#false} assume !(0 == ~c_dr_pc~0); {23771#false} is VALID [2022-02-20 19:59:51,672 INFO L290 TraceCheckUtils]: 60: Hoare triple {23771#false} assume 2 == ~c_dr_pc~0; {23771#false} is VALID [2022-02-20 19:59:51,672 INFO L290 TraceCheckUtils]: 61: Hoare triple {23771#false} do_read_c_~a~0#1 := ~a_t~0; {23771#false} is VALID [2022-02-20 19:59:51,672 INFO L290 TraceCheckUtils]: 62: Hoare triple {23771#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; {23771#false} is VALID [2022-02-20 19:59:51,672 INFO L290 TraceCheckUtils]: 63: Hoare triple {23771#false} assume !(~p_last_write~0 == ~c_last_read~0); {23771#false} is VALID [2022-02-20 19:59:51,672 INFO L272 TraceCheckUtils]: 64: Hoare triple {23771#false} call error1(); {23771#false} is VALID [2022-02-20 19:59:51,672 INFO L290 TraceCheckUtils]: 65: Hoare triple {23771#false} assume !false; {23771#false} is VALID [2022-02-20 19:59:51,672 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:51,672 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:51,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799367539] [2022-02-20 19:59:51,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799367539] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:51,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:51,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:51,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477575333] [2022-02-20 19:59:51,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:51,674 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:51,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:51,674 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:51,707 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:51,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:51,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:51,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:51,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:51,708 INFO L87 Difference]: Start difference. First operand 1588 states and 2135 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:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:57,478 INFO L93 Difference]: Finished difference Result 5160 states and 7009 transitions. [2022-02-20 19:59:57,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:57,479 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:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:57,479 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:57,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1190 transitions. [2022-02-20 19:59:57,487 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:57,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1190 transitions. [2022-02-20 19:59:57,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1190 transitions. [2022-02-20 19:59:58,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1190 edges. 1190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:58,512 INFO L225 Difference]: With dead ends: 5160 [2022-02-20 19:59:58,512 INFO L226 Difference]: Without dead ends: 1979 [2022-02-20 19:59:58,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:59:58,521 INFO L933 BasicCegarLoop]: 529 mSDtfsCounter, 2356 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 609 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 609 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:58,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2374 Valid, 2127 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [609 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 19:59:58,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2022-02-20 19:59:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1799. [2022-02-20 19:59:58,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:58,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1979 states. Second operand has 1799 states, 1420 states have (on average 1.3232394366197182) internal successors, (1879), 1446 states have internal predecessors, (1879), 211 states have call successors, (211), 140 states have call predecessors, (211), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2022-02-20 19:59:58,629 INFO L74 IsIncluded]: Start isIncluded. First operand 1979 states. Second operand has 1799 states, 1420 states have (on average 1.3232394366197182) internal successors, (1879), 1446 states have internal predecessors, (1879), 211 states have call successors, (211), 140 states have call predecessors, (211), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2022-02-20 19:59:58,630 INFO L87 Difference]: Start difference. First operand 1979 states. Second operand has 1799 states, 1420 states have (on average 1.3232394366197182) internal successors, (1879), 1446 states have internal predecessors, (1879), 211 states have call successors, (211), 140 states have call predecessors, (211), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2022-02-20 19:59:58,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:58,735 INFO L93 Difference]: Finished difference Result 1979 states and 2578 transitions. [2022-02-20 19:59:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 2578 transitions. [2022-02-20 19:59:58,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:58,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:58,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 1799 states, 1420 states have (on average 1.3232394366197182) internal successors, (1879), 1446 states have internal predecessors, (1879), 211 states have call successors, (211), 140 states have call predecessors, (211), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) Second operand 1979 states. [2022-02-20 19:59:58,745 INFO L87 Difference]: Start difference. First operand has 1799 states, 1420 states have (on average 1.3232394366197182) internal successors, (1879), 1446 states have internal predecessors, (1879), 211 states have call successors, (211), 140 states have call predecessors, (211), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) Second operand 1979 states. [2022-02-20 19:59:58,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:58,847 INFO L93 Difference]: Finished difference Result 1979 states and 2578 transitions. [2022-02-20 19:59:58,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 2578 transitions. [2022-02-20 19:59:58,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:58,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:58,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:58,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1420 states have (on average 1.3232394366197182) internal successors, (1879), 1446 states have internal predecessors, (1879), 211 states have call successors, (211), 140 states have call predecessors, (211), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2022-02-20 19:59:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2347 transitions. [2022-02-20 19:59:58,978 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2347 transitions. Word has length 66 [2022-02-20 19:59:58,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:58,978 INFO L470 AbstractCegarLoop]: Abstraction has 1799 states and 2347 transitions. [2022-02-20 19:59:58,979 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:58,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2347 transitions. [2022-02-20 19:59:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 19:59:58,981 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:58,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:58,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:58,982 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:58,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:58,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1802213968, now seen corresponding path program 1 times [2022-02-20 19:59:58,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:58,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393245913] [2022-02-20 19:59:58,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:58,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {37242#true} assume true; {37242#true} is VALID [2022-02-20 19:59:59,021 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {37242#true} {37244#(= ~t2_i~0 1)} #994#return; {37244#(= ~t2_i~0 1)} is VALID [2022-02-20 19:59:59,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:59:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {37298#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {37242#true} is VALID [2022-02-20 19:59:59,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {37242#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {37242#true} is VALID [2022-02-20 19:59:59,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {37242#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {37242#true} is VALID [2022-02-20 19:59:59,035 INFO L290 TraceCheckUtils]: 3: Hoare triple {37242#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {37242#true} is VALID [2022-02-20 19:59:59,035 INFO L290 TraceCheckUtils]: 4: Hoare triple {37242#true} assume 0 == ~E_M~0;~E_M~0 := 1; {37242#true} is VALID [2022-02-20 19:59:59,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {37242#true} assume 0 == ~E_1~0;~E_1~0 := 1; {37242#true} is VALID [2022-02-20 19:59:59,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {37242#true} assume !(0 == ~E_2~0); {37242#true} is VALID [2022-02-20 19:59:59,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {37242#true} assume 0 == ~E_3~0;~E_3~0 := 1; {37242#true} is VALID [2022-02-20 19:59:59,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {37242#true} assume true; {37242#true} is VALID [2022-02-20 19:59:59,035 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {37242#true} {37243#false} #996#return; {37243#false} is VALID [2022-02-20 19:59:59,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:59:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {37299#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {37242#true} is VALID [2022-02-20 19:59:59,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {37242#true} assume !(1 == ~m_pc~0); {37242#true} is VALID [2022-02-20 19:59:59,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {37242#true} is_master_triggered_~__retres1~4#1 := 0; {37242#true} is VALID [2022-02-20 19:59:59,059 INFO L290 TraceCheckUtils]: 3: Hoare triple {37242#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {37242#true} is VALID [2022-02-20 19:59:59,059 INFO L290 TraceCheckUtils]: 4: Hoare triple {37242#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {37242#true} is VALID [2022-02-20 19:59:59,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {37242#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {37242#true} is VALID [2022-02-20 19:59:59,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {37242#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; {37242#true} is VALID [2022-02-20 19:59:59,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {37242#true} assume 1 == ~t1_pc~0; {37242#true} is VALID [2022-02-20 19:59:59,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {37242#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {37242#true} is VALID [2022-02-20 19:59:59,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {37242#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {37242#true} is VALID [2022-02-20 19:59:59,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {37242#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {37242#true} is VALID [2022-02-20 19:59:59,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {37242#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {37242#true} is VALID [2022-02-20 19:59:59,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {37242#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; {37242#true} is VALID [2022-02-20 19:59:59,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {37242#true} assume !(1 == ~t2_pc~0); {37242#true} is VALID [2022-02-20 19:59:59,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {37242#true} is_transmit2_triggered_~__retres1~6#1 := 0; {37242#true} is VALID [2022-02-20 19:59:59,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {37242#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {37242#true} is VALID [2022-02-20 19:59:59,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {37242#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {37242#true} is VALID [2022-02-20 19:59:59,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {37242#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {37242#true} is VALID [2022-02-20 19:59:59,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {37242#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {37242#true} is VALID [2022-02-20 19:59:59,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {37242#true} assume 1 == ~t3_pc~0; {37242#true} is VALID [2022-02-20 19:59:59,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {37242#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {37242#true} is VALID [2022-02-20 19:59:59,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {37242#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {37242#true} is VALID [2022-02-20 19:59:59,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {37242#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {37242#true} is VALID [2022-02-20 19:59:59,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {37242#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {37242#true} is VALID [2022-02-20 19:59:59,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {37242#true} assume true; {37242#true} is VALID [2022-02-20 19:59:59,062 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {37242#true} {37243#false} #998#return; {37243#false} is VALID [2022-02-20 19:59:59,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:59:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {37298#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {37242#true} is VALID [2022-02-20 19:59:59,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {37242#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {37242#true} is VALID [2022-02-20 19:59:59,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {37242#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {37242#true} is VALID [2022-02-20 19:59:59,069 INFO L290 TraceCheckUtils]: 3: Hoare triple {37242#true} assume !(1 == ~T3_E~0); {37242#true} is VALID [2022-02-20 19:59:59,069 INFO L290 TraceCheckUtils]: 4: Hoare triple {37242#true} assume 1 == ~E_M~0;~E_M~0 := 2; {37242#true} is VALID [2022-02-20 19:59:59,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {37242#true} assume 1 == ~E_1~0;~E_1~0 := 2; {37242#true} is VALID [2022-02-20 19:59:59,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {37242#true} assume 1 == ~E_2~0;~E_2~0 := 2; {37242#true} is VALID [2022-02-20 19:59:59,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {37242#true} assume 1 == ~E_3~0;~E_3~0 := 2; {37242#true} is VALID [2022-02-20 19:59:59,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {37242#true} assume true; {37242#true} is VALID [2022-02-20 19:59:59,069 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {37242#true} {37243#false} #1000#return; {37243#false} is VALID [2022-02-20 19:59:59,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:59:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:59,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {37242#true} havoc ~__retres1~8; {37242#true} is VALID [2022-02-20 19:59:59,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {37242#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {37242#true} is VALID [2022-02-20 19:59:59,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {37242#true} #res := ~__retres1~8; {37242#true} is VALID [2022-02-20 19:59:59,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {37242#true} assume true; {37242#true} is VALID [2022-02-20 19:59:59,076 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37242#true} {37243#false} #1002#return; {37243#false} is VALID [2022-02-20 19:59:59,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {37242#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {37242#true} is VALID [2022-02-20 19:59:59,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {37242#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {37242#true} is VALID [2022-02-20 19:59:59,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {37242#true} assume !(0 != main_#t~nondet34#1);havoc main_#t~nondet34#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {37244#(= ~t2_i~0 1)} is VALID [2022-02-20 19:59:59,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {37244#(= ~t2_i~0 1)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret32#1, start_simulation2_#t~ret33#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; {37244#(= ~t2_i~0 1)} is VALID [2022-02-20 19:59:59,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {37244#(= ~t2_i~0 1)} call update_channels2(); {37242#true} is VALID [2022-02-20 19:59:59,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {37242#true} assume true; {37242#true} is VALID [2022-02-20 19:59:59,077 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {37242#true} {37244#(= ~t2_i~0 1)} #994#return; {37244#(= ~t2_i~0 1)} is VALID [2022-02-20 19:59:59,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {37244#(= ~t2_i~0 1)} assume { :begin_inline_init_threads2 } true; {37244#(= ~t2_i~0 1)} is VALID [2022-02-20 19:59:59,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {37244#(= ~t2_i~0 1)} assume 1 == ~m_i~0;~m_st~0 := 0; {37244#(= ~t2_i~0 1)} is VALID [2022-02-20 19:59:59,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {37244#(= ~t2_i~0 1)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {37244#(= ~t2_i~0 1)} is VALID [2022-02-20 19:59:59,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {37244#(= ~t2_i~0 1)} assume !(1 == ~t2_i~0);~t2_st~0 := 2; {37243#false} is VALID [2022-02-20 19:59:59,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {37243#false} assume 1 == ~t3_i~0;~t3_st~0 := 0; {37243#false} is VALID [2022-02-20 19:59:59,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {37243#false} assume { :end_inline_init_threads2 } true; {37243#false} is VALID [2022-02-20 19:59:59,079 INFO L272 TraceCheckUtils]: 13: Hoare triple {37243#false} call fire_delta_events2(); {37298#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:59:59,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {37298#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {37242#true} is VALID [2022-02-20 19:59:59,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {37242#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {37242#true} is VALID [2022-02-20 19:59:59,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {37242#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {37242#true} is VALID [2022-02-20 19:59:59,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {37242#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {37242#true} is VALID [2022-02-20 19:59:59,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {37242#true} assume 0 == ~E_M~0;~E_M~0 := 1; {37242#true} is VALID [2022-02-20 19:59:59,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {37242#true} assume 0 == ~E_1~0;~E_1~0 := 1; {37242#true} is VALID [2022-02-20 19:59:59,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {37242#true} assume !(0 == ~E_2~0); {37242#true} is VALID [2022-02-20 19:59:59,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {37242#true} assume 0 == ~E_3~0;~E_3~0 := 1; {37242#true} is VALID [2022-02-20 19:59:59,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {37242#true} assume true; {37242#true} is VALID [2022-02-20 19:59:59,080 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37242#true} {37243#false} #996#return; {37243#false} is VALID [2022-02-20 19:59:59,080 INFO L272 TraceCheckUtils]: 24: Hoare triple {37243#false} call activate_threads2(); {37299#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:59:59,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {37299#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {37242#true} is VALID [2022-02-20 19:59:59,080 INFO L290 TraceCheckUtils]: 26: Hoare triple {37242#true} assume !(1 == ~m_pc~0); {37242#true} is VALID [2022-02-20 19:59:59,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {37242#true} is_master_triggered_~__retres1~4#1 := 0; {37242#true} is VALID [2022-02-20 19:59:59,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {37242#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {37242#true} is VALID [2022-02-20 19:59:59,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {37242#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {37242#true} is VALID [2022-02-20 19:59:59,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {37242#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {37242#true} is VALID [2022-02-20 19:59:59,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {37242#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; {37242#true} is VALID [2022-02-20 19:59:59,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {37242#true} assume 1 == ~t1_pc~0; {37242#true} is VALID [2022-02-20 19:59:59,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {37242#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {37242#true} is VALID [2022-02-20 19:59:59,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {37242#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {37242#true} is VALID [2022-02-20 19:59:59,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {37242#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {37242#true} is VALID [2022-02-20 19:59:59,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {37242#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {37242#true} is VALID [2022-02-20 19:59:59,081 INFO L290 TraceCheckUtils]: 37: Hoare triple {37242#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; {37242#true} is VALID [2022-02-20 19:59:59,081 INFO L290 TraceCheckUtils]: 38: Hoare triple {37242#true} assume !(1 == ~t2_pc~0); {37242#true} is VALID [2022-02-20 19:59:59,082 INFO L290 TraceCheckUtils]: 39: Hoare triple {37242#true} is_transmit2_triggered_~__retres1~6#1 := 0; {37242#true} is VALID [2022-02-20 19:59:59,082 INFO L290 TraceCheckUtils]: 40: Hoare triple {37242#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {37242#true} is VALID [2022-02-20 19:59:59,082 INFO L290 TraceCheckUtils]: 41: Hoare triple {37242#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {37242#true} is VALID [2022-02-20 19:59:59,082 INFO L290 TraceCheckUtils]: 42: Hoare triple {37242#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {37242#true} is VALID [2022-02-20 19:59:59,082 INFO L290 TraceCheckUtils]: 43: Hoare triple {37242#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {37242#true} is VALID [2022-02-20 19:59:59,082 INFO L290 TraceCheckUtils]: 44: Hoare triple {37242#true} assume 1 == ~t3_pc~0; {37242#true} is VALID [2022-02-20 19:59:59,082 INFO L290 TraceCheckUtils]: 45: Hoare triple {37242#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {37242#true} is VALID [2022-02-20 19:59:59,082 INFO L290 TraceCheckUtils]: 46: Hoare triple {37242#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {37242#true} is VALID [2022-02-20 19:59:59,082 INFO L290 TraceCheckUtils]: 47: Hoare triple {37242#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {37242#true} is VALID [2022-02-20 19:59:59,083 INFO L290 TraceCheckUtils]: 48: Hoare triple {37242#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {37242#true} is VALID [2022-02-20 19:59:59,083 INFO L290 TraceCheckUtils]: 49: Hoare triple {37242#true} assume true; {37242#true} is VALID [2022-02-20 19:59:59,083 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {37242#true} {37243#false} #998#return; {37243#false} is VALID [2022-02-20 19:59:59,083 INFO L272 TraceCheckUtils]: 51: Hoare triple {37243#false} call reset_delta_events2(); {37298#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:59:59,083 INFO L290 TraceCheckUtils]: 52: Hoare triple {37298#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {37242#true} is VALID [2022-02-20 19:59:59,083 INFO L290 TraceCheckUtils]: 53: Hoare triple {37242#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {37242#true} is VALID [2022-02-20 19:59:59,083 INFO L290 TraceCheckUtils]: 54: Hoare triple {37242#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {37242#true} is VALID [2022-02-20 19:59:59,083 INFO L290 TraceCheckUtils]: 55: Hoare triple {37242#true} assume !(1 == ~T3_E~0); {37242#true} is VALID [2022-02-20 19:59:59,083 INFO L290 TraceCheckUtils]: 56: Hoare triple {37242#true} assume 1 == ~E_M~0;~E_M~0 := 2; {37242#true} is VALID [2022-02-20 19:59:59,083 INFO L290 TraceCheckUtils]: 57: Hoare triple {37242#true} assume 1 == ~E_1~0;~E_1~0 := 2; {37242#true} is VALID [2022-02-20 19:59:59,084 INFO L290 TraceCheckUtils]: 58: Hoare triple {37242#true} assume 1 == ~E_2~0;~E_2~0 := 2; {37242#true} is VALID [2022-02-20 19:59:59,084 INFO L290 TraceCheckUtils]: 59: Hoare triple {37242#true} assume 1 == ~E_3~0;~E_3~0 := 2; {37242#true} is VALID [2022-02-20 19:59:59,084 INFO L290 TraceCheckUtils]: 60: Hoare triple {37242#true} assume true; {37242#true} is VALID [2022-02-20 19:59:59,084 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {37242#true} {37243#false} #1000#return; {37243#false} is VALID [2022-02-20 19:59:59,084 INFO L290 TraceCheckUtils]: 62: Hoare triple {37243#false} assume !false; {37243#false} is VALID [2022-02-20 19:59:59,084 INFO L290 TraceCheckUtils]: 63: Hoare triple {37243#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {37243#false} is VALID [2022-02-20 19:59:59,084 INFO L290 TraceCheckUtils]: 64: Hoare triple {37243#false} assume !false; {37243#false} is VALID [2022-02-20 19:59:59,084 INFO L272 TraceCheckUtils]: 65: Hoare triple {37243#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {37242#true} is VALID [2022-02-20 19:59:59,085 INFO L290 TraceCheckUtils]: 66: Hoare triple {37242#true} havoc ~__retres1~8; {37242#true} is VALID [2022-02-20 19:59:59,085 INFO L290 TraceCheckUtils]: 67: Hoare triple {37242#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {37242#true} is VALID [2022-02-20 19:59:59,085 INFO L290 TraceCheckUtils]: 68: Hoare triple {37242#true} #res := ~__retres1~8; {37242#true} is VALID [2022-02-20 19:59:59,085 INFO L290 TraceCheckUtils]: 69: Hoare triple {37242#true} assume true; {37242#true} is VALID [2022-02-20 19:59:59,085 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {37242#true} {37243#false} #1002#return; {37243#false} is VALID [2022-02-20 19:59:59,085 INFO L290 TraceCheckUtils]: 71: Hoare triple {37243#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; {37243#false} is VALID [2022-02-20 19:59:59,085 INFO L290 TraceCheckUtils]: 72: Hoare triple {37243#false} assume 0 != eval2_~tmp~5#1; {37243#false} is VALID [2022-02-20 19:59:59,085 INFO L290 TraceCheckUtils]: 73: Hoare triple {37243#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; {37243#false} is VALID [2022-02-20 19:59:59,085 INFO L290 TraceCheckUtils]: 74: Hoare triple {37243#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; {37243#false} is VALID [2022-02-20 19:59:59,086 INFO L290 TraceCheckUtils]: 75: Hoare triple {37243#false} assume !(0 == ~m_pc~0); {37243#false} is VALID [2022-02-20 19:59:59,086 INFO L290 TraceCheckUtils]: 76: Hoare triple {37243#false} assume 1 == ~m_pc~0; {37243#false} is VALID [2022-02-20 19:59:59,086 INFO L290 TraceCheckUtils]: 77: Hoare triple {37243#false} assume ~token~0 != 3 + ~local~0; {37243#false} is VALID [2022-02-20 19:59:59,086 INFO L272 TraceCheckUtils]: 78: Hoare triple {37243#false} call error2(); {37243#false} is VALID [2022-02-20 19:59:59,086 INFO L290 TraceCheckUtils]: 79: Hoare triple {37243#false} assume !false; {37243#false} is VALID [2022-02-20 19:59:59,086 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,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:59,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393245913] [2022-02-20 19:59:59,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393245913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:59,087 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:59,087 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:59,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119444234] [2022-02-20 19:59:59,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:59,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-02-20 19:59:59,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:59,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:59,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:59,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:59,138 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:59,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:59,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:59,139 INFO L87 Difference]: Start difference. First operand 1799 states and 2347 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:00,412 INFO L93 Difference]: Finished difference Result 1993 states and 2647 transitions. [2022-02-20 20:00:00,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:00:00,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-02-20 20:00:00,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 687 transitions. [2022-02-20 20:00:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 687 transitions. [2022-02-20 20:00:00,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 687 transitions. [2022-02-20 20:00:00,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 687 edges. 687 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:01,036 INFO L225 Difference]: With dead ends: 1993 [2022-02-20 20:00:01,037 INFO L226 Difference]: Without dead ends: 1842 [2022-02-20 20:00:01,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:01,039 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 479 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:01,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 777 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 20:00:01,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2022-02-20 20:00:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1799. [2022-02-20 20:00:01,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:01,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1842 states. Second operand has 1799 states, 1420 states have (on average 1.3225352112676056) internal successors, (1878), 1446 states have internal predecessors, (1878), 211 states have call successors, (211), 140 states have call predecessors, (211), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2022-02-20 20:00:01,135 INFO L74 IsIncluded]: Start isIncluded. First operand 1842 states. Second operand has 1799 states, 1420 states have (on average 1.3225352112676056) internal successors, (1878), 1446 states have internal predecessors, (1878), 211 states have call successors, (211), 140 states have call predecessors, (211), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2022-02-20 20:00:01,136 INFO L87 Difference]: Start difference. First operand 1842 states. Second operand has 1799 states, 1420 states have (on average 1.3225352112676056) internal successors, (1878), 1446 states have internal predecessors, (1878), 211 states have call successors, (211), 140 states have call predecessors, (211), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2022-02-20 20:00:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:01,251 INFO L93 Difference]: Finished difference Result 1842 states and 2420 transitions. [2022-02-20 20:00:01,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2420 transitions. [2022-02-20 20:00:01,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:01,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:01,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 1799 states, 1420 states have (on average 1.3225352112676056) internal successors, (1878), 1446 states have internal predecessors, (1878), 211 states have call successors, (211), 140 states have call predecessors, (211), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) Second operand 1842 states. [2022-02-20 20:00:01,262 INFO L87 Difference]: Start difference. First operand has 1799 states, 1420 states have (on average 1.3225352112676056) internal successors, (1878), 1446 states have internal predecessors, (1878), 211 states have call successors, (211), 140 states have call predecessors, (211), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) Second operand 1842 states. [2022-02-20 20:00:01,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:01,392 INFO L93 Difference]: Finished difference Result 1842 states and 2420 transitions. [2022-02-20 20:00:01,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2420 transitions. [2022-02-20 20:00:01,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:01,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:01,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:01,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1420 states have (on average 1.3225352112676056) internal successors, (1878), 1446 states have internal predecessors, (1878), 211 states have call successors, (211), 140 states have call predecessors, (211), 166 states have return successors, (257), 215 states have call predecessors, (257), 207 states have call successors, (257) [2022-02-20 20:00:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2346 transitions. [2022-02-20 20:00:01,541 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2346 transitions. Word has length 80 [2022-02-20 20:00:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:01,542 INFO L470 AbstractCegarLoop]: Abstraction has 1799 states and 2346 transitions. [2022-02-20 20:00:01,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 20:00:01,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2346 transitions. [2022-02-20 20:00:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 20:00:01,544 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:01,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:00:01,544 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:01,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:01,545 INFO L85 PathProgramCache]: Analyzing trace with hash -106243822, now seen corresponding path program 1 times [2022-02-20 20:00:01,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:01,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315287726] [2022-02-20 20:00:01,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:01,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:01,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:01,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {46120#true} assume true; {46120#true} is VALID [2022-02-20 20:00:01,573 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {46120#true} {46122#(= ~M_E~0 2)} #994#return; {46122#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:01,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 20:00:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:01,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {46176#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {46177#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {46177#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,593 INFO L290 TraceCheckUtils]: 3: Hoare triple {46177#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,593 INFO L290 TraceCheckUtils]: 4: Hoare triple {46177#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {46177#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {46177#(= |old(~M_E~0)| 0)} assume !(0 == ~E_2~0); {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {46177#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {46177#(= |old(~M_E~0)| 0)} assume true; {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,595 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {46177#(= |old(~M_E~0)| 0)} {46122#(= ~M_E~0 2)} #996#return; {46121#false} is VALID [2022-02-20 20:00:01,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 20:00:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:01,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {46178#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {46120#true} is VALID [2022-02-20 20:00:01,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {46120#true} assume !(1 == ~m_pc~0); {46120#true} is VALID [2022-02-20 20:00:01,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {46120#true} is_master_triggered_~__retres1~4#1 := 0; {46120#true} is VALID [2022-02-20 20:00:01,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {46120#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {46120#true} is VALID [2022-02-20 20:00:01,622 INFO L290 TraceCheckUtils]: 4: Hoare triple {46120#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {46120#true} is VALID [2022-02-20 20:00:01,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {46120#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {46120#true} is VALID [2022-02-20 20:00:01,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {46120#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; {46120#true} is VALID [2022-02-20 20:00:01,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {46120#true} assume 1 == ~t1_pc~0; {46120#true} is VALID [2022-02-20 20:00:01,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {46120#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {46120#true} is VALID [2022-02-20 20:00:01,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {46120#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {46120#true} is VALID [2022-02-20 20:00:01,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {46120#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {46120#true} is VALID [2022-02-20 20:00:01,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {46120#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {46120#true} is VALID [2022-02-20 20:00:01,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {46120#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; {46120#true} is VALID [2022-02-20 20:00:01,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {46120#true} assume !(1 == ~t2_pc~0); {46120#true} is VALID [2022-02-20 20:00:01,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {46120#true} is_transmit2_triggered_~__retres1~6#1 := 0; {46120#true} is VALID [2022-02-20 20:00:01,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {46120#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {46120#true} is VALID [2022-02-20 20:00:01,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {46120#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {46120#true} is VALID [2022-02-20 20:00:01,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {46120#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {46120#true} is VALID [2022-02-20 20:00:01,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {46120#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {46120#true} is VALID [2022-02-20 20:00:01,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {46120#true} assume 1 == ~t3_pc~0; {46120#true} is VALID [2022-02-20 20:00:01,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {46120#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {46120#true} is VALID [2022-02-20 20:00:01,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {46120#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {46120#true} is VALID [2022-02-20 20:00:01,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {46120#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {46120#true} is VALID [2022-02-20 20:00:01,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {46120#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {46120#true} is VALID [2022-02-20 20:00:01,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {46120#true} assume true; {46120#true} is VALID [2022-02-20 20:00:01,624 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {46120#true} {46121#false} #998#return; {46121#false} is VALID [2022-02-20 20:00:01,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 20:00:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:01,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {46176#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {46120#true} is VALID [2022-02-20 20:00:01,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {46120#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {46120#true} is VALID [2022-02-20 20:00:01,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {46120#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {46120#true} is VALID [2022-02-20 20:00:01,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {46120#true} assume !(1 == ~T3_E~0); {46120#true} is VALID [2022-02-20 20:00:01,631 INFO L290 TraceCheckUtils]: 4: Hoare triple {46120#true} assume 1 == ~E_M~0;~E_M~0 := 2; {46120#true} is VALID [2022-02-20 20:00:01,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {46120#true} assume 1 == ~E_1~0;~E_1~0 := 2; {46120#true} is VALID [2022-02-20 20:00:01,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {46120#true} assume 1 == ~E_2~0;~E_2~0 := 2; {46120#true} is VALID [2022-02-20 20:00:01,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {46120#true} assume 1 == ~E_3~0;~E_3~0 := 2; {46120#true} is VALID [2022-02-20 20:00:01,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {46120#true} assume true; {46120#true} is VALID [2022-02-20 20:00:01,632 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {46120#true} {46121#false} #1000#return; {46121#false} is VALID [2022-02-20 20:00:01,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:01,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {46120#true} havoc ~__retres1~8; {46120#true} is VALID [2022-02-20 20:00:01,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {46120#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {46120#true} is VALID [2022-02-20 20:00:01,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {46120#true} #res := ~__retres1~8; {46120#true} is VALID [2022-02-20 20:00:01,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {46120#true} assume true; {46120#true} is VALID [2022-02-20 20:00:01,637 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {46120#true} {46121#false} #1002#return; {46121#false} is VALID [2022-02-20 20:00:01,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {46120#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {46122#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:01,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {46122#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {46122#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:01,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {46122#(= ~M_E~0 2)} assume !(0 != main_#t~nondet34#1);havoc main_#t~nondet34#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {46122#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:01,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {46122#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret32#1, start_simulation2_#t~ret33#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; {46122#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:01,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {46122#(= ~M_E~0 2)} call update_channels2(); {46120#true} is VALID [2022-02-20 20:00:01,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {46120#true} assume true; {46120#true} is VALID [2022-02-20 20:00:01,640 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {46120#true} {46122#(= ~M_E~0 2)} #994#return; {46122#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:01,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {46122#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {46122#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:01,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {46122#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {46122#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:01,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {46122#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {46122#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:01,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {46122#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {46122#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:01,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {46122#(= ~M_E~0 2)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {46122#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:01,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {46122#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {46122#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:01,643 INFO L272 TraceCheckUtils]: 13: Hoare triple {46122#(= ~M_E~0 2)} call fire_delta_events2(); {46176#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:01,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {46176#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {46177#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {46177#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {46177#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {46177#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {46177#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {46177#(= |old(~M_E~0)| 0)} assume !(0 == ~E_2~0); {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {46177#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {46177#(= |old(~M_E~0)| 0)} assume true; {46177#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:01,646 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {46177#(= |old(~M_E~0)| 0)} {46122#(= ~M_E~0 2)} #996#return; {46121#false} is VALID [2022-02-20 20:00:01,646 INFO L272 TraceCheckUtils]: 24: Hoare triple {46121#false} call activate_threads2(); {46178#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 20:00:01,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {46178#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {46120#true} is VALID [2022-02-20 20:00:01,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {46120#true} assume !(1 == ~m_pc~0); {46120#true} is VALID [2022-02-20 20:00:01,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {46120#true} is_master_triggered_~__retres1~4#1 := 0; {46120#true} is VALID [2022-02-20 20:00:01,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {46120#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {46120#true} is VALID [2022-02-20 20:00:01,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {46120#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {46120#true} is VALID [2022-02-20 20:00:01,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {46120#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {46120#true} is VALID [2022-02-20 20:00:01,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {46120#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; {46120#true} is VALID [2022-02-20 20:00:01,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {46120#true} assume 1 == ~t1_pc~0; {46120#true} is VALID [2022-02-20 20:00:01,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {46120#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {46120#true} is VALID [2022-02-20 20:00:01,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {46120#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {46120#true} is VALID [2022-02-20 20:00:01,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {46120#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {46120#true} is VALID [2022-02-20 20:00:01,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {46120#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {46120#true} is VALID [2022-02-20 20:00:01,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {46120#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; {46120#true} is VALID [2022-02-20 20:00:01,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {46120#true} assume !(1 == ~t2_pc~0); {46120#true} is VALID [2022-02-20 20:00:01,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {46120#true} is_transmit2_triggered_~__retres1~6#1 := 0; {46120#true} is VALID [2022-02-20 20:00:01,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {46120#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {46120#true} is VALID [2022-02-20 20:00:01,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {46120#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {46120#true} is VALID [2022-02-20 20:00:01,648 INFO L290 TraceCheckUtils]: 42: Hoare triple {46120#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {46120#true} is VALID [2022-02-20 20:00:01,648 INFO L290 TraceCheckUtils]: 43: Hoare triple {46120#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {46120#true} is VALID [2022-02-20 20:00:01,648 INFO L290 TraceCheckUtils]: 44: Hoare triple {46120#true} assume 1 == ~t3_pc~0; {46120#true} is VALID [2022-02-20 20:00:01,649 INFO L290 TraceCheckUtils]: 45: Hoare triple {46120#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {46120#true} is VALID [2022-02-20 20:00:01,649 INFO L290 TraceCheckUtils]: 46: Hoare triple {46120#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {46120#true} is VALID [2022-02-20 20:00:01,649 INFO L290 TraceCheckUtils]: 47: Hoare triple {46120#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {46120#true} is VALID [2022-02-20 20:00:01,649 INFO L290 TraceCheckUtils]: 48: Hoare triple {46120#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {46120#true} is VALID [2022-02-20 20:00:01,649 INFO L290 TraceCheckUtils]: 49: Hoare triple {46120#true} assume true; {46120#true} is VALID [2022-02-20 20:00:01,649 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {46120#true} {46121#false} #998#return; {46121#false} is VALID [2022-02-20 20:00:01,649 INFO L272 TraceCheckUtils]: 51: Hoare triple {46121#false} call reset_delta_events2(); {46176#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:01,649 INFO L290 TraceCheckUtils]: 52: Hoare triple {46176#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {46120#true} is VALID [2022-02-20 20:00:01,649 INFO L290 TraceCheckUtils]: 53: Hoare triple {46120#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {46120#true} is VALID [2022-02-20 20:00:01,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {46120#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {46120#true} is VALID [2022-02-20 20:00:01,650 INFO L290 TraceCheckUtils]: 55: Hoare triple {46120#true} assume !(1 == ~T3_E~0); {46120#true} is VALID [2022-02-20 20:00:01,650 INFO L290 TraceCheckUtils]: 56: Hoare triple {46120#true} assume 1 == ~E_M~0;~E_M~0 := 2; {46120#true} is VALID [2022-02-20 20:00:01,650 INFO L290 TraceCheckUtils]: 57: Hoare triple {46120#true} assume 1 == ~E_1~0;~E_1~0 := 2; {46120#true} is VALID [2022-02-20 20:00:01,650 INFO L290 TraceCheckUtils]: 58: Hoare triple {46120#true} assume 1 == ~E_2~0;~E_2~0 := 2; {46120#true} is VALID [2022-02-20 20:00:01,650 INFO L290 TraceCheckUtils]: 59: Hoare triple {46120#true} assume 1 == ~E_3~0;~E_3~0 := 2; {46120#true} is VALID [2022-02-20 20:00:01,650 INFO L290 TraceCheckUtils]: 60: Hoare triple {46120#true} assume true; {46120#true} is VALID [2022-02-20 20:00:01,650 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {46120#true} {46121#false} #1000#return; {46121#false} is VALID [2022-02-20 20:00:01,650 INFO L290 TraceCheckUtils]: 62: Hoare triple {46121#false} assume !false; {46121#false} is VALID [2022-02-20 20:00:01,650 INFO L290 TraceCheckUtils]: 63: Hoare triple {46121#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {46121#false} is VALID [2022-02-20 20:00:01,651 INFO L290 TraceCheckUtils]: 64: Hoare triple {46121#false} assume !false; {46121#false} is VALID [2022-02-20 20:00:01,651 INFO L272 TraceCheckUtils]: 65: Hoare triple {46121#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {46120#true} is VALID [2022-02-20 20:00:01,651 INFO L290 TraceCheckUtils]: 66: Hoare triple {46120#true} havoc ~__retres1~8; {46120#true} is VALID [2022-02-20 20:00:01,651 INFO L290 TraceCheckUtils]: 67: Hoare triple {46120#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {46120#true} is VALID [2022-02-20 20:00:01,651 INFO L290 TraceCheckUtils]: 68: Hoare triple {46120#true} #res := ~__retres1~8; {46120#true} is VALID [2022-02-20 20:00:01,657 INFO L290 TraceCheckUtils]: 69: Hoare triple {46120#true} assume true; {46120#true} is VALID [2022-02-20 20:00:01,658 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {46120#true} {46121#false} #1002#return; {46121#false} is VALID [2022-02-20 20:00:01,658 INFO L290 TraceCheckUtils]: 71: Hoare triple {46121#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; {46121#false} is VALID [2022-02-20 20:00:01,658 INFO L290 TraceCheckUtils]: 72: Hoare triple {46121#false} assume 0 != eval2_~tmp~5#1; {46121#false} is VALID [2022-02-20 20:00:01,658 INFO L290 TraceCheckUtils]: 73: Hoare triple {46121#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; {46121#false} is VALID [2022-02-20 20:00:01,658 INFO L290 TraceCheckUtils]: 74: Hoare triple {46121#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; {46121#false} is VALID [2022-02-20 20:00:01,658 INFO L290 TraceCheckUtils]: 75: Hoare triple {46121#false} assume !(0 == ~m_pc~0); {46121#false} is VALID [2022-02-20 20:00:01,658 INFO L290 TraceCheckUtils]: 76: Hoare triple {46121#false} assume 1 == ~m_pc~0; {46121#false} is VALID [2022-02-20 20:00:01,658 INFO L290 TraceCheckUtils]: 77: Hoare triple {46121#false} assume ~token~0 != 3 + ~local~0; {46121#false} is VALID [2022-02-20 20:00:01,659 INFO L272 TraceCheckUtils]: 78: Hoare triple {46121#false} call error2(); {46121#false} is VALID [2022-02-20 20:00:01,659 INFO L290 TraceCheckUtils]: 79: Hoare triple {46121#false} assume !false; {46121#false} is VALID [2022-02-20 20:00:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:01,659 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:01,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315287726] [2022-02-20 20:00:01,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315287726] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:01,660 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:01,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:01,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874191186] [2022-02-20 20:00:01,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:01,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 80 [2022-02-20 20:00:01,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:01,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:01,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:01,709 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:01,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:01,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:01,709 INFO L87 Difference]: Start difference. First operand 1799 states and 2346 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:04,179 INFO L93 Difference]: Finished difference Result 2181 states and 2937 transitions. [2022-02-20 20:00:04,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 20:00:04,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 80 [2022-02-20 20:00:04,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 977 transitions. [2022-02-20 20:00:04,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 977 transitions. [2022-02-20 20:00:04,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 977 transitions. [2022-02-20 20:00:04,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 977 edges. 977 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:05,078 INFO L225 Difference]: With dead ends: 2181 [2022-02-20 20:00:05,078 INFO L226 Difference]: Without dead ends: 2033 [2022-02-20 20:00:05,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:00:05,080 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 778 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:05,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [800 Valid, 1009 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 20:00:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2022-02-20 20:00:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 1946. [2022-02-20 20:00:05,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:05,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2033 states. Second operand has 1946 states, 1548 states have (on average 1.3404392764857882) internal successors, (2075), 1575 states have internal predecessors, (2075), 223 states have call successors, (223), 146 states have call predecessors, (223), 173 states have return successors, (272), 227 states have call predecessors, (272), 219 states have call successors, (272) [2022-02-20 20:00:05,192 INFO L74 IsIncluded]: Start isIncluded. First operand 2033 states. Second operand has 1946 states, 1548 states have (on average 1.3404392764857882) internal successors, (2075), 1575 states have internal predecessors, (2075), 223 states have call successors, (223), 146 states have call predecessors, (223), 173 states have return successors, (272), 227 states have call predecessors, (272), 219 states have call successors, (272) [2022-02-20 20:00:05,194 INFO L87 Difference]: Start difference. First operand 2033 states. Second operand has 1946 states, 1548 states have (on average 1.3404392764857882) internal successors, (2075), 1575 states have internal predecessors, (2075), 223 states have call successors, (223), 146 states have call predecessors, (223), 173 states have return successors, (272), 227 states have call predecessors, (272), 219 states have call successors, (272) [2022-02-20 20:00:05,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:05,327 INFO L93 Difference]: Finished difference Result 2033 states and 2710 transitions. [2022-02-20 20:00:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2710 transitions. [2022-02-20 20:00:05,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:05,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:05,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 1946 states, 1548 states have (on average 1.3404392764857882) internal successors, (2075), 1575 states have internal predecessors, (2075), 223 states have call successors, (223), 146 states have call predecessors, (223), 173 states have return successors, (272), 227 states have call predecessors, (272), 219 states have call successors, (272) Second operand 2033 states. [2022-02-20 20:00:05,337 INFO L87 Difference]: Start difference. First operand has 1946 states, 1548 states have (on average 1.3404392764857882) internal successors, (2075), 1575 states have internal predecessors, (2075), 223 states have call successors, (223), 146 states have call predecessors, (223), 173 states have return successors, (272), 227 states have call predecessors, (272), 219 states have call successors, (272) Second operand 2033 states. [2022-02-20 20:00:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:05,462 INFO L93 Difference]: Finished difference Result 2033 states and 2710 transitions. [2022-02-20 20:00:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2710 transitions. [2022-02-20 20:00:05,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:05,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:05,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:05,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1548 states have (on average 1.3404392764857882) internal successors, (2075), 1575 states have internal predecessors, (2075), 223 states have call successors, (223), 146 states have call predecessors, (223), 173 states have return successors, (272), 227 states have call predecessors, (272), 219 states have call successors, (272) [2022-02-20 20:00:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2570 transitions. [2022-02-20 20:00:05,628 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2570 transitions. Word has length 80 [2022-02-20 20:00:05,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:05,628 INFO L470 AbstractCegarLoop]: Abstraction has 1946 states and 2570 transitions. [2022-02-20 20:00:05,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2570 transitions. [2022-02-20 20:00:05,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 20:00:05,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:05,629 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:05,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:00:05,630 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:05,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:05,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1347684338, now seen corresponding path program 1 times [2022-02-20 20:00:05,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:05,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863643227] [2022-02-20 20:00:05,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:05,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:05,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:05,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {55814#true} assume true; {55814#true} is VALID [2022-02-20 20:00:05,665 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {55814#true} {55816#(= ~T1_E~0 ~M_E~0)} #994#return; {55816#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:05,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 20:00:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:05,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {55870#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {55871#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:05,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {55871#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:05,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:05,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:05,707 INFO L290 TraceCheckUtils]: 4: Hoare triple {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:05,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:05,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:05,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:05,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:05,709 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {55816#(= ~T1_E~0 ~M_E~0)} #996#return; {55815#false} is VALID [2022-02-20 20:00:05,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 20:00:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:05,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {55873#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {55814#true} is VALID [2022-02-20 20:00:05,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {55814#true} assume !(1 == ~m_pc~0); {55814#true} is VALID [2022-02-20 20:00:05,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {55814#true} is_master_triggered_~__retres1~4#1 := 0; {55814#true} is VALID [2022-02-20 20:00:05,727 INFO L290 TraceCheckUtils]: 3: Hoare triple {55814#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {55814#true} is VALID [2022-02-20 20:00:05,728 INFO L290 TraceCheckUtils]: 4: Hoare triple {55814#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {55814#true} is VALID [2022-02-20 20:00:05,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {55814#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {55814#true} is VALID [2022-02-20 20:00:05,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {55814#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; {55814#true} is VALID [2022-02-20 20:00:05,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {55814#true} assume 1 == ~t1_pc~0; {55814#true} is VALID [2022-02-20 20:00:05,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {55814#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {55814#true} is VALID [2022-02-20 20:00:05,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {55814#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {55814#true} is VALID [2022-02-20 20:00:05,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {55814#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {55814#true} is VALID [2022-02-20 20:00:05,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {55814#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {55814#true} is VALID [2022-02-20 20:00:05,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {55814#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; {55814#true} is VALID [2022-02-20 20:00:05,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {55814#true} assume !(1 == ~t2_pc~0); {55814#true} is VALID [2022-02-20 20:00:05,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {55814#true} is_transmit2_triggered_~__retres1~6#1 := 0; {55814#true} is VALID [2022-02-20 20:00:05,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {55814#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {55814#true} is VALID [2022-02-20 20:00:05,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {55814#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {55814#true} is VALID [2022-02-20 20:00:05,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {55814#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {55814#true} is VALID [2022-02-20 20:00:05,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {55814#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {55814#true} is VALID [2022-02-20 20:00:05,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {55814#true} assume 1 == ~t3_pc~0; {55814#true} is VALID [2022-02-20 20:00:05,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {55814#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {55814#true} is VALID [2022-02-20 20:00:05,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {55814#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {55814#true} is VALID [2022-02-20 20:00:05,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {55814#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {55814#true} is VALID [2022-02-20 20:00:05,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {55814#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {55814#true} is VALID [2022-02-20 20:00:05,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {55814#true} assume true; {55814#true} is VALID [2022-02-20 20:00:05,731 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {55814#true} {55815#false} #998#return; {55815#false} is VALID [2022-02-20 20:00:05,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 20:00:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:05,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {55870#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {55814#true} is VALID [2022-02-20 20:00:05,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {55814#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {55814#true} is VALID [2022-02-20 20:00:05,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {55814#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {55814#true} is VALID [2022-02-20 20:00:05,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {55814#true} assume !(1 == ~T3_E~0); {55814#true} is VALID [2022-02-20 20:00:05,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {55814#true} assume 1 == ~E_M~0;~E_M~0 := 2; {55814#true} is VALID [2022-02-20 20:00:05,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {55814#true} assume 1 == ~E_1~0;~E_1~0 := 2; {55814#true} is VALID [2022-02-20 20:00:05,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {55814#true} assume 1 == ~E_2~0;~E_2~0 := 2; {55814#true} is VALID [2022-02-20 20:00:05,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {55814#true} assume 1 == ~E_3~0;~E_3~0 := 2; {55814#true} is VALID [2022-02-20 20:00:05,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {55814#true} assume true; {55814#true} is VALID [2022-02-20 20:00:05,737 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {55814#true} {55815#false} #1000#return; {55815#false} is VALID [2022-02-20 20:00:05,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:05,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {55814#true} havoc ~__retres1~8; {55814#true} is VALID [2022-02-20 20:00:05,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {55814#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {55814#true} is VALID [2022-02-20 20:00:05,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {55814#true} #res := ~__retres1~8; {55814#true} is VALID [2022-02-20 20:00:05,741 INFO L290 TraceCheckUtils]: 3: Hoare triple {55814#true} assume true; {55814#true} is VALID [2022-02-20 20:00:05,741 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {55814#true} {55815#false} #1002#return; {55815#false} is VALID [2022-02-20 20:00:05,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {55814#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {55816#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:05,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {55816#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {55816#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:05,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {55816#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet34#1);havoc main_#t~nondet34#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {55816#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:05,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {55816#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret32#1, start_simulation2_#t~ret33#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; {55816#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:05,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {55816#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {55814#true} is VALID [2022-02-20 20:00:05,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {55814#true} assume true; {55814#true} is VALID [2022-02-20 20:00:05,744 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {55814#true} {55816#(= ~T1_E~0 ~M_E~0)} #994#return; {55816#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:05,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {55816#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {55816#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:05,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {55816#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {55816#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:05,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {55816#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {55816#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:05,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {55816#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {55816#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:05,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {55816#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {55816#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:05,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {55816#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {55816#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:05,747 INFO L272 TraceCheckUtils]: 13: Hoare triple {55816#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {55870#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:05,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {55870#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {55871#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:05,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {55871#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:05,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:05,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:05,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:05,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:05,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:05,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:05,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:05,751 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {55872#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {55816#(= ~T1_E~0 ~M_E~0)} #996#return; {55815#false} is VALID [2022-02-20 20:00:05,751 INFO L272 TraceCheckUtils]: 24: Hoare triple {55815#false} call activate_threads2(); {55873#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 20:00:05,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {55873#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {55814#true} is VALID [2022-02-20 20:00:05,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {55814#true} assume !(1 == ~m_pc~0); {55814#true} is VALID [2022-02-20 20:00:05,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {55814#true} is_master_triggered_~__retres1~4#1 := 0; {55814#true} is VALID [2022-02-20 20:00:05,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {55814#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {55814#true} is VALID [2022-02-20 20:00:05,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {55814#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {55814#true} is VALID [2022-02-20 20:00:05,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {55814#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {55814#true} is VALID [2022-02-20 20:00:05,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {55814#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; {55814#true} is VALID [2022-02-20 20:00:05,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {55814#true} assume 1 == ~t1_pc~0; {55814#true} is VALID [2022-02-20 20:00:05,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {55814#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {55814#true} is VALID [2022-02-20 20:00:05,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {55814#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {55814#true} is VALID [2022-02-20 20:00:05,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {55814#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {55814#true} is VALID [2022-02-20 20:00:05,753 INFO L290 TraceCheckUtils]: 36: Hoare triple {55814#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {55814#true} is VALID [2022-02-20 20:00:05,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {55814#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; {55814#true} is VALID [2022-02-20 20:00:05,753 INFO L290 TraceCheckUtils]: 38: Hoare triple {55814#true} assume !(1 == ~t2_pc~0); {55814#true} is VALID [2022-02-20 20:00:05,753 INFO L290 TraceCheckUtils]: 39: Hoare triple {55814#true} is_transmit2_triggered_~__retres1~6#1 := 0; {55814#true} is VALID [2022-02-20 20:00:05,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {55814#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {55814#true} is VALID [2022-02-20 20:00:05,754 INFO L290 TraceCheckUtils]: 41: Hoare triple {55814#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {55814#true} is VALID [2022-02-20 20:00:05,754 INFO L290 TraceCheckUtils]: 42: Hoare triple {55814#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {55814#true} is VALID [2022-02-20 20:00:05,754 INFO L290 TraceCheckUtils]: 43: Hoare triple {55814#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {55814#true} is VALID [2022-02-20 20:00:05,754 INFO L290 TraceCheckUtils]: 44: Hoare triple {55814#true} assume 1 == ~t3_pc~0; {55814#true} is VALID [2022-02-20 20:00:05,754 INFO L290 TraceCheckUtils]: 45: Hoare triple {55814#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {55814#true} is VALID [2022-02-20 20:00:05,754 INFO L290 TraceCheckUtils]: 46: Hoare triple {55814#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {55814#true} is VALID [2022-02-20 20:00:05,755 INFO L290 TraceCheckUtils]: 47: Hoare triple {55814#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {55814#true} is VALID [2022-02-20 20:00:05,755 INFO L290 TraceCheckUtils]: 48: Hoare triple {55814#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {55814#true} is VALID [2022-02-20 20:00:05,755 INFO L290 TraceCheckUtils]: 49: Hoare triple {55814#true} assume true; {55814#true} is VALID [2022-02-20 20:00:05,755 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {55814#true} {55815#false} #998#return; {55815#false} is VALID [2022-02-20 20:00:05,755 INFO L272 TraceCheckUtils]: 51: Hoare triple {55815#false} call reset_delta_events2(); {55870#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:05,755 INFO L290 TraceCheckUtils]: 52: Hoare triple {55870#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {55814#true} is VALID [2022-02-20 20:00:05,755 INFO L290 TraceCheckUtils]: 53: Hoare triple {55814#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {55814#true} is VALID [2022-02-20 20:00:05,756 INFO L290 TraceCheckUtils]: 54: Hoare triple {55814#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {55814#true} is VALID [2022-02-20 20:00:05,756 INFO L290 TraceCheckUtils]: 55: Hoare triple {55814#true} assume !(1 == ~T3_E~0); {55814#true} is VALID [2022-02-20 20:00:05,756 INFO L290 TraceCheckUtils]: 56: Hoare triple {55814#true} assume 1 == ~E_M~0;~E_M~0 := 2; {55814#true} is VALID [2022-02-20 20:00:05,756 INFO L290 TraceCheckUtils]: 57: Hoare triple {55814#true} assume 1 == ~E_1~0;~E_1~0 := 2; {55814#true} is VALID [2022-02-20 20:00:05,756 INFO L290 TraceCheckUtils]: 58: Hoare triple {55814#true} assume 1 == ~E_2~0;~E_2~0 := 2; {55814#true} is VALID [2022-02-20 20:00:05,756 INFO L290 TraceCheckUtils]: 59: Hoare triple {55814#true} assume 1 == ~E_3~0;~E_3~0 := 2; {55814#true} is VALID [2022-02-20 20:00:05,756 INFO L290 TraceCheckUtils]: 60: Hoare triple {55814#true} assume true; {55814#true} is VALID [2022-02-20 20:00:05,756 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {55814#true} {55815#false} #1000#return; {55815#false} is VALID [2022-02-20 20:00:05,757 INFO L290 TraceCheckUtils]: 62: Hoare triple {55815#false} assume !false; {55815#false} is VALID [2022-02-20 20:00:05,757 INFO L290 TraceCheckUtils]: 63: Hoare triple {55815#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {55815#false} is VALID [2022-02-20 20:00:05,757 INFO L290 TraceCheckUtils]: 64: Hoare triple {55815#false} assume !false; {55815#false} is VALID [2022-02-20 20:00:05,757 INFO L272 TraceCheckUtils]: 65: Hoare triple {55815#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {55814#true} is VALID [2022-02-20 20:00:05,757 INFO L290 TraceCheckUtils]: 66: Hoare triple {55814#true} havoc ~__retres1~8; {55814#true} is VALID [2022-02-20 20:00:05,757 INFO L290 TraceCheckUtils]: 67: Hoare triple {55814#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {55814#true} is VALID [2022-02-20 20:00:05,757 INFO L290 TraceCheckUtils]: 68: Hoare triple {55814#true} #res := ~__retres1~8; {55814#true} is VALID [2022-02-20 20:00:05,758 INFO L290 TraceCheckUtils]: 69: Hoare triple {55814#true} assume true; {55814#true} is VALID [2022-02-20 20:00:05,758 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {55814#true} {55815#false} #1002#return; {55815#false} is VALID [2022-02-20 20:00:05,758 INFO L290 TraceCheckUtils]: 71: Hoare triple {55815#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; {55815#false} is VALID [2022-02-20 20:00:05,758 INFO L290 TraceCheckUtils]: 72: Hoare triple {55815#false} assume 0 != eval2_~tmp~5#1; {55815#false} is VALID [2022-02-20 20:00:05,758 INFO L290 TraceCheckUtils]: 73: Hoare triple {55815#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; {55815#false} is VALID [2022-02-20 20:00:05,758 INFO L290 TraceCheckUtils]: 74: Hoare triple {55815#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; {55815#false} is VALID [2022-02-20 20:00:05,758 INFO L290 TraceCheckUtils]: 75: Hoare triple {55815#false} assume !(0 == ~m_pc~0); {55815#false} is VALID [2022-02-20 20:00:05,758 INFO L290 TraceCheckUtils]: 76: Hoare triple {55815#false} assume 1 == ~m_pc~0; {55815#false} is VALID [2022-02-20 20:00:05,759 INFO L290 TraceCheckUtils]: 77: Hoare triple {55815#false} assume ~token~0 != 3 + ~local~0; {55815#false} is VALID [2022-02-20 20:00:05,759 INFO L272 TraceCheckUtils]: 78: Hoare triple {55815#false} call error2(); {55815#false} is VALID [2022-02-20 20:00:05,759 INFO L290 TraceCheckUtils]: 79: Hoare triple {55815#false} assume !false; {55815#false} is VALID [2022-02-20 20:00:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:05,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:05,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863643227] [2022-02-20 20:00:05,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863643227] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:05,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:05,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:05,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125546805] [2022-02-20 20:00:05,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:05,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-02-20 20:00:05,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:05,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:05,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:05,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:05,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:05,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:05,821 INFO L87 Difference]: Start difference. First operand 1946 states and 2570 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:08,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:08,663 INFO L93 Difference]: Finished difference Result 2519 states and 3450 transitions. [2022-02-20 20:00:08,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:08,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-02-20 20:00:08,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 981 transitions. [2022-02-20 20:00:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 981 transitions. [2022-02-20 20:00:08,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 981 transitions. [2022-02-20 20:00:09,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 981 edges. 981 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:09,440 INFO L225 Difference]: With dead ends: 2519 [2022-02-20 20:00:09,440 INFO L226 Difference]: Without dead ends: 2224 [2022-02-20 20:00:09,441 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 20:00:09,442 INFO L933 BasicCegarLoop]: 520 mSDtfsCounter, 769 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:09,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [791 Valid, 1575 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:00:09,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2022-02-20 20:00:09,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 2084. [2022-02-20 20:00:09,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:09,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2224 states. Second operand has 2084 states, 1667 states have (on average 1.3521295740851829) internal successors, (2254), 1695 states have internal predecessors, (2254), 235 states have call successors, (235), 152 states have call predecessors, (235), 180 states have return successors, (286), 240 states have call predecessors, (286), 231 states have call successors, (286) [2022-02-20 20:00:09,537 INFO L74 IsIncluded]: Start isIncluded. First operand 2224 states. Second operand has 2084 states, 1667 states have (on average 1.3521295740851829) internal successors, (2254), 1695 states have internal predecessors, (2254), 235 states have call successors, (235), 152 states have call predecessors, (235), 180 states have return successors, (286), 240 states have call predecessors, (286), 231 states have call successors, (286) [2022-02-20 20:00:09,539 INFO L87 Difference]: Start difference. First operand 2224 states. Second operand has 2084 states, 1667 states have (on average 1.3521295740851829) internal successors, (2254), 1695 states have internal predecessors, (2254), 235 states have call successors, (235), 152 states have call predecessors, (235), 180 states have return successors, (286), 240 states have call predecessors, (286), 231 states have call successors, (286) [2022-02-20 20:00:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:09,664 INFO L93 Difference]: Finished difference Result 2224 states and 3002 transitions. [2022-02-20 20:00:09,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3002 transitions. [2022-02-20 20:00:09,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:09,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:09,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 2084 states, 1667 states have (on average 1.3521295740851829) internal successors, (2254), 1695 states have internal predecessors, (2254), 235 states have call successors, (235), 152 states have call predecessors, (235), 180 states have return successors, (286), 240 states have call predecessors, (286), 231 states have call successors, (286) Second operand 2224 states. [2022-02-20 20:00:09,672 INFO L87 Difference]: Start difference. First operand has 2084 states, 1667 states have (on average 1.3521295740851829) internal successors, (2254), 1695 states have internal predecessors, (2254), 235 states have call successors, (235), 152 states have call predecessors, (235), 180 states have return successors, (286), 240 states have call predecessors, (286), 231 states have call successors, (286) Second operand 2224 states. [2022-02-20 20:00:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:09,797 INFO L93 Difference]: Finished difference Result 2224 states and 3002 transitions. [2022-02-20 20:00:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3002 transitions. [2022-02-20 20:00:09,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:09,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:09,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:09,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 1667 states have (on average 1.3521295740851829) internal successors, (2254), 1695 states have internal predecessors, (2254), 235 states have call successors, (235), 152 states have call predecessors, (235), 180 states have return successors, (286), 240 states have call predecessors, (286), 231 states have call successors, (286) [2022-02-20 20:00:09,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2775 transitions. [2022-02-20 20:00:09,971 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2775 transitions. Word has length 80 [2022-02-20 20:00:09,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:09,971 INFO L470 AbstractCegarLoop]: Abstraction has 2084 states and 2775 transitions. [2022-02-20 20:00:09,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2775 transitions. [2022-02-20 20:00:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 20:00:09,972 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:09,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:09,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:00:09,973 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:09,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:09,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1261103120, now seen corresponding path program 1 times [2022-02-20 20:00:09,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:09,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034622478] [2022-02-20 20:00:09,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:09,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:09,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:09,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {66512#true} assume true; {66512#true} is VALID [2022-02-20 20:00:09,996 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {66512#true} {66514#(= ~T2_E~0 ~M_E~0)} #994#return; {66514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:10,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 20:00:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:10,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {66568#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {66569#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:10,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {66569#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {66569#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:10,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {66569#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:10,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:10,034 INFO L290 TraceCheckUtils]: 4: Hoare triple {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:10,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:10,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:10,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:10,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:10,035 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {66514#(= ~T2_E~0 ~M_E~0)} #996#return; {66513#false} is VALID [2022-02-20 20:00:10,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 20:00:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:10,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {66571#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {66512#true} is VALID [2022-02-20 20:00:10,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {66512#true} assume !(1 == ~m_pc~0); {66512#true} is VALID [2022-02-20 20:00:10,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {66512#true} is_master_triggered_~__retres1~4#1 := 0; {66512#true} is VALID [2022-02-20 20:00:10,050 INFO L290 TraceCheckUtils]: 3: Hoare triple {66512#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {66512#true} is VALID [2022-02-20 20:00:10,050 INFO L290 TraceCheckUtils]: 4: Hoare triple {66512#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {66512#true} is VALID [2022-02-20 20:00:10,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {66512#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {66512#true} is VALID [2022-02-20 20:00:10,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {66512#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; {66512#true} is VALID [2022-02-20 20:00:10,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {66512#true} assume 1 == ~t1_pc~0; {66512#true} is VALID [2022-02-20 20:00:10,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {66512#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {66512#true} is VALID [2022-02-20 20:00:10,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {66512#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {66512#true} is VALID [2022-02-20 20:00:10,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {66512#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {66512#true} is VALID [2022-02-20 20:00:10,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {66512#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {66512#true} is VALID [2022-02-20 20:00:10,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {66512#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; {66512#true} is VALID [2022-02-20 20:00:10,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {66512#true} assume !(1 == ~t2_pc~0); {66512#true} is VALID [2022-02-20 20:00:10,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {66512#true} is_transmit2_triggered_~__retres1~6#1 := 0; {66512#true} is VALID [2022-02-20 20:00:10,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {66512#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {66512#true} is VALID [2022-02-20 20:00:10,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {66512#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {66512#true} is VALID [2022-02-20 20:00:10,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {66512#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {66512#true} is VALID [2022-02-20 20:00:10,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {66512#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {66512#true} is VALID [2022-02-20 20:00:10,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {66512#true} assume 1 == ~t3_pc~0; {66512#true} is VALID [2022-02-20 20:00:10,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {66512#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {66512#true} is VALID [2022-02-20 20:00:10,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {66512#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {66512#true} is VALID [2022-02-20 20:00:10,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {66512#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {66512#true} is VALID [2022-02-20 20:00:10,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {66512#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {66512#true} is VALID [2022-02-20 20:00:10,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {66512#true} assume true; {66512#true} is VALID [2022-02-20 20:00:10,052 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {66512#true} {66513#false} #998#return; {66513#false} is VALID [2022-02-20 20:00:10,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 20:00:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:10,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {66568#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {66512#true} is VALID [2022-02-20 20:00:10,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {66512#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {66512#true} is VALID [2022-02-20 20:00:10,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {66512#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {66512#true} is VALID [2022-02-20 20:00:10,059 INFO L290 TraceCheckUtils]: 3: Hoare triple {66512#true} assume !(1 == ~T3_E~0); {66512#true} is VALID [2022-02-20 20:00:10,059 INFO L290 TraceCheckUtils]: 4: Hoare triple {66512#true} assume 1 == ~E_M~0;~E_M~0 := 2; {66512#true} is VALID [2022-02-20 20:00:10,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {66512#true} assume 1 == ~E_1~0;~E_1~0 := 2; {66512#true} is VALID [2022-02-20 20:00:10,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {66512#true} assume 1 == ~E_2~0;~E_2~0 := 2; {66512#true} is VALID [2022-02-20 20:00:10,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {66512#true} assume 1 == ~E_3~0;~E_3~0 := 2; {66512#true} is VALID [2022-02-20 20:00:10,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {66512#true} assume true; {66512#true} is VALID [2022-02-20 20:00:10,060 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {66512#true} {66513#false} #1000#return; {66513#false} is VALID [2022-02-20 20:00:10,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:10,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {66512#true} havoc ~__retres1~8; {66512#true} is VALID [2022-02-20 20:00:10,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {66512#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {66512#true} is VALID [2022-02-20 20:00:10,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {66512#true} #res := ~__retres1~8; {66512#true} is VALID [2022-02-20 20:00:10,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {66512#true} assume true; {66512#true} is VALID [2022-02-20 20:00:10,063 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {66512#true} {66513#false} #1002#return; {66513#false} is VALID [2022-02-20 20:00:10,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {66512#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {66514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:10,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {66514#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {66514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:10,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {66514#(= ~T2_E~0 ~M_E~0)} assume !(0 != main_#t~nondet34#1);havoc main_#t~nondet34#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {66514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:10,064 INFO L290 TraceCheckUtils]: 3: Hoare triple {66514#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret32#1, start_simulation2_#t~ret33#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; {66514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:10,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {66514#(= ~T2_E~0 ~M_E~0)} call update_channels2(); {66512#true} is VALID [2022-02-20 20:00:10,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {66512#true} assume true; {66512#true} is VALID [2022-02-20 20:00:10,065 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {66512#true} {66514#(= ~T2_E~0 ~M_E~0)} #994#return; {66514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:10,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {66514#(= ~T2_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {66514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:10,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {66514#(= ~T2_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {66514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:10,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {66514#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {66514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:10,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {66514#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {66514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:10,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {66514#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {66514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:10,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {66514#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {66514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:10,067 INFO L272 TraceCheckUtils]: 13: Hoare triple {66514#(= ~T2_E~0 ~M_E~0)} call fire_delta_events2(); {66568#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:10,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {66568#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {66569#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:10,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {66569#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {66569#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:10,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {66569#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:10,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:10,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:10,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:10,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:10,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:10,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:10,071 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {66570#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {66514#(= ~T2_E~0 ~M_E~0)} #996#return; {66513#false} is VALID [2022-02-20 20:00:10,071 INFO L272 TraceCheckUtils]: 24: Hoare triple {66513#false} call activate_threads2(); {66571#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 20:00:10,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {66571#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {66512#true} is VALID [2022-02-20 20:00:10,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {66512#true} assume !(1 == ~m_pc~0); {66512#true} is VALID [2022-02-20 20:00:10,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {66512#true} is_master_triggered_~__retres1~4#1 := 0; {66512#true} is VALID [2022-02-20 20:00:10,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {66512#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {66512#true} is VALID [2022-02-20 20:00:10,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {66512#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {66512#true} is VALID [2022-02-20 20:00:10,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {66512#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {66512#true} is VALID [2022-02-20 20:00:10,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {66512#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; {66512#true} is VALID [2022-02-20 20:00:10,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {66512#true} assume 1 == ~t1_pc~0; {66512#true} is VALID [2022-02-20 20:00:10,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {66512#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {66512#true} is VALID [2022-02-20 20:00:10,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {66512#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {66512#true} is VALID [2022-02-20 20:00:10,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {66512#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {66512#true} is VALID [2022-02-20 20:00:10,072 INFO L290 TraceCheckUtils]: 36: Hoare triple {66512#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {66512#true} is VALID [2022-02-20 20:00:10,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {66512#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; {66512#true} is VALID [2022-02-20 20:00:10,072 INFO L290 TraceCheckUtils]: 38: Hoare triple {66512#true} assume !(1 == ~t2_pc~0); {66512#true} is VALID [2022-02-20 20:00:10,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {66512#true} is_transmit2_triggered_~__retres1~6#1 := 0; {66512#true} is VALID [2022-02-20 20:00:10,072 INFO L290 TraceCheckUtils]: 40: Hoare triple {66512#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {66512#true} is VALID [2022-02-20 20:00:10,073 INFO L290 TraceCheckUtils]: 41: Hoare triple {66512#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {66512#true} is VALID [2022-02-20 20:00:10,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {66512#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {66512#true} is VALID [2022-02-20 20:00:10,073 INFO L290 TraceCheckUtils]: 43: Hoare triple {66512#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {66512#true} is VALID [2022-02-20 20:00:10,073 INFO L290 TraceCheckUtils]: 44: Hoare triple {66512#true} assume 1 == ~t3_pc~0; {66512#true} is VALID [2022-02-20 20:00:10,073 INFO L290 TraceCheckUtils]: 45: Hoare triple {66512#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {66512#true} is VALID [2022-02-20 20:00:10,073 INFO L290 TraceCheckUtils]: 46: Hoare triple {66512#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {66512#true} is VALID [2022-02-20 20:00:10,073 INFO L290 TraceCheckUtils]: 47: Hoare triple {66512#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {66512#true} is VALID [2022-02-20 20:00:10,073 INFO L290 TraceCheckUtils]: 48: Hoare triple {66512#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {66512#true} is VALID [2022-02-20 20:00:10,073 INFO L290 TraceCheckUtils]: 49: Hoare triple {66512#true} assume true; {66512#true} is VALID [2022-02-20 20:00:10,073 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {66512#true} {66513#false} #998#return; {66513#false} is VALID [2022-02-20 20:00:10,074 INFO L272 TraceCheckUtils]: 51: Hoare triple {66513#false} call reset_delta_events2(); {66568#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:10,074 INFO L290 TraceCheckUtils]: 52: Hoare triple {66568#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {66512#true} is VALID [2022-02-20 20:00:10,074 INFO L290 TraceCheckUtils]: 53: Hoare triple {66512#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {66512#true} is VALID [2022-02-20 20:00:10,074 INFO L290 TraceCheckUtils]: 54: Hoare triple {66512#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {66512#true} is VALID [2022-02-20 20:00:10,074 INFO L290 TraceCheckUtils]: 55: Hoare triple {66512#true} assume !(1 == ~T3_E~0); {66512#true} is VALID [2022-02-20 20:00:10,074 INFO L290 TraceCheckUtils]: 56: Hoare triple {66512#true} assume 1 == ~E_M~0;~E_M~0 := 2; {66512#true} is VALID [2022-02-20 20:00:10,074 INFO L290 TraceCheckUtils]: 57: Hoare triple {66512#true} assume 1 == ~E_1~0;~E_1~0 := 2; {66512#true} is VALID [2022-02-20 20:00:10,074 INFO L290 TraceCheckUtils]: 58: Hoare triple {66512#true} assume 1 == ~E_2~0;~E_2~0 := 2; {66512#true} is VALID [2022-02-20 20:00:10,074 INFO L290 TraceCheckUtils]: 59: Hoare triple {66512#true} assume 1 == ~E_3~0;~E_3~0 := 2; {66512#true} is VALID [2022-02-20 20:00:10,075 INFO L290 TraceCheckUtils]: 60: Hoare triple {66512#true} assume true; {66512#true} is VALID [2022-02-20 20:00:10,075 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {66512#true} {66513#false} #1000#return; {66513#false} is VALID [2022-02-20 20:00:10,075 INFO L290 TraceCheckUtils]: 62: Hoare triple {66513#false} assume !false; {66513#false} is VALID [2022-02-20 20:00:10,075 INFO L290 TraceCheckUtils]: 63: Hoare triple {66513#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {66513#false} is VALID [2022-02-20 20:00:10,075 INFO L290 TraceCheckUtils]: 64: Hoare triple {66513#false} assume !false; {66513#false} is VALID [2022-02-20 20:00:10,075 INFO L272 TraceCheckUtils]: 65: Hoare triple {66513#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {66512#true} is VALID [2022-02-20 20:00:10,075 INFO L290 TraceCheckUtils]: 66: Hoare triple {66512#true} havoc ~__retres1~8; {66512#true} is VALID [2022-02-20 20:00:10,075 INFO L290 TraceCheckUtils]: 67: Hoare triple {66512#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {66512#true} is VALID [2022-02-20 20:00:10,075 INFO L290 TraceCheckUtils]: 68: Hoare triple {66512#true} #res := ~__retres1~8; {66512#true} is VALID [2022-02-20 20:00:10,075 INFO L290 TraceCheckUtils]: 69: Hoare triple {66512#true} assume true; {66512#true} is VALID [2022-02-20 20:00:10,076 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {66512#true} {66513#false} #1002#return; {66513#false} is VALID [2022-02-20 20:00:10,076 INFO L290 TraceCheckUtils]: 71: Hoare triple {66513#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; {66513#false} is VALID [2022-02-20 20:00:10,076 INFO L290 TraceCheckUtils]: 72: Hoare triple {66513#false} assume 0 != eval2_~tmp~5#1; {66513#false} is VALID [2022-02-20 20:00:10,076 INFO L290 TraceCheckUtils]: 73: Hoare triple {66513#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; {66513#false} is VALID [2022-02-20 20:00:10,076 INFO L290 TraceCheckUtils]: 74: Hoare triple {66513#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; {66513#false} is VALID [2022-02-20 20:00:10,076 INFO L290 TraceCheckUtils]: 75: Hoare triple {66513#false} assume !(0 == ~m_pc~0); {66513#false} is VALID [2022-02-20 20:00:10,076 INFO L290 TraceCheckUtils]: 76: Hoare triple {66513#false} assume 1 == ~m_pc~0; {66513#false} is VALID [2022-02-20 20:00:10,076 INFO L290 TraceCheckUtils]: 77: Hoare triple {66513#false} assume ~token~0 != 3 + ~local~0; {66513#false} is VALID [2022-02-20 20:00:10,076 INFO L272 TraceCheckUtils]: 78: Hoare triple {66513#false} call error2(); {66513#false} is VALID [2022-02-20 20:00:10,076 INFO L290 TraceCheckUtils]: 79: Hoare triple {66513#false} assume !false; {66513#false} is VALID [2022-02-20 20:00:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:10,077 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:10,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034622478] [2022-02-20 20:00:10,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034622478] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:10,077 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:10,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:10,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269316716] [2022-02-20 20:00:10,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:10,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-02-20 20:00:10,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:10,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:10,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:10,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:10,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:10,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:10,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:10,119 INFO L87 Difference]: Start difference. First operand 2084 states and 2775 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:13,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:13,313 INFO L93 Difference]: Finished difference Result 3016 states and 4203 transitions. [2022-02-20 20:00:13,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:13,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-02-20 20:00:13,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:13,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 986 transitions. [2022-02-20 20:00:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 986 transitions. [2022-02-20 20:00:13,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 986 transitions. [2022-02-20 20:00:13,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 986 edges. 986 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:14,218 INFO L225 Difference]: With dead ends: 3016 [2022-02-20 20:00:14,219 INFO L226 Difference]: Without dead ends: 2583 [2022-02-20 20:00:14,222 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 20:00:14,224 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 766 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:14,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [788 Valid, 1567 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 20:00:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2022-02-20 20:00:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2361. [2022-02-20 20:00:14,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:14,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2583 states. Second operand has 2361 states, 1906 states have (on average 1.3709338929695698) internal successors, (2613), 1936 states have internal predecessors, (2613), 259 states have call successors, (259), 164 states have call predecessors, (259), 194 states have return successors, (318), 266 states have call predecessors, (318), 255 states have call successors, (318) [2022-02-20 20:00:14,337 INFO L74 IsIncluded]: Start isIncluded. First operand 2583 states. Second operand has 2361 states, 1906 states have (on average 1.3709338929695698) internal successors, (2613), 1936 states have internal predecessors, (2613), 259 states have call successors, (259), 164 states have call predecessors, (259), 194 states have return successors, (318), 266 states have call predecessors, (318), 255 states have call successors, (318) [2022-02-20 20:00:14,338 INFO L87 Difference]: Start difference. First operand 2583 states. Second operand has 2361 states, 1906 states have (on average 1.3709338929695698) internal successors, (2613), 1936 states have internal predecessors, (2613), 259 states have call successors, (259), 164 states have call predecessors, (259), 194 states have return successors, (318), 266 states have call predecessors, (318), 255 states have call successors, (318) [2022-02-20 20:00:14,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:14,519 INFO L93 Difference]: Finished difference Result 2583 states and 3547 transitions. [2022-02-20 20:00:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 3547 transitions. [2022-02-20 20:00:14,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:14,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:14,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 2361 states, 1906 states have (on average 1.3709338929695698) internal successors, (2613), 1936 states have internal predecessors, (2613), 259 states have call successors, (259), 164 states have call predecessors, (259), 194 states have return successors, (318), 266 states have call predecessors, (318), 255 states have call successors, (318) Second operand 2583 states. [2022-02-20 20:00:14,528 INFO L87 Difference]: Start difference. First operand has 2361 states, 1906 states have (on average 1.3709338929695698) internal successors, (2613), 1936 states have internal predecessors, (2613), 259 states have call successors, (259), 164 states have call predecessors, (259), 194 states have return successors, (318), 266 states have call predecessors, (318), 255 states have call successors, (318) Second operand 2583 states. [2022-02-20 20:00:14,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:14,701 INFO L93 Difference]: Finished difference Result 2583 states and 3547 transitions. [2022-02-20 20:00:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 3547 transitions. [2022-02-20 20:00:14,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:14,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:14,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:14,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 1906 states have (on average 1.3709338929695698) internal successors, (2613), 1936 states have internal predecessors, (2613), 259 states have call successors, (259), 164 states have call predecessors, (259), 194 states have return successors, (318), 266 states have call predecessors, (318), 255 states have call successors, (318) [2022-02-20 20:00:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3190 transitions. [2022-02-20 20:00:14,951 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3190 transitions. Word has length 80 [2022-02-20 20:00:14,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:14,951 INFO L470 AbstractCegarLoop]: Abstraction has 2361 states and 3190 transitions. [2022-02-20 20:00:14,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3190 transitions. [2022-02-20 20:00:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 20:00:14,952 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:14,952 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:14,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:00:14,953 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:14,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:14,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1206710222, now seen corresponding path program 1 times [2022-02-20 20:00:14,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:14,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81894198] [2022-02-20 20:00:14,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:14,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {78929#true} assume true; {78929#true} is VALID [2022-02-20 20:00:14,985 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {78929#true} {78931#(= ~T3_E~0 ~M_E~0)} #994#return; {78931#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:14,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 20:00:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:15,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {78985#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {78986#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:15,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {78986#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~T1_E~0); {78986#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:15,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {78986#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~T2_E~0); {78986#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:15,013 INFO L290 TraceCheckUtils]: 3: Hoare triple {78986#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:15,013 INFO L290 TraceCheckUtils]: 4: Hoare triple {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:15,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:15,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:15,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:15,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume true; {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:15,015 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} {78931#(= ~T3_E~0 ~M_E~0)} #996#return; {78930#false} is VALID [2022-02-20 20:00:15,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 20:00:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:15,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {78988#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {78929#true} is VALID [2022-02-20 20:00:15,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {78929#true} assume !(1 == ~m_pc~0); {78929#true} is VALID [2022-02-20 20:00:15,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {78929#true} is_master_triggered_~__retres1~4#1 := 0; {78929#true} is VALID [2022-02-20 20:00:15,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {78929#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {78929#true} is VALID [2022-02-20 20:00:15,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {78929#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {78929#true} is VALID [2022-02-20 20:00:15,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {78929#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {78929#true} is VALID [2022-02-20 20:00:15,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {78929#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; {78929#true} is VALID [2022-02-20 20:00:15,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {78929#true} assume 1 == ~t1_pc~0; {78929#true} is VALID [2022-02-20 20:00:15,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {78929#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {78929#true} is VALID [2022-02-20 20:00:15,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {78929#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {78929#true} is VALID [2022-02-20 20:00:15,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {78929#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {78929#true} is VALID [2022-02-20 20:00:15,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {78929#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {78929#true} is VALID [2022-02-20 20:00:15,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {78929#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; {78929#true} is VALID [2022-02-20 20:00:15,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {78929#true} assume !(1 == ~t2_pc~0); {78929#true} is VALID [2022-02-20 20:00:15,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {78929#true} is_transmit2_triggered_~__retres1~6#1 := 0; {78929#true} is VALID [2022-02-20 20:00:15,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {78929#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {78929#true} is VALID [2022-02-20 20:00:15,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {78929#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {78929#true} is VALID [2022-02-20 20:00:15,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {78929#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {78929#true} is VALID [2022-02-20 20:00:15,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {78929#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {78929#true} is VALID [2022-02-20 20:00:15,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {78929#true} assume 1 == ~t3_pc~0; {78929#true} is VALID [2022-02-20 20:00:15,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {78929#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {78929#true} is VALID [2022-02-20 20:00:15,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {78929#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {78929#true} is VALID [2022-02-20 20:00:15,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {78929#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {78929#true} is VALID [2022-02-20 20:00:15,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {78929#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {78929#true} is VALID [2022-02-20 20:00:15,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {78929#true} assume true; {78929#true} is VALID [2022-02-20 20:00:15,031 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {78929#true} {78930#false} #998#return; {78930#false} is VALID [2022-02-20 20:00:15,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 20:00:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:15,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {78985#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {78929#true} is VALID [2022-02-20 20:00:15,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {78929#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {78929#true} is VALID [2022-02-20 20:00:15,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {78929#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {78929#true} is VALID [2022-02-20 20:00:15,035 INFO L290 TraceCheckUtils]: 3: Hoare triple {78929#true} assume !(1 == ~T3_E~0); {78929#true} is VALID [2022-02-20 20:00:15,035 INFO L290 TraceCheckUtils]: 4: Hoare triple {78929#true} assume 1 == ~E_M~0;~E_M~0 := 2; {78929#true} is VALID [2022-02-20 20:00:15,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {78929#true} assume 1 == ~E_1~0;~E_1~0 := 2; {78929#true} is VALID [2022-02-20 20:00:15,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {78929#true} assume 1 == ~E_2~0;~E_2~0 := 2; {78929#true} is VALID [2022-02-20 20:00:15,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {78929#true} assume 1 == ~E_3~0;~E_3~0 := 2; {78929#true} is VALID [2022-02-20 20:00:15,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {78929#true} assume true; {78929#true} is VALID [2022-02-20 20:00:15,036 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {78929#true} {78930#false} #1000#return; {78930#false} is VALID [2022-02-20 20:00:15,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:15,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {78929#true} havoc ~__retres1~8; {78929#true} is VALID [2022-02-20 20:00:15,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {78929#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {78929#true} is VALID [2022-02-20 20:00:15,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {78929#true} #res := ~__retres1~8; {78929#true} is VALID [2022-02-20 20:00:15,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {78929#true} assume true; {78929#true} is VALID [2022-02-20 20:00:15,038 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {78929#true} {78930#false} #1002#return; {78930#false} is VALID [2022-02-20 20:00:15,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {78929#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {78931#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:15,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {78931#(= ~T3_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {78931#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:15,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {78931#(= ~T3_E~0 ~M_E~0)} assume !(0 != main_#t~nondet34#1);havoc main_#t~nondet34#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {78931#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:15,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {78931#(= ~T3_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret32#1, start_simulation2_#t~ret33#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; {78931#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:15,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {78931#(= ~T3_E~0 ~M_E~0)} call update_channels2(); {78929#true} is VALID [2022-02-20 20:00:15,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {78929#true} assume true; {78929#true} is VALID [2022-02-20 20:00:15,041 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {78929#true} {78931#(= ~T3_E~0 ~M_E~0)} #994#return; {78931#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:15,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {78931#(= ~T3_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {78931#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:15,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {78931#(= ~T3_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {78931#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:15,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {78931#(= ~T3_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {78931#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:15,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {78931#(= ~T3_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {78931#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:15,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {78931#(= ~T3_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {78931#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:15,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {78931#(= ~T3_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {78931#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:15,043 INFO L272 TraceCheckUtils]: 13: Hoare triple {78931#(= ~T3_E~0 ~M_E~0)} call fire_delta_events2(); {78985#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:15,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {78985#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {78986#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:15,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {78986#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~T1_E~0); {78986#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:15,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {78986#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~T2_E~0); {78986#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:15,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {78986#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:15,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:15,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:15,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:15,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:15,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume true; {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:15,046 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {78987#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} {78931#(= ~T3_E~0 ~M_E~0)} #996#return; {78930#false} is VALID [2022-02-20 20:00:15,046 INFO L272 TraceCheckUtils]: 24: Hoare triple {78930#false} call activate_threads2(); {78988#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 20:00:15,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {78988#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {78929#true} is VALID [2022-02-20 20:00:15,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {78929#true} assume !(1 == ~m_pc~0); {78929#true} is VALID [2022-02-20 20:00:15,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {78929#true} is_master_triggered_~__retres1~4#1 := 0; {78929#true} is VALID [2022-02-20 20:00:15,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {78929#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {78929#true} is VALID [2022-02-20 20:00:15,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {78929#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {78929#true} is VALID [2022-02-20 20:00:15,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {78929#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {78929#true} is VALID [2022-02-20 20:00:15,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {78929#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; {78929#true} is VALID [2022-02-20 20:00:15,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {78929#true} assume 1 == ~t1_pc~0; {78929#true} is VALID [2022-02-20 20:00:15,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {78929#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {78929#true} is VALID [2022-02-20 20:00:15,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {78929#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {78929#true} is VALID [2022-02-20 20:00:15,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {78929#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {78929#true} is VALID [2022-02-20 20:00:15,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {78929#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {78929#true} is VALID [2022-02-20 20:00:15,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {78929#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; {78929#true} is VALID [2022-02-20 20:00:15,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {78929#true} assume !(1 == ~t2_pc~0); {78929#true} is VALID [2022-02-20 20:00:15,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {78929#true} is_transmit2_triggered_~__retres1~6#1 := 0; {78929#true} is VALID [2022-02-20 20:00:15,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {78929#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {78929#true} is VALID [2022-02-20 20:00:15,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {78929#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {78929#true} is VALID [2022-02-20 20:00:15,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {78929#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {78929#true} is VALID [2022-02-20 20:00:15,048 INFO L290 TraceCheckUtils]: 43: Hoare triple {78929#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {78929#true} is VALID [2022-02-20 20:00:15,048 INFO L290 TraceCheckUtils]: 44: Hoare triple {78929#true} assume 1 == ~t3_pc~0; {78929#true} is VALID [2022-02-20 20:00:15,048 INFO L290 TraceCheckUtils]: 45: Hoare triple {78929#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {78929#true} is VALID [2022-02-20 20:00:15,048 INFO L290 TraceCheckUtils]: 46: Hoare triple {78929#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {78929#true} is VALID [2022-02-20 20:00:15,048 INFO L290 TraceCheckUtils]: 47: Hoare triple {78929#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {78929#true} is VALID [2022-02-20 20:00:15,049 INFO L290 TraceCheckUtils]: 48: Hoare triple {78929#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {78929#true} is VALID [2022-02-20 20:00:15,049 INFO L290 TraceCheckUtils]: 49: Hoare triple {78929#true} assume true; {78929#true} is VALID [2022-02-20 20:00:15,049 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {78929#true} {78930#false} #998#return; {78930#false} is VALID [2022-02-20 20:00:15,049 INFO L272 TraceCheckUtils]: 51: Hoare triple {78930#false} call reset_delta_events2(); {78985#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:15,049 INFO L290 TraceCheckUtils]: 52: Hoare triple {78985#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {78929#true} is VALID [2022-02-20 20:00:15,049 INFO L290 TraceCheckUtils]: 53: Hoare triple {78929#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {78929#true} is VALID [2022-02-20 20:00:15,049 INFO L290 TraceCheckUtils]: 54: Hoare triple {78929#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {78929#true} is VALID [2022-02-20 20:00:15,049 INFO L290 TraceCheckUtils]: 55: Hoare triple {78929#true} assume !(1 == ~T3_E~0); {78929#true} is VALID [2022-02-20 20:00:15,049 INFO L290 TraceCheckUtils]: 56: Hoare triple {78929#true} assume 1 == ~E_M~0;~E_M~0 := 2; {78929#true} is VALID [2022-02-20 20:00:15,049 INFO L290 TraceCheckUtils]: 57: Hoare triple {78929#true} assume 1 == ~E_1~0;~E_1~0 := 2; {78929#true} is VALID [2022-02-20 20:00:15,050 INFO L290 TraceCheckUtils]: 58: Hoare triple {78929#true} assume 1 == ~E_2~0;~E_2~0 := 2; {78929#true} is VALID [2022-02-20 20:00:15,050 INFO L290 TraceCheckUtils]: 59: Hoare triple {78929#true} assume 1 == ~E_3~0;~E_3~0 := 2; {78929#true} is VALID [2022-02-20 20:00:15,050 INFO L290 TraceCheckUtils]: 60: Hoare triple {78929#true} assume true; {78929#true} is VALID [2022-02-20 20:00:15,050 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {78929#true} {78930#false} #1000#return; {78930#false} is VALID [2022-02-20 20:00:15,050 INFO L290 TraceCheckUtils]: 62: Hoare triple {78930#false} assume !false; {78930#false} is VALID [2022-02-20 20:00:15,050 INFO L290 TraceCheckUtils]: 63: Hoare triple {78930#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {78930#false} is VALID [2022-02-20 20:00:15,050 INFO L290 TraceCheckUtils]: 64: Hoare triple {78930#false} assume !false; {78930#false} is VALID [2022-02-20 20:00:15,050 INFO L272 TraceCheckUtils]: 65: Hoare triple {78930#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {78929#true} is VALID [2022-02-20 20:00:15,050 INFO L290 TraceCheckUtils]: 66: Hoare triple {78929#true} havoc ~__retres1~8; {78929#true} is VALID [2022-02-20 20:00:15,051 INFO L290 TraceCheckUtils]: 67: Hoare triple {78929#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {78929#true} is VALID [2022-02-20 20:00:15,051 INFO L290 TraceCheckUtils]: 68: Hoare triple {78929#true} #res := ~__retres1~8; {78929#true} is VALID [2022-02-20 20:00:15,051 INFO L290 TraceCheckUtils]: 69: Hoare triple {78929#true} assume true; {78929#true} is VALID [2022-02-20 20:00:15,051 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {78929#true} {78930#false} #1002#return; {78930#false} is VALID [2022-02-20 20:00:15,051 INFO L290 TraceCheckUtils]: 71: Hoare triple {78930#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; {78930#false} is VALID [2022-02-20 20:00:15,051 INFO L290 TraceCheckUtils]: 72: Hoare triple {78930#false} assume 0 != eval2_~tmp~5#1; {78930#false} is VALID [2022-02-20 20:00:15,051 INFO L290 TraceCheckUtils]: 73: Hoare triple {78930#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; {78930#false} is VALID [2022-02-20 20:00:15,051 INFO L290 TraceCheckUtils]: 74: Hoare triple {78930#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; {78930#false} is VALID [2022-02-20 20:00:15,051 INFO L290 TraceCheckUtils]: 75: Hoare triple {78930#false} assume !(0 == ~m_pc~0); {78930#false} is VALID [2022-02-20 20:00:15,052 INFO L290 TraceCheckUtils]: 76: Hoare triple {78930#false} assume 1 == ~m_pc~0; {78930#false} is VALID [2022-02-20 20:00:15,052 INFO L290 TraceCheckUtils]: 77: Hoare triple {78930#false} assume ~token~0 != 3 + ~local~0; {78930#false} is VALID [2022-02-20 20:00:15,052 INFO L272 TraceCheckUtils]: 78: Hoare triple {78930#false} call error2(); {78930#false} is VALID [2022-02-20 20:00:15,052 INFO L290 TraceCheckUtils]: 79: Hoare triple {78930#false} assume !false; {78930#false} is VALID [2022-02-20 20:00:15,052 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:15,052 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:15,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81894198] [2022-02-20 20:00:15,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81894198] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:15,053 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:15,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:15,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449980533] [2022-02-20 20:00:15,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:15,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-02-20 20:00:15,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:15,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:15,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:15,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:15,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:15,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:15,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:15,094 INFO L87 Difference]: Start difference. First operand 2361 states and 3190 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:18,808 INFO L93 Difference]: Finished difference Result 3977 states and 5658 transitions. [2022-02-20 20:00:18,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:18,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-02-20 20:00:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:18,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 984 transitions. [2022-02-20 20:00:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 984 transitions. [2022-02-20 20:00:18,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 984 transitions. [2022-02-20 20:00:19,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 984 edges. 984 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:20,010 INFO L225 Difference]: With dead ends: 3977 [2022-02-20 20:00:20,011 INFO L226 Difference]: Without dead ends: 3267 [2022-02-20 20:00:20,013 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 20:00:20,013 INFO L933 BasicCegarLoop]: 410 mSDtfsCounter, 806 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:20,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [828 Valid, 1205 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:00:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3267 states. [2022-02-20 20:00:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3267 to 2916. [2022-02-20 20:00:20,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:20,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3267 states. Second operand has 2916 states, 2385 states have (on average 1.3966457023060797) internal successors, (3331), 2419 states have internal predecessors, (3331), 307 states have call successors, (307), 188 states have call predecessors, (307), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2022-02-20 20:00:20,140 INFO L74 IsIncluded]: Start isIncluded. First operand 3267 states. Second operand has 2916 states, 2385 states have (on average 1.3966457023060797) internal successors, (3331), 2419 states have internal predecessors, (3331), 307 states have call successors, (307), 188 states have call predecessors, (307), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2022-02-20 20:00:20,142 INFO L87 Difference]: Start difference. First operand 3267 states. Second operand has 2916 states, 2385 states have (on average 1.3966457023060797) internal successors, (3331), 2419 states have internal predecessors, (3331), 307 states have call successors, (307), 188 states have call predecessors, (307), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2022-02-20 20:00:20,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:20,449 INFO L93 Difference]: Finished difference Result 3267 states and 4581 transitions. [2022-02-20 20:00:20,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3267 states and 4581 transitions. [2022-02-20 20:00:20,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:20,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:20,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 2916 states, 2385 states have (on average 1.3966457023060797) internal successors, (3331), 2419 states have internal predecessors, (3331), 307 states have call successors, (307), 188 states have call predecessors, (307), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) Second operand 3267 states. [2022-02-20 20:00:20,460 INFO L87 Difference]: Start difference. First operand has 2916 states, 2385 states have (on average 1.3966457023060797) internal successors, (3331), 2419 states have internal predecessors, (3331), 307 states have call successors, (307), 188 states have call predecessors, (307), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) Second operand 3267 states. [2022-02-20 20:00:20,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:20,771 INFO L93 Difference]: Finished difference Result 3267 states and 4581 transitions. [2022-02-20 20:00:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3267 states and 4581 transitions. [2022-02-20 20:00:20,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:20,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:20,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:20,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2385 states have (on average 1.3966457023060797) internal successors, (3331), 2419 states have internal predecessors, (3331), 307 states have call successors, (307), 188 states have call predecessors, (307), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2022-02-20 20:00:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 4026 transitions. [2022-02-20 20:00:21,164 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 4026 transitions. Word has length 80 [2022-02-20 20:00:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:21,164 INFO L470 AbstractCegarLoop]: Abstraction has 2916 states and 4026 transitions. [2022-02-20 20:00:21,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 4026 transitions. [2022-02-20 20:00:21,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 20:00:21,166 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:21,166 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:21,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 20:00:21,166 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash 789313616, now seen corresponding path program 1 times [2022-02-20 20:00:21,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:21,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082078327] [2022-02-20 20:00:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:21,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:21,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:21,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {94684#true} assume true; {94684#true} is VALID [2022-02-20 20:00:21,224 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {94684#true} {94686#(not (= ~E_M~0 0))} #994#return; {94686#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:21,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 20:00:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:21,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {94740#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {94741#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 20:00:21,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {94741#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {94741#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 20:00:21,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {94741#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T2_E~0); {94741#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 20:00:21,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {94741#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T3_E~0); {94741#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 20:00:21,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {94741#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {94742#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:21,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {94742#(= |old(~E_M~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {94742#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:21,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {94742#(= |old(~E_M~0)| 0)} assume !(0 == ~E_2~0); {94742#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:21,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {94742#(= |old(~E_M~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {94742#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:21,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {94742#(= |old(~E_M~0)| 0)} assume true; {94742#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:21,244 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {94742#(= |old(~E_M~0)| 0)} {94686#(not (= ~E_M~0 0))} #996#return; {94685#false} is VALID [2022-02-20 20:00:21,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 20:00:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:21,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {94743#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {94684#true} assume !(1 == ~m_pc~0); {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {94684#true} is_master_triggered_~__retres1~4#1 := 0; {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 3: Hoare triple {94684#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 4: Hoare triple {94684#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {94684#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {94684#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; {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {94684#true} assume 1 == ~t1_pc~0; {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {94684#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {94684#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {94684#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {94684#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {94684#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; {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {94684#true} assume !(1 == ~t2_pc~0); {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {94684#true} is_transmit2_triggered_~__retres1~6#1 := 0; {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {94684#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {94684#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {94684#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {94684#true} is VALID [2022-02-20 20:00:21,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {94684#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {94684#true} is VALID [2022-02-20 20:00:21,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {94684#true} assume 1 == ~t3_pc~0; {94684#true} is VALID [2022-02-20 20:00:21,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {94684#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {94684#true} is VALID [2022-02-20 20:00:21,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {94684#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {94684#true} is VALID [2022-02-20 20:00:21,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {94684#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {94684#true} is VALID [2022-02-20 20:00:21,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {94684#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {94684#true} is VALID [2022-02-20 20:00:21,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {94684#true} assume true; {94684#true} is VALID [2022-02-20 20:00:21,273 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {94684#true} {94685#false} #998#return; {94685#false} is VALID [2022-02-20 20:00:21,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 20:00:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:21,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {94740#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {94684#true} is VALID [2022-02-20 20:00:21,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {94684#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {94684#true} is VALID [2022-02-20 20:00:21,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {94684#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {94684#true} is VALID [2022-02-20 20:00:21,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {94684#true} assume !(1 == ~T3_E~0); {94684#true} is VALID [2022-02-20 20:00:21,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {94684#true} assume 1 == ~E_M~0;~E_M~0 := 2; {94684#true} is VALID [2022-02-20 20:00:21,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {94684#true} assume 1 == ~E_1~0;~E_1~0 := 2; {94684#true} is VALID [2022-02-20 20:00:21,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {94684#true} assume 1 == ~E_2~0;~E_2~0 := 2; {94684#true} is VALID [2022-02-20 20:00:21,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {94684#true} assume 1 == ~E_3~0;~E_3~0 := 2; {94684#true} is VALID [2022-02-20 20:00:21,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {94684#true} assume true; {94684#true} is VALID [2022-02-20 20:00:21,279 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {94684#true} {94685#false} #1000#return; {94685#false} is VALID [2022-02-20 20:00:21,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:21,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {94684#true} havoc ~__retres1~8; {94684#true} is VALID [2022-02-20 20:00:21,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {94684#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {94684#true} is VALID [2022-02-20 20:00:21,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {94684#true} #res := ~__retres1~8; {94684#true} is VALID [2022-02-20 20:00:21,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {94684#true} assume true; {94684#true} is VALID [2022-02-20 20:00:21,284 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {94684#true} {94685#false} #1002#return; {94685#false} is VALID [2022-02-20 20:00:21,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {94684#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {94686#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:21,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {94686#(not (= ~E_M~0 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {94686#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:21,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {94686#(not (= ~E_M~0 0))} assume !(0 != main_#t~nondet34#1);havoc main_#t~nondet34#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {94686#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:21,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {94686#(not (= ~E_M~0 0))} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret32#1, start_simulation2_#t~ret33#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; {94686#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:21,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {94686#(not (= ~E_M~0 0))} call update_channels2(); {94684#true} is VALID [2022-02-20 20:00:21,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {94684#true} assume true; {94684#true} is VALID [2022-02-20 20:00:21,287 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {94684#true} {94686#(not (= ~E_M~0 0))} #994#return; {94686#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:21,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {94686#(not (= ~E_M~0 0))} assume { :begin_inline_init_threads2 } true; {94686#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:21,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {94686#(not (= ~E_M~0 0))} assume 1 == ~m_i~0;~m_st~0 := 0; {94686#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:21,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {94686#(not (= ~E_M~0 0))} assume 1 == ~t1_i~0;~t1_st~0 := 0; {94686#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:21,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {94686#(not (= ~E_M~0 0))} assume 1 == ~t2_i~0;~t2_st~0 := 0; {94686#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:21,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {94686#(not (= ~E_M~0 0))} assume 1 == ~t3_i~0;~t3_st~0 := 0; {94686#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:21,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {94686#(not (= ~E_M~0 0))} assume { :end_inline_init_threads2 } true; {94686#(not (= ~E_M~0 0))} is VALID [2022-02-20 20:00:21,288 INFO L272 TraceCheckUtils]: 13: Hoare triple {94686#(not (= ~E_M~0 0))} call fire_delta_events2(); {94740#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:21,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {94740#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {94741#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 20:00:21,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {94741#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {94741#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 20:00:21,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {94741#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T2_E~0); {94741#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 20:00:21,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {94741#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T3_E~0); {94741#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 20:00:21,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {94741#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {94742#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:21,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {94742#(= |old(~E_M~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {94742#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:21,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {94742#(= |old(~E_M~0)| 0)} assume !(0 == ~E_2~0); {94742#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:21,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {94742#(= |old(~E_M~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {94742#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:21,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {94742#(= |old(~E_M~0)| 0)} assume true; {94742#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 20:00:21,291 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94742#(= |old(~E_M~0)| 0)} {94686#(not (= ~E_M~0 0))} #996#return; {94685#false} is VALID [2022-02-20 20:00:21,291 INFO L272 TraceCheckUtils]: 24: Hoare triple {94685#false} call activate_threads2(); {94743#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 20:00:21,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {94743#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {94684#true} is VALID [2022-02-20 20:00:21,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {94684#true} assume !(1 == ~m_pc~0); {94684#true} is VALID [2022-02-20 20:00:21,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {94684#true} is_master_triggered_~__retres1~4#1 := 0; {94684#true} is VALID [2022-02-20 20:00:21,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {94684#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {94684#true} is VALID [2022-02-20 20:00:21,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {94684#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {94684#true} is VALID [2022-02-20 20:00:21,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {94684#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {94684#true} is VALID [2022-02-20 20:00:21,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {94684#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; {94684#true} is VALID [2022-02-20 20:00:21,300 INFO L290 TraceCheckUtils]: 32: Hoare triple {94684#true} assume 1 == ~t1_pc~0; {94684#true} is VALID [2022-02-20 20:00:21,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {94684#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {94684#true} is VALID [2022-02-20 20:00:21,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {94684#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {94684#true} is VALID [2022-02-20 20:00:21,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {94684#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {94684#true} is VALID [2022-02-20 20:00:21,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {94684#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {94684#true} is VALID [2022-02-20 20:00:21,301 INFO L290 TraceCheckUtils]: 37: Hoare triple {94684#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; {94684#true} is VALID [2022-02-20 20:00:21,301 INFO L290 TraceCheckUtils]: 38: Hoare triple {94684#true} assume !(1 == ~t2_pc~0); {94684#true} is VALID [2022-02-20 20:00:21,301 INFO L290 TraceCheckUtils]: 39: Hoare triple {94684#true} is_transmit2_triggered_~__retres1~6#1 := 0; {94684#true} is VALID [2022-02-20 20:00:21,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {94684#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {94684#true} is VALID [2022-02-20 20:00:21,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {94684#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {94684#true} is VALID [2022-02-20 20:00:21,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {94684#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {94684#true} is VALID [2022-02-20 20:00:21,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {94684#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {94684#true} is VALID [2022-02-20 20:00:21,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {94684#true} assume 1 == ~t3_pc~0; {94684#true} is VALID [2022-02-20 20:00:21,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {94684#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {94684#true} is VALID [2022-02-20 20:00:21,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {94684#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {94684#true} is VALID [2022-02-20 20:00:21,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {94684#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {94684#true} is VALID [2022-02-20 20:00:21,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {94684#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {94684#true} is VALID [2022-02-20 20:00:21,302 INFO L290 TraceCheckUtils]: 49: Hoare triple {94684#true} assume true; {94684#true} is VALID [2022-02-20 20:00:21,302 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {94684#true} {94685#false} #998#return; {94685#false} is VALID [2022-02-20 20:00:21,302 INFO L272 TraceCheckUtils]: 51: Hoare triple {94685#false} call reset_delta_events2(); {94740#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:21,302 INFO L290 TraceCheckUtils]: 52: Hoare triple {94740#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {94684#true} is VALID [2022-02-20 20:00:21,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {94684#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {94684#true} is VALID [2022-02-20 20:00:21,303 INFO L290 TraceCheckUtils]: 54: Hoare triple {94684#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {94684#true} is VALID [2022-02-20 20:00:21,303 INFO L290 TraceCheckUtils]: 55: Hoare triple {94684#true} assume !(1 == ~T3_E~0); {94684#true} is VALID [2022-02-20 20:00:21,303 INFO L290 TraceCheckUtils]: 56: Hoare triple {94684#true} assume 1 == ~E_M~0;~E_M~0 := 2; {94684#true} is VALID [2022-02-20 20:00:21,303 INFO L290 TraceCheckUtils]: 57: Hoare triple {94684#true} assume 1 == ~E_1~0;~E_1~0 := 2; {94684#true} is VALID [2022-02-20 20:00:21,303 INFO L290 TraceCheckUtils]: 58: Hoare triple {94684#true} assume 1 == ~E_2~0;~E_2~0 := 2; {94684#true} is VALID [2022-02-20 20:00:21,303 INFO L290 TraceCheckUtils]: 59: Hoare triple {94684#true} assume 1 == ~E_3~0;~E_3~0 := 2; {94684#true} is VALID [2022-02-20 20:00:21,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {94684#true} assume true; {94684#true} is VALID [2022-02-20 20:00:21,303 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {94684#true} {94685#false} #1000#return; {94685#false} is VALID [2022-02-20 20:00:21,304 INFO L290 TraceCheckUtils]: 62: Hoare triple {94685#false} assume !false; {94685#false} is VALID [2022-02-20 20:00:21,304 INFO L290 TraceCheckUtils]: 63: Hoare triple {94685#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {94685#false} is VALID [2022-02-20 20:00:21,304 INFO L290 TraceCheckUtils]: 64: Hoare triple {94685#false} assume !false; {94685#false} is VALID [2022-02-20 20:00:21,304 INFO L272 TraceCheckUtils]: 65: Hoare triple {94685#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {94684#true} is VALID [2022-02-20 20:00:21,304 INFO L290 TraceCheckUtils]: 66: Hoare triple {94684#true} havoc ~__retres1~8; {94684#true} is VALID [2022-02-20 20:00:21,304 INFO L290 TraceCheckUtils]: 67: Hoare triple {94684#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {94684#true} is VALID [2022-02-20 20:00:21,304 INFO L290 TraceCheckUtils]: 68: Hoare triple {94684#true} #res := ~__retres1~8; {94684#true} is VALID [2022-02-20 20:00:21,304 INFO L290 TraceCheckUtils]: 69: Hoare triple {94684#true} assume true; {94684#true} is VALID [2022-02-20 20:00:21,304 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {94684#true} {94685#false} #1002#return; {94685#false} is VALID [2022-02-20 20:00:21,305 INFO L290 TraceCheckUtils]: 71: Hoare triple {94685#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; {94685#false} is VALID [2022-02-20 20:00:21,305 INFO L290 TraceCheckUtils]: 72: Hoare triple {94685#false} assume 0 != eval2_~tmp~5#1; {94685#false} is VALID [2022-02-20 20:00:21,305 INFO L290 TraceCheckUtils]: 73: Hoare triple {94685#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; {94685#false} is VALID [2022-02-20 20:00:21,305 INFO L290 TraceCheckUtils]: 74: Hoare triple {94685#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; {94685#false} is VALID [2022-02-20 20:00:21,305 INFO L290 TraceCheckUtils]: 75: Hoare triple {94685#false} assume !(0 == ~m_pc~0); {94685#false} is VALID [2022-02-20 20:00:21,305 INFO L290 TraceCheckUtils]: 76: Hoare triple {94685#false} assume 1 == ~m_pc~0; {94685#false} is VALID [2022-02-20 20:00:21,305 INFO L290 TraceCheckUtils]: 77: Hoare triple {94685#false} assume ~token~0 != 3 + ~local~0; {94685#false} is VALID [2022-02-20 20:00:21,305 INFO L272 TraceCheckUtils]: 78: Hoare triple {94685#false} call error2(); {94685#false} is VALID [2022-02-20 20:00:21,305 INFO L290 TraceCheckUtils]: 79: Hoare triple {94685#false} assume !false; {94685#false} is VALID [2022-02-20 20:00:21,306 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:21,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:21,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082078327] [2022-02-20 20:00:21,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082078327] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:21,306 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:21,306 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:21,306 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974023150] [2022-02-20 20:00:21,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:21,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-02-20 20:00:21,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:21,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:21,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:21,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:21,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:21,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:21,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:21,389 INFO L87 Difference]: Start difference. First operand 2916 states and 4026 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:23,739 INFO L93 Difference]: Finished difference Result 4527 states and 6511 transitions. [2022-02-20 20:00:23,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:00:23,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-02-20 20:00:23,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 692 transitions. [2022-02-20 20:00:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:23,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 692 transitions. [2022-02-20 20:00:23,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 692 transitions. [2022-02-20 20:00:24,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 692 edges. 692 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:24,796 INFO L225 Difference]: With dead ends: 4527 [2022-02-20 20:00:24,796 INFO L226 Difference]: Without dead ends: 3262 [2022-02-20 20:00:24,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:00:24,799 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 753 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:24,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [776 Valid, 849 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 20:00:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2022-02-20 20:00:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 2916. [2022-02-20 20:00:24,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:24,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3262 states. Second operand has 2916 states, 2385 states have (on average 1.3928721174004193) internal successors, (3322), 2419 states have internal predecessors, (3322), 307 states have call successors, (307), 188 states have call predecessors, (307), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2022-02-20 20:00:24,953 INFO L74 IsIncluded]: Start isIncluded. First operand 3262 states. Second operand has 2916 states, 2385 states have (on average 1.3928721174004193) internal successors, (3322), 2419 states have internal predecessors, (3322), 307 states have call successors, (307), 188 states have call predecessors, (307), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2022-02-20 20:00:24,956 INFO L87 Difference]: Start difference. First operand 3262 states. Second operand has 2916 states, 2385 states have (on average 1.3928721174004193) internal successors, (3322), 2419 states have internal predecessors, (3322), 307 states have call successors, (307), 188 states have call predecessors, (307), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2022-02-20 20:00:25,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:25,294 INFO L93 Difference]: Finished difference Result 3262 states and 4583 transitions. [2022-02-20 20:00:25,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4583 transitions. [2022-02-20 20:00:25,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:25,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:25,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 2916 states, 2385 states have (on average 1.3928721174004193) internal successors, (3322), 2419 states have internal predecessors, (3322), 307 states have call successors, (307), 188 states have call predecessors, (307), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) Second operand 3262 states. [2022-02-20 20:00:25,305 INFO L87 Difference]: Start difference. First operand has 2916 states, 2385 states have (on average 1.3928721174004193) internal successors, (3322), 2419 states have internal predecessors, (3322), 307 states have call successors, (307), 188 states have call predecessors, (307), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) Second operand 3262 states. [2022-02-20 20:00:25,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:25,624 INFO L93 Difference]: Finished difference Result 3262 states and 4583 transitions. [2022-02-20 20:00:25,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4583 transitions. [2022-02-20 20:00:25,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:25,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:25,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:25,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2385 states have (on average 1.3928721174004193) internal successors, (3322), 2419 states have internal predecessors, (3322), 307 states have call successors, (307), 188 states have call predecessors, (307), 222 states have return successors, (388), 318 states have call predecessors, (388), 303 states have call successors, (388) [2022-02-20 20:00:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 4017 transitions. [2022-02-20 20:00:26,053 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 4017 transitions. Word has length 80 [2022-02-20 20:00:26,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:26,053 INFO L470 AbstractCegarLoop]: Abstraction has 2916 states and 4017 transitions. [2022-02-20 20:00:26,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:26,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 4017 transitions. [2022-02-20 20:00:26,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 20:00:26,055 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:26,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 20:00:26,055 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:26,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:26,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1468585870, now seen corresponding path program 1 times [2022-02-20 20:00:26,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:26,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291053430] [2022-02-20 20:00:26,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:26,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:26,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:26,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {111137#true} assume true; {111137#true} is VALID [2022-02-20 20:00:26,076 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {111137#true} {111139#(= ~E_1~0 ~M_E~0)} #994#return; {111139#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:26,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 20:00:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:26,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {111193#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:26,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:26,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:26,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T3_E~0); {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:26,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:26,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {111195#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:26,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {111195#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {111195#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:26,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {111195#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {111195#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:26,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {111195#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {111195#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:26,102 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {111195#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {111139#(= ~E_1~0 ~M_E~0)} #996#return; {111138#false} is VALID [2022-02-20 20:00:26,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 20:00:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:26,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {111196#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {111137#true} is VALID [2022-02-20 20:00:26,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {111137#true} assume !(1 == ~m_pc~0); {111137#true} is VALID [2022-02-20 20:00:26,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {111137#true} is_master_triggered_~__retres1~4#1 := 0; {111137#true} is VALID [2022-02-20 20:00:26,115 INFO L290 TraceCheckUtils]: 3: Hoare triple {111137#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {111137#true} is VALID [2022-02-20 20:00:26,115 INFO L290 TraceCheckUtils]: 4: Hoare triple {111137#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {111137#true} is VALID [2022-02-20 20:00:26,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {111137#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {111137#true} is VALID [2022-02-20 20:00:26,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {111137#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; {111137#true} is VALID [2022-02-20 20:00:26,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {111137#true} assume 1 == ~t1_pc~0; {111137#true} is VALID [2022-02-20 20:00:26,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {111137#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {111137#true} is VALID [2022-02-20 20:00:26,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {111137#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {111137#true} is VALID [2022-02-20 20:00:26,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {111137#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {111137#true} is VALID [2022-02-20 20:00:26,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {111137#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {111137#true} is VALID [2022-02-20 20:00:26,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {111137#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; {111137#true} is VALID [2022-02-20 20:00:26,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {111137#true} assume !(1 == ~t2_pc~0); {111137#true} is VALID [2022-02-20 20:00:26,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {111137#true} is_transmit2_triggered_~__retres1~6#1 := 0; {111137#true} is VALID [2022-02-20 20:00:26,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {111137#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {111137#true} is VALID [2022-02-20 20:00:26,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {111137#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {111137#true} is VALID [2022-02-20 20:00:26,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {111137#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {111137#true} is VALID [2022-02-20 20:00:26,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {111137#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {111137#true} is VALID [2022-02-20 20:00:26,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {111137#true} assume 1 == ~t3_pc~0; {111137#true} is VALID [2022-02-20 20:00:26,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {111137#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {111137#true} is VALID [2022-02-20 20:00:26,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {111137#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {111137#true} is VALID [2022-02-20 20:00:26,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {111137#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {111137#true} is VALID [2022-02-20 20:00:26,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {111137#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {111137#true} is VALID [2022-02-20 20:00:26,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {111137#true} assume true; {111137#true} is VALID [2022-02-20 20:00:26,118 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {111137#true} {111138#false} #998#return; {111138#false} is VALID [2022-02-20 20:00:26,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 20:00:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:26,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {111193#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {111137#true} is VALID [2022-02-20 20:00:26,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {111137#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {111137#true} is VALID [2022-02-20 20:00:26,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {111137#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {111137#true} is VALID [2022-02-20 20:00:26,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {111137#true} assume !(1 == ~T3_E~0); {111137#true} is VALID [2022-02-20 20:00:26,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {111137#true} assume 1 == ~E_M~0;~E_M~0 := 2; {111137#true} is VALID [2022-02-20 20:00:26,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {111137#true} assume 1 == ~E_1~0;~E_1~0 := 2; {111137#true} is VALID [2022-02-20 20:00:26,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {111137#true} assume 1 == ~E_2~0;~E_2~0 := 2; {111137#true} is VALID [2022-02-20 20:00:26,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {111137#true} assume 1 == ~E_3~0;~E_3~0 := 2; {111137#true} is VALID [2022-02-20 20:00:26,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {111137#true} assume true; {111137#true} is VALID [2022-02-20 20:00:26,122 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {111137#true} {111138#false} #1000#return; {111138#false} is VALID [2022-02-20 20:00:26,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:26,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {111137#true} havoc ~__retres1~8; {111137#true} is VALID [2022-02-20 20:00:26,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {111137#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {111137#true} is VALID [2022-02-20 20:00:26,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {111137#true} #res := ~__retres1~8; {111137#true} is VALID [2022-02-20 20:00:26,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {111137#true} assume true; {111137#true} is VALID [2022-02-20 20:00:26,124 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {111137#true} {111138#false} #1002#return; {111138#false} is VALID [2022-02-20 20:00:26,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {111137#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {111139#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:26,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {111139#(= ~E_1~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {111139#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:26,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {111139#(= ~E_1~0 ~M_E~0)} assume !(0 != main_#t~nondet34#1);havoc main_#t~nondet34#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {111139#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:26,126 INFO L290 TraceCheckUtils]: 3: Hoare triple {111139#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret32#1, start_simulation2_#t~ret33#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; {111139#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:26,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {111139#(= ~E_1~0 ~M_E~0)} call update_channels2(); {111137#true} is VALID [2022-02-20 20:00:26,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {111137#true} assume true; {111137#true} is VALID [2022-02-20 20:00:26,127 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {111137#true} {111139#(= ~E_1~0 ~M_E~0)} #994#return; {111139#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:26,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {111139#(= ~E_1~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {111139#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:26,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {111139#(= ~E_1~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {111139#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:26,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {111139#(= ~E_1~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {111139#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:26,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {111139#(= ~E_1~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {111139#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:26,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {111139#(= ~E_1~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {111139#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:26,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {111139#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {111139#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 20:00:26,129 INFO L272 TraceCheckUtils]: 13: Hoare triple {111139#(= ~E_1~0 ~M_E~0)} call fire_delta_events2(); {111193#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:26,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {111193#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:26,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:26,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:26,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T3_E~0); {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:26,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:26,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {111194#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {111195#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:26,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {111195#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {111195#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:26,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {111195#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {111195#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:26,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {111195#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {111195#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:26,132 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {111195#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {111139#(= ~E_1~0 ~M_E~0)} #996#return; {111138#false} is VALID [2022-02-20 20:00:26,132 INFO L272 TraceCheckUtils]: 24: Hoare triple {111138#false} call activate_threads2(); {111196#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 20:00:26,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {111196#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {111137#true} is VALID [2022-02-20 20:00:26,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {111137#true} assume !(1 == ~m_pc~0); {111137#true} is VALID [2022-02-20 20:00:26,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {111137#true} is_master_triggered_~__retres1~4#1 := 0; {111137#true} is VALID [2022-02-20 20:00:26,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {111137#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {111137#true} is VALID [2022-02-20 20:00:26,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {111137#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {111137#true} is VALID [2022-02-20 20:00:26,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {111137#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {111137#true} is VALID [2022-02-20 20:00:26,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {111137#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; {111137#true} is VALID [2022-02-20 20:00:26,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {111137#true} assume 1 == ~t1_pc~0; {111137#true} is VALID [2022-02-20 20:00:26,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {111137#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {111137#true} is VALID [2022-02-20 20:00:26,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {111137#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {111137#true} is VALID [2022-02-20 20:00:26,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {111137#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {111137#true} is VALID [2022-02-20 20:00:26,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {111137#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {111137#true} is VALID [2022-02-20 20:00:26,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {111137#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; {111137#true} is VALID [2022-02-20 20:00:26,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {111137#true} assume !(1 == ~t2_pc~0); {111137#true} is VALID [2022-02-20 20:00:26,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {111137#true} is_transmit2_triggered_~__retres1~6#1 := 0; {111137#true} is VALID [2022-02-20 20:00:26,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {111137#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {111137#true} is VALID [2022-02-20 20:00:26,134 INFO L290 TraceCheckUtils]: 41: Hoare triple {111137#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {111137#true} is VALID [2022-02-20 20:00:26,134 INFO L290 TraceCheckUtils]: 42: Hoare triple {111137#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {111137#true} is VALID [2022-02-20 20:00:26,134 INFO L290 TraceCheckUtils]: 43: Hoare triple {111137#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {111137#true} is VALID [2022-02-20 20:00:26,134 INFO L290 TraceCheckUtils]: 44: Hoare triple {111137#true} assume 1 == ~t3_pc~0; {111137#true} is VALID [2022-02-20 20:00:26,134 INFO L290 TraceCheckUtils]: 45: Hoare triple {111137#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {111137#true} is VALID [2022-02-20 20:00:26,134 INFO L290 TraceCheckUtils]: 46: Hoare triple {111137#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {111137#true} is VALID [2022-02-20 20:00:26,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {111137#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {111137#true} is VALID [2022-02-20 20:00:26,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {111137#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {111137#true} is VALID [2022-02-20 20:00:26,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {111137#true} assume true; {111137#true} is VALID [2022-02-20 20:00:26,135 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {111137#true} {111138#false} #998#return; {111138#false} is VALID [2022-02-20 20:00:26,135 INFO L272 TraceCheckUtils]: 51: Hoare triple {111138#false} call reset_delta_events2(); {111193#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:26,135 INFO L290 TraceCheckUtils]: 52: Hoare triple {111193#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {111137#true} is VALID [2022-02-20 20:00:26,135 INFO L290 TraceCheckUtils]: 53: Hoare triple {111137#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {111137#true} is VALID [2022-02-20 20:00:26,135 INFO L290 TraceCheckUtils]: 54: Hoare triple {111137#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {111137#true} is VALID [2022-02-20 20:00:26,135 INFO L290 TraceCheckUtils]: 55: Hoare triple {111137#true} assume !(1 == ~T3_E~0); {111137#true} is VALID [2022-02-20 20:00:26,136 INFO L290 TraceCheckUtils]: 56: Hoare triple {111137#true} assume 1 == ~E_M~0;~E_M~0 := 2; {111137#true} is VALID [2022-02-20 20:00:26,136 INFO L290 TraceCheckUtils]: 57: Hoare triple {111137#true} assume 1 == ~E_1~0;~E_1~0 := 2; {111137#true} is VALID [2022-02-20 20:00:26,136 INFO L290 TraceCheckUtils]: 58: Hoare triple {111137#true} assume 1 == ~E_2~0;~E_2~0 := 2; {111137#true} is VALID [2022-02-20 20:00:26,136 INFO L290 TraceCheckUtils]: 59: Hoare triple {111137#true} assume 1 == ~E_3~0;~E_3~0 := 2; {111137#true} is VALID [2022-02-20 20:00:26,136 INFO L290 TraceCheckUtils]: 60: Hoare triple {111137#true} assume true; {111137#true} is VALID [2022-02-20 20:00:26,136 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {111137#true} {111138#false} #1000#return; {111138#false} is VALID [2022-02-20 20:00:26,136 INFO L290 TraceCheckUtils]: 62: Hoare triple {111138#false} assume !false; {111138#false} is VALID [2022-02-20 20:00:26,136 INFO L290 TraceCheckUtils]: 63: Hoare triple {111138#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {111138#false} is VALID [2022-02-20 20:00:26,136 INFO L290 TraceCheckUtils]: 64: Hoare triple {111138#false} assume !false; {111138#false} is VALID [2022-02-20 20:00:26,137 INFO L272 TraceCheckUtils]: 65: Hoare triple {111138#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {111137#true} is VALID [2022-02-20 20:00:26,137 INFO L290 TraceCheckUtils]: 66: Hoare triple {111137#true} havoc ~__retres1~8; {111137#true} is VALID [2022-02-20 20:00:26,137 INFO L290 TraceCheckUtils]: 67: Hoare triple {111137#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {111137#true} is VALID [2022-02-20 20:00:26,137 INFO L290 TraceCheckUtils]: 68: Hoare triple {111137#true} #res := ~__retres1~8; {111137#true} is VALID [2022-02-20 20:00:26,137 INFO L290 TraceCheckUtils]: 69: Hoare triple {111137#true} assume true; {111137#true} is VALID [2022-02-20 20:00:26,137 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {111137#true} {111138#false} #1002#return; {111138#false} is VALID [2022-02-20 20:00:26,137 INFO L290 TraceCheckUtils]: 71: Hoare triple {111138#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; {111138#false} is VALID [2022-02-20 20:00:26,137 INFO L290 TraceCheckUtils]: 72: Hoare triple {111138#false} assume 0 != eval2_~tmp~5#1; {111138#false} is VALID [2022-02-20 20:00:26,137 INFO L290 TraceCheckUtils]: 73: Hoare triple {111138#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; {111138#false} is VALID [2022-02-20 20:00:26,137 INFO L290 TraceCheckUtils]: 74: Hoare triple {111138#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; {111138#false} is VALID [2022-02-20 20:00:26,138 INFO L290 TraceCheckUtils]: 75: Hoare triple {111138#false} assume !(0 == ~m_pc~0); {111138#false} is VALID [2022-02-20 20:00:26,138 INFO L290 TraceCheckUtils]: 76: Hoare triple {111138#false} assume 1 == ~m_pc~0; {111138#false} is VALID [2022-02-20 20:00:26,138 INFO L290 TraceCheckUtils]: 77: Hoare triple {111138#false} assume ~token~0 != 3 + ~local~0; {111138#false} is VALID [2022-02-20 20:00:26,138 INFO L272 TraceCheckUtils]: 78: Hoare triple {111138#false} call error2(); {111138#false} is VALID [2022-02-20 20:00:26,138 INFO L290 TraceCheckUtils]: 79: Hoare triple {111138#false} assume !false; {111138#false} is VALID [2022-02-20 20:00:26,138 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:26,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:26,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291053430] [2022-02-20 20:00:26,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291053430] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:26,139 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:26,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:26,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443932662] [2022-02-20 20:00:26,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:26,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-02-20 20:00:26,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:26,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:26,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:26,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:26,186 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:26,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:26,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:26,187 INFO L87 Difference]: Start difference. First operand 2916 states and 4017 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:31,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:31,016 INFO L93 Difference]: Finished difference Result 6199 states and 8978 transitions. [2022-02-20 20:00:31,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 20:00:31,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-02-20 20:00:31,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1033 transitions. [2022-02-20 20:00:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:31,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1033 transitions. [2022-02-20 20:00:31,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 1033 transitions. [2022-02-20 20:00:31,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1033 edges. 1033 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:32,739 INFO L225 Difference]: With dead ends: 6199 [2022-02-20 20:00:32,739 INFO L226 Difference]: Without dead ends: 4934 [2022-02-20 20:00:32,742 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:32,743 INFO L933 BasicCegarLoop]: 493 mSDtfsCounter, 848 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:32,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [874 Valid, 1537 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 20:00:32,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2022-02-20 20:00:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 3935. [2022-02-20 20:00:32,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:32,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4934 states. Second operand has 3935 states, 3260 states have (on average 1.4125766871165644) internal successors, (4605), 3302 states have internal predecessors, (4605), 395 states have call successors, (395), 236 states have call predecessors, (395), 278 states have return successors, (538), 414 states have call predecessors, (538), 391 states have call successors, (538) [2022-02-20 20:00:32,947 INFO L74 IsIncluded]: Start isIncluded. First operand 4934 states. Second operand has 3935 states, 3260 states have (on average 1.4125766871165644) internal successors, (4605), 3302 states have internal predecessors, (4605), 395 states have call successors, (395), 236 states have call predecessors, (395), 278 states have return successors, (538), 414 states have call predecessors, (538), 391 states have call successors, (538) [2022-02-20 20:00:32,953 INFO L87 Difference]: Start difference. First operand 4934 states. Second operand has 3935 states, 3260 states have (on average 1.4125766871165644) internal successors, (4605), 3302 states have internal predecessors, (4605), 395 states have call successors, (395), 236 states have call predecessors, (395), 278 states have return successors, (538), 414 states have call predecessors, (538), 391 states have call successors, (538) [2022-02-20 20:00:33,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:33,682 INFO L93 Difference]: Finished difference Result 4934 states and 7062 transitions. [2022-02-20 20:00:33,682 INFO L276 IsEmpty]: Start isEmpty. Operand 4934 states and 7062 transitions. [2022-02-20 20:00:33,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:33,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:33,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 3935 states, 3260 states have (on average 1.4125766871165644) internal successors, (4605), 3302 states have internal predecessors, (4605), 395 states have call successors, (395), 236 states have call predecessors, (395), 278 states have return successors, (538), 414 states have call predecessors, (538), 391 states have call successors, (538) Second operand 4934 states. [2022-02-20 20:00:33,706 INFO L87 Difference]: Start difference. First operand has 3935 states, 3260 states have (on average 1.4125766871165644) internal successors, (4605), 3302 states have internal predecessors, (4605), 395 states have call successors, (395), 236 states have call predecessors, (395), 278 states have return successors, (538), 414 states have call predecessors, (538), 391 states have call successors, (538) Second operand 4934 states. [2022-02-20 20:00:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:34,392 INFO L93 Difference]: Finished difference Result 4934 states and 7062 transitions. [2022-02-20 20:00:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4934 states and 7062 transitions. [2022-02-20 20:00:34,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:34,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:34,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:34,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3935 states, 3260 states have (on average 1.4125766871165644) internal successors, (4605), 3302 states have internal predecessors, (4605), 395 states have call successors, (395), 236 states have call predecessors, (395), 278 states have return successors, (538), 414 states have call predecessors, (538), 391 states have call successors, (538) [2022-02-20 20:00:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 5538 transitions. [2022-02-20 20:00:35,080 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 5538 transitions. Word has length 80 [2022-02-20 20:00:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:35,080 INFO L470 AbstractCegarLoop]: Abstraction has 3935 states and 5538 transitions. [2022-02-20 20:00:35,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 5538 transitions. [2022-02-20 20:00:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 20:00:35,083 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:35,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:35,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 20:00:35,083 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:35,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:35,084 INFO L85 PathProgramCache]: Analyzing trace with hash -864806768, now seen corresponding path program 1 times [2022-02-20 20:00:35,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:35,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011471665] [2022-02-20 20:00:35,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:35,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {134427#true} assume true; {134427#true} is VALID [2022-02-20 20:00:35,106 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {134427#true} {134429#(= ~E_3~0 ~M_E~0)} #994#return; {134429#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 20:00:35,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 20:00:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {134483#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:35,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:35,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:35,141 INFO L290 TraceCheckUtils]: 3: Hoare triple {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T3_E~0); {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:35,142 INFO L290 TraceCheckUtils]: 4: Hoare triple {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:35,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:35,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_2~0); {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:35,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_3~0;~E_3~0 := 1; {134485#(not (= |old(~E_3~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:35,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {134485#(not (= |old(~E_3~0)| |old(~M_E~0)|))} assume true; {134485#(not (= |old(~E_3~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:35,144 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {134485#(not (= |old(~E_3~0)| |old(~M_E~0)|))} {134429#(= ~E_3~0 ~M_E~0)} #996#return; {134428#false} is VALID [2022-02-20 20:00:35,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 20:00:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {134486#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {134427#true} is VALID [2022-02-20 20:00:35,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {134427#true} assume !(1 == ~m_pc~0); {134427#true} is VALID [2022-02-20 20:00:35,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {134427#true} is_master_triggered_~__retres1~4#1 := 0; {134427#true} is VALID [2022-02-20 20:00:35,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {134427#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {134427#true} is VALID [2022-02-20 20:00:35,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {134427#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {134427#true} is VALID [2022-02-20 20:00:35,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {134427#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {134427#true} is VALID [2022-02-20 20:00:35,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {134427#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; {134427#true} is VALID [2022-02-20 20:00:35,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {134427#true} assume 1 == ~t1_pc~0; {134427#true} is VALID [2022-02-20 20:00:35,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {134427#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {134427#true} is VALID [2022-02-20 20:00:35,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {134427#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {134427#true} is VALID [2022-02-20 20:00:35,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {134427#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {134427#true} is VALID [2022-02-20 20:00:35,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {134427#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {134427#true} is VALID [2022-02-20 20:00:35,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {134427#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; {134427#true} is VALID [2022-02-20 20:00:35,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {134427#true} assume !(1 == ~t2_pc~0); {134427#true} is VALID [2022-02-20 20:00:35,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {134427#true} is_transmit2_triggered_~__retres1~6#1 := 0; {134427#true} is VALID [2022-02-20 20:00:35,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {134427#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {134427#true} is VALID [2022-02-20 20:00:35,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {134427#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {134427#true} is VALID [2022-02-20 20:00:35,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {134427#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {134427#true} is VALID [2022-02-20 20:00:35,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {134427#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {134427#true} is VALID [2022-02-20 20:00:35,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {134427#true} assume 1 == ~t3_pc~0; {134427#true} is VALID [2022-02-20 20:00:35,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {134427#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {134427#true} is VALID [2022-02-20 20:00:35,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {134427#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {134427#true} is VALID [2022-02-20 20:00:35,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {134427#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {134427#true} is VALID [2022-02-20 20:00:35,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {134427#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {134427#true} is VALID [2022-02-20 20:00:35,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {134427#true} assume true; {134427#true} is VALID [2022-02-20 20:00:35,167 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {134427#true} {134428#false} #998#return; {134428#false} is VALID [2022-02-20 20:00:35,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 20:00:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {134483#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {134427#true} is VALID [2022-02-20 20:00:35,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {134427#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {134427#true} is VALID [2022-02-20 20:00:35,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {134427#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {134427#true} is VALID [2022-02-20 20:00:35,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {134427#true} assume !(1 == ~T3_E~0); {134427#true} is VALID [2022-02-20 20:00:35,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {134427#true} assume 1 == ~E_M~0;~E_M~0 := 2; {134427#true} is VALID [2022-02-20 20:00:35,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {134427#true} assume 1 == ~E_1~0;~E_1~0 := 2; {134427#true} is VALID [2022-02-20 20:00:35,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {134427#true} assume 1 == ~E_2~0;~E_2~0 := 2; {134427#true} is VALID [2022-02-20 20:00:35,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {134427#true} assume 1 == ~E_3~0;~E_3~0 := 2; {134427#true} is VALID [2022-02-20 20:00:35,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {134427#true} assume true; {134427#true} is VALID [2022-02-20 20:00:35,171 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {134427#true} {134428#false} #1000#return; {134428#false} is VALID [2022-02-20 20:00:35,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {134427#true} havoc ~__retres1~8; {134427#true} is VALID [2022-02-20 20:00:35,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {134427#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {134427#true} is VALID [2022-02-20 20:00:35,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {134427#true} #res := ~__retres1~8; {134427#true} is VALID [2022-02-20 20:00:35,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {134427#true} assume true; {134427#true} is VALID [2022-02-20 20:00:35,173 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {134427#true} {134428#false} #1002#return; {134428#false} is VALID [2022-02-20 20:00:35,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {134427#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {134429#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 20:00:35,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {134429#(= ~E_3~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {134429#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 20:00:35,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {134429#(= ~E_3~0 ~M_E~0)} assume !(0 != main_#t~nondet34#1);havoc main_#t~nondet34#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {134429#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 20:00:35,175 INFO L290 TraceCheckUtils]: 3: Hoare triple {134429#(= ~E_3~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret32#1, start_simulation2_#t~ret33#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; {134429#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 20:00:35,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {134429#(= ~E_3~0 ~M_E~0)} call update_channels2(); {134427#true} is VALID [2022-02-20 20:00:35,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {134427#true} assume true; {134427#true} is VALID [2022-02-20 20:00:35,176 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {134427#true} {134429#(= ~E_3~0 ~M_E~0)} #994#return; {134429#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 20:00:35,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {134429#(= ~E_3~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {134429#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 20:00:35,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {134429#(= ~E_3~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {134429#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 20:00:35,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {134429#(= ~E_3~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {134429#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 20:00:35,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {134429#(= ~E_3~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {134429#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 20:00:35,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {134429#(= ~E_3~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {134429#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 20:00:35,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {134429#(= ~E_3~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {134429#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 20:00:35,178 INFO L272 TraceCheckUtils]: 13: Hoare triple {134429#(= ~E_3~0 ~M_E~0)} call fire_delta_events2(); {134483#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:35,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {134483#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:35,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:35,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:35,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T3_E~0); {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:35,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:35,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:35,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_2~0); {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:35,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {134484#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_3~0;~E_3~0 := 1; {134485#(not (= |old(~E_3~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:35,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {134485#(not (= |old(~E_3~0)| |old(~M_E~0)|))} assume true; {134485#(not (= |old(~E_3~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:35,181 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {134485#(not (= |old(~E_3~0)| |old(~M_E~0)|))} {134429#(= ~E_3~0 ~M_E~0)} #996#return; {134428#false} is VALID [2022-02-20 20:00:35,182 INFO L272 TraceCheckUtils]: 24: Hoare triple {134428#false} call activate_threads2(); {134486#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 20:00:35,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {134486#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {134427#true} is VALID [2022-02-20 20:00:35,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {134427#true} assume !(1 == ~m_pc~0); {134427#true} is VALID [2022-02-20 20:00:35,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {134427#true} is_master_triggered_~__retres1~4#1 := 0; {134427#true} is VALID [2022-02-20 20:00:35,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {134427#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {134427#true} is VALID [2022-02-20 20:00:35,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {134427#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {134427#true} is VALID [2022-02-20 20:00:35,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {134427#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {134427#true} is VALID [2022-02-20 20:00:35,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {134427#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; {134427#true} is VALID [2022-02-20 20:00:35,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {134427#true} assume 1 == ~t1_pc~0; {134427#true} is VALID [2022-02-20 20:00:35,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {134427#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {134427#true} is VALID [2022-02-20 20:00:35,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {134427#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {134427#true} is VALID [2022-02-20 20:00:35,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {134427#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {134427#true} is VALID [2022-02-20 20:00:35,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {134427#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {134427#true} is VALID [2022-02-20 20:00:35,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {134427#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; {134427#true} is VALID [2022-02-20 20:00:35,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {134427#true} assume !(1 == ~t2_pc~0); {134427#true} is VALID [2022-02-20 20:00:35,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {134427#true} is_transmit2_triggered_~__retres1~6#1 := 0; {134427#true} is VALID [2022-02-20 20:00:35,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {134427#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {134427#true} is VALID [2022-02-20 20:00:35,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {134427#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {134427#true} is VALID [2022-02-20 20:00:35,183 INFO L290 TraceCheckUtils]: 42: Hoare triple {134427#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {134427#true} is VALID [2022-02-20 20:00:35,184 INFO L290 TraceCheckUtils]: 43: Hoare triple {134427#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {134427#true} is VALID [2022-02-20 20:00:35,184 INFO L290 TraceCheckUtils]: 44: Hoare triple {134427#true} assume 1 == ~t3_pc~0; {134427#true} is VALID [2022-02-20 20:00:35,184 INFO L290 TraceCheckUtils]: 45: Hoare triple {134427#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {134427#true} is VALID [2022-02-20 20:00:35,184 INFO L290 TraceCheckUtils]: 46: Hoare triple {134427#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {134427#true} is VALID [2022-02-20 20:00:35,184 INFO L290 TraceCheckUtils]: 47: Hoare triple {134427#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {134427#true} is VALID [2022-02-20 20:00:35,184 INFO L290 TraceCheckUtils]: 48: Hoare triple {134427#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {134427#true} is VALID [2022-02-20 20:00:35,184 INFO L290 TraceCheckUtils]: 49: Hoare triple {134427#true} assume true; {134427#true} is VALID [2022-02-20 20:00:35,184 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {134427#true} {134428#false} #998#return; {134428#false} is VALID [2022-02-20 20:00:35,184 INFO L272 TraceCheckUtils]: 51: Hoare triple {134428#false} call reset_delta_events2(); {134483#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:35,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {134483#(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_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {134427#true} is VALID [2022-02-20 20:00:35,185 INFO L290 TraceCheckUtils]: 53: Hoare triple {134427#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {134427#true} is VALID [2022-02-20 20:00:35,185 INFO L290 TraceCheckUtils]: 54: Hoare triple {134427#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {134427#true} is VALID [2022-02-20 20:00:35,185 INFO L290 TraceCheckUtils]: 55: Hoare triple {134427#true} assume !(1 == ~T3_E~0); {134427#true} is VALID [2022-02-20 20:00:35,185 INFO L290 TraceCheckUtils]: 56: Hoare triple {134427#true} assume 1 == ~E_M~0;~E_M~0 := 2; {134427#true} is VALID [2022-02-20 20:00:35,185 INFO L290 TraceCheckUtils]: 57: Hoare triple {134427#true} assume 1 == ~E_1~0;~E_1~0 := 2; {134427#true} is VALID [2022-02-20 20:00:35,185 INFO L290 TraceCheckUtils]: 58: Hoare triple {134427#true} assume 1 == ~E_2~0;~E_2~0 := 2; {134427#true} is VALID [2022-02-20 20:00:35,185 INFO L290 TraceCheckUtils]: 59: Hoare triple {134427#true} assume 1 == ~E_3~0;~E_3~0 := 2; {134427#true} is VALID [2022-02-20 20:00:35,185 INFO L290 TraceCheckUtils]: 60: Hoare triple {134427#true} assume true; {134427#true} is VALID [2022-02-20 20:00:35,185 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {134427#true} {134428#false} #1000#return; {134428#false} is VALID [2022-02-20 20:00:35,185 INFO L290 TraceCheckUtils]: 62: Hoare triple {134428#false} assume !false; {134428#false} is VALID [2022-02-20 20:00:35,186 INFO L290 TraceCheckUtils]: 63: Hoare triple {134428#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {134428#false} is VALID [2022-02-20 20:00:35,186 INFO L290 TraceCheckUtils]: 64: Hoare triple {134428#false} assume !false; {134428#false} is VALID [2022-02-20 20:00:35,186 INFO L272 TraceCheckUtils]: 65: Hoare triple {134428#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {134427#true} is VALID [2022-02-20 20:00:35,186 INFO L290 TraceCheckUtils]: 66: Hoare triple {134427#true} havoc ~__retres1~8; {134427#true} is VALID [2022-02-20 20:00:35,186 INFO L290 TraceCheckUtils]: 67: Hoare triple {134427#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {134427#true} is VALID [2022-02-20 20:00:35,186 INFO L290 TraceCheckUtils]: 68: Hoare triple {134427#true} #res := ~__retres1~8; {134427#true} is VALID [2022-02-20 20:00:35,186 INFO L290 TraceCheckUtils]: 69: Hoare triple {134427#true} assume true; {134427#true} is VALID [2022-02-20 20:00:35,186 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {134427#true} {134428#false} #1002#return; {134428#false} is VALID [2022-02-20 20:00:35,186 INFO L290 TraceCheckUtils]: 71: Hoare triple {134428#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; {134428#false} is VALID [2022-02-20 20:00:35,187 INFO L290 TraceCheckUtils]: 72: Hoare triple {134428#false} assume 0 != eval2_~tmp~5#1; {134428#false} is VALID [2022-02-20 20:00:35,187 INFO L290 TraceCheckUtils]: 73: Hoare triple {134428#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; {134428#false} is VALID [2022-02-20 20:00:35,187 INFO L290 TraceCheckUtils]: 74: Hoare triple {134428#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; {134428#false} is VALID [2022-02-20 20:00:35,187 INFO L290 TraceCheckUtils]: 75: Hoare triple {134428#false} assume !(0 == ~m_pc~0); {134428#false} is VALID [2022-02-20 20:00:35,187 INFO L290 TraceCheckUtils]: 76: Hoare triple {134428#false} assume 1 == ~m_pc~0; {134428#false} is VALID [2022-02-20 20:00:35,187 INFO L290 TraceCheckUtils]: 77: Hoare triple {134428#false} assume ~token~0 != 3 + ~local~0; {134428#false} is VALID [2022-02-20 20:00:35,187 INFO L272 TraceCheckUtils]: 78: Hoare triple {134428#false} call error2(); {134428#false} is VALID [2022-02-20 20:00:35,187 INFO L290 TraceCheckUtils]: 79: Hoare triple {134428#false} assume !false; {134428#false} is VALID [2022-02-20 20:00:35,188 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:35,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:35,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011471665] [2022-02-20 20:00:35,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011471665] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:35,188 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:35,188 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:35,188 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962988831] [2022-02-20 20:00:35,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:35,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-02-20 20:00:35,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:35,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:35,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:35,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:35,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:35,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:35,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:35,248 INFO L87 Difference]: Start difference. First operand 3935 states and 5538 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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)