./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+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_1.cil-2+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 d5746a53d1ab0f7d20d2e5362b7235e80167d7cee80ddadf160c57caf25829fe --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:54:41,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:54:41,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:54:41,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:54:41,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:54:41,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:54:41,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:54:41,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:54:41,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:54:41,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:54:41,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:54:41,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:54:41,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:54:41,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:54:41,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:54:41,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:54:41,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:54:41,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:54:41,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:54:41,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:54:41,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:54:41,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:54:41,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:54:41,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:54:41,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:54:41,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:54:41,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:54:41,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:54:41,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:54:41,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:54:41,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:54:41,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:54:41,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:54:41,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:54:41,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:54:41,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:54:41,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:54:41,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:54:41,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:54:41,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:54:41,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:54:41,682 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:54:41,717 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:54:41,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:54:41,718 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:54:41,718 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:54:41,719 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:54:41,720 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:54:41,720 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:54:41,720 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:54:41,721 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:54:41,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:54:41,722 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:54:41,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:54:41,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:54:41,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:54:41,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:54:41,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:54:41,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:54:41,723 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:54:41,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:54:41,724 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:54:41,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:54:41,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:54:41,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:54:41,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:54:41,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:54:41,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:54:41,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:54:41,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:54:41,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:54:41,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:54:41,726 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:54:41,726 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:54:41,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:54:41,726 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 -> d5746a53d1ab0f7d20d2e5362b7235e80167d7cee80ddadf160c57caf25829fe [2022-02-20 19:54:41,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:54:41,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:54:41,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:54:41,971 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:54:41,971 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:54:41,973 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-1.c [2022-02-20 19:54:42,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fa4415e/c69f02e9b5184514ae2b3c22372d025a/FLAG63cca2715 [2022-02-20 19:54:42,460 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:54:42,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-1.c [2022-02-20 19:54:42,476 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fa4415e/c69f02e9b5184514ae2b3c22372d025a/FLAG63cca2715 [2022-02-20 19:54:42,847 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fa4415e/c69f02e9b5184514ae2b3c22372d025a [2022-02-20 19:54:42,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:54:42,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:54:42,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:54:42,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:54:42,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:54:42,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:54:42" (1/1) ... [2022-02-20 19:54:42,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c48435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:42, skipping insertion in model container [2022-02-20 19:54:42,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:54:42" (1/1) ... [2022-02-20 19:54:42,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:54:42,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:54:43,040 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_1.cil-2+token_ring.03.cil-1.c[913,926] [2022-02-20 19:54:43,087 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_1.cil-2+token_ring.03.cil-1.c[5977,5990] [2022-02-20 19:54:43,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:54:43,149 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:54:43,159 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_1.cil-2+token_ring.03.cil-1.c[913,926] [2022-02-20 19:54:43,174 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_1.cil-2+token_ring.03.cil-1.c[5977,5990] [2022-02-20 19:54:43,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:54:43,223 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:54:43,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:43 WrapperNode [2022-02-20 19:54:43,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:54:43,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:54:43,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:54:43,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:54:43,232 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:54:43" (1/1) ... [2022-02-20 19:54:43,242 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:54:43" (1/1) ... [2022-02-20 19:54:43,299 INFO L137 Inliner]: procedures = 54, calls = 58, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 538 [2022-02-20 19:54:43,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:54:43,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:54:43,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:54:43,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:54:43,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:43" (1/1) ... [2022-02-20 19:54:43,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:43" (1/1) ... [2022-02-20 19:54:43,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:43" (1/1) ... [2022-02-20 19:54:43,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:43" (1/1) ... [2022-02-20 19:54:43,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:43" (1/1) ... [2022-02-20 19:54:43,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:43" (1/1) ... [2022-02-20 19:54:43,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:43" (1/1) ... [2022-02-20 19:54:43,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:54:43,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:54:43,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:54:43,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:54:43,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:43" (1/1) ... [2022-02-20 19:54:43,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:54:43,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:54:43,396 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:54:43,420 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:54:43,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:54:43,436 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:54:43,437 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:54:43,437 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-02-20 19:54:43,437 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-02-20 19:54:43,439 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:54:43,439 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:54:43,439 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:54:43,440 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:54:43,440 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:54:43,440 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:54:43,440 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:54:43,441 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:54:43,441 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:54:43,441 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:54:43,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:54:43,441 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:54:43,441 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:54:43,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:54:43,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:54:43,442 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:54:43,442 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:54:43,442 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:54:43,442 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:54:43,564 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:54:43,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:54:44,100 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:54:44,109 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:54:44,109 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 19:54:44,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:54:44 BoogieIcfgContainer [2022-02-20 19:54:44,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:54:44,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:54:44,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:54:44,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:54:44,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:54:42" (1/3) ... [2022-02-20 19:54:44,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ff3dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:54:44, skipping insertion in model container [2022-02-20 19:54:44,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:43" (2/3) ... [2022-02-20 19:54:44,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ff3dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:54:44, skipping insertion in model container [2022-02-20 19:54:44,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:54:44" (3/3) ... [2022-02-20 19:54:44,118 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.03.cil-1.c [2022-02-20 19:54:44,123 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:54:44,124 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:54:44,185 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:54:44,192 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:54:44,192 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:54:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 199 states have (on average 1.592964824120603) internal successors, (317), 206 states have internal predecessors, (317), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-20 19:54:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 19:54:44,233 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:44,234 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] [2022-02-20 19:54:44,234 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:44,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:44,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1832472135, now seen corresponding path program 1 times [2022-02-20 19:54:44,251 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:44,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301716439] [2022-02-20 19:54:44,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:44,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:44,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#true} havoc ~__retres1~2; {240#true} is VALID [2022-02-20 19:54:44,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {242#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {242#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {242#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,515 INFO L290 TraceCheckUtils]: 3: Hoare triple {242#(= ~p_dw_st~0 0)} assume true; {242#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,516 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {242#(= ~p_dw_st~0 0)} {242#(= ~p_dw_st~0 0)} #843#return; {242#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 19:54:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:44,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {240#true} is VALID [2022-02-20 19:54:44,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} assume 1 == ~p_dw_pc~0; {240#true} is VALID [2022-02-20 19:54:44,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {240#true} is VALID [2022-02-20 19:54:44,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {240#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {240#true} is VALID [2022-02-20 19:54:44,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {240#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {240#true} is VALID [2022-02-20 19:54:44,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {240#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {240#true} is VALID [2022-02-20 19:54:44,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {240#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {240#true} is VALID [2022-02-20 19:54:44,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#true} assume !(1 == ~c_dr_pc~0); {240#true} is VALID [2022-02-20 19:54:44,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {240#true} is VALID [2022-02-20 19:54:44,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {240#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {240#true} is VALID [2022-02-20 19:54:44,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {240#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {240#true} is VALID [2022-02-20 19:54:44,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {240#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {240#true} is VALID [2022-02-20 19:54:44,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {240#true} assume true; {240#true} is VALID [2022-02-20 19:54:44,563 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {240#true} {241#false} #847#return; {241#false} is VALID [2022-02-20 19:54:44,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {240#true} is VALID [2022-02-20 19:54:44,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {240#true} is VALID [2022-02-20 19:54:44,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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;~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; {240#true} is VALID [2022-02-20 19:54:44,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {240#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {240#true} is VALID [2022-02-20 19:54:44,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {240#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {242#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {242#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {242#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {242#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {242#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {242#(= ~p_dw_st~0 0)} assume !false; {242#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {242#(= ~p_dw_st~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {242#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {242#(= ~p_dw_st~0 0)} assume !false; {242#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,582 INFO L272 TraceCheckUtils]: 10: Hoare triple {242#(= ~p_dw_st~0 0)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {240#true} is VALID [2022-02-20 19:54:44,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {240#true} havoc ~__retres1~2; {240#true} is VALID [2022-02-20 19:54:44,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {240#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {242#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {242#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {242#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {242#(= ~p_dw_st~0 0)} assume true; {242#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,585 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {242#(= ~p_dw_st~0 0)} {242#(= ~p_dw_st~0 0)} #843#return; {242#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {242#(= ~p_dw_st~0 0)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {242#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {242#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {242#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:44,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {242#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {241#false} is VALID [2022-02-20 19:54:44,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {241#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {241#false} is VALID [2022-02-20 19:54:44,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {241#false} assume 0 != eval1_~tmp___0~1#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; {241#false} is VALID [2022-02-20 19:54:44,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {241#false} assume 0 == ~c_dr_pc~0; {241#false} is VALID [2022-02-20 19:54:44,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {241#false} assume !false; {241#false} is VALID [2022-02-20 19:54:44,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {241#false} assume !(1 == ~q_free~0); {241#false} is VALID [2022-02-20 19:54:44,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {241#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_read_ev~0 := 1; {241#false} is VALID [2022-02-20 19:54:44,589 INFO L272 TraceCheckUtils]: 25: Hoare triple {241#false} call immediate_notify_threads(); {262#(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:54:44,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {262#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {240#true} is VALID [2022-02-20 19:54:44,590 INFO L290 TraceCheckUtils]: 27: Hoare triple {240#true} assume 1 == ~p_dw_pc~0; {240#true} is VALID [2022-02-20 19:54:44,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {240#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {240#true} is VALID [2022-02-20 19:54:44,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {240#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {240#true} is VALID [2022-02-20 19:54:44,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {240#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {240#true} is VALID [2022-02-20 19:54:44,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {240#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {240#true} is VALID [2022-02-20 19:54:44,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {240#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {240#true} is VALID [2022-02-20 19:54:44,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {240#true} assume !(1 == ~c_dr_pc~0); {240#true} is VALID [2022-02-20 19:54:44,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {240#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {240#true} is VALID [2022-02-20 19:54:44,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {240#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {240#true} is VALID [2022-02-20 19:54:44,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {240#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {240#true} is VALID [2022-02-20 19:54:44,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {240#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {240#true} is VALID [2022-02-20 19:54:44,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {240#true} assume true; {240#true} is VALID [2022-02-20 19:54:44,601 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {240#true} {241#false} #847#return; {241#false} is VALID [2022-02-20 19:54:44,602 INFO L290 TraceCheckUtils]: 40: Hoare triple {241#false} ~q_read_ev~0 := 2; {241#false} is VALID [2022-02-20 19:54:44,603 INFO L290 TraceCheckUtils]: 41: Hoare triple {241#false} assume !(~p_last_write~0 == ~c_last_read~0); {241#false} is VALID [2022-02-20 19:54:44,603 INFO L272 TraceCheckUtils]: 42: Hoare triple {241#false} call error1(); {241#false} is VALID [2022-02-20 19:54:44,603 INFO L290 TraceCheckUtils]: 43: Hoare triple {241#false} assume !false; {241#false} is VALID [2022-02-20 19:54:44,608 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:54:44,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:44,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301716439] [2022-02-20 19:54:44,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301716439] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:44,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:44,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:44,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266646171] [2022-02-20 19:54:44,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:44,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-02-20 19:54:44,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:44,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:44,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:44,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:44,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:44,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:44,708 INFO L87 Difference]: Start difference. First operand has 237 states, 199 states have (on average 1.592964824120603) internal successors, (317), 206 states have internal predecessors, (317), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:45,579 INFO L93 Difference]: Finished difference Result 527 states and 820 transitions. [2022-02-20 19:54:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:45,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-02-20 19:54:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 820 transitions. [2022-02-20 19:54:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 820 transitions. [2022-02-20 19:54:45,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 820 transitions. [2022-02-20 19:54:46,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 820 edges. 820 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:46,278 INFO L225 Difference]: With dead ends: 527 [2022-02-20 19:54:46,278 INFO L226 Difference]: Without dead ends: 296 [2022-02-20 19:54:46,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:46,286 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 417 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:46,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 610 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:54:46,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-02-20 19:54:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 290. [2022-02-20 19:54:46,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:46,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 296 states. Second operand has 290 states, 248 states have (on average 1.4596774193548387) internal successors, (362), 253 states have internal predecessors, (362), 29 states have call successors, (29), 12 states have call predecessors, (29), 11 states have return successors, (31), 25 states have call predecessors, (31), 25 states have call successors, (31) [2022-02-20 19:54:46,338 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand has 290 states, 248 states have (on average 1.4596774193548387) internal successors, (362), 253 states have internal predecessors, (362), 29 states have call successors, (29), 12 states have call predecessors, (29), 11 states have return successors, (31), 25 states have call predecessors, (31), 25 states have call successors, (31) [2022-02-20 19:54:46,340 INFO L87 Difference]: Start difference. First operand 296 states. Second operand has 290 states, 248 states have (on average 1.4596774193548387) internal successors, (362), 253 states have internal predecessors, (362), 29 states have call successors, (29), 12 states have call predecessors, (29), 11 states have return successors, (31), 25 states have call predecessors, (31), 25 states have call successors, (31) [2022-02-20 19:54:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:46,357 INFO L93 Difference]: Finished difference Result 296 states and 428 transitions. [2022-02-20 19:54:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 428 transitions. [2022-02-20 19:54:46,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:46,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:46,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 290 states, 248 states have (on average 1.4596774193548387) internal successors, (362), 253 states have internal predecessors, (362), 29 states have call successors, (29), 12 states have call predecessors, (29), 11 states have return successors, (31), 25 states have call predecessors, (31), 25 states have call successors, (31) Second operand 296 states. [2022-02-20 19:54:46,364 INFO L87 Difference]: Start difference. First operand has 290 states, 248 states have (on average 1.4596774193548387) internal successors, (362), 253 states have internal predecessors, (362), 29 states have call successors, (29), 12 states have call predecessors, (29), 11 states have return successors, (31), 25 states have call predecessors, (31), 25 states have call successors, (31) Second operand 296 states. [2022-02-20 19:54:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:46,379 INFO L93 Difference]: Finished difference Result 296 states and 428 transitions. [2022-02-20 19:54:46,380 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 428 transitions. [2022-02-20 19:54:46,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:46,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:46,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:46,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 248 states have (on average 1.4596774193548387) internal successors, (362), 253 states have internal predecessors, (362), 29 states have call successors, (29), 12 states have call predecessors, (29), 11 states have return successors, (31), 25 states have call predecessors, (31), 25 states have call successors, (31) [2022-02-20 19:54:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 422 transitions. [2022-02-20 19:54:46,400 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 422 transitions. Word has length 44 [2022-02-20 19:54:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:46,401 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 422 transitions. [2022-02-20 19:54:46,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 422 transitions. [2022-02-20 19:54:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 19:54:46,403 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:46,403 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] [2022-02-20 19:54:46,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:54:46,404 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:46,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash -882534523, now seen corresponding path program 1 times [2022-02-20 19:54:46,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:46,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874624126] [2022-02-20 19:54:46,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:46,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:46,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:46,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {1976#true} havoc ~__retres1~2; {1976#true} is VALID [2022-02-20 19:54:46,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {1976#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {1976#true} is VALID [2022-02-20 19:54:46,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {1976#true} #res := ~__retres1~2; {1976#true} is VALID [2022-02-20 19:54:46,479 INFO L290 TraceCheckUtils]: 3: Hoare triple {1976#true} assume true; {1976#true} is VALID [2022-02-20 19:54:46,480 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1976#true} {1978#(= ~q_free~0 1)} #843#return; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 19:54:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:46,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {1998#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {1976#true} is VALID [2022-02-20 19:54:46,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {1976#true} assume 1 == ~p_dw_pc~0; {1976#true} is VALID [2022-02-20 19:54:46,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {1976#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {1976#true} is VALID [2022-02-20 19:54:46,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {1976#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {1976#true} is VALID [2022-02-20 19:54:46,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {1976#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {1976#true} is VALID [2022-02-20 19:54:46,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {1976#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {1976#true} is VALID [2022-02-20 19:54:46,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {1976#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {1976#true} is VALID [2022-02-20 19:54:46,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {1976#true} assume !(1 == ~c_dr_pc~0); {1976#true} is VALID [2022-02-20 19:54:46,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {1976#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {1976#true} is VALID [2022-02-20 19:54:46,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {1976#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {1976#true} is VALID [2022-02-20 19:54:46,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {1976#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {1976#true} is VALID [2022-02-20 19:54:46,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {1976#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {1976#true} is VALID [2022-02-20 19:54:46,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {1976#true} assume true; {1976#true} is VALID [2022-02-20 19:54:46,498 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1976#true} {1977#false} #847#return; {1977#false} is VALID [2022-02-20 19:54:46,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {1976#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {1976#true} is VALID [2022-02-20 19:54:46,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {1976#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {1976#true} is VALID [2022-02-20 19:54:46,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {1976#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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;~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; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {1978#(= ~q_free~0 1)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,500 INFO L290 TraceCheckUtils]: 4: Hoare triple {1978#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {1978#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#(= ~q_free~0 1)} assume !false; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#(= ~q_free~0 1)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {1978#(= ~q_free~0 1)} assume !false; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,502 INFO L272 TraceCheckUtils]: 10: Hoare triple {1978#(= ~q_free~0 1)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {1976#true} is VALID [2022-02-20 19:54:46,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {1976#true} havoc ~__retres1~2; {1976#true} is VALID [2022-02-20 19:54:46,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {1976#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {1976#true} is VALID [2022-02-20 19:54:46,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {1976#true} #res := ~__retres1~2; {1976#true} is VALID [2022-02-20 19:54:46,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {1976#true} assume true; {1976#true} is VALID [2022-02-20 19:54:46,504 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1976#true} {1978#(= ~q_free~0 1)} #843#return; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {1978#(= ~q_free~0 1)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {1978#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {1978#(= ~q_free~0 1)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {1978#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~1#1); {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {1978#(= ~q_free~0 1)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {1978#(= ~q_free~0 1)} assume 0 != eval1_~tmp___0~1#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; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {1978#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {1978#(= ~q_free~0 1)} assume !false; {1978#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:46,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {1978#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {1977#false} is VALID [2022-02-20 19:54:46,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {1977#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_read_ev~0 := 1; {1977#false} is VALID [2022-02-20 19:54:46,508 INFO L272 TraceCheckUtils]: 26: Hoare triple {1977#false} call immediate_notify_threads(); {1998#(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:54:46,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {1998#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {1976#true} is VALID [2022-02-20 19:54:46,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {1976#true} assume 1 == ~p_dw_pc~0; {1976#true} is VALID [2022-02-20 19:54:46,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {1976#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {1976#true} is VALID [2022-02-20 19:54:46,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {1976#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {1976#true} is VALID [2022-02-20 19:54:46,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {1976#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {1976#true} is VALID [2022-02-20 19:54:46,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {1976#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {1976#true} is VALID [2022-02-20 19:54:46,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {1976#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {1976#true} is VALID [2022-02-20 19:54:46,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {1976#true} assume !(1 == ~c_dr_pc~0); {1976#true} is VALID [2022-02-20 19:54:46,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {1976#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {1976#true} is VALID [2022-02-20 19:54:46,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {1976#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {1976#true} is VALID [2022-02-20 19:54:46,510 INFO L290 TraceCheckUtils]: 37: Hoare triple {1976#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {1976#true} is VALID [2022-02-20 19:54:46,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {1976#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {1976#true} is VALID [2022-02-20 19:54:46,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {1976#true} assume true; {1976#true} is VALID [2022-02-20 19:54:46,511 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1976#true} {1977#false} #847#return; {1977#false} is VALID [2022-02-20 19:54:46,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {1977#false} ~q_read_ev~0 := 2; {1977#false} is VALID [2022-02-20 19:54:46,511 INFO L290 TraceCheckUtils]: 42: Hoare triple {1977#false} assume !(~p_last_write~0 == ~c_last_read~0); {1977#false} is VALID [2022-02-20 19:54:46,512 INFO L272 TraceCheckUtils]: 43: Hoare triple {1977#false} call error1(); {1977#false} is VALID [2022-02-20 19:54:46,512 INFO L290 TraceCheckUtils]: 44: Hoare triple {1977#false} assume !false; {1977#false} is VALID [2022-02-20 19:54:46,512 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:54:46,513 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:46,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874624126] [2022-02-20 19:54:46,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874624126] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:46,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:46,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:46,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62091564] [2022-02-20 19:54:46,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:46,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-20 19:54:46,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:46,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:46,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:46,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:46,545 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:46,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:46,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:46,546 INFO L87 Difference]: Start difference. First operand 290 states and 422 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:47,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:47,263 INFO L93 Difference]: Finished difference Result 538 states and 762 transitions. [2022-02-20 19:54:47,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:47,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-20 19:54:47,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2022-02-20 19:54:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2022-02-20 19:54:47,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 510 transitions. [2022-02-20 19:54:47,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 510 edges. 510 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:47,700 INFO L225 Difference]: With dead ends: 538 [2022-02-20 19:54:47,700 INFO L226 Difference]: Without dead ends: 414 [2022-02-20 19:54:47,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:47,702 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 189 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:47,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 760 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 19:54:47,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-02-20 19:54:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 357. [2022-02-20 19:54:47,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:47,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 414 states. Second operand has 357 states, 309 states have (on average 1.4433656957928802) internal successors, (446), 314 states have internal predecessors, (446), 32 states have call successors, (32), 15 states have call predecessors, (32), 14 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2022-02-20 19:54:47,725 INFO L74 IsIncluded]: Start isIncluded. First operand 414 states. Second operand has 357 states, 309 states have (on average 1.4433656957928802) internal successors, (446), 314 states have internal predecessors, (446), 32 states have call successors, (32), 15 states have call predecessors, (32), 14 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2022-02-20 19:54:47,726 INFO L87 Difference]: Start difference. First operand 414 states. Second operand has 357 states, 309 states have (on average 1.4433656957928802) internal successors, (446), 314 states have internal predecessors, (446), 32 states have call successors, (32), 15 states have call predecessors, (32), 14 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2022-02-20 19:54:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:47,743 INFO L93 Difference]: Finished difference Result 414 states and 586 transitions. [2022-02-20 19:54:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 586 transitions. [2022-02-20 19:54:47,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:47,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:47,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 309 states have (on average 1.4433656957928802) internal successors, (446), 314 states have internal predecessors, (446), 32 states have call successors, (32), 15 states have call predecessors, (32), 14 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) Second operand 414 states. [2022-02-20 19:54:47,747 INFO L87 Difference]: Start difference. First operand has 357 states, 309 states have (on average 1.4433656957928802) internal successors, (446), 314 states have internal predecessors, (446), 32 states have call successors, (32), 15 states have call predecessors, (32), 14 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) Second operand 414 states. [2022-02-20 19:54:47,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:47,764 INFO L93 Difference]: Finished difference Result 414 states and 586 transitions. [2022-02-20 19:54:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 586 transitions. [2022-02-20 19:54:47,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:47,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:47,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:47,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 309 states have (on average 1.4433656957928802) internal successors, (446), 314 states have internal predecessors, (446), 32 states have call successors, (32), 15 states have call predecessors, (32), 14 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2022-02-20 19:54:47,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 512 transitions. [2022-02-20 19:54:47,782 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 512 transitions. Word has length 45 [2022-02-20 19:54:47,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:47,782 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 512 transitions. [2022-02-20 19:54:47,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:47,783 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 512 transitions. [2022-02-20 19:54:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 19:54:47,784 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:47,784 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] [2022-02-20 19:54:47,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:54:47,785 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:47,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:47,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2128075312, now seen corresponding path program 1 times [2022-02-20 19:54:47,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:47,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268055632] [2022-02-20 19:54:47,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:47,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {4050#true} havoc ~__retres1~2; {4050#true} is VALID [2022-02-20 19:54:47,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {4050#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4050#true} is VALID [2022-02-20 19:54:47,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {4050#true} #res := ~__retres1~2; {4050#true} is VALID [2022-02-20 19:54:47,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {4050#true} assume true; {4050#true} is VALID [2022-02-20 19:54:47,836 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4050#true} {4052#(= ~c_dr_pc~0 0)} #843#return; {4052#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 19:54:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {4072#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {4050#true} is VALID [2022-02-20 19:54:47,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {4050#true} assume 1 == ~p_dw_pc~0; {4050#true} is VALID [2022-02-20 19:54:47,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {4050#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {4050#true} is VALID [2022-02-20 19:54:47,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {4050#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {4050#true} is VALID [2022-02-20 19:54:47,852 INFO L290 TraceCheckUtils]: 4: Hoare triple {4050#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {4050#true} is VALID [2022-02-20 19:54:47,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {4050#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {4050#true} is VALID [2022-02-20 19:54:47,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {4050#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {4050#true} is VALID [2022-02-20 19:54:47,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {4050#true} assume !(1 == ~c_dr_pc~0); {4050#true} is VALID [2022-02-20 19:54:47,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {4050#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {4050#true} is VALID [2022-02-20 19:54:47,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {4050#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {4050#true} is VALID [2022-02-20 19:54:47,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {4050#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {4050#true} is VALID [2022-02-20 19:54:47,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {4050#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {4050#true} is VALID [2022-02-20 19:54:47,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {4050#true} assume true; {4050#true} is VALID [2022-02-20 19:54:47,853 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4050#true} {4051#false} #847#return; {4051#false} is VALID [2022-02-20 19:54:47,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {4050#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {4050#true} is VALID [2022-02-20 19:54:47,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {4050#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {4050#true} is VALID [2022-02-20 19:54:47,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {4050#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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;~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; {4052#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {4052#(= ~c_dr_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {4052#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,856 INFO L290 TraceCheckUtils]: 4: Hoare triple {4052#(= ~c_dr_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {4052#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {4052#(= ~c_dr_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {4052#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {4052#(= ~c_dr_pc~0 0)} assume { :end_inline_init_threads1 } true; {4052#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {4052#(= ~c_dr_pc~0 0)} assume !false; {4052#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {4052#(= ~c_dr_pc~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {4052#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {4052#(= ~c_dr_pc~0 0)} assume !false; {4052#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,858 INFO L272 TraceCheckUtils]: 10: Hoare triple {4052#(= ~c_dr_pc~0 0)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {4050#true} is VALID [2022-02-20 19:54:47,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {4050#true} havoc ~__retres1~2; {4050#true} is VALID [2022-02-20 19:54:47,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {4050#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4050#true} is VALID [2022-02-20 19:54:47,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {4050#true} #res := ~__retres1~2; {4050#true} is VALID [2022-02-20 19:54:47,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {4050#true} assume true; {4050#true} is VALID [2022-02-20 19:54:47,859 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4050#true} {4052#(= ~c_dr_pc~0 0)} #843#return; {4052#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {4052#(= ~c_dr_pc~0 0)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {4052#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {4052#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {4052#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {4052#(= ~c_dr_pc~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {4052#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {4052#(= ~c_dr_pc~0 0)} assume !(0 != eval1_~tmp~1#1); {4052#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {4052#(= ~c_dr_pc~0 0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {4052#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {4052#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___0~1#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; {4052#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:47,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {4052#(= ~c_dr_pc~0 0)} assume !(0 == ~c_dr_pc~0); {4051#false} is VALID [2022-02-20 19:54:47,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {4051#false} assume 1 == ~c_dr_pc~0; {4051#false} is VALID [2022-02-20 19:54:47,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {4051#false} do_read_c_~a~0#1 := ~a_t~0; {4051#false} is VALID [2022-02-20 19:54:47,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {4051#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_read_ev~0 := 1; {4051#false} is VALID [2022-02-20 19:54:47,863 INFO L272 TraceCheckUtils]: 26: Hoare triple {4051#false} call immediate_notify_threads(); {4072#(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:54:47,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {4072#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {4050#true} is VALID [2022-02-20 19:54:47,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {4050#true} assume 1 == ~p_dw_pc~0; {4050#true} is VALID [2022-02-20 19:54:47,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {4050#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {4050#true} is VALID [2022-02-20 19:54:47,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {4050#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {4050#true} is VALID [2022-02-20 19:54:47,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {4050#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {4050#true} is VALID [2022-02-20 19:54:47,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {4050#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {4050#true} is VALID [2022-02-20 19:54:47,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {4050#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {4050#true} is VALID [2022-02-20 19:54:47,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {4050#true} assume !(1 == ~c_dr_pc~0); {4050#true} is VALID [2022-02-20 19:54:47,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {4050#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {4050#true} is VALID [2022-02-20 19:54:47,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {4050#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {4050#true} is VALID [2022-02-20 19:54:47,865 INFO L290 TraceCheckUtils]: 37: Hoare triple {4050#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {4050#true} is VALID [2022-02-20 19:54:47,865 INFO L290 TraceCheckUtils]: 38: Hoare triple {4050#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {4050#true} is VALID [2022-02-20 19:54:47,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {4050#true} assume true; {4050#true} is VALID [2022-02-20 19:54:47,866 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4050#true} {4051#false} #847#return; {4051#false} is VALID [2022-02-20 19:54:47,866 INFO L290 TraceCheckUtils]: 41: Hoare triple {4051#false} ~q_read_ev~0 := 2; {4051#false} is VALID [2022-02-20 19:54:47,866 INFO L290 TraceCheckUtils]: 42: Hoare triple {4051#false} assume !(~p_last_write~0 == ~c_last_read~0); {4051#false} is VALID [2022-02-20 19:54:47,867 INFO L272 TraceCheckUtils]: 43: Hoare triple {4051#false} call error1(); {4051#false} is VALID [2022-02-20 19:54:47,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {4051#false} assume !false; {4051#false} is VALID [2022-02-20 19:54:47,867 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:54:47,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:47,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268055632] [2022-02-20 19:54:47,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268055632] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:47,868 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:47,868 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:47,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724980791] [2022-02-20 19:54:47,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:47,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-20 19:54:47,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:47,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:47,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:47,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:47,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:47,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:47,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:47,899 INFO L87 Difference]: Start difference. First operand 357 states and 512 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:48,485 INFO L93 Difference]: Finished difference Result 765 states and 1071 transitions. [2022-02-20 19:54:48,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:48,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-20 19:54:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2022-02-20 19:54:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2022-02-20 19:54:48,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 521 transitions. [2022-02-20 19:54:48,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 521 edges. 521 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:48,928 INFO L225 Difference]: With dead ends: 765 [2022-02-20 19:54:48,929 INFO L226 Difference]: Without dead ends: 574 [2022-02-20 19:54:48,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:48,937 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 426 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:48,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 603 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:54:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-02-20 19:54:48,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 522. [2022-02-20 19:54:48,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:48,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 574 states. Second operand has 522 states, 455 states have (on average 1.3978021978021977) internal successors, (636), 463 states have internal predecessors, (636), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (51), 37 states have call predecessors, (51), 39 states have call successors, (51) [2022-02-20 19:54:48,975 INFO L74 IsIncluded]: Start isIncluded. First operand 574 states. Second operand has 522 states, 455 states have (on average 1.3978021978021977) internal successors, (636), 463 states have internal predecessors, (636), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (51), 37 states have call predecessors, (51), 39 states have call successors, (51) [2022-02-20 19:54:48,977 INFO L87 Difference]: Start difference. First operand 574 states. Second operand has 522 states, 455 states have (on average 1.3978021978021977) internal successors, (636), 463 states have internal predecessors, (636), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (51), 37 states have call predecessors, (51), 39 states have call successors, (51) [2022-02-20 19:54:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:49,000 INFO L93 Difference]: Finished difference Result 574 states and 793 transitions. [2022-02-20 19:54:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 793 transitions. [2022-02-20 19:54:49,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:49,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:49,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 522 states, 455 states have (on average 1.3978021978021977) internal successors, (636), 463 states have internal predecessors, (636), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (51), 37 states have call predecessors, (51), 39 states have call successors, (51) Second operand 574 states. [2022-02-20 19:54:49,007 INFO L87 Difference]: Start difference. First operand has 522 states, 455 states have (on average 1.3978021978021977) internal successors, (636), 463 states have internal predecessors, (636), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (51), 37 states have call predecessors, (51), 39 states have call successors, (51) Second operand 574 states. [2022-02-20 19:54:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:49,029 INFO L93 Difference]: Finished difference Result 574 states and 793 transitions. [2022-02-20 19:54:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 793 transitions. [2022-02-20 19:54:49,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:49,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:49,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:49,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 455 states have (on average 1.3978021978021977) internal successors, (636), 463 states have internal predecessors, (636), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (51), 37 states have call predecessors, (51), 39 states have call successors, (51) [2022-02-20 19:54:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 730 transitions. [2022-02-20 19:54:49,052 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 730 transitions. Word has length 45 [2022-02-20 19:54:49,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:49,052 INFO L470 AbstractCegarLoop]: Abstraction has 522 states and 730 transitions. [2022-02-20 19:54:49,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:49,052 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 730 transitions. [2022-02-20 19:54:49,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 19:54:49,054 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:49,054 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:49,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:54:49,054 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:49,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:49,055 INFO L85 PathProgramCache]: Analyzing trace with hash 888089079, now seen corresponding path program 1 times [2022-02-20 19:54:49,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:49,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764393390] [2022-02-20 19:54:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:49,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:49,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:49,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {6979#true} havoc ~__retres1~2; {6979#true} is VALID [2022-02-20 19:54:49,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {6979#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6979#true} is VALID [2022-02-20 19:54:49,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {6979#true} #res := ~__retres1~2; {6979#true} is VALID [2022-02-20 19:54:49,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {6979#true} assume true; {6979#true} is VALID [2022-02-20 19:54:49,112 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6979#true} {6979#true} #843#return; {6979#true} is VALID [2022-02-20 19:54:49,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 19:54:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:49,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {6979#true} havoc ~__retres1~2; {6979#true} is VALID [2022-02-20 19:54:49,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {6979#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6979#true} is VALID [2022-02-20 19:54:49,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {6979#true} #res := ~__retres1~2; {6979#true} is VALID [2022-02-20 19:54:49,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {6979#true} assume true; {6979#true} is VALID [2022-02-20 19:54:49,119 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6979#true} {6986#(= ~c_dr_st~0 2)} #843#return; {6986#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:49,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:54:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:49,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {7006#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {6979#true} is VALID [2022-02-20 19:54:49,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {6979#true} assume 1 == ~p_dw_pc~0; {6979#true} is VALID [2022-02-20 19:54:49,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {6979#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {6979#true} is VALID [2022-02-20 19:54:49,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {6979#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {6979#true} is VALID [2022-02-20 19:54:49,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {6979#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {6979#true} is VALID [2022-02-20 19:54:49,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {6979#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {6979#true} is VALID [2022-02-20 19:54:49,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {6979#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {6979#true} is VALID [2022-02-20 19:54:49,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {6979#true} assume !(1 == ~c_dr_pc~0); {6979#true} is VALID [2022-02-20 19:54:49,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {6979#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {6979#true} is VALID [2022-02-20 19:54:49,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {6979#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {6979#true} is VALID [2022-02-20 19:54:49,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {6979#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {6979#true} is VALID [2022-02-20 19:54:49,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {6979#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {6979#true} is VALID [2022-02-20 19:54:49,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {6979#true} assume true; {6979#true} is VALID [2022-02-20 19:54:49,134 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6979#true} {6980#false} #847#return; {6980#false} is VALID [2022-02-20 19:54:49,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {6979#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {6979#true} is VALID [2022-02-20 19:54:49,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {6979#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {6979#true} is VALID [2022-02-20 19:54:49,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {6979#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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;~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; {6979#true} is VALID [2022-02-20 19:54:49,135 INFO L290 TraceCheckUtils]: 3: Hoare triple {6979#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {6979#true} is VALID [2022-02-20 19:54:49,135 INFO L290 TraceCheckUtils]: 4: Hoare triple {6979#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {6979#true} is VALID [2022-02-20 19:54:49,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {6979#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {6979#true} is VALID [2022-02-20 19:54:49,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {6979#true} assume { :end_inline_init_threads1 } true; {6979#true} is VALID [2022-02-20 19:54:49,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {6979#true} assume !false; {6979#true} is VALID [2022-02-20 19:54:49,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {6979#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {6979#true} is VALID [2022-02-20 19:54:49,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {6979#true} assume !false; {6979#true} is VALID [2022-02-20 19:54:49,137 INFO L272 TraceCheckUtils]: 10: Hoare triple {6979#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {6979#true} is VALID [2022-02-20 19:54:49,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {6979#true} havoc ~__retres1~2; {6979#true} is VALID [2022-02-20 19:54:49,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {6979#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6979#true} is VALID [2022-02-20 19:54:49,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {6979#true} #res := ~__retres1~2; {6979#true} is VALID [2022-02-20 19:54:49,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {6979#true} assume true; {6979#true} is VALID [2022-02-20 19:54:49,137 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6979#true} {6979#true} #843#return; {6979#true} is VALID [2022-02-20 19:54:49,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {6979#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {6979#true} is VALID [2022-02-20 19:54:49,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {6979#true} assume 0 != eval1_~tmp___1~0#1; {6979#true} is VALID [2022-02-20 19:54:49,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {6979#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {6979#true} is VALID [2022-02-20 19:54:49,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {6979#true} assume !(0 != eval1_~tmp~1#1); {6979#true} is VALID [2022-02-20 19:54:49,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {6979#true} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {6979#true} is VALID [2022-02-20 19:54:49,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {6979#true} assume 0 != eval1_~tmp___0~1#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; {6979#true} is VALID [2022-02-20 19:54:49,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {6979#true} assume 0 == ~c_dr_pc~0; {6979#true} is VALID [2022-02-20 19:54:49,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {6979#true} assume !false; {6979#true} is VALID [2022-02-20 19:54:49,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {6979#true} assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0#1; {6986#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:49,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {6986#(= ~c_dr_st~0 2)} assume { :end_inline_do_read_c } true; {6986#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:49,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {6986#(= ~c_dr_st~0 2)} assume !false; {6986#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:49,140 INFO L272 TraceCheckUtils]: 27: Hoare triple {6986#(= ~c_dr_st~0 2)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {6979#true} is VALID [2022-02-20 19:54:49,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {6979#true} havoc ~__retres1~2; {6979#true} is VALID [2022-02-20 19:54:49,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {6979#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6979#true} is VALID [2022-02-20 19:54:49,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {6979#true} #res := ~__retres1~2; {6979#true} is VALID [2022-02-20 19:54:49,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {6979#true} assume true; {6979#true} is VALID [2022-02-20 19:54:49,142 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6979#true} {6986#(= ~c_dr_st~0 2)} #843#return; {6986#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:49,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {6986#(= ~c_dr_st~0 2)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {6986#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:49,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {6986#(= ~c_dr_st~0 2)} assume 0 != eval1_~tmp___1~0#1; {6986#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:49,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {6986#(= ~c_dr_st~0 2)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {6986#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:49,143 INFO L290 TraceCheckUtils]: 36: Hoare triple {6986#(= ~c_dr_st~0 2)} assume !(0 != eval1_~tmp~1#1); {6986#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:54:49,144 INFO L290 TraceCheckUtils]: 37: Hoare triple {6986#(= ~c_dr_st~0 2)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {6980#false} is VALID [2022-02-20 19:54:49,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {6980#false} assume 0 != eval1_~tmp___0~1#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; {6980#false} is VALID [2022-02-20 19:54:49,144 INFO L290 TraceCheckUtils]: 39: Hoare triple {6980#false} assume !(0 == ~c_dr_pc~0); {6980#false} is VALID [2022-02-20 19:54:49,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {6980#false} assume 1 == ~c_dr_pc~0; {6980#false} is VALID [2022-02-20 19:54:49,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {6980#false} do_read_c_~a~0#1 := ~a_t~0; {6980#false} is VALID [2022-02-20 19:54:49,145 INFO L290 TraceCheckUtils]: 42: Hoare triple {6980#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_read_ev~0 := 1; {6980#false} is VALID [2022-02-20 19:54:49,145 INFO L272 TraceCheckUtils]: 43: Hoare triple {6980#false} call immediate_notify_threads(); {7006#(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:54:49,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {7006#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {6979#true} is VALID [2022-02-20 19:54:49,145 INFO L290 TraceCheckUtils]: 45: Hoare triple {6979#true} assume 1 == ~p_dw_pc~0; {6979#true} is VALID [2022-02-20 19:54:49,145 INFO L290 TraceCheckUtils]: 46: Hoare triple {6979#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {6979#true} is VALID [2022-02-20 19:54:49,146 INFO L290 TraceCheckUtils]: 47: Hoare triple {6979#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {6979#true} is VALID [2022-02-20 19:54:49,146 INFO L290 TraceCheckUtils]: 48: Hoare triple {6979#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {6979#true} is VALID [2022-02-20 19:54:49,146 INFO L290 TraceCheckUtils]: 49: Hoare triple {6979#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {6979#true} is VALID [2022-02-20 19:54:49,146 INFO L290 TraceCheckUtils]: 50: Hoare triple {6979#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {6979#true} is VALID [2022-02-20 19:54:49,146 INFO L290 TraceCheckUtils]: 51: Hoare triple {6979#true} assume !(1 == ~c_dr_pc~0); {6979#true} is VALID [2022-02-20 19:54:49,147 INFO L290 TraceCheckUtils]: 52: Hoare triple {6979#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {6979#true} is VALID [2022-02-20 19:54:49,147 INFO L290 TraceCheckUtils]: 53: Hoare triple {6979#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {6979#true} is VALID [2022-02-20 19:54:49,147 INFO L290 TraceCheckUtils]: 54: Hoare triple {6979#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {6979#true} is VALID [2022-02-20 19:54:49,147 INFO L290 TraceCheckUtils]: 55: Hoare triple {6979#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {6979#true} is VALID [2022-02-20 19:54:49,147 INFO L290 TraceCheckUtils]: 56: Hoare triple {6979#true} assume true; {6979#true} is VALID [2022-02-20 19:54:49,147 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6979#true} {6980#false} #847#return; {6980#false} is VALID [2022-02-20 19:54:49,148 INFO L290 TraceCheckUtils]: 58: Hoare triple {6980#false} ~q_read_ev~0 := 2; {6980#false} is VALID [2022-02-20 19:54:49,148 INFO L290 TraceCheckUtils]: 59: Hoare triple {6980#false} assume !(~p_last_write~0 == ~c_last_read~0); {6980#false} is VALID [2022-02-20 19:54:49,148 INFO L272 TraceCheckUtils]: 60: Hoare triple {6980#false} call error1(); {6980#false} is VALID [2022-02-20 19:54:49,148 INFO L290 TraceCheckUtils]: 61: Hoare triple {6980#false} assume !false; {6980#false} is VALID [2022-02-20 19:54:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 19:54:49,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:49,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764393390] [2022-02-20 19:54:49,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764393390] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:49,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:49,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:49,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142125849] [2022-02-20 19:54:49,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:49,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-02-20 19:54:49,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:49,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:49,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:49,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:49,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:49,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:49,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:49,192 INFO L87 Difference]: Start difference. First operand 522 states and 730 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:49,950 INFO L93 Difference]: Finished difference Result 1106 states and 1515 transitions. [2022-02-20 19:54:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:49,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-02-20 19:54:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2022-02-20 19:54:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2022-02-20 19:54:49,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 508 transitions. [2022-02-20 19:54:50,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:50,326 INFO L225 Difference]: With dead ends: 1106 [2022-02-20 19:54:50,327 INFO L226 Difference]: Without dead ends: 750 [2022-02-20 19:54:50,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:50,328 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 173 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:50,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 815 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 19:54:50,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-02-20 19:54:50,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 712. [2022-02-20 19:54:50,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:50,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 750 states. Second operand has 712 states, 621 states have (on average 1.3462157809983897) internal successors, (836), 631 states have internal predecessors, (836), 57 states have call successors, (57), 30 states have call predecessors, (57), 32 states have return successors, (75), 51 states have call predecessors, (75), 53 states have call successors, (75) [2022-02-20 19:54:50,353 INFO L74 IsIncluded]: Start isIncluded. First operand 750 states. Second operand has 712 states, 621 states have (on average 1.3462157809983897) internal successors, (836), 631 states have internal predecessors, (836), 57 states have call successors, (57), 30 states have call predecessors, (57), 32 states have return successors, (75), 51 states have call predecessors, (75), 53 states have call successors, (75) [2022-02-20 19:54:50,354 INFO L87 Difference]: Start difference. First operand 750 states. Second operand has 712 states, 621 states have (on average 1.3462157809983897) internal successors, (836), 631 states have internal predecessors, (836), 57 states have call successors, (57), 30 states have call predecessors, (57), 32 states have return successors, (75), 51 states have call predecessors, (75), 53 states have call successors, (75) [2022-02-20 19:54:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:50,385 INFO L93 Difference]: Finished difference Result 750 states and 1014 transitions. [2022-02-20 19:54:50,385 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1014 transitions. [2022-02-20 19:54:50,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:50,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:50,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 712 states, 621 states have (on average 1.3462157809983897) internal successors, (836), 631 states have internal predecessors, (836), 57 states have call successors, (57), 30 states have call predecessors, (57), 32 states have return successors, (75), 51 states have call predecessors, (75), 53 states have call successors, (75) Second operand 750 states. [2022-02-20 19:54:50,390 INFO L87 Difference]: Start difference. First operand has 712 states, 621 states have (on average 1.3462157809983897) internal successors, (836), 631 states have internal predecessors, (836), 57 states have call successors, (57), 30 states have call predecessors, (57), 32 states have return successors, (75), 51 states have call predecessors, (75), 53 states have call successors, (75) Second operand 750 states. [2022-02-20 19:54:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:50,429 INFO L93 Difference]: Finished difference Result 750 states and 1014 transitions. [2022-02-20 19:54:50,429 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1014 transitions. [2022-02-20 19:54:50,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:50,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:50,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:50,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 621 states have (on average 1.3462157809983897) internal successors, (836), 631 states have internal predecessors, (836), 57 states have call successors, (57), 30 states have call predecessors, (57), 32 states have return successors, (75), 51 states have call predecessors, (75), 53 states have call successors, (75) [2022-02-20 19:54:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 968 transitions. [2022-02-20 19:54:50,469 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 968 transitions. Word has length 62 [2022-02-20 19:54:50,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:50,470 INFO L470 AbstractCegarLoop]: Abstraction has 712 states and 968 transitions. [2022-02-20 19:54:50,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:50,470 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 968 transitions. [2022-02-20 19:54:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 19:54:50,472 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:50,472 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:50,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:54:50,472 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:50,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:50,473 INFO L85 PathProgramCache]: Analyzing trace with hash 306547218, now seen corresponding path program 1 times [2022-02-20 19:54:50,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:50,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657497188] [2022-02-20 19:54:50,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:50,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:50,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:50,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {11011#true} havoc ~__retres1~2; {11011#true} is VALID [2022-02-20 19:54:50,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {11011#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {11011#true} is VALID [2022-02-20 19:54:50,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {11011#true} #res := ~__retres1~2; {11011#true} is VALID [2022-02-20 19:54:50,511 INFO L290 TraceCheckUtils]: 3: Hoare triple {11011#true} assume true; {11011#true} is VALID [2022-02-20 19:54:50,512 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11011#true} {11013#(= ~p_dw_pc~0 0)} #843#return; {11013#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 19:54:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:50,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {11047#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {11011#true} is VALID [2022-02-20 19:54:50,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {11011#true} assume 1 == ~p_dw_pc~0; {11011#true} is VALID [2022-02-20 19:54:50,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {11011#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {11011#true} is VALID [2022-02-20 19:54:50,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {11011#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {11011#true} is VALID [2022-02-20 19:54:50,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {11011#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {11011#true} is VALID [2022-02-20 19:54:50,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {11011#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {11011#true} is VALID [2022-02-20 19:54:50,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {11011#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {11011#true} is VALID [2022-02-20 19:54:50,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {11011#true} assume !(1 == ~c_dr_pc~0); {11011#true} is VALID [2022-02-20 19:54:50,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {11011#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {11011#true} is VALID [2022-02-20 19:54:50,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {11011#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {11011#true} is VALID [2022-02-20 19:54:50,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {11011#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {11011#true} is VALID [2022-02-20 19:54:50,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {11011#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {11011#true} is VALID [2022-02-20 19:54:50,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {11011#true} assume true; {11011#true} is VALID [2022-02-20 19:54:50,525 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11011#true} {11012#false} #845#return; {11012#false} is VALID [2022-02-20 19:54:50,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:54:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:50,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {11047#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {11011#true} is VALID [2022-02-20 19:54:50,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {11011#true} assume 1 == ~p_dw_pc~0; {11011#true} is VALID [2022-02-20 19:54:50,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {11011#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {11011#true} is VALID [2022-02-20 19:54:50,533 INFO L290 TraceCheckUtils]: 3: Hoare triple {11011#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {11011#true} is VALID [2022-02-20 19:54:50,533 INFO L290 TraceCheckUtils]: 4: Hoare triple {11011#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {11011#true} is VALID [2022-02-20 19:54:50,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {11011#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {11011#true} is VALID [2022-02-20 19:54:50,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {11011#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {11011#true} is VALID [2022-02-20 19:54:50,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {11011#true} assume !(1 == ~c_dr_pc~0); {11011#true} is VALID [2022-02-20 19:54:50,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {11011#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {11011#true} is VALID [2022-02-20 19:54:50,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {11011#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {11011#true} is VALID [2022-02-20 19:54:50,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {11011#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {11011#true} is VALID [2022-02-20 19:54:50,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {11011#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {11011#true} is VALID [2022-02-20 19:54:50,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {11011#true} assume true; {11011#true} is VALID [2022-02-20 19:54:50,535 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11011#true} {11012#false} #847#return; {11012#false} is VALID [2022-02-20 19:54:50,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {11011#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {11011#true} is VALID [2022-02-20 19:54:50,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {11011#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {11011#true} is VALID [2022-02-20 19:54:50,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {11011#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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;~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; {11013#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,536 INFO L290 TraceCheckUtils]: 3: Hoare triple {11013#(= ~p_dw_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {11013#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {11013#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {11013#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {11013#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {11013#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {11013#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {11013#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {11013#(= ~p_dw_pc~0 0)} assume !false; {11013#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {11013#(= ~p_dw_pc~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {11013#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {11013#(= ~p_dw_pc~0 0)} assume !false; {11013#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,539 INFO L272 TraceCheckUtils]: 10: Hoare triple {11013#(= ~p_dw_pc~0 0)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {11011#true} is VALID [2022-02-20 19:54:50,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {11011#true} havoc ~__retres1~2; {11011#true} is VALID [2022-02-20 19:54:50,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {11011#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {11011#true} is VALID [2022-02-20 19:54:50,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {11011#true} #res := ~__retres1~2; {11011#true} is VALID [2022-02-20 19:54:50,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {11011#true} assume true; {11011#true} is VALID [2022-02-20 19:54:50,540 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11011#true} {11013#(= ~p_dw_pc~0 0)} #843#return; {11013#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {11013#(= ~p_dw_pc~0 0)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {11013#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {11013#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {11013#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {11013#(= ~p_dw_pc~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {11013#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {11013#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {11013#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:54:50,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {11013#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {11012#false} is VALID [2022-02-20 19:54:50,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {11012#false} assume 1 == ~p_dw_pc~0; {11012#false} is VALID [2022-02-20 19:54:50,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {11012#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {11012#false} is VALID [2022-02-20 19:54:50,542 INFO L272 TraceCheckUtils]: 23: Hoare triple {11012#false} call immediate_notify_threads(); {11047#(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:54:50,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {11047#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {11011#true} is VALID [2022-02-20 19:54:50,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {11011#true} assume 1 == ~p_dw_pc~0; {11011#true} is VALID [2022-02-20 19:54:50,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {11011#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {11011#true} is VALID [2022-02-20 19:54:50,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {11011#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {11011#true} is VALID [2022-02-20 19:54:50,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {11011#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {11011#true} is VALID [2022-02-20 19:54:50,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {11011#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {11011#true} is VALID [2022-02-20 19:54:50,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {11011#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {11011#true} is VALID [2022-02-20 19:54:50,544 INFO L290 TraceCheckUtils]: 31: Hoare triple {11011#true} assume !(1 == ~c_dr_pc~0); {11011#true} is VALID [2022-02-20 19:54:50,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {11011#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {11011#true} is VALID [2022-02-20 19:54:50,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {11011#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {11011#true} is VALID [2022-02-20 19:54:50,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {11011#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {11011#true} is VALID [2022-02-20 19:54:50,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {11011#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {11011#true} is VALID [2022-02-20 19:54:50,556 INFO L290 TraceCheckUtils]: 36: Hoare triple {11011#true} assume true; {11011#true} is VALID [2022-02-20 19:54:50,556 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11011#true} {11012#false} #845#return; {11012#false} is VALID [2022-02-20 19:54:50,556 INFO L290 TraceCheckUtils]: 38: Hoare triple {11012#false} ~q_write_ev~0 := 2; {11012#false} is VALID [2022-02-20 19:54:50,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {11012#false} assume !false; {11012#false} is VALID [2022-02-20 19:54:50,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {11012#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {11012#false} is VALID [2022-02-20 19:54:50,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {11012#false} assume { :end_inline_do_write_p } true; {11012#false} is VALID [2022-02-20 19:54:50,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {11012#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {11012#false} is VALID [2022-02-20 19:54:50,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {11012#false} assume 0 != eval1_~tmp___0~1#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; {11012#false} is VALID [2022-02-20 19:54:50,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {11012#false} assume 0 == ~c_dr_pc~0; {11012#false} is VALID [2022-02-20 19:54:50,557 INFO L290 TraceCheckUtils]: 45: Hoare triple {11012#false} assume !false; {11012#false} is VALID [2022-02-20 19:54:50,557 INFO L290 TraceCheckUtils]: 46: Hoare triple {11012#false} assume !(1 == ~q_free~0); {11012#false} is VALID [2022-02-20 19:54:50,557 INFO L290 TraceCheckUtils]: 47: Hoare triple {11012#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_read_ev~0 := 1; {11012#false} is VALID [2022-02-20 19:54:50,558 INFO L272 TraceCheckUtils]: 48: Hoare triple {11012#false} call immediate_notify_threads(); {11047#(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:54:50,558 INFO L290 TraceCheckUtils]: 49: Hoare triple {11047#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {11011#true} is VALID [2022-02-20 19:54:50,558 INFO L290 TraceCheckUtils]: 50: Hoare triple {11011#true} assume 1 == ~p_dw_pc~0; {11011#true} is VALID [2022-02-20 19:54:50,558 INFO L290 TraceCheckUtils]: 51: Hoare triple {11011#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {11011#true} is VALID [2022-02-20 19:54:50,558 INFO L290 TraceCheckUtils]: 52: Hoare triple {11011#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {11011#true} is VALID [2022-02-20 19:54:50,558 INFO L290 TraceCheckUtils]: 53: Hoare triple {11011#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {11011#true} is VALID [2022-02-20 19:54:50,559 INFO L290 TraceCheckUtils]: 54: Hoare triple {11011#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {11011#true} is VALID [2022-02-20 19:54:50,559 INFO L290 TraceCheckUtils]: 55: Hoare triple {11011#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {11011#true} is VALID [2022-02-20 19:54:50,559 INFO L290 TraceCheckUtils]: 56: Hoare triple {11011#true} assume !(1 == ~c_dr_pc~0); {11011#true} is VALID [2022-02-20 19:54:50,559 INFO L290 TraceCheckUtils]: 57: Hoare triple {11011#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {11011#true} is VALID [2022-02-20 19:54:50,559 INFO L290 TraceCheckUtils]: 58: Hoare triple {11011#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {11011#true} is VALID [2022-02-20 19:54:50,560 INFO L290 TraceCheckUtils]: 59: Hoare triple {11011#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {11011#true} is VALID [2022-02-20 19:54:50,560 INFO L290 TraceCheckUtils]: 60: Hoare triple {11011#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {11011#true} is VALID [2022-02-20 19:54:50,560 INFO L290 TraceCheckUtils]: 61: Hoare triple {11011#true} assume true; {11011#true} is VALID [2022-02-20 19:54:50,560 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {11011#true} {11012#false} #847#return; {11012#false} is VALID [2022-02-20 19:54:50,560 INFO L290 TraceCheckUtils]: 63: Hoare triple {11012#false} ~q_read_ev~0 := 2; {11012#false} is VALID [2022-02-20 19:54:50,560 INFO L290 TraceCheckUtils]: 64: Hoare triple {11012#false} assume !(~p_last_write~0 == ~c_last_read~0); {11012#false} is VALID [2022-02-20 19:54:50,561 INFO L272 TraceCheckUtils]: 65: Hoare triple {11012#false} call error1(); {11012#false} is VALID [2022-02-20 19:54:50,561 INFO L290 TraceCheckUtils]: 66: Hoare triple {11012#false} assume !false; {11012#false} is VALID [2022-02-20 19:54:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 19:54:50,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:50,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657497188] [2022-02-20 19:54:50,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657497188] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:50,562 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:50,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:50,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077033894] [2022-02-20 19:54:50,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:50,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-02-20 19:54:50,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:50,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:54:50,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:50,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:50,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:50,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:50,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:50,601 INFO L87 Difference]: Start difference. First operand 712 states and 968 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:54:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:51,245 INFO L93 Difference]: Finished difference Result 1365 states and 1821 transitions. [2022-02-20 19:54:51,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:51,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-02-20 19:54:51,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:54:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2022-02-20 19:54:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:54:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2022-02-20 19:54:51,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 506 transitions. [2022-02-20 19:54:51,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 506 edges. 506 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:51,654 INFO L225 Difference]: With dead ends: 1365 [2022-02-20 19:54:51,655 INFO L226 Difference]: Without dead ends: 911 [2022-02-20 19:54:51,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:51,657 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 413 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:51,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 600 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:54:51,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2022-02-20 19:54:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 856. [2022-02-20 19:54:51,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:51,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 911 states. Second operand has 856 states, 749 states have (on average 1.3177570093457944) internal successors, (987), 761 states have internal predecessors, (987), 65 states have call successors, (65), 36 states have call predecessors, (65), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2022-02-20 19:54:51,689 INFO L74 IsIncluded]: Start isIncluded. First operand 911 states. Second operand has 856 states, 749 states have (on average 1.3177570093457944) internal successors, (987), 761 states have internal predecessors, (987), 65 states have call successors, (65), 36 states have call predecessors, (65), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2022-02-20 19:54:51,690 INFO L87 Difference]: Start difference. First operand 911 states. Second operand has 856 states, 749 states have (on average 1.3177570093457944) internal successors, (987), 761 states have internal predecessors, (987), 65 states have call successors, (65), 36 states have call predecessors, (65), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2022-02-20 19:54:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:51,737 INFO L93 Difference]: Finished difference Result 911 states and 1208 transitions. [2022-02-20 19:54:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1208 transitions. [2022-02-20 19:54:51,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:51,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:51,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 856 states, 749 states have (on average 1.3177570093457944) internal successors, (987), 761 states have internal predecessors, (987), 65 states have call successors, (65), 36 states have call predecessors, (65), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) Second operand 911 states. [2022-02-20 19:54:51,744 INFO L87 Difference]: Start difference. First operand has 856 states, 749 states have (on average 1.3177570093457944) internal successors, (987), 761 states have internal predecessors, (987), 65 states have call successors, (65), 36 states have call predecessors, (65), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) Second operand 911 states. [2022-02-20 19:54:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:51,806 INFO L93 Difference]: Finished difference Result 911 states and 1208 transitions. [2022-02-20 19:54:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1208 transitions. [2022-02-20 19:54:51,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:51,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:51,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:51,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 749 states have (on average 1.3177570093457944) internal successors, (987), 761 states have internal predecessors, (987), 65 states have call successors, (65), 36 states have call predecessors, (65), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2022-02-20 19:54:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1141 transitions. [2022-02-20 19:54:51,861 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1141 transitions. Word has length 67 [2022-02-20 19:54:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:51,861 INFO L470 AbstractCegarLoop]: Abstraction has 856 states and 1141 transitions. [2022-02-20 19:54:51,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:54:51,862 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1141 transitions. [2022-02-20 19:54:51,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:54:51,863 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:51,864 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:51,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:54:51,864 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:51,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:51,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1645428910, now seen corresponding path program 1 times [2022-02-20 19:54:51,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:51,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982983084] [2022-02-20 19:54:51,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:51,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:51,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {15940#true} havoc ~__retres1~2; {15940#true} is VALID [2022-02-20 19:54:51,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {15940#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {15940#true} is VALID [2022-02-20 19:54:51,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {15940#true} #res := ~__retres1~2; {15940#true} is VALID [2022-02-20 19:54:51,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {15940#true} assume true; {15940#true} is VALID [2022-02-20 19:54:51,926 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15940#true} {15940#true} #843#return; {15940#true} is VALID [2022-02-20 19:54:51,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:54:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:51,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {15975#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {15940#true} is VALID [2022-02-20 19:54:51,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {15940#true} assume !(1 == ~p_dw_pc~0); {15940#true} is VALID [2022-02-20 19:54:51,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {15940#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {15976#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is VALID [2022-02-20 19:54:51,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {15976#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {15977#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} is VALID [2022-02-20 19:54:51,993 INFO L290 TraceCheckUtils]: 4: Hoare triple {15977#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {15978#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} is VALID [2022-02-20 19:54:51,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {15978#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {15941#false} is VALID [2022-02-20 19:54:51,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {15941#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {15941#false} is VALID [2022-02-20 19:54:51,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {15941#false} assume !(1 == ~c_dr_pc~0); {15941#false} is VALID [2022-02-20 19:54:51,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {15941#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {15941#false} is VALID [2022-02-20 19:54:51,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {15941#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {15941#false} is VALID [2022-02-20 19:54:51,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {15941#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {15941#false} is VALID [2022-02-20 19:54:51,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {15941#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {15941#false} is VALID [2022-02-20 19:54:51,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {15941#false} assume true; {15941#false} is VALID [2022-02-20 19:54:51,995 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15941#false} {15940#true} #845#return; {15941#false} is VALID [2022-02-20 19:54:51,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 19:54:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:52,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {15975#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {15940#true} is VALID [2022-02-20 19:54:52,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {15940#true} assume 1 == ~p_dw_pc~0; {15940#true} is VALID [2022-02-20 19:54:52,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {15940#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {15940#true} is VALID [2022-02-20 19:54:52,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {15940#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {15940#true} is VALID [2022-02-20 19:54:52,003 INFO L290 TraceCheckUtils]: 4: Hoare triple {15940#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {15940#true} is VALID [2022-02-20 19:54:52,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {15940#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {15940#true} is VALID [2022-02-20 19:54:52,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {15940#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {15940#true} is VALID [2022-02-20 19:54:52,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {15940#true} assume !(1 == ~c_dr_pc~0); {15940#true} is VALID [2022-02-20 19:54:52,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {15940#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {15940#true} is VALID [2022-02-20 19:54:52,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {15940#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {15940#true} is VALID [2022-02-20 19:54:52,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {15940#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {15940#true} is VALID [2022-02-20 19:54:52,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {15940#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {15940#true} is VALID [2022-02-20 19:54:52,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {15940#true} assume true; {15940#true} is VALID [2022-02-20 19:54:52,005 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15940#true} {15941#false} #847#return; {15941#false} is VALID [2022-02-20 19:54:52,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {15940#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {15940#true} is VALID [2022-02-20 19:54:52,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {15940#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {15940#true} is VALID [2022-02-20 19:54:52,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {15940#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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;~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; {15940#true} is VALID [2022-02-20 19:54:52,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {15940#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {15940#true} is VALID [2022-02-20 19:54:52,006 INFO L290 TraceCheckUtils]: 4: Hoare triple {15940#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {15940#true} is VALID [2022-02-20 19:54:52,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {15940#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {15940#true} is VALID [2022-02-20 19:54:52,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {15940#true} assume { :end_inline_init_threads1 } true; {15940#true} is VALID [2022-02-20 19:54:52,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {15940#true} assume !false; {15940#true} is VALID [2022-02-20 19:54:52,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {15940#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {15940#true} is VALID [2022-02-20 19:54:52,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {15940#true} assume !false; {15940#true} is VALID [2022-02-20 19:54:52,007 INFO L272 TraceCheckUtils]: 10: Hoare triple {15940#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {15940#true} is VALID [2022-02-20 19:54:52,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {15940#true} havoc ~__retres1~2; {15940#true} is VALID [2022-02-20 19:54:52,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {15940#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {15940#true} is VALID [2022-02-20 19:54:52,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {15940#true} #res := ~__retres1~2; {15940#true} is VALID [2022-02-20 19:54:52,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {15940#true} assume true; {15940#true} is VALID [2022-02-20 19:54:52,007 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15940#true} {15940#true} #843#return; {15940#true} is VALID [2022-02-20 19:54:52,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {15940#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {15940#true} is VALID [2022-02-20 19:54:52,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {15940#true} assume 0 != eval1_~tmp___1~0#1; {15940#true} is VALID [2022-02-20 19:54:52,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {15940#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {15940#true} is VALID [2022-02-20 19:54:52,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {15940#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {15940#true} is VALID [2022-02-20 19:54:52,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {15940#true} assume 0 == ~p_dw_pc~0; {15940#true} is VALID [2022-02-20 19:54:52,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {15940#true} assume !false; {15940#true} is VALID [2022-02-20 19:54:52,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {15940#true} assume !(0 == ~q_free~0); {15940#true} is VALID [2022-02-20 19:54:52,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {15940#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {15940#true} is VALID [2022-02-20 19:54:52,009 INFO L272 TraceCheckUtils]: 24: Hoare triple {15940#true} call immediate_notify_threads(); {15975#(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:54:52,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {15975#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {15940#true} is VALID [2022-02-20 19:54:52,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {15940#true} assume !(1 == ~p_dw_pc~0); {15940#true} is VALID [2022-02-20 19:54:52,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {15940#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {15976#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is VALID [2022-02-20 19:54:52,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {15976#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {15977#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} is VALID [2022-02-20 19:54:52,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {15977#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {15978#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} is VALID [2022-02-20 19:54:52,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {15978#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {15941#false} is VALID [2022-02-20 19:54:52,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {15941#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {15941#false} is VALID [2022-02-20 19:54:52,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {15941#false} assume !(1 == ~c_dr_pc~0); {15941#false} is VALID [2022-02-20 19:54:52,016 INFO L290 TraceCheckUtils]: 33: Hoare triple {15941#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {15941#false} is VALID [2022-02-20 19:54:52,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {15941#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {15941#false} is VALID [2022-02-20 19:54:52,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {15941#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {15941#false} is VALID [2022-02-20 19:54:52,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {15941#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {15941#false} is VALID [2022-02-20 19:54:52,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {15941#false} assume true; {15941#false} is VALID [2022-02-20 19:54:52,017 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15941#false} {15940#true} #845#return; {15941#false} is VALID [2022-02-20 19:54:52,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {15941#false} ~q_write_ev~0 := 2; {15941#false} is VALID [2022-02-20 19:54:52,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {15941#false} assume !false; {15941#false} is VALID [2022-02-20 19:54:52,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {15941#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {15941#false} is VALID [2022-02-20 19:54:52,017 INFO L290 TraceCheckUtils]: 42: Hoare triple {15941#false} assume { :end_inline_do_write_p } true; {15941#false} is VALID [2022-02-20 19:54:52,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {15941#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {15941#false} is VALID [2022-02-20 19:54:52,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {15941#false} assume 0 != eval1_~tmp___0~1#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; {15941#false} is VALID [2022-02-20 19:54:52,018 INFO L290 TraceCheckUtils]: 45: Hoare triple {15941#false} assume 0 == ~c_dr_pc~0; {15941#false} is VALID [2022-02-20 19:54:52,018 INFO L290 TraceCheckUtils]: 46: Hoare triple {15941#false} assume !false; {15941#false} is VALID [2022-02-20 19:54:52,018 INFO L290 TraceCheckUtils]: 47: Hoare triple {15941#false} assume !(1 == ~q_free~0); {15941#false} is VALID [2022-02-20 19:54:52,018 INFO L290 TraceCheckUtils]: 48: Hoare triple {15941#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_read_ev~0 := 1; {15941#false} is VALID [2022-02-20 19:54:52,018 INFO L272 TraceCheckUtils]: 49: Hoare triple {15941#false} call immediate_notify_threads(); {15975#(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:54:52,019 INFO L290 TraceCheckUtils]: 50: Hoare triple {15975#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {15940#true} is VALID [2022-02-20 19:54:52,019 INFO L290 TraceCheckUtils]: 51: Hoare triple {15940#true} assume 1 == ~p_dw_pc~0; {15940#true} is VALID [2022-02-20 19:54:52,020 INFO L290 TraceCheckUtils]: 52: Hoare triple {15940#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {15940#true} is VALID [2022-02-20 19:54:52,021 INFO L290 TraceCheckUtils]: 53: Hoare triple {15940#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {15940#true} is VALID [2022-02-20 19:54:52,021 INFO L290 TraceCheckUtils]: 54: Hoare triple {15940#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {15940#true} is VALID [2022-02-20 19:54:52,021 INFO L290 TraceCheckUtils]: 55: Hoare triple {15940#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {15940#true} is VALID [2022-02-20 19:54:52,021 INFO L290 TraceCheckUtils]: 56: Hoare triple {15940#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {15940#true} is VALID [2022-02-20 19:54:52,021 INFO L290 TraceCheckUtils]: 57: Hoare triple {15940#true} assume !(1 == ~c_dr_pc~0); {15940#true} is VALID [2022-02-20 19:54:52,021 INFO L290 TraceCheckUtils]: 58: Hoare triple {15940#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {15940#true} is VALID [2022-02-20 19:54:52,022 INFO L290 TraceCheckUtils]: 59: Hoare triple {15940#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {15940#true} is VALID [2022-02-20 19:54:52,022 INFO L290 TraceCheckUtils]: 60: Hoare triple {15940#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {15940#true} is VALID [2022-02-20 19:54:52,022 INFO L290 TraceCheckUtils]: 61: Hoare triple {15940#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {15940#true} is VALID [2022-02-20 19:54:52,022 INFO L290 TraceCheckUtils]: 62: Hoare triple {15940#true} assume true; {15940#true} is VALID [2022-02-20 19:54:52,022 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15940#true} {15941#false} #847#return; {15941#false} is VALID [2022-02-20 19:54:52,022 INFO L290 TraceCheckUtils]: 64: Hoare triple {15941#false} ~q_read_ev~0 := 2; {15941#false} is VALID [2022-02-20 19:54:52,022 INFO L290 TraceCheckUtils]: 65: Hoare triple {15941#false} assume !(~p_last_write~0 == ~c_last_read~0); {15941#false} is VALID [2022-02-20 19:54:52,023 INFO L272 TraceCheckUtils]: 66: Hoare triple {15941#false} call error1(); {15941#false} is VALID [2022-02-20 19:54:52,023 INFO L290 TraceCheckUtils]: 67: Hoare triple {15941#false} assume !false; {15941#false} is VALID [2022-02-20 19:54:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 19:54:52,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:52,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982983084] [2022-02-20 19:54:52,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982983084] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:54:52,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620053223] [2022-02-20 19:54:52,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:52,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:54:52,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:54:52,028 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:54:52,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:54:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:52,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 19:54:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:52,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:54:52,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {15940#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {15940#true} is VALID [2022-02-20 19:54:52,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {15940#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {15940#true} is VALID [2022-02-20 19:54:52,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {15940#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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;~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; {15940#true} is VALID [2022-02-20 19:54:52,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {15940#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {15940#true} is VALID [2022-02-20 19:54:52,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {15940#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {15940#true} is VALID [2022-02-20 19:54:52,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {15940#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {15940#true} is VALID [2022-02-20 19:54:52,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {15940#true} assume { :end_inline_init_threads1 } true; {15940#true} is VALID [2022-02-20 19:54:52,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {15940#true} assume !false; {15940#true} is VALID [2022-02-20 19:54:52,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {15940#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {15940#true} is VALID [2022-02-20 19:54:52,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {15940#true} assume !false; {15940#true} is VALID [2022-02-20 19:54:52,473 INFO L272 TraceCheckUtils]: 10: Hoare triple {15940#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {15940#true} is VALID [2022-02-20 19:54:52,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {15940#true} havoc ~__retres1~2; {15940#true} is VALID [2022-02-20 19:54:52,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {15940#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {15940#true} is VALID [2022-02-20 19:54:52,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {15940#true} #res := ~__retres1~2; {15940#true} is VALID [2022-02-20 19:54:52,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {15940#true} assume true; {15940#true} is VALID [2022-02-20 19:54:52,473 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15940#true} {15940#true} #843#return; {15940#true} is VALID [2022-02-20 19:54:52,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {15940#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {15940#true} is VALID [2022-02-20 19:54:52,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {15940#true} assume 0 != eval1_~tmp___1~0#1; {15940#true} is VALID [2022-02-20 19:54:52,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {15940#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {15940#true} is VALID [2022-02-20 19:54:52,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {15940#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {15940#true} is VALID [2022-02-20 19:54:52,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {15940#true} assume 0 == ~p_dw_pc~0; {15940#true} is VALID [2022-02-20 19:54:52,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {15940#true} assume !false; {15940#true} is VALID [2022-02-20 19:54:52,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {15940#true} assume !(0 == ~q_free~0); {15940#true} is VALID [2022-02-20 19:54:52,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {15940#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,476 INFO L272 TraceCheckUtils]: 24: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} call immediate_notify_threads(); {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~p_dw_pc~0); {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} is_do_write_p_triggered_~__retres1~0#1 := 0; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~c_dr_pc~0); {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} is_do_read_c_triggered_~__retres1~1#1 := 0; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume true; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,483 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16051#(= ~p_last_write~0 ~q_buf_0~0)} {16051#(= ~p_last_write~0 ~q_buf_0~0)} #845#return; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,483 INFO L290 TraceCheckUtils]: 39: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} ~q_write_ev~0 := 2; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,484 INFO L290 TraceCheckUtils]: 41: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != eval1_~tmp___0~1#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; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,487 INFO L290 TraceCheckUtils]: 46: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,487 INFO L290 TraceCheckUtils]: 47: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,488 INFO L290 TraceCheckUtils]: 48: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} 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_read_ev~0 := 1; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,488 INFO L272 TraceCheckUtils]: 49: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} call immediate_notify_threads(); {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,489 INFO L290 TraceCheckUtils]: 50: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,489 INFO L290 TraceCheckUtils]: 51: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} assume 1 == ~p_dw_pc~0; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,490 INFO L290 TraceCheckUtils]: 52: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,490 INFO L290 TraceCheckUtils]: 53: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,490 INFO L290 TraceCheckUtils]: 54: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,491 INFO L290 TraceCheckUtils]: 56: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,492 INFO L290 TraceCheckUtils]: 57: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} assume !(1 == ~c_dr_pc~0); {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,492 INFO L290 TraceCheckUtils]: 58: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} is_do_read_c_triggered_~__retres1~1#1 := 0; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,492 INFO L290 TraceCheckUtils]: 59: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,493 INFO L290 TraceCheckUtils]: 60: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,493 INFO L290 TraceCheckUtils]: 61: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,494 INFO L290 TraceCheckUtils]: 62: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} assume true; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,494 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16127#(= ~c_last_read~0 ~p_last_write~0)} {16127#(= ~c_last_read~0 ~p_last_write~0)} #847#return; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,495 INFO L290 TraceCheckUtils]: 64: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} ~q_read_ev~0 := 2; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,495 INFO L290 TraceCheckUtils]: 65: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {15941#false} is VALID [2022-02-20 19:54:52,495 INFO L272 TraceCheckUtils]: 66: Hoare triple {15941#false} call error1(); {15941#false} is VALID [2022-02-20 19:54:52,495 INFO L290 TraceCheckUtils]: 67: Hoare triple {15941#false} assume !false; {15941#false} is VALID [2022-02-20 19:54:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:52,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:54:52,641 INFO L290 TraceCheckUtils]: 67: Hoare triple {15941#false} assume !false; {15941#false} is VALID [2022-02-20 19:54:52,641 INFO L272 TraceCheckUtils]: 66: Hoare triple {15941#false} call error1(); {15941#false} is VALID [2022-02-20 19:54:52,641 INFO L290 TraceCheckUtils]: 65: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {15941#false} is VALID [2022-02-20 19:54:52,642 INFO L290 TraceCheckUtils]: 64: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} ~q_read_ev~0 := 2; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,642 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15940#true} {16127#(= ~c_last_read~0 ~p_last_write~0)} #847#return; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,642 INFO L290 TraceCheckUtils]: 62: Hoare triple {15940#true} assume true; {15940#true} is VALID [2022-02-20 19:54:52,642 INFO L290 TraceCheckUtils]: 61: Hoare triple {15940#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {15940#true} is VALID [2022-02-20 19:54:52,643 INFO L290 TraceCheckUtils]: 60: Hoare triple {15940#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {15940#true} is VALID [2022-02-20 19:54:52,643 INFO L290 TraceCheckUtils]: 59: Hoare triple {15940#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {15940#true} is VALID [2022-02-20 19:54:52,643 INFO L290 TraceCheckUtils]: 58: Hoare triple {15940#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {15940#true} is VALID [2022-02-20 19:54:52,643 INFO L290 TraceCheckUtils]: 57: Hoare triple {15940#true} assume !(1 == ~c_dr_pc~0); {15940#true} is VALID [2022-02-20 19:54:52,643 INFO L290 TraceCheckUtils]: 56: Hoare triple {15940#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {15940#true} is VALID [2022-02-20 19:54:52,643 INFO L290 TraceCheckUtils]: 55: Hoare triple {15940#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {15940#true} is VALID [2022-02-20 19:54:52,644 INFO L290 TraceCheckUtils]: 54: Hoare triple {15940#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {15940#true} is VALID [2022-02-20 19:54:52,644 INFO L290 TraceCheckUtils]: 53: Hoare triple {15940#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {15940#true} is VALID [2022-02-20 19:54:52,644 INFO L290 TraceCheckUtils]: 52: Hoare triple {15940#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {15940#true} is VALID [2022-02-20 19:54:52,644 INFO L290 TraceCheckUtils]: 51: Hoare triple {15940#true} assume 1 == ~p_dw_pc~0; {15940#true} is VALID [2022-02-20 19:54:52,644 INFO L290 TraceCheckUtils]: 50: Hoare triple {15940#true} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {15940#true} is VALID [2022-02-20 19:54:52,644 INFO L272 TraceCheckUtils]: 49: Hoare triple {16127#(= ~c_last_read~0 ~p_last_write~0)} call immediate_notify_threads(); {15940#true} is VALID [2022-02-20 19:54:52,645 INFO L290 TraceCheckUtils]: 48: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} 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_read_ev~0 := 1; {16127#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:54:52,645 INFO L290 TraceCheckUtils]: 47: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,646 INFO L290 TraceCheckUtils]: 46: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,646 INFO L290 TraceCheckUtils]: 45: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,646 INFO L290 TraceCheckUtils]: 44: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != eval1_~tmp___0~1#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; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,647 INFO L290 TraceCheckUtils]: 43: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,647 INFO L290 TraceCheckUtils]: 42: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} ~q_write_ev~0 := 2; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,649 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15940#true} {16051#(= ~p_last_write~0 ~q_buf_0~0)} #845#return; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {15940#true} assume true; {15940#true} is VALID [2022-02-20 19:54:52,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {15940#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {15940#true} is VALID [2022-02-20 19:54:52,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {15940#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {15940#true} is VALID [2022-02-20 19:54:52,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {15940#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {15940#true} is VALID [2022-02-20 19:54:52,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {15940#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {15940#true} is VALID [2022-02-20 19:54:52,650 INFO L290 TraceCheckUtils]: 32: Hoare triple {15940#true} assume !(1 == ~c_dr_pc~0); {15940#true} is VALID [2022-02-20 19:54:52,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {15940#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {15940#true} is VALID [2022-02-20 19:54:52,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {15940#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {15940#true} is VALID [2022-02-20 19:54:52,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {15940#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {15940#true} is VALID [2022-02-20 19:54:52,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {15940#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {15940#true} is VALID [2022-02-20 19:54:52,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {15940#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {15940#true} is VALID [2022-02-20 19:54:52,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {15940#true} assume !(1 == ~p_dw_pc~0); {15940#true} is VALID [2022-02-20 19:54:52,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {15940#true} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {15940#true} is VALID [2022-02-20 19:54:52,651 INFO L272 TraceCheckUtils]: 24: Hoare triple {16051#(= ~p_last_write~0 ~q_buf_0~0)} call immediate_notify_threads(); {15940#true} is VALID [2022-02-20 19:54:52,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {15940#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {16051#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:54:52,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {15940#true} assume !(0 == ~q_free~0); {15940#true} is VALID [2022-02-20 19:54:52,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {15940#true} assume !false; {15940#true} is VALID [2022-02-20 19:54:52,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {15940#true} assume 0 == ~p_dw_pc~0; {15940#true} is VALID [2022-02-20 19:54:52,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {15940#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {15940#true} is VALID [2022-02-20 19:54:52,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {15940#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {15940#true} is VALID [2022-02-20 19:54:52,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {15940#true} assume 0 != eval1_~tmp___1~0#1; {15940#true} is VALID [2022-02-20 19:54:52,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {15940#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {15940#true} is VALID [2022-02-20 19:54:52,653 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15940#true} {15940#true} #843#return; {15940#true} is VALID [2022-02-20 19:54:52,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {15940#true} assume true; {15940#true} is VALID [2022-02-20 19:54:52,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {15940#true} #res := ~__retres1~2; {15940#true} is VALID [2022-02-20 19:54:52,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {15940#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {15940#true} is VALID [2022-02-20 19:54:52,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {15940#true} havoc ~__retres1~2; {15940#true} is VALID [2022-02-20 19:54:52,654 INFO L272 TraceCheckUtils]: 10: Hoare triple {15940#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {15940#true} is VALID [2022-02-20 19:54:52,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {15940#true} assume !false; {15940#true} is VALID [2022-02-20 19:54:52,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {15940#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {15940#true} is VALID [2022-02-20 19:54:52,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {15940#true} assume !false; {15940#true} is VALID [2022-02-20 19:54:52,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {15940#true} assume { :end_inline_init_threads1 } true; {15940#true} is VALID [2022-02-20 19:54:52,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {15940#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {15940#true} is VALID [2022-02-20 19:54:52,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {15940#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {15940#true} is VALID [2022-02-20 19:54:52,655 INFO L290 TraceCheckUtils]: 3: Hoare triple {15940#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {15940#true} is VALID [2022-02-20 19:54:52,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {15940#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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;~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; {15940#true} is VALID [2022-02-20 19:54:52,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {15940#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {15940#true} is VALID [2022-02-20 19:54:52,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {15940#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {15940#true} is VALID [2022-02-20 19:54:52,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 19:54:52,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620053223] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 19:54:52,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:54:52,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-02-20 19:54:52,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296518543] [2022-02-20 19:54:52,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:52,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-02-20 19:54:52,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:52,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:52,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:52,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:52,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:52,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:52,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:54:52,709 INFO L87 Difference]: Start difference. First operand 856 states and 1141 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:53,235 INFO L93 Difference]: Finished difference Result 912 states and 1209 transitions. [2022-02-20 19:54:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:54:53,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-02-20 19:54:53,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2022-02-20 19:54:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2022-02-20 19:54:53,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 396 transitions. [2022-02-20 19:54:53,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:53,615 INFO L225 Difference]: With dead ends: 912 [2022-02-20 19:54:53,615 INFO L226 Difference]: Without dead ends: 909 [2022-02-20 19:54:53,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:54:53,617 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 577 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:53,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [577 Valid, 423 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:54:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2022-02-20 19:54:53,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 855. [2022-02-20 19:54:53,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:53,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 909 states. Second operand has 855 states, 749 states have (on average 1.315086782376502) internal successors, (985), 760 states have internal predecessors, (985), 64 states have call successors, (64), 36 states have call predecessors, (64), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2022-02-20 19:54:53,660 INFO L74 IsIncluded]: Start isIncluded. First operand 909 states. Second operand has 855 states, 749 states have (on average 1.315086782376502) internal successors, (985), 760 states have internal predecessors, (985), 64 states have call successors, (64), 36 states have call predecessors, (64), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2022-02-20 19:54:53,662 INFO L87 Difference]: Start difference. First operand 909 states. Second operand has 855 states, 749 states have (on average 1.315086782376502) internal successors, (985), 760 states have internal predecessors, (985), 64 states have call successors, (64), 36 states have call predecessors, (64), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2022-02-20 19:54:53,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:53,705 INFO L93 Difference]: Finished difference Result 909 states and 1205 transitions. [2022-02-20 19:54:53,706 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1205 transitions. [2022-02-20 19:54:53,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:53,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:53,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 855 states, 749 states have (on average 1.315086782376502) internal successors, (985), 760 states have internal predecessors, (985), 64 states have call successors, (64), 36 states have call predecessors, (64), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) Second operand 909 states. [2022-02-20 19:54:53,712 INFO L87 Difference]: Start difference. First operand has 855 states, 749 states have (on average 1.315086782376502) internal successors, (985), 760 states have internal predecessors, (985), 64 states have call successors, (64), 36 states have call predecessors, (64), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) Second operand 909 states. [2022-02-20 19:54:53,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:53,758 INFO L93 Difference]: Finished difference Result 909 states and 1205 transitions. [2022-02-20 19:54:53,758 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1205 transitions. [2022-02-20 19:54:53,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:53,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:53,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:53,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 749 states have (on average 1.315086782376502) internal successors, (985), 760 states have internal predecessors, (985), 64 states have call successors, (64), 36 states have call predecessors, (64), 40 states have return successors, (89), 59 states have call predecessors, (89), 61 states have call successors, (89) [2022-02-20 19:54:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1138 transitions. [2022-02-20 19:54:53,812 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1138 transitions. Word has length 68 [2022-02-20 19:54:53,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:53,813 INFO L470 AbstractCegarLoop]: Abstraction has 855 states and 1138 transitions. [2022-02-20 19:54:53,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:54:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1138 transitions. [2022-02-20 19:54:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 19:54:53,815 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:53,815 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:53,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 19:54:54,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 19:54:54,036 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:54,036 INFO L85 PathProgramCache]: Analyzing trace with hash 530550805, now seen corresponding path program 1 times [2022-02-20 19:54:54,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:54,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224507385] [2022-02-20 19:54:54,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:54,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {20657#true} havoc ~__retres1~2; {20657#true} is VALID [2022-02-20 19:54:54,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {20657#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20657#true} is VALID [2022-02-20 19:54:54,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {20657#true} #res := ~__retres1~2; {20657#true} is VALID [2022-02-20 19:54:54,098 INFO L290 TraceCheckUtils]: 3: Hoare triple {20657#true} assume true; {20657#true} is VALID [2022-02-20 19:54:54,098 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20657#true} {20657#true} #843#return; {20657#true} is VALID [2022-02-20 19:54:54,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:54:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {20692#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {20657#true} is VALID [2022-02-20 19:54:54,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {20657#true} assume !(1 == ~p_dw_pc~0); {20657#true} is VALID [2022-02-20 19:54:54,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {20657#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {20693#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is VALID [2022-02-20 19:54:54,175 INFO L290 TraceCheckUtils]: 3: Hoare triple {20693#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {20694#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} is VALID [2022-02-20 19:54:54,176 INFO L290 TraceCheckUtils]: 4: Hoare triple {20694#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {20695#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} is VALID [2022-02-20 19:54:54,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {20695#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {20658#false} is VALID [2022-02-20 19:54:54,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {20658#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {20658#false} is VALID [2022-02-20 19:54:54,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {20658#false} assume !(1 == ~c_dr_pc~0); {20658#false} is VALID [2022-02-20 19:54:54,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {20658#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {20658#false} is VALID [2022-02-20 19:54:54,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {20658#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {20658#false} is VALID [2022-02-20 19:54:54,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {20658#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {20658#false} is VALID [2022-02-20 19:54:54,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {20658#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {20658#false} is VALID [2022-02-20 19:54:54,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {20658#false} assume true; {20658#false} is VALID [2022-02-20 19:54:54,178 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {20658#false} {20657#true} #845#return; {20658#false} is VALID [2022-02-20 19:54:54,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 19:54:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {20692#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {20657#true} is VALID [2022-02-20 19:54:54,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {20657#true} assume 1 == ~p_dw_pc~0; {20657#true} is VALID [2022-02-20 19:54:54,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {20657#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {20657#true} is VALID [2022-02-20 19:54:54,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {20657#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {20657#true} is VALID [2022-02-20 19:54:54,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {20657#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {20657#true} is VALID [2022-02-20 19:54:54,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {20657#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {20657#true} is VALID [2022-02-20 19:54:54,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {20657#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {20657#true} is VALID [2022-02-20 19:54:54,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {20657#true} assume !(1 == ~c_dr_pc~0); {20657#true} is VALID [2022-02-20 19:54:54,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {20657#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {20657#true} is VALID [2022-02-20 19:54:54,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {20657#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {20657#true} is VALID [2022-02-20 19:54:54,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {20657#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {20657#true} is VALID [2022-02-20 19:54:54,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {20657#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {20657#true} is VALID [2022-02-20 19:54:54,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {20657#true} assume true; {20657#true} is VALID [2022-02-20 19:54:54,191 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {20657#true} {20658#false} #847#return; {20658#false} is VALID [2022-02-20 19:54:54,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {20657#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {20657#true} is VALID [2022-02-20 19:54:54,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {20657#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {20657#true} is VALID [2022-02-20 19:54:54,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {20657#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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;~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; {20657#true} is VALID [2022-02-20 19:54:54,192 INFO L290 TraceCheckUtils]: 3: Hoare triple {20657#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {20657#true} is VALID [2022-02-20 19:54:54,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {20657#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {20657#true} is VALID [2022-02-20 19:54:54,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {20657#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {20657#true} is VALID [2022-02-20 19:54:54,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {20657#true} assume { :end_inline_init_threads1 } true; {20657#true} is VALID [2022-02-20 19:54:54,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {20657#true} assume !false; {20657#true} is VALID [2022-02-20 19:54:54,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {20657#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {20657#true} is VALID [2022-02-20 19:54:54,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {20657#true} assume !false; {20657#true} is VALID [2022-02-20 19:54:54,193 INFO L272 TraceCheckUtils]: 10: Hoare triple {20657#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {20657#true} is VALID [2022-02-20 19:54:54,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {20657#true} havoc ~__retres1~2; {20657#true} is VALID [2022-02-20 19:54:54,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {20657#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20657#true} is VALID [2022-02-20 19:54:54,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {20657#true} #res := ~__retres1~2; {20657#true} is VALID [2022-02-20 19:54:54,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {20657#true} assume true; {20657#true} is VALID [2022-02-20 19:54:54,194 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20657#true} {20657#true} #843#return; {20657#true} is VALID [2022-02-20 19:54:54,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {20657#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {20657#true} is VALID [2022-02-20 19:54:54,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {20657#true} assume 0 != eval1_~tmp___1~0#1; {20657#true} is VALID [2022-02-20 19:54:54,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {20657#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {20657#true} is VALID [2022-02-20 19:54:54,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {20657#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {20657#true} is VALID [2022-02-20 19:54:54,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {20657#true} assume 0 == ~p_dw_pc~0; {20657#true} is VALID [2022-02-20 19:54:54,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {20657#true} assume !false; {20657#true} is VALID [2022-02-20 19:54:54,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {20657#true} assume !(0 == ~q_free~0); {20657#true} is VALID [2022-02-20 19:54:54,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {20657#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {20657#true} is VALID [2022-02-20 19:54:54,196 INFO L272 TraceCheckUtils]: 24: Hoare triple {20657#true} call immediate_notify_threads(); {20692#(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:54:54,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {20692#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {20657#true} is VALID [2022-02-20 19:54:54,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {20657#true} assume !(1 == ~p_dw_pc~0); {20657#true} is VALID [2022-02-20 19:54:54,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {20657#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {20693#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is VALID [2022-02-20 19:54:54,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {20693#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {20694#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} is VALID [2022-02-20 19:54:54,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {20694#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {20695#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} is VALID [2022-02-20 19:54:54,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {20695#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {20658#false} is VALID [2022-02-20 19:54:54,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {20658#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {20658#false} is VALID [2022-02-20 19:54:54,198 INFO L290 TraceCheckUtils]: 32: Hoare triple {20658#false} assume !(1 == ~c_dr_pc~0); {20658#false} is VALID [2022-02-20 19:54:54,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {20658#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {20658#false} is VALID [2022-02-20 19:54:54,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {20658#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {20658#false} is VALID [2022-02-20 19:54:54,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {20658#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {20658#false} is VALID [2022-02-20 19:54:54,199 INFO L290 TraceCheckUtils]: 36: Hoare triple {20658#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {20658#false} is VALID [2022-02-20 19:54:54,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {20658#false} assume true; {20658#false} is VALID [2022-02-20 19:54:54,199 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20658#false} {20657#true} #845#return; {20658#false} is VALID [2022-02-20 19:54:54,199 INFO L290 TraceCheckUtils]: 39: Hoare triple {20658#false} ~q_write_ev~0 := 2; {20658#false} is VALID [2022-02-20 19:54:54,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {20658#false} assume !false; {20658#false} is VALID [2022-02-20 19:54:54,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {20658#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {20658#false} is VALID [2022-02-20 19:54:54,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {20658#false} assume { :end_inline_do_write_p } true; {20658#false} is VALID [2022-02-20 19:54:54,200 INFO L290 TraceCheckUtils]: 43: Hoare triple {20658#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {20658#false} is VALID [2022-02-20 19:54:54,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {20658#false} assume 0 != eval1_~tmp___0~1#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; {20658#false} is VALID [2022-02-20 19:54:54,200 INFO L290 TraceCheckUtils]: 45: Hoare triple {20658#false} assume 0 == ~c_dr_pc~0; {20658#false} is VALID [2022-02-20 19:54:54,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {20658#false} assume !false; {20658#false} is VALID [2022-02-20 19:54:54,201 INFO L290 TraceCheckUtils]: 47: Hoare triple {20658#false} assume !(1 == ~q_free~0); {20658#false} is VALID [2022-02-20 19:54:54,201 INFO L290 TraceCheckUtils]: 48: Hoare triple {20658#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_read_ev~0 := 1; {20658#false} is VALID [2022-02-20 19:54:54,201 INFO L272 TraceCheckUtils]: 49: Hoare triple {20658#false} call immediate_notify_threads(); {20692#(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:54:54,201 INFO L290 TraceCheckUtils]: 50: Hoare triple {20692#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {20657#true} is VALID [2022-02-20 19:54:54,201 INFO L290 TraceCheckUtils]: 51: Hoare triple {20657#true} assume 1 == ~p_dw_pc~0; {20657#true} is VALID [2022-02-20 19:54:54,201 INFO L290 TraceCheckUtils]: 52: Hoare triple {20657#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {20657#true} is VALID [2022-02-20 19:54:54,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {20657#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {20657#true} is VALID [2022-02-20 19:54:54,202 INFO L290 TraceCheckUtils]: 54: Hoare triple {20657#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {20657#true} is VALID [2022-02-20 19:54:54,202 INFO L290 TraceCheckUtils]: 55: Hoare triple {20657#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {20657#true} is VALID [2022-02-20 19:54:54,202 INFO L290 TraceCheckUtils]: 56: Hoare triple {20657#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {20657#true} is VALID [2022-02-20 19:54:54,202 INFO L290 TraceCheckUtils]: 57: Hoare triple {20657#true} assume !(1 == ~c_dr_pc~0); {20657#true} is VALID [2022-02-20 19:54:54,202 INFO L290 TraceCheckUtils]: 58: Hoare triple {20657#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {20657#true} is VALID [2022-02-20 19:54:54,202 INFO L290 TraceCheckUtils]: 59: Hoare triple {20657#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {20657#true} is VALID [2022-02-20 19:54:54,203 INFO L290 TraceCheckUtils]: 60: Hoare triple {20657#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {20657#true} is VALID [2022-02-20 19:54:54,203 INFO L290 TraceCheckUtils]: 61: Hoare triple {20657#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {20657#true} is VALID [2022-02-20 19:54:54,203 INFO L290 TraceCheckUtils]: 62: Hoare triple {20657#true} assume true; {20657#true} is VALID [2022-02-20 19:54:54,203 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20657#true} {20658#false} #847#return; {20658#false} is VALID [2022-02-20 19:54:54,203 INFO L290 TraceCheckUtils]: 64: Hoare triple {20658#false} ~q_read_ev~0 := 2; {20658#false} is VALID [2022-02-20 19:54:54,203 INFO L290 TraceCheckUtils]: 65: Hoare triple {20658#false} assume ~p_last_write~0 == ~c_last_read~0; {20658#false} is VALID [2022-02-20 19:54:54,204 INFO L290 TraceCheckUtils]: 66: Hoare triple {20658#false} assume !(~p_num_write~0 == ~c_num_read~0); {20658#false} is VALID [2022-02-20 19:54:54,204 INFO L272 TraceCheckUtils]: 67: Hoare triple {20658#false} call error1(); {20658#false} is VALID [2022-02-20 19:54:54,204 INFO L290 TraceCheckUtils]: 68: Hoare triple {20658#false} assume !false; {20658#false} is VALID [2022-02-20 19:54:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 19:54:54,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:54,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224507385] [2022-02-20 19:54:54,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224507385] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:54:54,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076277081] [2022-02-20 19:54:54,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:54,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:54:54,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:54:54,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:54:54,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 19:54:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:54:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:54:54,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {20657#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {20657#true} is VALID [2022-02-20 19:54:54,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {20657#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {20657#true} is VALID [2022-02-20 19:54:54,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {20657#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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;~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; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,764 INFO L290 TraceCheckUtils]: 3: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,765 INFO L290 TraceCheckUtils]: 4: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,775 INFO L272 TraceCheckUtils]: 10: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret8#1 := exists_runnable_thread1(); {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,777 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #843#return; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:54:54,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {20705#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,781 INFO L272 TraceCheckUtils]: 24: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} call immediate_notify_threads(); {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !(1 == ~p_dw_pc~0); {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is_do_write_p_triggered_~__retres1~0#1 := 0; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,785 INFO L290 TraceCheckUtils]: 32: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !(1 == ~c_dr_pc~0); {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is_do_read_c_triggered_~__retres1~1#1 := 0; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,787 INFO L290 TraceCheckUtils]: 37: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume true; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,787 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} #845#return; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,788 INFO L290 TraceCheckUtils]: 39: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} ~q_write_ev~0 := 2; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,788 INFO L290 TraceCheckUtils]: 40: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !false; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,789 INFO L290 TraceCheckUtils]: 41: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,789 INFO L290 TraceCheckUtils]: 42: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume { :end_inline_do_write_p } true; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,789 INFO L290 TraceCheckUtils]: 43: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,790 INFO L290 TraceCheckUtils]: 44: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 != eval1_~tmp___0~1#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; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,790 INFO L290 TraceCheckUtils]: 45: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 == ~c_dr_pc~0; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,791 INFO L290 TraceCheckUtils]: 46: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !false; {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,791 INFO L290 TraceCheckUtils]: 47: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !(1 == ~q_free~0); {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {20769#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} 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_read_ev~0 := 1; {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,792 INFO L272 TraceCheckUtils]: 49: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} call immediate_notify_threads(); {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,793 INFO L290 TraceCheckUtils]: 51: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume 1 == ~p_dw_pc~0; {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,793 INFO L290 TraceCheckUtils]: 52: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,794 INFO L290 TraceCheckUtils]: 53: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,794 INFO L290 TraceCheckUtils]: 54: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,795 INFO L290 TraceCheckUtils]: 55: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,795 INFO L290 TraceCheckUtils]: 56: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,795 INFO L290 TraceCheckUtils]: 57: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume !(1 == ~c_dr_pc~0); {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,796 INFO L290 TraceCheckUtils]: 58: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is_do_read_c_triggered_~__retres1~1#1 := 0; {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,796 INFO L290 TraceCheckUtils]: 59: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,797 INFO L290 TraceCheckUtils]: 60: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,797 INFO L290 TraceCheckUtils]: 61: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,798 INFO L290 TraceCheckUtils]: 62: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume true; {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,798 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} #847#return; {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,799 INFO L290 TraceCheckUtils]: 64: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} ~q_read_ev~0 := 2; {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,799 INFO L290 TraceCheckUtils]: 65: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume ~p_last_write~0 == ~c_last_read~0; {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:54:54,799 INFO L290 TraceCheckUtils]: 66: Hoare triple {20845#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume !(~p_num_write~0 == ~c_num_read~0); {20658#false} is VALID [2022-02-20 19:54:54,800 INFO L272 TraceCheckUtils]: 67: Hoare triple {20658#false} call error1(); {20658#false} is VALID [2022-02-20 19:54:54,800 INFO L290 TraceCheckUtils]: 68: Hoare triple {20658#false} assume !false; {20658#false} is VALID [2022-02-20 19:54:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:54,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:54:55,043 INFO L290 TraceCheckUtils]: 68: Hoare triple {20658#false} assume !false; {20658#false} is VALID [2022-02-20 19:54:55,044 INFO L272 TraceCheckUtils]: 67: Hoare triple {20658#false} call error1(); {20658#false} is VALID [2022-02-20 19:54:55,044 INFO L290 TraceCheckUtils]: 66: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} assume !(~p_num_write~0 == ~c_num_read~0); {20658#false} is VALID [2022-02-20 19:54:55,044 INFO L290 TraceCheckUtils]: 65: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} assume ~p_last_write~0 == ~c_last_read~0; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,045 INFO L290 TraceCheckUtils]: 64: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} ~q_read_ev~0 := 2; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,045 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20657#true} {20912#(= ~c_num_read~0 ~p_num_write~0)} #847#return; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,046 INFO L290 TraceCheckUtils]: 62: Hoare triple {20657#true} assume true; {20657#true} is VALID [2022-02-20 19:54:55,046 INFO L290 TraceCheckUtils]: 61: Hoare triple {20657#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {20657#true} is VALID [2022-02-20 19:54:55,046 INFO L290 TraceCheckUtils]: 60: Hoare triple {20657#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {20657#true} is VALID [2022-02-20 19:54:55,046 INFO L290 TraceCheckUtils]: 59: Hoare triple {20657#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {20657#true} is VALID [2022-02-20 19:54:55,046 INFO L290 TraceCheckUtils]: 58: Hoare triple {20657#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {20657#true} is VALID [2022-02-20 19:54:55,046 INFO L290 TraceCheckUtils]: 57: Hoare triple {20657#true} assume !(1 == ~c_dr_pc~0); {20657#true} is VALID [2022-02-20 19:54:55,047 INFO L290 TraceCheckUtils]: 56: Hoare triple {20657#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {20657#true} is VALID [2022-02-20 19:54:55,047 INFO L290 TraceCheckUtils]: 55: Hoare triple {20657#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {20657#true} is VALID [2022-02-20 19:54:55,047 INFO L290 TraceCheckUtils]: 54: Hoare triple {20657#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {20657#true} is VALID [2022-02-20 19:54:55,047 INFO L290 TraceCheckUtils]: 53: Hoare triple {20657#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {20657#true} is VALID [2022-02-20 19:54:55,047 INFO L290 TraceCheckUtils]: 52: Hoare triple {20657#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {20657#true} is VALID [2022-02-20 19:54:55,047 INFO L290 TraceCheckUtils]: 51: Hoare triple {20657#true} assume 1 == ~p_dw_pc~0; {20657#true} is VALID [2022-02-20 19:54:55,047 INFO L290 TraceCheckUtils]: 50: Hoare triple {20657#true} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {20657#true} is VALID [2022-02-20 19:54:55,048 INFO L272 TraceCheckUtils]: 49: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} call immediate_notify_threads(); {20657#true} is VALID [2022-02-20 19:54:55,048 INFO L290 TraceCheckUtils]: 48: Hoare triple {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} 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_read_ev~0 := 1; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,049 INFO L290 TraceCheckUtils]: 47: Hoare triple {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume !(1 == ~q_free~0); {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:55,049 INFO L290 TraceCheckUtils]: 46: Hoare triple {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume !false; {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:55,050 INFO L290 TraceCheckUtils]: 45: Hoare triple {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume 0 == ~c_dr_pc~0; {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:55,050 INFO L290 TraceCheckUtils]: 44: Hoare triple {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume 0 != eval1_~tmp___0~1#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; {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:55,051 INFO L290 TraceCheckUtils]: 43: Hoare triple {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:55,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume { :end_inline_do_write_p } true; {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:55,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:55,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume !false; {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:55,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} ~q_write_ev~0 := 2; {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:55,054 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20657#true} {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} #845#return; {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:55,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {20657#true} assume true; {20657#true} is VALID [2022-02-20 19:54:55,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {20657#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {20657#true} is VALID [2022-02-20 19:54:55,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {20657#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {20657#true} is VALID [2022-02-20 19:54:55,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {20657#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {20657#true} is VALID [2022-02-20 19:54:55,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {20657#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {20657#true} is VALID [2022-02-20 19:54:55,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {20657#true} assume !(1 == ~c_dr_pc~0); {20657#true} is VALID [2022-02-20 19:54:55,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {20657#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {20657#true} is VALID [2022-02-20 19:54:55,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {20657#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {20657#true} is VALID [2022-02-20 19:54:55,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {20657#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {20657#true} is VALID [2022-02-20 19:54:55,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {20657#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {20657#true} is VALID [2022-02-20 19:54:55,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {20657#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {20657#true} is VALID [2022-02-20 19:54:55,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {20657#true} assume !(1 == ~p_dw_pc~0); {20657#true} is VALID [2022-02-20 19:54:55,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {20657#true} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {20657#true} is VALID [2022-02-20 19:54:55,056 INFO L272 TraceCheckUtils]: 24: Hoare triple {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} call immediate_notify_threads(); {20657#true} is VALID [2022-02-20 19:54:55,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {20967#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:54:55,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} assume !(0 == ~q_free~0); {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} assume !false; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} assume 0 == ~p_dw_pc~0; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} assume 0 != eval1_~tmp___1~0#1; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,060 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20657#true} {20912#(= ~c_num_read~0 ~p_num_write~0)} #843#return; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {20657#true} assume true; {20657#true} is VALID [2022-02-20 19:54:55,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {20657#true} #res := ~__retres1~2; {20657#true} is VALID [2022-02-20 19:54:55,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {20657#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20657#true} is VALID [2022-02-20 19:54:55,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {20657#true} havoc ~__retres1~2; {20657#true} is VALID [2022-02-20 19:54:55,061 INFO L272 TraceCheckUtils]: 10: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {20657#true} is VALID [2022-02-20 19:54:55,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} assume !false; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} assume !false; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} assume { :end_inline_init_threads1 } true; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,064 INFO L290 TraceCheckUtils]: 4: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,064 INFO L290 TraceCheckUtils]: 3: Hoare triple {20912#(= ~c_num_read~0 ~p_num_write~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {20657#true} assume 0 != main_#t~nondet31#1;havoc main_#t~nondet31#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;~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; {20912#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:54:55,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {20657#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {20657#true} is VALID [2022-02-20 19:54:55,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {20657#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {20657#true} is VALID [2022-02-20 19:54:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 19:54:55,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076277081] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:54:55,066 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:54:55,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2022-02-20 19:54:55,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993438546] [2022-02-20 19:54:55,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:54:55,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2022-02-20 19:54:55,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:55,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:54:55,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:55,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 19:54:55,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:55,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 19:54:55,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:54:55,194 INFO L87 Difference]: Start difference. First operand 855 states and 1138 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:54:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:59,871 INFO L93 Difference]: Finished difference Result 2555 states and 3358 transitions. [2022-02-20 19:54:59,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-02-20 19:54:59,872 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2022-02-20 19:54:59,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:54:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 869 transitions. [2022-02-20 19:54:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:54:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 869 transitions. [2022-02-20 19:54:59,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 869 transitions. [2022-02-20 19:55:00,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 869 edges. 869 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:00,779 INFO L225 Difference]: With dead ends: 2555 [2022-02-20 19:55:00,780 INFO L226 Difference]: Without dead ends: 2011 [2022-02-20 19:55:00,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2022-02-20 19:55:00,784 INFO L933 BasicCegarLoop]: 461 mSDtfsCounter, 738 mSDsluCounter, 2296 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 2757 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:00,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [762 Valid, 2757 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:55:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2022-02-20 19:55:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 1244. [2022-02-20 19:55:01,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:01,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2011 states. Second operand has 1244 states, 1099 states have (on average 1.2911737943585078) internal successors, (1419), 1118 states have internal predecessors, (1419), 84 states have call successors, (84), 50 states have call predecessors, (84), 59 states have return successors, (123), 76 states have call predecessors, (123), 81 states have call successors, (123) [2022-02-20 19:55:01,065 INFO L74 IsIncluded]: Start isIncluded. First operand 2011 states. Second operand has 1244 states, 1099 states have (on average 1.2911737943585078) internal successors, (1419), 1118 states have internal predecessors, (1419), 84 states have call successors, (84), 50 states have call predecessors, (84), 59 states have return successors, (123), 76 states have call predecessors, (123), 81 states have call successors, (123) [2022-02-20 19:55:01,067 INFO L87 Difference]: Start difference. First operand 2011 states. Second operand has 1244 states, 1099 states have (on average 1.2911737943585078) internal successors, (1419), 1118 states have internal predecessors, (1419), 84 states have call successors, (84), 50 states have call predecessors, (84), 59 states have return successors, (123), 76 states have call predecessors, (123), 81 states have call successors, (123) [2022-02-20 19:55:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:01,252 INFO L93 Difference]: Finished difference Result 2011 states and 2584 transitions. [2022-02-20 19:55:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2584 transitions. [2022-02-20 19:55:01,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:01,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:01,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 1244 states, 1099 states have (on average 1.2911737943585078) internal successors, (1419), 1118 states have internal predecessors, (1419), 84 states have call successors, (84), 50 states have call predecessors, (84), 59 states have return successors, (123), 76 states have call predecessors, (123), 81 states have call successors, (123) Second operand 2011 states. [2022-02-20 19:55:01,264 INFO L87 Difference]: Start difference. First operand has 1244 states, 1099 states have (on average 1.2911737943585078) internal successors, (1419), 1118 states have internal predecessors, (1419), 84 states have call successors, (84), 50 states have call predecessors, (84), 59 states have return successors, (123), 76 states have call predecessors, (123), 81 states have call successors, (123) Second operand 2011 states. [2022-02-20 19:55:01,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:01,442 INFO L93 Difference]: Finished difference Result 2011 states and 2584 transitions. [2022-02-20 19:55:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2584 transitions. [2022-02-20 19:55:01,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:01,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:01,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:01,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1099 states have (on average 1.2911737943585078) internal successors, (1419), 1118 states have internal predecessors, (1419), 84 states have call successors, (84), 50 states have call predecessors, (84), 59 states have return successors, (123), 76 states have call predecessors, (123), 81 states have call successors, (123) [2022-02-20 19:55:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1626 transitions. [2022-02-20 19:55:01,546 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1626 transitions. Word has length 69 [2022-02-20 19:55:01,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:01,546 INFO L470 AbstractCegarLoop]: Abstraction has 1244 states and 1626 transitions. [2022-02-20 19:55:01,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:55:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1626 transitions. [2022-02-20 19:55:01,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 19:55:01,549 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:01,550 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:55:01,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 19:55:01,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-02-20 19:55:01,763 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:01,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:01,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1086322536, now seen corresponding path program 1 times [2022-02-20 19:55:01,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:01,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559809304] [2022-02-20 19:55:01,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:01,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {30446#true} assume true; {30446#true} is VALID [2022-02-20 19:55:01,809 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {30446#true} {30448#(= ~M_E~0 2)} #855#return; {30448#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:55:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {30502#(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; {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {30503#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {30503#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {30503#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,844 INFO L290 TraceCheckUtils]: 4: Hoare triple {30503#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {30503#(= |old(~M_E~0)| 0)} assume !(0 == ~E_1~0); {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {30503#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {30503#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {30503#(= |old(~M_E~0)| 0)} assume true; {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,846 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {30503#(= |old(~M_E~0)| 0)} {30448#(= ~M_E~0 2)} #857#return; {30447#false} is VALID [2022-02-20 19:55:01,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {30504#(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~5#1;havoc ~tmp___0~2#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; {30446#true} is VALID [2022-02-20 19:55:01,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {30446#true} assume 1 == ~m_pc~0; {30446#true} is VALID [2022-02-20 19:55:01,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {30446#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {30446#true} is VALID [2022-02-20 19:55:01,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {30446#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {30446#true} is VALID [2022-02-20 19:55:01,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {30446#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~5#1 := #t~ret24#1;havoc #t~ret24#1; {30446#true} is VALID [2022-02-20 19:55:01,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {30446#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {30446#true} is VALID [2022-02-20 19:55:01,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {30446#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; {30446#true} is VALID [2022-02-20 19:55:01,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {30446#true} assume !(1 == ~t1_pc~0); {30446#true} is VALID [2022-02-20 19:55:01,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {30446#true} is_transmit1_triggered_~__retres1~5#1 := 0; {30446#true} is VALID [2022-02-20 19:55:01,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {30446#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {30446#true} is VALID [2022-02-20 19:55:01,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {30446#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~2#1 := #t~ret25#1;havoc #t~ret25#1; {30446#true} is VALID [2022-02-20 19:55:01,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {30446#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {30446#true} is VALID [2022-02-20 19:55:01,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {30446#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; {30446#true} is VALID [2022-02-20 19:55:01,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {30446#true} assume 1 == ~t2_pc~0; {30446#true} is VALID [2022-02-20 19:55:01,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {30446#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {30446#true} is VALID [2022-02-20 19:55:01,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {30446#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {30446#true} is VALID [2022-02-20 19:55:01,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {30446#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {30446#true} is VALID [2022-02-20 19:55:01,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {30446#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {30446#true} is VALID [2022-02-20 19:55:01,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {30446#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; {30446#true} is VALID [2022-02-20 19:55:01,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {30446#true} assume !(1 == ~t3_pc~0); {30446#true} is VALID [2022-02-20 19:55:01,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {30446#true} is_transmit3_triggered_~__retres1~7#1 := 0; {30446#true} is VALID [2022-02-20 19:55:01,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {30446#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {30446#true} is VALID [2022-02-20 19:55:01,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {30446#true} #t~ret27#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___2~0#1 := #t~ret27#1;havoc #t~ret27#1; {30446#true} is VALID [2022-02-20 19:55:01,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {30446#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {30446#true} is VALID [2022-02-20 19:55:01,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {30446#true} assume true; {30446#true} is VALID [2022-02-20 19:55:01,877 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {30446#true} {30447#false} #859#return; {30447#false} is VALID [2022-02-20 19:55:01,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:55:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {30502#(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; {30446#true} is VALID [2022-02-20 19:55:01,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {30446#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {30446#true} is VALID [2022-02-20 19:55:01,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {30446#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {30446#true} is VALID [2022-02-20 19:55:01,883 INFO L290 TraceCheckUtils]: 3: Hoare triple {30446#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {30446#true} is VALID [2022-02-20 19:55:01,883 INFO L290 TraceCheckUtils]: 4: Hoare triple {30446#true} assume !(1 == ~E_M~0); {30446#true} is VALID [2022-02-20 19:55:01,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {30446#true} assume 1 == ~E_1~0;~E_1~0 := 2; {30446#true} is VALID [2022-02-20 19:55:01,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {30446#true} assume 1 == ~E_2~0;~E_2~0 := 2; {30446#true} is VALID [2022-02-20 19:55:01,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {30446#true} assume 1 == ~E_3~0;~E_3~0 := 2; {30446#true} is VALID [2022-02-20 19:55:01,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {30446#true} assume true; {30446#true} is VALID [2022-02-20 19:55:01,884 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {30446#true} {30447#false} #861#return; {30447#false} is VALID [2022-02-20 19:55:01,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:55:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:01,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {30446#true} havoc ~__retres1~8; {30446#true} is VALID [2022-02-20 19:55:01,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {30446#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {30446#true} is VALID [2022-02-20 19:55:01,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {30446#true} #res := ~__retres1~8; {30446#true} is VALID [2022-02-20 19:55:01,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {30446#true} assume true; {30446#true} is VALID [2022-02-20 19:55:01,890 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30446#true} {30447#false} #863#return; {30447#false} is VALID [2022-02-20 19:55:01,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {30446#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {30448#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {30448#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {30448#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {30448#(= ~M_E~0 2)} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#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; {30448#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {30448#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {30448#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {30448#(= ~M_E~0 2)} call update_channels2(); {30446#true} is VALID [2022-02-20 19:55:01,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {30446#true} assume true; {30446#true} is VALID [2022-02-20 19:55:01,893 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {30446#true} {30448#(= ~M_E~0 2)} #855#return; {30448#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {30448#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {30448#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {30448#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {30448#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {30448#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {30448#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {30448#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {30448#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {30448#(= ~M_E~0 2)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {30448#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {30448#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {30448#(= ~M_E~0 2)} is VALID [2022-02-20 19:55:01,901 INFO L272 TraceCheckUtils]: 13: Hoare triple {30448#(= ~M_E~0 2)} call fire_delta_events2(); {30502#(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:55:01,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {30502#(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; {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {30503#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {30503#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {30503#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {30503#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {30503#(= |old(~M_E~0)| 0)} assume !(0 == ~E_1~0); {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {30503#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {30503#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {30503#(= |old(~M_E~0)| 0)} assume true; {30503#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:55:01,905 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {30503#(= |old(~M_E~0)| 0)} {30448#(= ~M_E~0 2)} #857#return; {30447#false} is VALID [2022-02-20 19:55:01,905 INFO L272 TraceCheckUtils]: 24: Hoare triple {30447#false} call activate_threads2(); {30504#(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:55:01,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {30504#(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~5#1;havoc ~tmp___0~2#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; {30446#true} is VALID [2022-02-20 19:55:01,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {30446#true} assume 1 == ~m_pc~0; {30446#true} is VALID [2022-02-20 19:55:01,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {30446#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {30446#true} is VALID [2022-02-20 19:55:01,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {30446#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {30446#true} is VALID [2022-02-20 19:55:01,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {30446#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~5#1 := #t~ret24#1;havoc #t~ret24#1; {30446#true} is VALID [2022-02-20 19:55:01,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {30446#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {30446#true} is VALID [2022-02-20 19:55:01,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {30446#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; {30446#true} is VALID [2022-02-20 19:55:01,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {30446#true} assume !(1 == ~t1_pc~0); {30446#true} is VALID [2022-02-20 19:55:01,907 INFO L290 TraceCheckUtils]: 33: Hoare triple {30446#true} is_transmit1_triggered_~__retres1~5#1 := 0; {30446#true} is VALID [2022-02-20 19:55:01,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {30446#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {30446#true} is VALID [2022-02-20 19:55:01,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {30446#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~2#1 := #t~ret25#1;havoc #t~ret25#1; {30446#true} is VALID [2022-02-20 19:55:01,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {30446#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {30446#true} is VALID [2022-02-20 19:55:01,907 INFO L290 TraceCheckUtils]: 37: Hoare triple {30446#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; {30446#true} is VALID [2022-02-20 19:55:01,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {30446#true} assume 1 == ~t2_pc~0; {30446#true} is VALID [2022-02-20 19:55:01,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {30446#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {30446#true} is VALID [2022-02-20 19:55:01,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {30446#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {30446#true} is VALID [2022-02-20 19:55:01,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {30446#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {30446#true} is VALID [2022-02-20 19:55:01,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {30446#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {30446#true} is VALID [2022-02-20 19:55:01,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {30446#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; {30446#true} is VALID [2022-02-20 19:55:01,908 INFO L290 TraceCheckUtils]: 44: Hoare triple {30446#true} assume !(1 == ~t3_pc~0); {30446#true} is VALID [2022-02-20 19:55:01,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {30446#true} is_transmit3_triggered_~__retres1~7#1 := 0; {30446#true} is VALID [2022-02-20 19:55:01,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {30446#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {30446#true} is VALID [2022-02-20 19:55:01,909 INFO L290 TraceCheckUtils]: 47: Hoare triple {30446#true} #t~ret27#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___2~0#1 := #t~ret27#1;havoc #t~ret27#1; {30446#true} is VALID [2022-02-20 19:55:01,909 INFO L290 TraceCheckUtils]: 48: Hoare triple {30446#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {30446#true} is VALID [2022-02-20 19:55:01,909 INFO L290 TraceCheckUtils]: 49: Hoare triple {30446#true} assume true; {30446#true} is VALID [2022-02-20 19:55:01,909 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {30446#true} {30447#false} #859#return; {30447#false} is VALID [2022-02-20 19:55:01,909 INFO L272 TraceCheckUtils]: 51: Hoare triple {30447#false} call reset_delta_events2(); {30502#(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:55:01,909 INFO L290 TraceCheckUtils]: 52: Hoare triple {30502#(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; {30446#true} is VALID [2022-02-20 19:55:01,910 INFO L290 TraceCheckUtils]: 53: Hoare triple {30446#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {30446#true} is VALID [2022-02-20 19:55:01,910 INFO L290 TraceCheckUtils]: 54: Hoare triple {30446#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {30446#true} is VALID [2022-02-20 19:55:01,910 INFO L290 TraceCheckUtils]: 55: Hoare triple {30446#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {30446#true} is VALID [2022-02-20 19:55:01,910 INFO L290 TraceCheckUtils]: 56: Hoare triple {30446#true} assume !(1 == ~E_M~0); {30446#true} is VALID [2022-02-20 19:55:01,910 INFO L290 TraceCheckUtils]: 57: Hoare triple {30446#true} assume 1 == ~E_1~0;~E_1~0 := 2; {30446#true} is VALID [2022-02-20 19:55:01,910 INFO L290 TraceCheckUtils]: 58: Hoare triple {30446#true} assume 1 == ~E_2~0;~E_2~0 := 2; {30446#true} is VALID [2022-02-20 19:55:01,910 INFO L290 TraceCheckUtils]: 59: Hoare triple {30446#true} assume 1 == ~E_3~0;~E_3~0 := 2; {30446#true} is VALID [2022-02-20 19:55:01,911 INFO L290 TraceCheckUtils]: 60: Hoare triple {30446#true} assume true; {30446#true} is VALID [2022-02-20 19:55:01,911 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {30446#true} {30447#false} #861#return; {30447#false} is VALID [2022-02-20 19:55:01,911 INFO L290 TraceCheckUtils]: 62: Hoare triple {30447#false} assume !false; {30447#false} is VALID [2022-02-20 19:55:01,911 INFO L290 TraceCheckUtils]: 63: Hoare triple {30447#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret19#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {30447#false} is VALID [2022-02-20 19:55:01,911 INFO L290 TraceCheckUtils]: 64: Hoare triple {30447#false} assume !false; {30447#false} is VALID [2022-02-20 19:55:01,911 INFO L272 TraceCheckUtils]: 65: Hoare triple {30447#false} call eval2_#t~ret19#1 := exists_runnable_thread2(); {30446#true} is VALID [2022-02-20 19:55:01,912 INFO L290 TraceCheckUtils]: 66: Hoare triple {30446#true} havoc ~__retres1~8; {30446#true} is VALID [2022-02-20 19:55:01,912 INFO L290 TraceCheckUtils]: 67: Hoare triple {30446#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {30446#true} is VALID [2022-02-20 19:55:01,912 INFO L290 TraceCheckUtils]: 68: Hoare triple {30446#true} #res := ~__retres1~8; {30446#true} is VALID [2022-02-20 19:55:01,912 INFO L290 TraceCheckUtils]: 69: Hoare triple {30446#true} assume true; {30446#true} is VALID [2022-02-20 19:55:01,912 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {30446#true} {30447#false} #863#return; {30447#false} is VALID [2022-02-20 19:55:01,912 INFO L290 TraceCheckUtils]: 71: Hoare triple {30447#false} assume -2147483648 <= eval2_#t~ret19#1 && eval2_#t~ret19#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret19#1;havoc eval2_#t~ret19#1; {30447#false} is VALID [2022-02-20 19:55:01,912 INFO L290 TraceCheckUtils]: 72: Hoare triple {30447#false} assume 0 != eval2_~tmp~4#1; {30447#false} is VALID [2022-02-20 19:55:01,913 INFO L290 TraceCheckUtils]: 73: Hoare triple {30447#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet20#1 && eval2_#t~nondet20#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet20#1;havoc eval2_#t~nondet20#1; {30447#false} is VALID [2022-02-20 19:55:01,913 INFO L290 TraceCheckUtils]: 74: Hoare triple {30447#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1, master_#t~nondet18#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet17#1 && master_#t~nondet17#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet17#1;havoc master_#t~nondet17#1; {30447#false} is VALID [2022-02-20 19:55:01,913 INFO L290 TraceCheckUtils]: 75: Hoare triple {30447#false} assume !(0 == ~m_pc~0); {30447#false} is VALID [2022-02-20 19:55:01,913 INFO L290 TraceCheckUtils]: 76: Hoare triple {30447#false} assume 1 == ~m_pc~0; {30447#false} is VALID [2022-02-20 19:55:01,913 INFO L290 TraceCheckUtils]: 77: Hoare triple {30447#false} assume ~token~0 != 3 + ~local~0; {30447#false} is VALID [2022-02-20 19:55:01,913 INFO L272 TraceCheckUtils]: 78: Hoare triple {30447#false} call error2(); {30447#false} is VALID [2022-02-20 19:55:01,913 INFO L290 TraceCheckUtils]: 79: Hoare triple {30447#false} assume !false; {30447#false} is VALID [2022-02-20 19:55:01,914 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:55:01,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:01,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559809304] [2022-02-20 19:55:01,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559809304] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:01,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:01,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:55:01,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219977237] [2022-02-20 19:55:01,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:01,916 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 19:55:01,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:01,916 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 19:55:01,974 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:55:01,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:55:01,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:01,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:55:01,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:55:01,976 INFO L87 Difference]: Start difference. First operand 1244 states and 1626 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 19:55:04,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:04,466 INFO L93 Difference]: Finished difference Result 1626 states and 2217 transitions. [2022-02-20 19:55:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:55:04,466 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 19:55:04,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:04,467 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 19:55:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 920 transitions. [2022-02-20 19:55:04,476 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 19:55:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 920 transitions. [2022-02-20 19:55:04,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 920 transitions. [2022-02-20 19:55:05,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 920 edges. 920 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:05,285 INFO L225 Difference]: With dead ends: 1626 [2022-02-20 19:55:05,285 INFO L226 Difference]: Without dead ends: 1478 [2022-02-20 19:55:05,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:55:05,286 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 679 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:05,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 934 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:55:05,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2022-02-20 19:55:05,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1391. [2022-02-20 19:55:05,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:05,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1478 states. Second operand has 1391 states, 1227 states have (on average 1.317033414832926) internal successors, (1616), 1247 states have internal predecessors, (1616), 96 states have call successors, (96), 56 states have call predecessors, (96), 66 states have return successors, (138), 88 states have call predecessors, (138), 93 states have call successors, (138) [2022-02-20 19:55:05,550 INFO L74 IsIncluded]: Start isIncluded. First operand 1478 states. Second operand has 1391 states, 1227 states have (on average 1.317033414832926) internal successors, (1616), 1247 states have internal predecessors, (1616), 96 states have call successors, (96), 56 states have call predecessors, (96), 66 states have return successors, (138), 88 states have call predecessors, (138), 93 states have call successors, (138) [2022-02-20 19:55:05,552 INFO L87 Difference]: Start difference. First operand 1478 states. Second operand has 1391 states, 1227 states have (on average 1.317033414832926) internal successors, (1616), 1247 states have internal predecessors, (1616), 96 states have call successors, (96), 56 states have call predecessors, (96), 66 states have return successors, (138), 88 states have call predecessors, (138), 93 states have call successors, (138) [2022-02-20 19:55:05,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:05,649 INFO L93 Difference]: Finished difference Result 1478 states and 1990 transitions. [2022-02-20 19:55:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1990 transitions. [2022-02-20 19:55:05,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:05,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:05,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 1391 states, 1227 states have (on average 1.317033414832926) internal successors, (1616), 1247 states have internal predecessors, (1616), 96 states have call successors, (96), 56 states have call predecessors, (96), 66 states have return successors, (138), 88 states have call predecessors, (138), 93 states have call successors, (138) Second operand 1478 states. [2022-02-20 19:55:05,658 INFO L87 Difference]: Start difference. First operand has 1391 states, 1227 states have (on average 1.317033414832926) internal successors, (1616), 1247 states have internal predecessors, (1616), 96 states have call successors, (96), 56 states have call predecessors, (96), 66 states have return successors, (138), 88 states have call predecessors, (138), 93 states have call successors, (138) Second operand 1478 states. [2022-02-20 19:55:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:05,755 INFO L93 Difference]: Finished difference Result 1478 states and 1990 transitions. [2022-02-20 19:55:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1990 transitions. [2022-02-20 19:55:05,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:05,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:05,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:05,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1227 states have (on average 1.317033414832926) internal successors, (1616), 1247 states have internal predecessors, (1616), 96 states have call successors, (96), 56 states have call predecessors, (96), 66 states have return successors, (138), 88 states have call predecessors, (138), 93 states have call successors, (138) [2022-02-20 19:55:05,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1850 transitions. [2022-02-20 19:55:05,880 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1850 transitions. Word has length 80 [2022-02-20 19:55:05,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:05,881 INFO L470 AbstractCegarLoop]: Abstraction has 1391 states and 1850 transitions. [2022-02-20 19:55:05,881 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 19:55:05,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1850 transitions. [2022-02-20 19:55:05,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 19:55:05,888 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:05,888 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:55:05,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:55:05,888 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:05,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:05,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1967204244, now seen corresponding path program 1 times [2022-02-20 19:55:05,889 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:05,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441147891] [2022-02-20 19:55:05,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:05,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:05,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:05,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {37616#true} assume true; {37616#true} is VALID [2022-02-20 19:55:05,921 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {37616#true} {37618#(= ~T1_E~0 ~M_E~0)} #855#return; {37618#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:55:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:05,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {37672#(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); {37673#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:05,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {37673#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,957 INFO L290 TraceCheckUtils]: 3: Hoare triple {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,957 INFO L290 TraceCheckUtils]: 4: Hoare triple {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:05,959 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {37618#(= ~T1_E~0 ~M_E~0)} #857#return; {37617#false} is VALID [2022-02-20 19:55:05,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:05,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {37675#(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~5#1;havoc ~tmp___0~2#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; {37616#true} is VALID [2022-02-20 19:55:05,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {37616#true} assume 1 == ~m_pc~0; {37616#true} is VALID [2022-02-20 19:55:05,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {37616#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {37616#true} is VALID [2022-02-20 19:55:05,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {37616#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {37616#true} is VALID [2022-02-20 19:55:05,984 INFO L290 TraceCheckUtils]: 4: Hoare triple {37616#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~5#1 := #t~ret24#1;havoc #t~ret24#1; {37616#true} is VALID [2022-02-20 19:55:05,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {37616#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {37616#true} is VALID [2022-02-20 19:55:05,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {37616#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; {37616#true} is VALID [2022-02-20 19:55:05,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {37616#true} assume !(1 == ~t1_pc~0); {37616#true} is VALID [2022-02-20 19:55:05,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {37616#true} is_transmit1_triggered_~__retres1~5#1 := 0; {37616#true} is VALID [2022-02-20 19:55:05,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {37616#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {37616#true} is VALID [2022-02-20 19:55:05,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {37616#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~2#1 := #t~ret25#1;havoc #t~ret25#1; {37616#true} is VALID [2022-02-20 19:55:05,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {37616#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {37616#true} is VALID [2022-02-20 19:55:05,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {37616#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; {37616#true} is VALID [2022-02-20 19:55:05,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {37616#true} assume 1 == ~t2_pc~0; {37616#true} is VALID [2022-02-20 19:55:05,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {37616#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {37616#true} is VALID [2022-02-20 19:55:05,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {37616#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {37616#true} is VALID [2022-02-20 19:55:05,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {37616#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {37616#true} is VALID [2022-02-20 19:55:05,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {37616#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {37616#true} is VALID [2022-02-20 19:55:05,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {37616#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; {37616#true} is VALID [2022-02-20 19:55:05,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {37616#true} assume !(1 == ~t3_pc~0); {37616#true} is VALID [2022-02-20 19:55:05,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {37616#true} is_transmit3_triggered_~__retres1~7#1 := 0; {37616#true} is VALID [2022-02-20 19:55:05,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {37616#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {37616#true} is VALID [2022-02-20 19:55:05,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {37616#true} #t~ret27#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___2~0#1 := #t~ret27#1;havoc #t~ret27#1; {37616#true} is VALID [2022-02-20 19:55:05,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {37616#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {37616#true} is VALID [2022-02-20 19:55:05,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {37616#true} assume true; {37616#true} is VALID [2022-02-20 19:55:05,986 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {37616#true} {37617#false} #859#return; {37617#false} is VALID [2022-02-20 19:55:05,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:55:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:05,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {37672#(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); {37616#true} is VALID [2022-02-20 19:55:05,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {37616#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {37616#true} is VALID [2022-02-20 19:55:05,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {37616#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {37616#true} is VALID [2022-02-20 19:55:05,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {37616#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {37616#true} is VALID [2022-02-20 19:55:05,992 INFO L290 TraceCheckUtils]: 4: Hoare triple {37616#true} assume !(1 == ~E_M~0); {37616#true} is VALID [2022-02-20 19:55:05,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {37616#true} assume 1 == ~E_1~0;~E_1~0 := 2; {37616#true} is VALID [2022-02-20 19:55:05,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {37616#true} assume 1 == ~E_2~0;~E_2~0 := 2; {37616#true} is VALID [2022-02-20 19:55:05,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {37616#true} assume 1 == ~E_3~0;~E_3~0 := 2; {37616#true} is VALID [2022-02-20 19:55:05,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {37616#true} assume true; {37616#true} is VALID [2022-02-20 19:55:05,993 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {37616#true} {37617#false} #861#return; {37617#false} is VALID [2022-02-20 19:55:05,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:55:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:05,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {37616#true} havoc ~__retres1~8; {37616#true} is VALID [2022-02-20 19:55:05,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {37616#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {37616#true} is VALID [2022-02-20 19:55:05,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {37616#true} #res := ~__retres1~8; {37616#true} is VALID [2022-02-20 19:55:05,997 INFO L290 TraceCheckUtils]: 3: Hoare triple {37616#true} assume true; {37616#true} is VALID [2022-02-20 19:55:05,997 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37616#true} {37617#false} #863#return; {37617#false} is VALID [2022-02-20 19:55:05,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {37616#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {37618#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {37618#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {37618#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {37618#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#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; {37618#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {37618#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {37618#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:05,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {37618#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {37616#true} is VALID [2022-02-20 19:55:05,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {37616#true} assume true; {37616#true} is VALID [2022-02-20 19:55:05,999 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {37616#true} {37618#(= ~T1_E~0 ~M_E~0)} #855#return; {37618#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:06,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {37618#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {37618#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:06,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {37618#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {37618#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:06,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {37618#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {37618#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:06,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {37618#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {37618#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:06,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {37618#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {37618#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:06,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {37618#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {37618#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:06,002 INFO L272 TraceCheckUtils]: 13: Hoare triple {37618#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {37672#(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:55:06,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {37672#(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); {37673#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:06,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {37673#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:06,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:06,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:06,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:06,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:06,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:06,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:06,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:06,005 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37674#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {37618#(= ~T1_E~0 ~M_E~0)} #857#return; {37617#false} is VALID [2022-02-20 19:55:06,006 INFO L272 TraceCheckUtils]: 24: Hoare triple {37617#false} call activate_threads2(); {37675#(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:55:06,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {37675#(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~5#1;havoc ~tmp___0~2#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; {37616#true} is VALID [2022-02-20 19:55:06,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {37616#true} assume 1 == ~m_pc~0; {37616#true} is VALID [2022-02-20 19:55:06,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {37616#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {37616#true} is VALID [2022-02-20 19:55:06,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {37616#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {37616#true} is VALID [2022-02-20 19:55:06,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {37616#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~5#1 := #t~ret24#1;havoc #t~ret24#1; {37616#true} is VALID [2022-02-20 19:55:06,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {37616#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {37616#true} is VALID [2022-02-20 19:55:06,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {37616#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; {37616#true} is VALID [2022-02-20 19:55:06,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {37616#true} assume !(1 == ~t1_pc~0); {37616#true} is VALID [2022-02-20 19:55:06,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {37616#true} is_transmit1_triggered_~__retres1~5#1 := 0; {37616#true} is VALID [2022-02-20 19:55:06,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {37616#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {37616#true} is VALID [2022-02-20 19:55:06,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {37616#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~2#1 := #t~ret25#1;havoc #t~ret25#1; {37616#true} is VALID [2022-02-20 19:55:06,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {37616#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {37616#true} is VALID [2022-02-20 19:55:06,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {37616#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; {37616#true} is VALID [2022-02-20 19:55:06,007 INFO L290 TraceCheckUtils]: 38: Hoare triple {37616#true} assume 1 == ~t2_pc~0; {37616#true} is VALID [2022-02-20 19:55:06,007 INFO L290 TraceCheckUtils]: 39: Hoare triple {37616#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {37616#true} is VALID [2022-02-20 19:55:06,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {37616#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {37616#true} is VALID [2022-02-20 19:55:06,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {37616#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {37616#true} is VALID [2022-02-20 19:55:06,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {37616#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {37616#true} is VALID [2022-02-20 19:55:06,008 INFO L290 TraceCheckUtils]: 43: Hoare triple {37616#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; {37616#true} is VALID [2022-02-20 19:55:06,008 INFO L290 TraceCheckUtils]: 44: Hoare triple {37616#true} assume !(1 == ~t3_pc~0); {37616#true} is VALID [2022-02-20 19:55:06,008 INFO L290 TraceCheckUtils]: 45: Hoare triple {37616#true} is_transmit3_triggered_~__retres1~7#1 := 0; {37616#true} is VALID [2022-02-20 19:55:06,008 INFO L290 TraceCheckUtils]: 46: Hoare triple {37616#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {37616#true} is VALID [2022-02-20 19:55:06,008 INFO L290 TraceCheckUtils]: 47: Hoare triple {37616#true} #t~ret27#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___2~0#1 := #t~ret27#1;havoc #t~ret27#1; {37616#true} is VALID [2022-02-20 19:55:06,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {37616#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {37616#true} is VALID [2022-02-20 19:55:06,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {37616#true} assume true; {37616#true} is VALID [2022-02-20 19:55:06,008 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {37616#true} {37617#false} #859#return; {37617#false} is VALID [2022-02-20 19:55:06,008 INFO L272 TraceCheckUtils]: 51: Hoare triple {37617#false} call reset_delta_events2(); {37672#(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:55:06,009 INFO L290 TraceCheckUtils]: 52: Hoare triple {37672#(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); {37616#true} is VALID [2022-02-20 19:55:06,009 INFO L290 TraceCheckUtils]: 53: Hoare triple {37616#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {37616#true} is VALID [2022-02-20 19:55:06,009 INFO L290 TraceCheckUtils]: 54: Hoare triple {37616#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {37616#true} is VALID [2022-02-20 19:55:06,009 INFO L290 TraceCheckUtils]: 55: Hoare triple {37616#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {37616#true} is VALID [2022-02-20 19:55:06,009 INFO L290 TraceCheckUtils]: 56: Hoare triple {37616#true} assume !(1 == ~E_M~0); {37616#true} is VALID [2022-02-20 19:55:06,009 INFO L290 TraceCheckUtils]: 57: Hoare triple {37616#true} assume 1 == ~E_1~0;~E_1~0 := 2; {37616#true} is VALID [2022-02-20 19:55:06,009 INFO L290 TraceCheckUtils]: 58: Hoare triple {37616#true} assume 1 == ~E_2~0;~E_2~0 := 2; {37616#true} is VALID [2022-02-20 19:55:06,009 INFO L290 TraceCheckUtils]: 59: Hoare triple {37616#true} assume 1 == ~E_3~0;~E_3~0 := 2; {37616#true} is VALID [2022-02-20 19:55:06,009 INFO L290 TraceCheckUtils]: 60: Hoare triple {37616#true} assume true; {37616#true} is VALID [2022-02-20 19:55:06,010 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {37616#true} {37617#false} #861#return; {37617#false} is VALID [2022-02-20 19:55:06,010 INFO L290 TraceCheckUtils]: 62: Hoare triple {37617#false} assume !false; {37617#false} is VALID [2022-02-20 19:55:06,010 INFO L290 TraceCheckUtils]: 63: Hoare triple {37617#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret19#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {37617#false} is VALID [2022-02-20 19:55:06,010 INFO L290 TraceCheckUtils]: 64: Hoare triple {37617#false} assume !false; {37617#false} is VALID [2022-02-20 19:55:06,010 INFO L272 TraceCheckUtils]: 65: Hoare triple {37617#false} call eval2_#t~ret19#1 := exists_runnable_thread2(); {37616#true} is VALID [2022-02-20 19:55:06,010 INFO L290 TraceCheckUtils]: 66: Hoare triple {37616#true} havoc ~__retres1~8; {37616#true} is VALID [2022-02-20 19:55:06,010 INFO L290 TraceCheckUtils]: 67: Hoare triple {37616#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {37616#true} is VALID [2022-02-20 19:55:06,010 INFO L290 TraceCheckUtils]: 68: Hoare triple {37616#true} #res := ~__retres1~8; {37616#true} is VALID [2022-02-20 19:55:06,010 INFO L290 TraceCheckUtils]: 69: Hoare triple {37616#true} assume true; {37616#true} is VALID [2022-02-20 19:55:06,010 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {37616#true} {37617#false} #863#return; {37617#false} is VALID [2022-02-20 19:55:06,011 INFO L290 TraceCheckUtils]: 71: Hoare triple {37617#false} assume -2147483648 <= eval2_#t~ret19#1 && eval2_#t~ret19#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret19#1;havoc eval2_#t~ret19#1; {37617#false} is VALID [2022-02-20 19:55:06,011 INFO L290 TraceCheckUtils]: 72: Hoare triple {37617#false} assume 0 != eval2_~tmp~4#1; {37617#false} is VALID [2022-02-20 19:55:06,011 INFO L290 TraceCheckUtils]: 73: Hoare triple {37617#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet20#1 && eval2_#t~nondet20#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet20#1;havoc eval2_#t~nondet20#1; {37617#false} is VALID [2022-02-20 19:55:06,011 INFO L290 TraceCheckUtils]: 74: Hoare triple {37617#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1, master_#t~nondet18#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet17#1 && master_#t~nondet17#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet17#1;havoc master_#t~nondet17#1; {37617#false} is VALID [2022-02-20 19:55:06,011 INFO L290 TraceCheckUtils]: 75: Hoare triple {37617#false} assume !(0 == ~m_pc~0); {37617#false} is VALID [2022-02-20 19:55:06,011 INFO L290 TraceCheckUtils]: 76: Hoare triple {37617#false} assume 1 == ~m_pc~0; {37617#false} is VALID [2022-02-20 19:55:06,011 INFO L290 TraceCheckUtils]: 77: Hoare triple {37617#false} assume ~token~0 != 3 + ~local~0; {37617#false} is VALID [2022-02-20 19:55:06,011 INFO L272 TraceCheckUtils]: 78: Hoare triple {37617#false} call error2(); {37617#false} is VALID [2022-02-20 19:55:06,011 INFO L290 TraceCheckUtils]: 79: Hoare triple {37617#false} assume !false; {37617#false} is VALID [2022-02-20 19:55:06,012 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:55:06,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:06,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441147891] [2022-02-20 19:55:06,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441147891] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:06,012 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:06,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:55:06,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494151184] [2022-02-20 19:55:06,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:06,013 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 19:55:06,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:06,013 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 19:55:06,063 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:55:06,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:55:06,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:06,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:55:06,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:06,065 INFO L87 Difference]: Start difference. First operand 1391 states and 1850 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 19:55:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:09,179 INFO L93 Difference]: Finished difference Result 1964 states and 2730 transitions. [2022-02-20 19:55:09,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:55:09,179 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 19:55:09,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:09,179 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 19:55:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 924 transitions. [2022-02-20 19:55:09,186 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 19:55:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 924 transitions. [2022-02-20 19:55:09,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 924 transitions. [2022-02-20 19:55:09,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 924 edges. 924 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:10,058 INFO L225 Difference]: With dead ends: 1964 [2022-02-20 19:55:10,058 INFO L226 Difference]: Without dead ends: 1669 [2022-02-20 19:55:10,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:55:10,060 INFO L933 BasicCegarLoop]: 473 mSDtfsCounter, 670 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:10,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [684 Valid, 1491 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:55:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2022-02-20 19:55:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1529. [2022-02-20 19:55:10,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:10,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1669 states. Second operand has 1529 states, 1346 states have (on average 1.3335809806835066) internal successors, (1795), 1367 states have internal predecessors, (1795), 108 states have call successors, (108), 62 states have call predecessors, (108), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) [2022-02-20 19:55:10,295 INFO L74 IsIncluded]: Start isIncluded. First operand 1669 states. Second operand has 1529 states, 1346 states have (on average 1.3335809806835066) internal successors, (1795), 1367 states have internal predecessors, (1795), 108 states have call successors, (108), 62 states have call predecessors, (108), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) [2022-02-20 19:55:10,297 INFO L87 Difference]: Start difference. First operand 1669 states. Second operand has 1529 states, 1346 states have (on average 1.3335809806835066) internal successors, (1795), 1367 states have internal predecessors, (1795), 108 states have call successors, (108), 62 states have call predecessors, (108), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) [2022-02-20 19:55:10,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:10,398 INFO L93 Difference]: Finished difference Result 1669 states and 2282 transitions. [2022-02-20 19:55:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2282 transitions. [2022-02-20 19:55:10,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:10,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:10,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 1529 states, 1346 states have (on average 1.3335809806835066) internal successors, (1795), 1367 states have internal predecessors, (1795), 108 states have call successors, (108), 62 states have call predecessors, (108), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) Second operand 1669 states. [2022-02-20 19:55:10,406 INFO L87 Difference]: Start difference. First operand has 1529 states, 1346 states have (on average 1.3335809806835066) internal successors, (1795), 1367 states have internal predecessors, (1795), 108 states have call successors, (108), 62 states have call predecessors, (108), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) Second operand 1669 states. [2022-02-20 19:55:10,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:10,535 INFO L93 Difference]: Finished difference Result 1669 states and 2282 transitions. [2022-02-20 19:55:10,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2282 transitions. [2022-02-20 19:55:10,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:10,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:10,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:10,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:10,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1346 states have (on average 1.3335809806835066) internal successors, (1795), 1367 states have internal predecessors, (1795), 108 states have call successors, (108), 62 states have call predecessors, (108), 73 states have return successors, (152), 101 states have call predecessors, (152), 105 states have call successors, (152) [2022-02-20 19:55:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2055 transitions. [2022-02-20 19:55:10,688 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2055 transitions. Word has length 80 [2022-02-20 19:55:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:10,688 INFO L470 AbstractCegarLoop]: Abstraction has 1529 states and 2055 transitions. [2022-02-20 19:55:10,689 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 19:55:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2055 transitions. [2022-02-20 19:55:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 19:55:10,691 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:10,691 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:55:10,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:55:10,692 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:10,692 INFO L85 PathProgramCache]: Analyzing trace with hash 281024406, now seen corresponding path program 1 times [2022-02-20 19:55:10,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:10,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689024835] [2022-02-20 19:55:10,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:10,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:10,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:10,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {45790#true} assume true; {45790#true} is VALID [2022-02-20 19:55:10,724 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {45790#true} {45792#(= ~T2_E~0 ~M_E~0)} #855#return; {45792#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:10,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:55:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:10,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {45846#(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); {45847#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:10,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {45847#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {45847#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:10,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {45847#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:10,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:10,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:10,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:10,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:10,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:10,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:10,756 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {45792#(= ~T2_E~0 ~M_E~0)} #857#return; {45791#false} is VALID [2022-02-20 19:55:10,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:10,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {45849#(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~5#1;havoc ~tmp___0~2#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; {45790#true} is VALID [2022-02-20 19:55:10,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {45790#true} assume 1 == ~m_pc~0; {45790#true} is VALID [2022-02-20 19:55:10,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {45790#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {45790#true} is VALID [2022-02-20 19:55:10,774 INFO L290 TraceCheckUtils]: 3: Hoare triple {45790#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {45790#true} is VALID [2022-02-20 19:55:10,774 INFO L290 TraceCheckUtils]: 4: Hoare triple {45790#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~5#1 := #t~ret24#1;havoc #t~ret24#1; {45790#true} is VALID [2022-02-20 19:55:10,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {45790#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {45790#true} is VALID [2022-02-20 19:55:10,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {45790#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; {45790#true} is VALID [2022-02-20 19:55:10,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {45790#true} assume !(1 == ~t1_pc~0); {45790#true} is VALID [2022-02-20 19:55:10,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {45790#true} is_transmit1_triggered_~__retres1~5#1 := 0; {45790#true} is VALID [2022-02-20 19:55:10,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {45790#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {45790#true} is VALID [2022-02-20 19:55:10,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {45790#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~2#1 := #t~ret25#1;havoc #t~ret25#1; {45790#true} is VALID [2022-02-20 19:55:10,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {45790#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {45790#true} is VALID [2022-02-20 19:55:10,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {45790#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; {45790#true} is VALID [2022-02-20 19:55:10,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {45790#true} assume 1 == ~t2_pc~0; {45790#true} is VALID [2022-02-20 19:55:10,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {45790#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {45790#true} is VALID [2022-02-20 19:55:10,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {45790#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {45790#true} is VALID [2022-02-20 19:55:10,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {45790#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {45790#true} is VALID [2022-02-20 19:55:10,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {45790#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {45790#true} is VALID [2022-02-20 19:55:10,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {45790#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; {45790#true} is VALID [2022-02-20 19:55:10,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {45790#true} assume !(1 == ~t3_pc~0); {45790#true} is VALID [2022-02-20 19:55:10,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {45790#true} is_transmit3_triggered_~__retres1~7#1 := 0; {45790#true} is VALID [2022-02-20 19:55:10,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {45790#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {45790#true} is VALID [2022-02-20 19:55:10,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {45790#true} #t~ret27#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___2~0#1 := #t~ret27#1;havoc #t~ret27#1; {45790#true} is VALID [2022-02-20 19:55:10,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {45790#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {45790#true} is VALID [2022-02-20 19:55:10,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {45790#true} assume true; {45790#true} is VALID [2022-02-20 19:55:10,777 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {45790#true} {45791#false} #859#return; {45791#false} is VALID [2022-02-20 19:55:10,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:55:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:10,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {45846#(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); {45790#true} is VALID [2022-02-20 19:55:10,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {45790#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {45790#true} is VALID [2022-02-20 19:55:10,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {45790#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {45790#true} is VALID [2022-02-20 19:55:10,783 INFO L290 TraceCheckUtils]: 3: Hoare triple {45790#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {45790#true} is VALID [2022-02-20 19:55:10,783 INFO L290 TraceCheckUtils]: 4: Hoare triple {45790#true} assume !(1 == ~E_M~0); {45790#true} is VALID [2022-02-20 19:55:10,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {45790#true} assume 1 == ~E_1~0;~E_1~0 := 2; {45790#true} is VALID [2022-02-20 19:55:10,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {45790#true} assume 1 == ~E_2~0;~E_2~0 := 2; {45790#true} is VALID [2022-02-20 19:55:10,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {45790#true} assume 1 == ~E_3~0;~E_3~0 := 2; {45790#true} is VALID [2022-02-20 19:55:10,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {45790#true} assume true; {45790#true} is VALID [2022-02-20 19:55:10,784 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {45790#true} {45791#false} #861#return; {45791#false} is VALID [2022-02-20 19:55:10,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:55:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:10,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {45790#true} havoc ~__retres1~8; {45790#true} is VALID [2022-02-20 19:55:10,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {45790#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {45790#true} is VALID [2022-02-20 19:55:10,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {45790#true} #res := ~__retres1~8; {45790#true} is VALID [2022-02-20 19:55:10,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {45790#true} assume true; {45790#true} is VALID [2022-02-20 19:55:10,787 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45790#true} {45791#false} #863#return; {45791#false} is VALID [2022-02-20 19:55:10,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {45790#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {45792#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:10,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {45792#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {45792#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:10,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {45792#(= ~T2_E~0 ~M_E~0)} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#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; {45792#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:10,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {45792#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {45792#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:10,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {45792#(= ~T2_E~0 ~M_E~0)} call update_channels2(); {45790#true} is VALID [2022-02-20 19:55:10,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {45790#true} assume true; {45790#true} is VALID [2022-02-20 19:55:10,790 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {45790#true} {45792#(= ~T2_E~0 ~M_E~0)} #855#return; {45792#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:10,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {45792#(= ~T2_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {45792#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:10,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {45792#(= ~T2_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {45792#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:10,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {45792#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {45792#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:10,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {45792#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {45792#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:10,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {45792#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {45792#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:10,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {45792#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {45792#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:55:10,792 INFO L272 TraceCheckUtils]: 13: Hoare triple {45792#(= ~T2_E~0 ~M_E~0)} call fire_delta_events2(); {45846#(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:55:10,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {45846#(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); {45847#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:10,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {45847#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {45847#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:10,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {45847#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:10,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:10,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:10,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:10,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:10,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:10,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:10,796 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {45848#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {45792#(= ~T2_E~0 ~M_E~0)} #857#return; {45791#false} is VALID [2022-02-20 19:55:10,797 INFO L272 TraceCheckUtils]: 24: Hoare triple {45791#false} call activate_threads2(); {45849#(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:55:10,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {45849#(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~5#1;havoc ~tmp___0~2#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; {45790#true} is VALID [2022-02-20 19:55:10,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {45790#true} assume 1 == ~m_pc~0; {45790#true} is VALID [2022-02-20 19:55:10,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {45790#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {45790#true} is VALID [2022-02-20 19:55:10,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {45790#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {45790#true} is VALID [2022-02-20 19:55:10,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {45790#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~5#1 := #t~ret24#1;havoc #t~ret24#1; {45790#true} is VALID [2022-02-20 19:55:10,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {45790#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {45790#true} is VALID [2022-02-20 19:55:10,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {45790#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; {45790#true} is VALID [2022-02-20 19:55:10,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {45790#true} assume !(1 == ~t1_pc~0); {45790#true} is VALID [2022-02-20 19:55:10,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {45790#true} is_transmit1_triggered_~__retres1~5#1 := 0; {45790#true} is VALID [2022-02-20 19:55:10,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {45790#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {45790#true} is VALID [2022-02-20 19:55:10,798 INFO L290 TraceCheckUtils]: 35: Hoare triple {45790#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~2#1 := #t~ret25#1;havoc #t~ret25#1; {45790#true} is VALID [2022-02-20 19:55:10,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {45790#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {45790#true} is VALID [2022-02-20 19:55:10,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {45790#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; {45790#true} is VALID [2022-02-20 19:55:10,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {45790#true} assume 1 == ~t2_pc~0; {45790#true} is VALID [2022-02-20 19:55:10,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {45790#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {45790#true} is VALID [2022-02-20 19:55:10,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {45790#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {45790#true} is VALID [2022-02-20 19:55:10,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {45790#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {45790#true} is VALID [2022-02-20 19:55:10,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {45790#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {45790#true} is VALID [2022-02-20 19:55:10,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {45790#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; {45790#true} is VALID [2022-02-20 19:55:10,803 INFO L290 TraceCheckUtils]: 44: Hoare triple {45790#true} assume !(1 == ~t3_pc~0); {45790#true} is VALID [2022-02-20 19:55:10,803 INFO L290 TraceCheckUtils]: 45: Hoare triple {45790#true} is_transmit3_triggered_~__retres1~7#1 := 0; {45790#true} is VALID [2022-02-20 19:55:10,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {45790#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {45790#true} is VALID [2022-02-20 19:55:10,804 INFO L290 TraceCheckUtils]: 47: Hoare triple {45790#true} #t~ret27#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___2~0#1 := #t~ret27#1;havoc #t~ret27#1; {45790#true} is VALID [2022-02-20 19:55:10,804 INFO L290 TraceCheckUtils]: 48: Hoare triple {45790#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {45790#true} is VALID [2022-02-20 19:55:10,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {45790#true} assume true; {45790#true} is VALID [2022-02-20 19:55:10,804 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {45790#true} {45791#false} #859#return; {45791#false} is VALID [2022-02-20 19:55:10,804 INFO L272 TraceCheckUtils]: 51: Hoare triple {45791#false} call reset_delta_events2(); {45846#(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:55:10,804 INFO L290 TraceCheckUtils]: 52: Hoare triple {45846#(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); {45790#true} is VALID [2022-02-20 19:55:10,804 INFO L290 TraceCheckUtils]: 53: Hoare triple {45790#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {45790#true} is VALID [2022-02-20 19:55:10,805 INFO L290 TraceCheckUtils]: 54: Hoare triple {45790#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {45790#true} is VALID [2022-02-20 19:55:10,805 INFO L290 TraceCheckUtils]: 55: Hoare triple {45790#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {45790#true} is VALID [2022-02-20 19:55:10,805 INFO L290 TraceCheckUtils]: 56: Hoare triple {45790#true} assume !(1 == ~E_M~0); {45790#true} is VALID [2022-02-20 19:55:10,805 INFO L290 TraceCheckUtils]: 57: Hoare triple {45790#true} assume 1 == ~E_1~0;~E_1~0 := 2; {45790#true} is VALID [2022-02-20 19:55:10,805 INFO L290 TraceCheckUtils]: 58: Hoare triple {45790#true} assume 1 == ~E_2~0;~E_2~0 := 2; {45790#true} is VALID [2022-02-20 19:55:10,805 INFO L290 TraceCheckUtils]: 59: Hoare triple {45790#true} assume 1 == ~E_3~0;~E_3~0 := 2; {45790#true} is VALID [2022-02-20 19:55:10,805 INFO L290 TraceCheckUtils]: 60: Hoare triple {45790#true} assume true; {45790#true} is VALID [2022-02-20 19:55:10,806 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {45790#true} {45791#false} #861#return; {45791#false} is VALID [2022-02-20 19:55:10,806 INFO L290 TraceCheckUtils]: 62: Hoare triple {45791#false} assume !false; {45791#false} is VALID [2022-02-20 19:55:10,806 INFO L290 TraceCheckUtils]: 63: Hoare triple {45791#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret19#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {45791#false} is VALID [2022-02-20 19:55:10,806 INFO L290 TraceCheckUtils]: 64: Hoare triple {45791#false} assume !false; {45791#false} is VALID [2022-02-20 19:55:10,806 INFO L272 TraceCheckUtils]: 65: Hoare triple {45791#false} call eval2_#t~ret19#1 := exists_runnable_thread2(); {45790#true} is VALID [2022-02-20 19:55:10,806 INFO L290 TraceCheckUtils]: 66: Hoare triple {45790#true} havoc ~__retres1~8; {45790#true} is VALID [2022-02-20 19:55:10,806 INFO L290 TraceCheckUtils]: 67: Hoare triple {45790#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {45790#true} is VALID [2022-02-20 19:55:10,807 INFO L290 TraceCheckUtils]: 68: Hoare triple {45790#true} #res := ~__retres1~8; {45790#true} is VALID [2022-02-20 19:55:10,807 INFO L290 TraceCheckUtils]: 69: Hoare triple {45790#true} assume true; {45790#true} is VALID [2022-02-20 19:55:10,807 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {45790#true} {45791#false} #863#return; {45791#false} is VALID [2022-02-20 19:55:10,807 INFO L290 TraceCheckUtils]: 71: Hoare triple {45791#false} assume -2147483648 <= eval2_#t~ret19#1 && eval2_#t~ret19#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret19#1;havoc eval2_#t~ret19#1; {45791#false} is VALID [2022-02-20 19:55:10,807 INFO L290 TraceCheckUtils]: 72: Hoare triple {45791#false} assume 0 != eval2_~tmp~4#1; {45791#false} is VALID [2022-02-20 19:55:10,807 INFO L290 TraceCheckUtils]: 73: Hoare triple {45791#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet20#1 && eval2_#t~nondet20#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet20#1;havoc eval2_#t~nondet20#1; {45791#false} is VALID [2022-02-20 19:55:10,807 INFO L290 TraceCheckUtils]: 74: Hoare triple {45791#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1, master_#t~nondet18#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet17#1 && master_#t~nondet17#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet17#1;havoc master_#t~nondet17#1; {45791#false} is VALID [2022-02-20 19:55:10,808 INFO L290 TraceCheckUtils]: 75: Hoare triple {45791#false} assume !(0 == ~m_pc~0); {45791#false} is VALID [2022-02-20 19:55:10,808 INFO L290 TraceCheckUtils]: 76: Hoare triple {45791#false} assume 1 == ~m_pc~0; {45791#false} is VALID [2022-02-20 19:55:10,808 INFO L290 TraceCheckUtils]: 77: Hoare triple {45791#false} assume ~token~0 != 3 + ~local~0; {45791#false} is VALID [2022-02-20 19:55:10,808 INFO L272 TraceCheckUtils]: 78: Hoare triple {45791#false} call error2(); {45791#false} is VALID [2022-02-20 19:55:10,808 INFO L290 TraceCheckUtils]: 79: Hoare triple {45791#false} assume !false; {45791#false} is VALID [2022-02-20 19:55:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:55:10,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:10,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689024835] [2022-02-20 19:55:10,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689024835] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:10,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:10,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:55:10,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292001600] [2022-02-20 19:55:10,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:10,810 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 19:55:10,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:10,811 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 19:55:10,859 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:55:10,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:55:10,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:10,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:55:10,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:10,860 INFO L87 Difference]: Start difference. First operand 1529 states and 2055 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 19:55:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:14,120 INFO L93 Difference]: Finished difference Result 2461 states and 3483 transitions. [2022-02-20 19:55:14,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:55:14,120 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 19:55:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:14,120 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 19:55:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 929 transitions. [2022-02-20 19:55:14,126 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 19:55:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 929 transitions. [2022-02-20 19:55:14,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 929 transitions. [2022-02-20 19:55:14,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 929 edges. 929 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:15,072 INFO L225 Difference]: With dead ends: 2461 [2022-02-20 19:55:15,072 INFO L226 Difference]: Without dead ends: 2028 [2022-02-20 19:55:15,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:55:15,074 INFO L933 BasicCegarLoop]: 465 mSDtfsCounter, 667 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:15,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [681 Valid, 1483 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:55:15,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2022-02-20 19:55:15,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1806. [2022-02-20 19:55:15,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:15,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2028 states. Second operand has 1806 states, 1585 states have (on average 1.3589905362776025) internal successors, (2154), 1608 states have internal predecessors, (2154), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) [2022-02-20 19:55:15,359 INFO L74 IsIncluded]: Start isIncluded. First operand 2028 states. Second operand has 1806 states, 1585 states have (on average 1.3589905362776025) internal successors, (2154), 1608 states have internal predecessors, (2154), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) [2022-02-20 19:55:15,361 INFO L87 Difference]: Start difference. First operand 2028 states. Second operand has 1806 states, 1585 states have (on average 1.3589905362776025) internal successors, (2154), 1608 states have internal predecessors, (2154), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) [2022-02-20 19:55:15,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:15,529 INFO L93 Difference]: Finished difference Result 2028 states and 2827 transitions. [2022-02-20 19:55:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2827 transitions. [2022-02-20 19:55:15,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:15,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:15,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 1806 states, 1585 states have (on average 1.3589905362776025) internal successors, (2154), 1608 states have internal predecessors, (2154), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) Second operand 2028 states. [2022-02-20 19:55:15,538 INFO L87 Difference]: Start difference. First operand has 1806 states, 1585 states have (on average 1.3589905362776025) internal successors, (2154), 1608 states have internal predecessors, (2154), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) Second operand 2028 states. [2022-02-20 19:55:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:15,706 INFO L93 Difference]: Finished difference Result 2028 states and 2827 transitions. [2022-02-20 19:55:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2827 transitions. [2022-02-20 19:55:15,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:15,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:15,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:15,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1585 states have (on average 1.3589905362776025) internal successors, (2154), 1608 states have internal predecessors, (2154), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) [2022-02-20 19:55:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2470 transitions. [2022-02-20 19:55:15,906 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2470 transitions. Word has length 80 [2022-02-20 19:55:15,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:15,907 INFO L470 AbstractCegarLoop]: Abstraction has 1806 states and 2470 transitions. [2022-02-20 19:55:15,907 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 19:55:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2470 transitions. [2022-02-20 19:55:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 19:55:15,910 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:15,910 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:55:15,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:55:15,910 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:15,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:15,911 INFO L85 PathProgramCache]: Analyzing trace with hash 226631508, now seen corresponding path program 1 times [2022-02-20 19:55:15,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:15,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531099921] [2022-02-20 19:55:15,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:15,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:15,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:15,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {55683#true} assume true; {55683#true} is VALID [2022-02-20 19:55:15,948 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {55683#true} {55685#(not (= ~T3_E~0 0))} #855#return; {55685#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:15,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:55:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:15,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {55739#(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); {55740#(= |old(~T3_E~0)| ~T3_E~0)} is VALID [2022-02-20 19:55:15,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {55740#(= |old(~T3_E~0)| ~T3_E~0)} assume !(0 == ~T1_E~0); {55740#(= |old(~T3_E~0)| ~T3_E~0)} is VALID [2022-02-20 19:55:15,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {55740#(= |old(~T3_E~0)| ~T3_E~0)} assume !(0 == ~T2_E~0); {55740#(= |old(~T3_E~0)| ~T3_E~0)} is VALID [2022-02-20 19:55:15,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {55740#(= |old(~T3_E~0)| ~T3_E~0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {55741#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:15,983 INFO L290 TraceCheckUtils]: 4: Hoare triple {55741#(= |old(~T3_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {55741#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:15,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {55741#(= |old(~T3_E~0)| 0)} assume !(0 == ~E_1~0); {55741#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:15,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {55741#(= |old(~T3_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {55741#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:15,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {55741#(= |old(~T3_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {55741#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:15,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {55741#(= |old(~T3_E~0)| 0)} assume true; {55741#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:15,985 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {55741#(= |old(~T3_E~0)| 0)} {55685#(not (= ~T3_E~0 0))} #857#return; {55684#false} is VALID [2022-02-20 19:55:15,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:16,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {55742#(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~5#1;havoc ~tmp___0~2#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; {55683#true} is VALID [2022-02-20 19:55:16,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {55683#true} assume 1 == ~m_pc~0; {55683#true} is VALID [2022-02-20 19:55:16,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {55683#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {55683#true} is VALID [2022-02-20 19:55:16,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {55683#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {55683#true} is VALID [2022-02-20 19:55:16,002 INFO L290 TraceCheckUtils]: 4: Hoare triple {55683#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~5#1 := #t~ret24#1;havoc #t~ret24#1; {55683#true} is VALID [2022-02-20 19:55:16,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {55683#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {55683#true} is VALID [2022-02-20 19:55:16,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {55683#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; {55683#true} is VALID [2022-02-20 19:55:16,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {55683#true} assume !(1 == ~t1_pc~0); {55683#true} is VALID [2022-02-20 19:55:16,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {55683#true} is_transmit1_triggered_~__retres1~5#1 := 0; {55683#true} is VALID [2022-02-20 19:55:16,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {55683#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {55683#true} is VALID [2022-02-20 19:55:16,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {55683#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~2#1 := #t~ret25#1;havoc #t~ret25#1; {55683#true} is VALID [2022-02-20 19:55:16,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {55683#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {55683#true} is VALID [2022-02-20 19:55:16,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {55683#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; {55683#true} is VALID [2022-02-20 19:55:16,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {55683#true} assume 1 == ~t2_pc~0; {55683#true} is VALID [2022-02-20 19:55:16,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {55683#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {55683#true} is VALID [2022-02-20 19:55:16,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {55683#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {55683#true} is VALID [2022-02-20 19:55:16,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {55683#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {55683#true} is VALID [2022-02-20 19:55:16,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {55683#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {55683#true} is VALID [2022-02-20 19:55:16,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {55683#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; {55683#true} is VALID [2022-02-20 19:55:16,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {55683#true} assume !(1 == ~t3_pc~0); {55683#true} is VALID [2022-02-20 19:55:16,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {55683#true} is_transmit3_triggered_~__retres1~7#1 := 0; {55683#true} is VALID [2022-02-20 19:55:16,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {55683#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {55683#true} is VALID [2022-02-20 19:55:16,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {55683#true} #t~ret27#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___2~0#1 := #t~ret27#1;havoc #t~ret27#1; {55683#true} is VALID [2022-02-20 19:55:16,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {55683#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {55683#true} is VALID [2022-02-20 19:55:16,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {55683#true} assume true; {55683#true} is VALID [2022-02-20 19:55:16,005 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {55683#true} {55684#false} #859#return; {55684#false} is VALID [2022-02-20 19:55:16,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:55:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:16,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {55739#(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); {55683#true} is VALID [2022-02-20 19:55:16,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {55683#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {55683#true} is VALID [2022-02-20 19:55:16,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {55683#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {55683#true} is VALID [2022-02-20 19:55:16,011 INFO L290 TraceCheckUtils]: 3: Hoare triple {55683#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {55683#true} is VALID [2022-02-20 19:55:16,012 INFO L290 TraceCheckUtils]: 4: Hoare triple {55683#true} assume !(1 == ~E_M~0); {55683#true} is VALID [2022-02-20 19:55:16,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {55683#true} assume 1 == ~E_1~0;~E_1~0 := 2; {55683#true} is VALID [2022-02-20 19:55:16,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {55683#true} assume 1 == ~E_2~0;~E_2~0 := 2; {55683#true} is VALID [2022-02-20 19:55:16,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {55683#true} assume 1 == ~E_3~0;~E_3~0 := 2; {55683#true} is VALID [2022-02-20 19:55:16,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {55683#true} assume true; {55683#true} is VALID [2022-02-20 19:55:16,012 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {55683#true} {55684#false} #861#return; {55684#false} is VALID [2022-02-20 19:55:16,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:55:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:16,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {55683#true} havoc ~__retres1~8; {55683#true} is VALID [2022-02-20 19:55:16,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {55683#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {55683#true} is VALID [2022-02-20 19:55:16,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {55683#true} #res := ~__retres1~8; {55683#true} is VALID [2022-02-20 19:55:16,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {55683#true} assume true; {55683#true} is VALID [2022-02-20 19:55:16,015 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {55683#true} {55684#false} #863#return; {55684#false} is VALID [2022-02-20 19:55:16,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {55683#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {55685#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:16,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {55685#(not (= ~T3_E~0 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {55685#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:16,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {55685#(not (= ~T3_E~0 0))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#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; {55685#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:16,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {55685#(not (= ~T3_E~0 0))} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {55685#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:16,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {55685#(not (= ~T3_E~0 0))} call update_channels2(); {55683#true} is VALID [2022-02-20 19:55:16,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {55683#true} assume true; {55683#true} is VALID [2022-02-20 19:55:16,018 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {55683#true} {55685#(not (= ~T3_E~0 0))} #855#return; {55685#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:16,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {55685#(not (= ~T3_E~0 0))} assume { :begin_inline_init_threads2 } true; {55685#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:16,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {55685#(not (= ~T3_E~0 0))} assume 1 == ~m_i~0;~m_st~0 := 0; {55685#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:16,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {55685#(not (= ~T3_E~0 0))} assume 1 == ~t1_i~0;~t1_st~0 := 0; {55685#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:16,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {55685#(not (= ~T3_E~0 0))} assume 1 == ~t2_i~0;~t2_st~0 := 0; {55685#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:16,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {55685#(not (= ~T3_E~0 0))} assume 1 == ~t3_i~0;~t3_st~0 := 0; {55685#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:16,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {55685#(not (= ~T3_E~0 0))} assume { :end_inline_init_threads2 } true; {55685#(not (= ~T3_E~0 0))} is VALID [2022-02-20 19:55:16,020 INFO L272 TraceCheckUtils]: 13: Hoare triple {55685#(not (= ~T3_E~0 0))} call fire_delta_events2(); {55739#(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:55:16,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {55739#(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); {55740#(= |old(~T3_E~0)| ~T3_E~0)} is VALID [2022-02-20 19:55:16,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {55740#(= |old(~T3_E~0)| ~T3_E~0)} assume !(0 == ~T1_E~0); {55740#(= |old(~T3_E~0)| ~T3_E~0)} is VALID [2022-02-20 19:55:16,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {55740#(= |old(~T3_E~0)| ~T3_E~0)} assume !(0 == ~T2_E~0); {55740#(= |old(~T3_E~0)| ~T3_E~0)} is VALID [2022-02-20 19:55:16,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {55740#(= |old(~T3_E~0)| ~T3_E~0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {55741#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:16,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {55741#(= |old(~T3_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {55741#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:16,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {55741#(= |old(~T3_E~0)| 0)} assume !(0 == ~E_1~0); {55741#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:16,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {55741#(= |old(~T3_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {55741#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:16,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {55741#(= |old(~T3_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {55741#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:16,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {55741#(= |old(~T3_E~0)| 0)} assume true; {55741#(= |old(~T3_E~0)| 0)} is VALID [2022-02-20 19:55:16,024 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {55741#(= |old(~T3_E~0)| 0)} {55685#(not (= ~T3_E~0 0))} #857#return; {55684#false} is VALID [2022-02-20 19:55:16,024 INFO L272 TraceCheckUtils]: 24: Hoare triple {55684#false} call activate_threads2(); {55742#(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:55:16,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {55742#(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~5#1;havoc ~tmp___0~2#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; {55683#true} is VALID [2022-02-20 19:55:16,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {55683#true} assume 1 == ~m_pc~0; {55683#true} is VALID [2022-02-20 19:55:16,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {55683#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {55683#true} is VALID [2022-02-20 19:55:16,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {55683#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {55683#true} is VALID [2022-02-20 19:55:16,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {55683#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~5#1 := #t~ret24#1;havoc #t~ret24#1; {55683#true} is VALID [2022-02-20 19:55:16,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {55683#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {55683#true} is VALID [2022-02-20 19:55:16,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {55683#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; {55683#true} is VALID [2022-02-20 19:55:16,025 INFO L290 TraceCheckUtils]: 32: Hoare triple {55683#true} assume !(1 == ~t1_pc~0); {55683#true} is VALID [2022-02-20 19:55:16,025 INFO L290 TraceCheckUtils]: 33: Hoare triple {55683#true} is_transmit1_triggered_~__retres1~5#1 := 0; {55683#true} is VALID [2022-02-20 19:55:16,026 INFO L290 TraceCheckUtils]: 34: Hoare triple {55683#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {55683#true} is VALID [2022-02-20 19:55:16,026 INFO L290 TraceCheckUtils]: 35: Hoare triple {55683#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~2#1 := #t~ret25#1;havoc #t~ret25#1; {55683#true} is VALID [2022-02-20 19:55:16,026 INFO L290 TraceCheckUtils]: 36: Hoare triple {55683#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {55683#true} is VALID [2022-02-20 19:55:16,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {55683#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; {55683#true} is VALID [2022-02-20 19:55:16,026 INFO L290 TraceCheckUtils]: 38: Hoare triple {55683#true} assume 1 == ~t2_pc~0; {55683#true} is VALID [2022-02-20 19:55:16,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {55683#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {55683#true} is VALID [2022-02-20 19:55:16,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {55683#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {55683#true} is VALID [2022-02-20 19:55:16,027 INFO L290 TraceCheckUtils]: 41: Hoare triple {55683#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {55683#true} is VALID [2022-02-20 19:55:16,027 INFO L290 TraceCheckUtils]: 42: Hoare triple {55683#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {55683#true} is VALID [2022-02-20 19:55:16,027 INFO L290 TraceCheckUtils]: 43: Hoare triple {55683#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; {55683#true} is VALID [2022-02-20 19:55:16,027 INFO L290 TraceCheckUtils]: 44: Hoare triple {55683#true} assume !(1 == ~t3_pc~0); {55683#true} is VALID [2022-02-20 19:55:16,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {55683#true} is_transmit3_triggered_~__retres1~7#1 := 0; {55683#true} is VALID [2022-02-20 19:55:16,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {55683#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {55683#true} is VALID [2022-02-20 19:55:16,027 INFO L290 TraceCheckUtils]: 47: Hoare triple {55683#true} #t~ret27#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___2~0#1 := #t~ret27#1;havoc #t~ret27#1; {55683#true} is VALID [2022-02-20 19:55:16,028 INFO L290 TraceCheckUtils]: 48: Hoare triple {55683#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {55683#true} is VALID [2022-02-20 19:55:16,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {55683#true} assume true; {55683#true} is VALID [2022-02-20 19:55:16,028 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {55683#true} {55684#false} #859#return; {55684#false} is VALID [2022-02-20 19:55:16,028 INFO L272 TraceCheckUtils]: 51: Hoare triple {55684#false} call reset_delta_events2(); {55739#(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:55:16,028 INFO L290 TraceCheckUtils]: 52: Hoare triple {55739#(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); {55683#true} is VALID [2022-02-20 19:55:16,028 INFO L290 TraceCheckUtils]: 53: Hoare triple {55683#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {55683#true} is VALID [2022-02-20 19:55:16,029 INFO L290 TraceCheckUtils]: 54: Hoare triple {55683#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {55683#true} is VALID [2022-02-20 19:55:16,029 INFO L290 TraceCheckUtils]: 55: Hoare triple {55683#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {55683#true} is VALID [2022-02-20 19:55:16,029 INFO L290 TraceCheckUtils]: 56: Hoare triple {55683#true} assume !(1 == ~E_M~0); {55683#true} is VALID [2022-02-20 19:55:16,029 INFO L290 TraceCheckUtils]: 57: Hoare triple {55683#true} assume 1 == ~E_1~0;~E_1~0 := 2; {55683#true} is VALID [2022-02-20 19:55:16,029 INFO L290 TraceCheckUtils]: 58: Hoare triple {55683#true} assume 1 == ~E_2~0;~E_2~0 := 2; {55683#true} is VALID [2022-02-20 19:55:16,029 INFO L290 TraceCheckUtils]: 59: Hoare triple {55683#true} assume 1 == ~E_3~0;~E_3~0 := 2; {55683#true} is VALID [2022-02-20 19:55:16,029 INFO L290 TraceCheckUtils]: 60: Hoare triple {55683#true} assume true; {55683#true} is VALID [2022-02-20 19:55:16,029 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {55683#true} {55684#false} #861#return; {55684#false} is VALID [2022-02-20 19:55:16,030 INFO L290 TraceCheckUtils]: 62: Hoare triple {55684#false} assume !false; {55684#false} is VALID [2022-02-20 19:55:16,030 INFO L290 TraceCheckUtils]: 63: Hoare triple {55684#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret19#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {55684#false} is VALID [2022-02-20 19:55:16,030 INFO L290 TraceCheckUtils]: 64: Hoare triple {55684#false} assume !false; {55684#false} is VALID [2022-02-20 19:55:16,030 INFO L272 TraceCheckUtils]: 65: Hoare triple {55684#false} call eval2_#t~ret19#1 := exists_runnable_thread2(); {55683#true} is VALID [2022-02-20 19:55:16,030 INFO L290 TraceCheckUtils]: 66: Hoare triple {55683#true} havoc ~__retres1~8; {55683#true} is VALID [2022-02-20 19:55:16,030 INFO L290 TraceCheckUtils]: 67: Hoare triple {55683#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {55683#true} is VALID [2022-02-20 19:55:16,030 INFO L290 TraceCheckUtils]: 68: Hoare triple {55683#true} #res := ~__retres1~8; {55683#true} is VALID [2022-02-20 19:55:16,031 INFO L290 TraceCheckUtils]: 69: Hoare triple {55683#true} assume true; {55683#true} is VALID [2022-02-20 19:55:16,031 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {55683#true} {55684#false} #863#return; {55684#false} is VALID [2022-02-20 19:55:16,031 INFO L290 TraceCheckUtils]: 71: Hoare triple {55684#false} assume -2147483648 <= eval2_#t~ret19#1 && eval2_#t~ret19#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret19#1;havoc eval2_#t~ret19#1; {55684#false} is VALID [2022-02-20 19:55:16,031 INFO L290 TraceCheckUtils]: 72: Hoare triple {55684#false} assume 0 != eval2_~tmp~4#1; {55684#false} is VALID [2022-02-20 19:55:16,031 INFO L290 TraceCheckUtils]: 73: Hoare triple {55684#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet20#1 && eval2_#t~nondet20#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet20#1;havoc eval2_#t~nondet20#1; {55684#false} is VALID [2022-02-20 19:55:16,031 INFO L290 TraceCheckUtils]: 74: Hoare triple {55684#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1, master_#t~nondet18#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet17#1 && master_#t~nondet17#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet17#1;havoc master_#t~nondet17#1; {55684#false} is VALID [2022-02-20 19:55:16,031 INFO L290 TraceCheckUtils]: 75: Hoare triple {55684#false} assume !(0 == ~m_pc~0); {55684#false} is VALID [2022-02-20 19:55:16,032 INFO L290 TraceCheckUtils]: 76: Hoare triple {55684#false} assume 1 == ~m_pc~0; {55684#false} is VALID [2022-02-20 19:55:16,032 INFO L290 TraceCheckUtils]: 77: Hoare triple {55684#false} assume ~token~0 != 3 + ~local~0; {55684#false} is VALID [2022-02-20 19:55:16,032 INFO L272 TraceCheckUtils]: 78: Hoare triple {55684#false} call error2(); {55684#false} is VALID [2022-02-20 19:55:16,032 INFO L290 TraceCheckUtils]: 79: Hoare triple {55684#false} assume !false; {55684#false} is VALID [2022-02-20 19:55:16,032 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:55:16,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:16,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531099921] [2022-02-20 19:55:16,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531099921] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:16,033 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:16,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:55:16,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651316956] [2022-02-20 19:55:16,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:16,034 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 19:55:16,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:16,034 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 19:55:16,082 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:55:16,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:55:16,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:16,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:55:16,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:16,084 INFO L87 Difference]: Start difference. First operand 1806 states and 2470 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 19:55:18,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:18,318 INFO L93 Difference]: Finished difference Result 2726 states and 3889 transitions. [2022-02-20 19:55:18,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:55:18,318 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 19:55:18,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:18,319 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 19:55:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 637 transitions. [2022-02-20 19:55:18,323 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 19:55:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 637 transitions. [2022-02-20 19:55:18,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 637 transitions. [2022-02-20 19:55:18,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 637 edges. 637 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:19,008 INFO L225 Difference]: With dead ends: 2726 [2022-02-20 19:55:19,008 INFO L226 Difference]: Without dead ends: 2016 [2022-02-20 19:55:19,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:55:19,010 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 540 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:19,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [555 Valid, 919 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:55:19,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2022-02-20 19:55:19,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1806. [2022-02-20 19:55:19,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:19,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2016 states. Second operand has 1806 states, 1585 states have (on average 1.3558359621451104) internal successors, (2149), 1608 states have internal predecessors, (2149), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) [2022-02-20 19:55:19,279 INFO L74 IsIncluded]: Start isIncluded. First operand 2016 states. Second operand has 1806 states, 1585 states have (on average 1.3558359621451104) internal successors, (2149), 1608 states have internal predecessors, (2149), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) [2022-02-20 19:55:19,281 INFO L87 Difference]: Start difference. First operand 2016 states. Second operand has 1806 states, 1585 states have (on average 1.3558359621451104) internal successors, (2149), 1608 states have internal predecessors, (2149), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) [2022-02-20 19:55:19,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:19,452 INFO L93 Difference]: Finished difference Result 2016 states and 2809 transitions. [2022-02-20 19:55:19,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2809 transitions. [2022-02-20 19:55:19,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:19,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:19,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 1806 states, 1585 states have (on average 1.3558359621451104) internal successors, (2149), 1608 states have internal predecessors, (2149), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) Second operand 2016 states. [2022-02-20 19:55:19,465 INFO L87 Difference]: Start difference. First operand has 1806 states, 1585 states have (on average 1.3558359621451104) internal successors, (2149), 1608 states have internal predecessors, (2149), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) Second operand 2016 states. [2022-02-20 19:55:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:19,637 INFO L93 Difference]: Finished difference Result 2016 states and 2809 transitions. [2022-02-20 19:55:19,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2809 transitions. [2022-02-20 19:55:19,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:19,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:19,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:19,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1585 states have (on average 1.3558359621451104) internal successors, (2149), 1608 states have internal predecessors, (2149), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) [2022-02-20 19:55:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2465 transitions. [2022-02-20 19:55:19,854 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2465 transitions. Word has length 80 [2022-02-20 19:55:19,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:19,854 INFO L470 AbstractCegarLoop]: Abstraction has 1806 states and 2465 transitions. [2022-02-20 19:55:19,854 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 19:55:19,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2465 transitions. [2022-02-20 19:55:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 19:55:19,857 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:19,857 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:55:19,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 19:55:19,857 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:19,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:19,860 INFO L85 PathProgramCache]: Analyzing trace with hash -190765098, now seen corresponding path program 1 times [2022-02-20 19:55:19,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:19,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823716428] [2022-02-20 19:55:19,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:19,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:19,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:19,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {65889#true} assume true; {65889#true} is VALID [2022-02-20 19:55:19,895 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {65889#true} {65891#(not (= ~E_M~0 0))} #855#return; {65891#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:19,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:55:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:19,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {65945#(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); {65946#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:55:19,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {65946#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {65946#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:55:19,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {65946#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T2_E~0); {65946#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:55:19,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {65946#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T3_E~0); {65946#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:55:19,921 INFO L290 TraceCheckUtils]: 4: Hoare triple {65946#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {65947#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:19,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {65947#(= |old(~E_M~0)| 0)} assume !(0 == ~E_1~0); {65947#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:19,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {65947#(= |old(~E_M~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {65947#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:19,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {65947#(= |old(~E_M~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {65947#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:19,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {65947#(= |old(~E_M~0)| 0)} assume true; {65947#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:19,923 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {65947#(= |old(~E_M~0)| 0)} {65891#(not (= ~E_M~0 0))} #857#return; {65890#false} is VALID [2022-02-20 19:55:19,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:19,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {65948#(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~5#1;havoc ~tmp___0~2#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; {65889#true} is VALID [2022-02-20 19:55:19,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {65889#true} assume 1 == ~m_pc~0; {65889#true} is VALID [2022-02-20 19:55:19,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {65889#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {65889#true} is VALID [2022-02-20 19:55:19,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {65889#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {65889#true} is VALID [2022-02-20 19:55:19,942 INFO L290 TraceCheckUtils]: 4: Hoare triple {65889#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~5#1 := #t~ret24#1;havoc #t~ret24#1; {65889#true} is VALID [2022-02-20 19:55:19,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {65889#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {65889#true} is VALID [2022-02-20 19:55:19,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {65889#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; {65889#true} is VALID [2022-02-20 19:55:19,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {65889#true} assume !(1 == ~t1_pc~0); {65889#true} is VALID [2022-02-20 19:55:19,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {65889#true} is_transmit1_triggered_~__retres1~5#1 := 0; {65889#true} is VALID [2022-02-20 19:55:19,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {65889#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {65889#true} is VALID [2022-02-20 19:55:19,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {65889#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~2#1 := #t~ret25#1;havoc #t~ret25#1; {65889#true} is VALID [2022-02-20 19:55:19,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {65889#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {65889#true} is VALID [2022-02-20 19:55:19,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {65889#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; {65889#true} is VALID [2022-02-20 19:55:19,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {65889#true} assume 1 == ~t2_pc~0; {65889#true} is VALID [2022-02-20 19:55:19,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {65889#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {65889#true} is VALID [2022-02-20 19:55:19,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {65889#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {65889#true} is VALID [2022-02-20 19:55:19,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {65889#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {65889#true} is VALID [2022-02-20 19:55:19,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {65889#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {65889#true} is VALID [2022-02-20 19:55:19,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {65889#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; {65889#true} is VALID [2022-02-20 19:55:19,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {65889#true} assume !(1 == ~t3_pc~0); {65889#true} is VALID [2022-02-20 19:55:19,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {65889#true} is_transmit3_triggered_~__retres1~7#1 := 0; {65889#true} is VALID [2022-02-20 19:55:19,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {65889#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {65889#true} is VALID [2022-02-20 19:55:19,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {65889#true} #t~ret27#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___2~0#1 := #t~ret27#1;havoc #t~ret27#1; {65889#true} is VALID [2022-02-20 19:55:19,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {65889#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {65889#true} is VALID [2022-02-20 19:55:19,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {65889#true} assume true; {65889#true} is VALID [2022-02-20 19:55:19,945 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {65889#true} {65890#false} #859#return; {65890#false} is VALID [2022-02-20 19:55:19,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:55:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:19,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {65945#(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); {65889#true} is VALID [2022-02-20 19:55:19,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {65889#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {65889#true} is VALID [2022-02-20 19:55:19,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {65889#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {65889#true} is VALID [2022-02-20 19:55:19,950 INFO L290 TraceCheckUtils]: 3: Hoare triple {65889#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {65889#true} is VALID [2022-02-20 19:55:19,950 INFO L290 TraceCheckUtils]: 4: Hoare triple {65889#true} assume !(1 == ~E_M~0); {65889#true} is VALID [2022-02-20 19:55:19,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {65889#true} assume 1 == ~E_1~0;~E_1~0 := 2; {65889#true} is VALID [2022-02-20 19:55:19,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {65889#true} assume 1 == ~E_2~0;~E_2~0 := 2; {65889#true} is VALID [2022-02-20 19:55:19,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {65889#true} assume 1 == ~E_3~0;~E_3~0 := 2; {65889#true} is VALID [2022-02-20 19:55:19,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {65889#true} assume true; {65889#true} is VALID [2022-02-20 19:55:19,951 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {65889#true} {65890#false} #861#return; {65890#false} is VALID [2022-02-20 19:55:19,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:55:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:19,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {65889#true} havoc ~__retres1~8; {65889#true} is VALID [2022-02-20 19:55:19,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {65889#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {65889#true} is VALID [2022-02-20 19:55:19,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {65889#true} #res := ~__retres1~8; {65889#true} is VALID [2022-02-20 19:55:19,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {65889#true} assume true; {65889#true} is VALID [2022-02-20 19:55:19,970 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {65889#true} {65890#false} #863#return; {65890#false} is VALID [2022-02-20 19:55:19,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {65889#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {65891#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:19,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {65891#(not (= ~E_M~0 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {65891#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:19,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {65891#(not (= ~E_M~0 0))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#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; {65891#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:19,972 INFO L290 TraceCheckUtils]: 3: Hoare triple {65891#(not (= ~E_M~0 0))} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {65891#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:19,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {65891#(not (= ~E_M~0 0))} call update_channels2(); {65889#true} is VALID [2022-02-20 19:55:19,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {65889#true} assume true; {65889#true} is VALID [2022-02-20 19:55:19,973 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {65889#true} {65891#(not (= ~E_M~0 0))} #855#return; {65891#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:19,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {65891#(not (= ~E_M~0 0))} assume { :begin_inline_init_threads2 } true; {65891#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:19,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {65891#(not (= ~E_M~0 0))} assume 1 == ~m_i~0;~m_st~0 := 0; {65891#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:19,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {65891#(not (= ~E_M~0 0))} assume 1 == ~t1_i~0;~t1_st~0 := 0; {65891#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:19,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {65891#(not (= ~E_M~0 0))} assume 1 == ~t2_i~0;~t2_st~0 := 0; {65891#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:19,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {65891#(not (= ~E_M~0 0))} assume 1 == ~t3_i~0;~t3_st~0 := 0; {65891#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:19,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {65891#(not (= ~E_M~0 0))} assume { :end_inline_init_threads2 } true; {65891#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:55:19,976 INFO L272 TraceCheckUtils]: 13: Hoare triple {65891#(not (= ~E_M~0 0))} call fire_delta_events2(); {65945#(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:55:19,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {65945#(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); {65946#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:55:19,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {65946#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {65946#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:55:19,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {65946#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T2_E~0); {65946#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:55:19,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {65946#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T3_E~0); {65946#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:55:19,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {65946#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {65947#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:19,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {65947#(= |old(~E_M~0)| 0)} assume !(0 == ~E_1~0); {65947#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:19,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {65947#(= |old(~E_M~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {65947#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:19,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {65947#(= |old(~E_M~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {65947#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:19,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {65947#(= |old(~E_M~0)| 0)} assume true; {65947#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:55:19,980 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65947#(= |old(~E_M~0)| 0)} {65891#(not (= ~E_M~0 0))} #857#return; {65890#false} is VALID [2022-02-20 19:55:19,980 INFO L272 TraceCheckUtils]: 24: Hoare triple {65890#false} call activate_threads2(); {65948#(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:55:19,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {65948#(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~5#1;havoc ~tmp___0~2#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; {65889#true} is VALID [2022-02-20 19:55:19,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {65889#true} assume 1 == ~m_pc~0; {65889#true} is VALID [2022-02-20 19:55:19,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {65889#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {65889#true} is VALID [2022-02-20 19:55:19,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {65889#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {65889#true} is VALID [2022-02-20 19:55:19,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {65889#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~5#1 := #t~ret24#1;havoc #t~ret24#1; {65889#true} is VALID [2022-02-20 19:55:19,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {65889#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {65889#true} is VALID [2022-02-20 19:55:19,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {65889#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; {65889#true} is VALID [2022-02-20 19:55:19,981 INFO L290 TraceCheckUtils]: 32: Hoare triple {65889#true} assume !(1 == ~t1_pc~0); {65889#true} is VALID [2022-02-20 19:55:19,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {65889#true} is_transmit1_triggered_~__retres1~5#1 := 0; {65889#true} is VALID [2022-02-20 19:55:19,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {65889#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {65889#true} is VALID [2022-02-20 19:55:19,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {65889#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~2#1 := #t~ret25#1;havoc #t~ret25#1; {65889#true} is VALID [2022-02-20 19:55:19,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {65889#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {65889#true} is VALID [2022-02-20 19:55:19,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {65889#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; {65889#true} is VALID [2022-02-20 19:55:19,982 INFO L290 TraceCheckUtils]: 38: Hoare triple {65889#true} assume 1 == ~t2_pc~0; {65889#true} is VALID [2022-02-20 19:55:19,982 INFO L290 TraceCheckUtils]: 39: Hoare triple {65889#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {65889#true} is VALID [2022-02-20 19:55:19,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {65889#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {65889#true} is VALID [2022-02-20 19:55:19,982 INFO L290 TraceCheckUtils]: 41: Hoare triple {65889#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {65889#true} is VALID [2022-02-20 19:55:19,983 INFO L290 TraceCheckUtils]: 42: Hoare triple {65889#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {65889#true} is VALID [2022-02-20 19:55:19,983 INFO L290 TraceCheckUtils]: 43: Hoare triple {65889#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; {65889#true} is VALID [2022-02-20 19:55:19,983 INFO L290 TraceCheckUtils]: 44: Hoare triple {65889#true} assume !(1 == ~t3_pc~0); {65889#true} is VALID [2022-02-20 19:55:19,983 INFO L290 TraceCheckUtils]: 45: Hoare triple {65889#true} is_transmit3_triggered_~__retres1~7#1 := 0; {65889#true} is VALID [2022-02-20 19:55:19,983 INFO L290 TraceCheckUtils]: 46: Hoare triple {65889#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {65889#true} is VALID [2022-02-20 19:55:19,983 INFO L290 TraceCheckUtils]: 47: Hoare triple {65889#true} #t~ret27#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___2~0#1 := #t~ret27#1;havoc #t~ret27#1; {65889#true} is VALID [2022-02-20 19:55:19,984 INFO L290 TraceCheckUtils]: 48: Hoare triple {65889#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {65889#true} is VALID [2022-02-20 19:55:19,984 INFO L290 TraceCheckUtils]: 49: Hoare triple {65889#true} assume true; {65889#true} is VALID [2022-02-20 19:55:19,984 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {65889#true} {65890#false} #859#return; {65890#false} is VALID [2022-02-20 19:55:19,984 INFO L272 TraceCheckUtils]: 51: Hoare triple {65890#false} call reset_delta_events2(); {65945#(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:55:19,984 INFO L290 TraceCheckUtils]: 52: Hoare triple {65945#(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); {65889#true} is VALID [2022-02-20 19:55:19,984 INFO L290 TraceCheckUtils]: 53: Hoare triple {65889#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {65889#true} is VALID [2022-02-20 19:55:19,985 INFO L290 TraceCheckUtils]: 54: Hoare triple {65889#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {65889#true} is VALID [2022-02-20 19:55:19,985 INFO L290 TraceCheckUtils]: 55: Hoare triple {65889#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {65889#true} is VALID [2022-02-20 19:55:19,985 INFO L290 TraceCheckUtils]: 56: Hoare triple {65889#true} assume !(1 == ~E_M~0); {65889#true} is VALID [2022-02-20 19:55:19,985 INFO L290 TraceCheckUtils]: 57: Hoare triple {65889#true} assume 1 == ~E_1~0;~E_1~0 := 2; {65889#true} is VALID [2022-02-20 19:55:19,985 INFO L290 TraceCheckUtils]: 58: Hoare triple {65889#true} assume 1 == ~E_2~0;~E_2~0 := 2; {65889#true} is VALID [2022-02-20 19:55:19,985 INFO L290 TraceCheckUtils]: 59: Hoare triple {65889#true} assume 1 == ~E_3~0;~E_3~0 := 2; {65889#true} is VALID [2022-02-20 19:55:19,985 INFO L290 TraceCheckUtils]: 60: Hoare triple {65889#true} assume true; {65889#true} is VALID [2022-02-20 19:55:19,986 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {65889#true} {65890#false} #861#return; {65890#false} is VALID [2022-02-20 19:55:19,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {65890#false} assume !false; {65890#false} is VALID [2022-02-20 19:55:19,986 INFO L290 TraceCheckUtils]: 63: Hoare triple {65890#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret19#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {65890#false} is VALID [2022-02-20 19:55:19,986 INFO L290 TraceCheckUtils]: 64: Hoare triple {65890#false} assume !false; {65890#false} is VALID [2022-02-20 19:55:19,986 INFO L272 TraceCheckUtils]: 65: Hoare triple {65890#false} call eval2_#t~ret19#1 := exists_runnable_thread2(); {65889#true} is VALID [2022-02-20 19:55:19,986 INFO L290 TraceCheckUtils]: 66: Hoare triple {65889#true} havoc ~__retres1~8; {65889#true} is VALID [2022-02-20 19:55:19,986 INFO L290 TraceCheckUtils]: 67: Hoare triple {65889#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {65889#true} is VALID [2022-02-20 19:55:19,987 INFO L290 TraceCheckUtils]: 68: Hoare triple {65889#true} #res := ~__retres1~8; {65889#true} is VALID [2022-02-20 19:55:19,987 INFO L290 TraceCheckUtils]: 69: Hoare triple {65889#true} assume true; {65889#true} is VALID [2022-02-20 19:55:19,987 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {65889#true} {65890#false} #863#return; {65890#false} is VALID [2022-02-20 19:55:19,987 INFO L290 TraceCheckUtils]: 71: Hoare triple {65890#false} assume -2147483648 <= eval2_#t~ret19#1 && eval2_#t~ret19#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret19#1;havoc eval2_#t~ret19#1; {65890#false} is VALID [2022-02-20 19:55:19,987 INFO L290 TraceCheckUtils]: 72: Hoare triple {65890#false} assume 0 != eval2_~tmp~4#1; {65890#false} is VALID [2022-02-20 19:55:19,987 INFO L290 TraceCheckUtils]: 73: Hoare triple {65890#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet20#1 && eval2_#t~nondet20#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet20#1;havoc eval2_#t~nondet20#1; {65890#false} is VALID [2022-02-20 19:55:19,988 INFO L290 TraceCheckUtils]: 74: Hoare triple {65890#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1, master_#t~nondet18#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet17#1 && master_#t~nondet17#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet17#1;havoc master_#t~nondet17#1; {65890#false} is VALID [2022-02-20 19:55:19,988 INFO L290 TraceCheckUtils]: 75: Hoare triple {65890#false} assume !(0 == ~m_pc~0); {65890#false} is VALID [2022-02-20 19:55:19,988 INFO L290 TraceCheckUtils]: 76: Hoare triple {65890#false} assume 1 == ~m_pc~0; {65890#false} is VALID [2022-02-20 19:55:19,988 INFO L290 TraceCheckUtils]: 77: Hoare triple {65890#false} assume ~token~0 != 3 + ~local~0; {65890#false} is VALID [2022-02-20 19:55:19,988 INFO L272 TraceCheckUtils]: 78: Hoare triple {65890#false} call error2(); {65890#false} is VALID [2022-02-20 19:55:19,988 INFO L290 TraceCheckUtils]: 79: Hoare triple {65890#false} assume !false; {65890#false} is VALID [2022-02-20 19:55:19,989 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:55:19,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:19,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823716428] [2022-02-20 19:55:19,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823716428] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:19,989 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:19,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:55:19,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705233259] [2022-02-20 19:55:19,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:19,990 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 19:55:19,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:19,991 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 19:55:20,040 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:55:20,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:55:20,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:20,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:55:20,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:20,042 INFO L87 Difference]: Start difference. First operand 1806 states and 2465 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 19:55:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:21,989 INFO L93 Difference]: Finished difference Result 2720 states and 3863 transitions. [2022-02-20 19:55:21,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:55:21,994 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 19:55:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:21,994 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 19:55:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 632 transitions. [2022-02-20 19:55:21,998 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 19:55:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 632 transitions. [2022-02-20 19:55:22,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 632 transitions. [2022-02-20 19:55:22,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 632 edges. 632 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:22,630 INFO L225 Difference]: With dead ends: 2720 [2022-02-20 19:55:22,630 INFO L226 Difference]: Without dead ends: 2010 [2022-02-20 19:55:22,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:55:22,633 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 641 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:22,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 763 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:55:22,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2022-02-20 19:55:22,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 1806. [2022-02-20 19:55:22,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:22,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2010 states. Second operand has 1806 states, 1585 states have (on average 1.3526813880126183) internal successors, (2144), 1608 states have internal predecessors, (2144), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) [2022-02-20 19:55:22,889 INFO L74 IsIncluded]: Start isIncluded. First operand 2010 states. Second operand has 1806 states, 1585 states have (on average 1.3526813880126183) internal successors, (2144), 1608 states have internal predecessors, (2144), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) [2022-02-20 19:55:22,890 INFO L87 Difference]: Start difference. First operand 2010 states. Second operand has 1806 states, 1585 states have (on average 1.3526813880126183) internal successors, (2144), 1608 states have internal predecessors, (2144), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) [2022-02-20 19:55:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:23,049 INFO L93 Difference]: Finished difference Result 2010 states and 2788 transitions. [2022-02-20 19:55:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 2788 transitions. [2022-02-20 19:55:23,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:23,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:23,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 1806 states, 1585 states have (on average 1.3526813880126183) internal successors, (2144), 1608 states have internal predecessors, (2144), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) Second operand 2010 states. [2022-02-20 19:55:23,057 INFO L87 Difference]: Start difference. First operand has 1806 states, 1585 states have (on average 1.3526813880126183) internal successors, (2144), 1608 states have internal predecessors, (2144), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) Second operand 2010 states. [2022-02-20 19:55:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:23,217 INFO L93 Difference]: Finished difference Result 2010 states and 2788 transitions. [2022-02-20 19:55:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 2788 transitions. [2022-02-20 19:55:23,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:23,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:23,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:23,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1585 states have (on average 1.3526813880126183) internal successors, (2144), 1608 states have internal predecessors, (2144), 132 states have call successors, (132), 74 states have call predecessors, (132), 87 states have return successors, (184), 127 states have call predecessors, (184), 129 states have call successors, (184) [2022-02-20 19:55:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2460 transitions. [2022-02-20 19:55:23,354 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2460 transitions. Word has length 80 [2022-02-20 19:55:23,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:23,354 INFO L470 AbstractCegarLoop]: Abstraction has 1806 states and 2460 transitions. [2022-02-20 19:55:23,354 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 19:55:23,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2460 transitions. [2022-02-20 19:55:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 19:55:23,357 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:23,357 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:55:23,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 19:55:23,357 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:23,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:23,358 INFO L85 PathProgramCache]: Analyzing trace with hash 488507156, now seen corresponding path program 1 times [2022-02-20 19:55:23,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:23,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065761016] [2022-02-20 19:55:23,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:23,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:23,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:23,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {76077#true} assume true; {76077#true} is VALID [2022-02-20 19:55:23,385 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {76077#true} {76079#(= ~E_2~0 ~M_E~0)} #855#return; {76079#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:23,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:55:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:23,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {76133#(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); {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:23,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:23,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:23,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T3_E~0); {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:23,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:23,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:23,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_2~0;~E_2~0 := 1; {76135#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:23,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {76135#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {76135#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:23,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {76135#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume true; {76135#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:23,415 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {76135#(not (= |old(~E_2~0)| |old(~M_E~0)|))} {76079#(= ~E_2~0 ~M_E~0)} #857#return; {76078#false} is VALID [2022-02-20 19:55:23,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:23,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {76136#(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~5#1;havoc ~tmp___0~2#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; {76077#true} is VALID [2022-02-20 19:55:23,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {76077#true} assume 1 == ~m_pc~0; {76077#true} is VALID [2022-02-20 19:55:23,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {76077#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {76077#true} is VALID [2022-02-20 19:55:23,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {76077#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {76077#true} is VALID [2022-02-20 19:55:23,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {76077#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~5#1 := #t~ret24#1;havoc #t~ret24#1; {76077#true} is VALID [2022-02-20 19:55:23,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {76077#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {76077#true} is VALID [2022-02-20 19:55:23,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {76077#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; {76077#true} is VALID [2022-02-20 19:55:23,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {76077#true} assume !(1 == ~t1_pc~0); {76077#true} is VALID [2022-02-20 19:55:23,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {76077#true} is_transmit1_triggered_~__retres1~5#1 := 0; {76077#true} is VALID [2022-02-20 19:55:23,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {76077#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {76077#true} is VALID [2022-02-20 19:55:23,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {76077#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~2#1 := #t~ret25#1;havoc #t~ret25#1; {76077#true} is VALID [2022-02-20 19:55:23,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {76077#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {76077#true} is VALID [2022-02-20 19:55:23,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {76077#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; {76077#true} is VALID [2022-02-20 19:55:23,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {76077#true} assume 1 == ~t2_pc~0; {76077#true} is VALID [2022-02-20 19:55:23,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {76077#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {76077#true} is VALID [2022-02-20 19:55:23,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {76077#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {76077#true} is VALID [2022-02-20 19:55:23,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {76077#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {76077#true} is VALID [2022-02-20 19:55:23,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {76077#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {76077#true} is VALID [2022-02-20 19:55:23,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {76077#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; {76077#true} is VALID [2022-02-20 19:55:23,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {76077#true} assume !(1 == ~t3_pc~0); {76077#true} is VALID [2022-02-20 19:55:23,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {76077#true} is_transmit3_triggered_~__retres1~7#1 := 0; {76077#true} is VALID [2022-02-20 19:55:23,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {76077#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {76077#true} is VALID [2022-02-20 19:55:23,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {76077#true} #t~ret27#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___2~0#1 := #t~ret27#1;havoc #t~ret27#1; {76077#true} is VALID [2022-02-20 19:55:23,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {76077#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {76077#true} is VALID [2022-02-20 19:55:23,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {76077#true} assume true; {76077#true} is VALID [2022-02-20 19:55:23,436 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {76077#true} {76078#false} #859#return; {76078#false} is VALID [2022-02-20 19:55:23,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:55:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:23,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {76133#(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); {76077#true} is VALID [2022-02-20 19:55:23,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {76077#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {76077#true} is VALID [2022-02-20 19:55:23,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {76077#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {76077#true} is VALID [2022-02-20 19:55:23,441 INFO L290 TraceCheckUtils]: 3: Hoare triple {76077#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {76077#true} is VALID [2022-02-20 19:55:23,441 INFO L290 TraceCheckUtils]: 4: Hoare triple {76077#true} assume !(1 == ~E_M~0); {76077#true} is VALID [2022-02-20 19:55:23,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {76077#true} assume 1 == ~E_1~0;~E_1~0 := 2; {76077#true} is VALID [2022-02-20 19:55:23,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {76077#true} assume 1 == ~E_2~0;~E_2~0 := 2; {76077#true} is VALID [2022-02-20 19:55:23,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {76077#true} assume 1 == ~E_3~0;~E_3~0 := 2; {76077#true} is VALID [2022-02-20 19:55:23,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {76077#true} assume true; {76077#true} is VALID [2022-02-20 19:55:23,442 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {76077#true} {76078#false} #861#return; {76078#false} is VALID [2022-02-20 19:55:23,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:55:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:23,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {76077#true} havoc ~__retres1~8; {76077#true} is VALID [2022-02-20 19:55:23,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {76077#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {76077#true} is VALID [2022-02-20 19:55:23,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {76077#true} #res := ~__retres1~8; {76077#true} is VALID [2022-02-20 19:55:23,445 INFO L290 TraceCheckUtils]: 3: Hoare triple {76077#true} assume true; {76077#true} is VALID [2022-02-20 19:55:23,445 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {76077#true} {76078#false} #863#return; {76078#false} is VALID [2022-02-20 19:55:23,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {76077#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {76079#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:23,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {76079#(= ~E_2~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {76079#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:23,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {76079#(= ~E_2~0 ~M_E~0)} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#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; {76079#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:23,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {76079#(= ~E_2~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {76079#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:23,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {76079#(= ~E_2~0 ~M_E~0)} call update_channels2(); {76077#true} is VALID [2022-02-20 19:55:23,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {76077#true} assume true; {76077#true} is VALID [2022-02-20 19:55:23,448 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {76077#true} {76079#(= ~E_2~0 ~M_E~0)} #855#return; {76079#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:23,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {76079#(= ~E_2~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {76079#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:23,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {76079#(= ~E_2~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {76079#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:23,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {76079#(= ~E_2~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {76079#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:23,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {76079#(= ~E_2~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {76079#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:23,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {76079#(= ~E_2~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {76079#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:23,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {76079#(= ~E_2~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {76079#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 19:55:23,451 INFO L272 TraceCheckUtils]: 13: Hoare triple {76079#(= ~E_2~0 ~M_E~0)} call fire_delta_events2(); {76133#(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:55:23,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {76133#(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); {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:23,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:23,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:23,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T3_E~0); {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:23,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:23,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:23,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {76134#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_2~0;~E_2~0 := 1; {76135#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:23,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {76135#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {76135#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:23,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {76135#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume true; {76135#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:23,455 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {76135#(not (= |old(~E_2~0)| |old(~M_E~0)|))} {76079#(= ~E_2~0 ~M_E~0)} #857#return; {76078#false} is VALID [2022-02-20 19:55:23,455 INFO L272 TraceCheckUtils]: 24: Hoare triple {76078#false} call activate_threads2(); {76136#(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:55:23,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {76136#(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~5#1;havoc ~tmp___0~2#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; {76077#true} is VALID [2022-02-20 19:55:23,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {76077#true} assume 1 == ~m_pc~0; {76077#true} is VALID [2022-02-20 19:55:23,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {76077#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {76077#true} is VALID [2022-02-20 19:55:23,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {76077#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {76077#true} is VALID [2022-02-20 19:55:23,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {76077#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~5#1 := #t~ret24#1;havoc #t~ret24#1; {76077#true} is VALID [2022-02-20 19:55:23,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {76077#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {76077#true} is VALID [2022-02-20 19:55:23,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {76077#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; {76077#true} is VALID [2022-02-20 19:55:23,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {76077#true} assume !(1 == ~t1_pc~0); {76077#true} is VALID [2022-02-20 19:55:23,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {76077#true} is_transmit1_triggered_~__retres1~5#1 := 0; {76077#true} is VALID [2022-02-20 19:55:23,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {76077#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {76077#true} is VALID [2022-02-20 19:55:23,463 INFO L290 TraceCheckUtils]: 35: Hoare triple {76077#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~2#1 := #t~ret25#1;havoc #t~ret25#1; {76077#true} is VALID [2022-02-20 19:55:23,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {76077#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {76077#true} is VALID [2022-02-20 19:55:23,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {76077#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; {76077#true} is VALID [2022-02-20 19:55:23,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {76077#true} assume 1 == ~t2_pc~0; {76077#true} is VALID [2022-02-20 19:55:23,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {76077#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {76077#true} is VALID [2022-02-20 19:55:23,464 INFO L290 TraceCheckUtils]: 40: Hoare triple {76077#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {76077#true} is VALID [2022-02-20 19:55:23,464 INFO L290 TraceCheckUtils]: 41: Hoare triple {76077#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {76077#true} is VALID [2022-02-20 19:55:23,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {76077#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {76077#true} is VALID [2022-02-20 19:55:23,464 INFO L290 TraceCheckUtils]: 43: Hoare triple {76077#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; {76077#true} is VALID [2022-02-20 19:55:23,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {76077#true} assume !(1 == ~t3_pc~0); {76077#true} is VALID [2022-02-20 19:55:23,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {76077#true} is_transmit3_triggered_~__retres1~7#1 := 0; {76077#true} is VALID [2022-02-20 19:55:23,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {76077#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {76077#true} is VALID [2022-02-20 19:55:23,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {76077#true} #t~ret27#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___2~0#1 := #t~ret27#1;havoc #t~ret27#1; {76077#true} is VALID [2022-02-20 19:55:23,465 INFO L290 TraceCheckUtils]: 48: Hoare triple {76077#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {76077#true} is VALID [2022-02-20 19:55:23,465 INFO L290 TraceCheckUtils]: 49: Hoare triple {76077#true} assume true; {76077#true} is VALID [2022-02-20 19:55:23,465 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {76077#true} {76078#false} #859#return; {76078#false} is VALID [2022-02-20 19:55:23,465 INFO L272 TraceCheckUtils]: 51: Hoare triple {76078#false} call reset_delta_events2(); {76133#(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:55:23,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {76133#(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); {76077#true} is VALID [2022-02-20 19:55:23,466 INFO L290 TraceCheckUtils]: 53: Hoare triple {76077#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {76077#true} is VALID [2022-02-20 19:55:23,466 INFO L290 TraceCheckUtils]: 54: Hoare triple {76077#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {76077#true} is VALID [2022-02-20 19:55:23,466 INFO L290 TraceCheckUtils]: 55: Hoare triple {76077#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {76077#true} is VALID [2022-02-20 19:55:23,466 INFO L290 TraceCheckUtils]: 56: Hoare triple {76077#true} assume !(1 == ~E_M~0); {76077#true} is VALID [2022-02-20 19:55:23,466 INFO L290 TraceCheckUtils]: 57: Hoare triple {76077#true} assume 1 == ~E_1~0;~E_1~0 := 2; {76077#true} is VALID [2022-02-20 19:55:23,466 INFO L290 TraceCheckUtils]: 58: Hoare triple {76077#true} assume 1 == ~E_2~0;~E_2~0 := 2; {76077#true} is VALID [2022-02-20 19:55:23,467 INFO L290 TraceCheckUtils]: 59: Hoare triple {76077#true} assume 1 == ~E_3~0;~E_3~0 := 2; {76077#true} is VALID [2022-02-20 19:55:23,467 INFO L290 TraceCheckUtils]: 60: Hoare triple {76077#true} assume true; {76077#true} is VALID [2022-02-20 19:55:23,467 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {76077#true} {76078#false} #861#return; {76078#false} is VALID [2022-02-20 19:55:23,467 INFO L290 TraceCheckUtils]: 62: Hoare triple {76078#false} assume !false; {76078#false} is VALID [2022-02-20 19:55:23,467 INFO L290 TraceCheckUtils]: 63: Hoare triple {76078#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret19#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {76078#false} is VALID [2022-02-20 19:55:23,467 INFO L290 TraceCheckUtils]: 64: Hoare triple {76078#false} assume !false; {76078#false} is VALID [2022-02-20 19:55:23,468 INFO L272 TraceCheckUtils]: 65: Hoare triple {76078#false} call eval2_#t~ret19#1 := exists_runnable_thread2(); {76077#true} is VALID [2022-02-20 19:55:23,468 INFO L290 TraceCheckUtils]: 66: Hoare triple {76077#true} havoc ~__retres1~8; {76077#true} is VALID [2022-02-20 19:55:23,468 INFO L290 TraceCheckUtils]: 67: Hoare triple {76077#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {76077#true} is VALID [2022-02-20 19:55:23,468 INFO L290 TraceCheckUtils]: 68: Hoare triple {76077#true} #res := ~__retres1~8; {76077#true} is VALID [2022-02-20 19:55:23,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {76077#true} assume true; {76077#true} is VALID [2022-02-20 19:55:23,468 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {76077#true} {76078#false} #863#return; {76078#false} is VALID [2022-02-20 19:55:23,468 INFO L290 TraceCheckUtils]: 71: Hoare triple {76078#false} assume -2147483648 <= eval2_#t~ret19#1 && eval2_#t~ret19#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret19#1;havoc eval2_#t~ret19#1; {76078#false} is VALID [2022-02-20 19:55:23,469 INFO L290 TraceCheckUtils]: 72: Hoare triple {76078#false} assume 0 != eval2_~tmp~4#1; {76078#false} is VALID [2022-02-20 19:55:23,469 INFO L290 TraceCheckUtils]: 73: Hoare triple {76078#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet20#1 && eval2_#t~nondet20#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet20#1;havoc eval2_#t~nondet20#1; {76078#false} is VALID [2022-02-20 19:55:23,469 INFO L290 TraceCheckUtils]: 74: Hoare triple {76078#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1, master_#t~nondet18#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet17#1 && master_#t~nondet17#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet17#1;havoc master_#t~nondet17#1; {76078#false} is VALID [2022-02-20 19:55:23,469 INFO L290 TraceCheckUtils]: 75: Hoare triple {76078#false} assume !(0 == ~m_pc~0); {76078#false} is VALID [2022-02-20 19:55:23,469 INFO L290 TraceCheckUtils]: 76: Hoare triple {76078#false} assume 1 == ~m_pc~0; {76078#false} is VALID [2022-02-20 19:55:23,469 INFO L290 TraceCheckUtils]: 77: Hoare triple {76078#false} assume ~token~0 != 3 + ~local~0; {76078#false} is VALID [2022-02-20 19:55:23,470 INFO L272 TraceCheckUtils]: 78: Hoare triple {76078#false} call error2(); {76078#false} is VALID [2022-02-20 19:55:23,470 INFO L290 TraceCheckUtils]: 79: Hoare triple {76078#false} assume !false; {76078#false} is VALID [2022-02-20 19:55:23,470 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:55:23,470 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:23,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065761016] [2022-02-20 19:55:23,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065761016] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:23,471 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:23,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:55:23,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378439958] [2022-02-20 19:55:23,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:23,472 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 19:55:23,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:23,472 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 19:55:23,524 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:55:23,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:55:23,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:23,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:55:23,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:23,525 INFO L87 Difference]: Start difference. First operand 1806 states and 2460 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 19:55:26,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:26,888 INFO L93 Difference]: Finished difference Result 3507 states and 5012 transitions. [2022-02-20 19:55:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:55:26,888 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 19:55:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:26,889 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 19:55:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 950 transitions. [2022-02-20 19:55:26,893 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 19:55:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 950 transitions. [2022-02-20 19:55:26,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 950 transitions. [2022-02-20 19:55:27,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 950 edges. 950 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:27,910 INFO L225 Difference]: With dead ends: 3507 [2022-02-20 19:55:27,910 INFO L226 Difference]: Without dead ends: 2797 [2022-02-20 19:55:27,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:55:27,912 INFO L933 BasicCegarLoop]: 441 mSDtfsCounter, 706 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:27,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [724 Valid, 1451 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:55:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2022-02-20 19:55:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 2362. [2022-02-20 19:55:28,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:28,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2797 states. Second operand has 2362 states, 2069 states have (on average 1.3852102464958918) internal successors, (2866), 2096 states have internal predecessors, (2866), 176 states have call successors, (176), 98 states have call predecessors, (176), 115 states have return successors, (250), 175 states have call predecessors, (250), 173 states have call successors, (250) [2022-02-20 19:55:28,226 INFO L74 IsIncluded]: Start isIncluded. First operand 2797 states. Second operand has 2362 states, 2069 states have (on average 1.3852102464958918) internal successors, (2866), 2096 states have internal predecessors, (2866), 176 states have call successors, (176), 98 states have call predecessors, (176), 115 states have return successors, (250), 175 states have call predecessors, (250), 173 states have call successors, (250) [2022-02-20 19:55:28,229 INFO L87 Difference]: Start difference. First operand 2797 states. Second operand has 2362 states, 2069 states have (on average 1.3852102464958918) internal successors, (2866), 2096 states have internal predecessors, (2866), 176 states have call successors, (176), 98 states have call predecessors, (176), 115 states have return successors, (250), 175 states have call predecessors, (250), 173 states have call successors, (250) [2022-02-20 19:55:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:28,491 INFO L93 Difference]: Finished difference Result 2797 states and 3943 transitions. [2022-02-20 19:55:28,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 3943 transitions. [2022-02-20 19:55:28,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:28,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:28,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 2362 states, 2069 states have (on average 1.3852102464958918) internal successors, (2866), 2096 states have internal predecessors, (2866), 176 states have call successors, (176), 98 states have call predecessors, (176), 115 states have return successors, (250), 175 states have call predecessors, (250), 173 states have call successors, (250) Second operand 2797 states. [2022-02-20 19:55:28,499 INFO L87 Difference]: Start difference. First operand has 2362 states, 2069 states have (on average 1.3852102464958918) internal successors, (2866), 2096 states have internal predecessors, (2866), 176 states have call successors, (176), 98 states have call predecessors, (176), 115 states have return successors, (250), 175 states have call predecessors, (250), 173 states have call successors, (250) Second operand 2797 states. [2022-02-20 19:55:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:28,706 INFO L93 Difference]: Finished difference Result 2797 states and 3943 transitions. [2022-02-20 19:55:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 3943 transitions. [2022-02-20 19:55:28,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:28,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:28,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:28,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2069 states have (on average 1.3852102464958918) internal successors, (2866), 2096 states have internal predecessors, (2866), 176 states have call successors, (176), 98 states have call predecessors, (176), 115 states have return successors, (250), 175 states have call predecessors, (250), 173 states have call successors, (250) [2022-02-20 19:55:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 3292 transitions. [2022-02-20 19:55:28,991 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 3292 transitions. Word has length 80 [2022-02-20 19:55:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:28,991 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 3292 transitions. [2022-02-20 19:55:28,991 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 19:55:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3292 transitions. [2022-02-20 19:55:28,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 19:55:28,995 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:28,995 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:55:28,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 19:55:28,996 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:28,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:28,996 INFO L85 PathProgramCache]: Analyzing trace with hash 690331090, now seen corresponding path program 1 times [2022-02-20 19:55:28,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:28,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804807874] [2022-02-20 19:55:28,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:28,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:29,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:29,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {89588#true} assume true; {89588#true} is VALID [2022-02-20 19:55:29,023 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {89588#true} {89590#(= ~E_3~0 ~M_E~0)} #855#return; {89590#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 19:55:29,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:55:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:29,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {89644#(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); {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:29,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:29,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:29,053 INFO L290 TraceCheckUtils]: 3: Hoare triple {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T3_E~0); {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:29,053 INFO L290 TraceCheckUtils]: 4: Hoare triple {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:29,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:29,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_2~0); {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:29,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_3~0;~E_3~0 := 1; {89646#(not (= |old(~E_3~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:29,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {89646#(not (= |old(~E_3~0)| |old(~M_E~0)|))} assume true; {89646#(not (= |old(~E_3~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:29,055 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {89646#(not (= |old(~E_3~0)| |old(~M_E~0)|))} {89590#(= ~E_3~0 ~M_E~0)} #857#return; {89589#false} is VALID [2022-02-20 19:55:29,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:29,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {89647#(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~5#1;havoc ~tmp___0~2#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; {89588#true} is VALID [2022-02-20 19:55:29,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {89588#true} assume 1 == ~m_pc~0; {89588#true} is VALID [2022-02-20 19:55:29,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {89588#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {89588#true} is VALID [2022-02-20 19:55:29,073 INFO L290 TraceCheckUtils]: 3: Hoare triple {89588#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {89588#true} is VALID [2022-02-20 19:55:29,073 INFO L290 TraceCheckUtils]: 4: Hoare triple {89588#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~5#1 := #t~ret24#1;havoc #t~ret24#1; {89588#true} is VALID [2022-02-20 19:55:29,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {89588#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {89588#true} is VALID [2022-02-20 19:55:29,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {89588#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; {89588#true} is VALID [2022-02-20 19:55:29,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {89588#true} assume !(1 == ~t1_pc~0); {89588#true} is VALID [2022-02-20 19:55:29,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {89588#true} is_transmit1_triggered_~__retres1~5#1 := 0; {89588#true} is VALID [2022-02-20 19:55:29,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {89588#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {89588#true} is VALID [2022-02-20 19:55:29,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {89588#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~2#1 := #t~ret25#1;havoc #t~ret25#1; {89588#true} is VALID [2022-02-20 19:55:29,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {89588#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {89588#true} is VALID [2022-02-20 19:55:29,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {89588#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; {89588#true} is VALID [2022-02-20 19:55:29,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {89588#true} assume 1 == ~t2_pc~0; {89588#true} is VALID [2022-02-20 19:55:29,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {89588#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {89588#true} is VALID [2022-02-20 19:55:29,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {89588#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {89588#true} is VALID [2022-02-20 19:55:29,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {89588#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {89588#true} is VALID [2022-02-20 19:55:29,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {89588#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {89588#true} is VALID [2022-02-20 19:55:29,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {89588#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; {89588#true} is VALID [2022-02-20 19:55:29,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {89588#true} assume !(1 == ~t3_pc~0); {89588#true} is VALID [2022-02-20 19:55:29,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {89588#true} is_transmit3_triggered_~__retres1~7#1 := 0; {89588#true} is VALID [2022-02-20 19:55:29,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {89588#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {89588#true} is VALID [2022-02-20 19:55:29,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {89588#true} #t~ret27#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___2~0#1 := #t~ret27#1;havoc #t~ret27#1; {89588#true} is VALID [2022-02-20 19:55:29,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {89588#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {89588#true} is VALID [2022-02-20 19:55:29,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {89588#true} assume true; {89588#true} is VALID [2022-02-20 19:55:29,076 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {89588#true} {89589#false} #859#return; {89589#false} is VALID [2022-02-20 19:55:29,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:55:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:29,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {89644#(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); {89588#true} is VALID [2022-02-20 19:55:29,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {89588#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {89588#true} is VALID [2022-02-20 19:55:29,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {89588#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {89588#true} is VALID [2022-02-20 19:55:29,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {89588#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {89588#true} is VALID [2022-02-20 19:55:29,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {89588#true} assume !(1 == ~E_M~0); {89588#true} is VALID [2022-02-20 19:55:29,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {89588#true} assume 1 == ~E_1~0;~E_1~0 := 2; {89588#true} is VALID [2022-02-20 19:55:29,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {89588#true} assume 1 == ~E_2~0;~E_2~0 := 2; {89588#true} is VALID [2022-02-20 19:55:29,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {89588#true} assume 1 == ~E_3~0;~E_3~0 := 2; {89588#true} is VALID [2022-02-20 19:55:29,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {89588#true} assume true; {89588#true} is VALID [2022-02-20 19:55:29,082 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {89588#true} {89589#false} #861#return; {89589#false} is VALID [2022-02-20 19:55:29,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:55:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:29,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {89588#true} havoc ~__retres1~8; {89588#true} is VALID [2022-02-20 19:55:29,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {89588#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {89588#true} is VALID [2022-02-20 19:55:29,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {89588#true} #res := ~__retres1~8; {89588#true} is VALID [2022-02-20 19:55:29,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {89588#true} assume true; {89588#true} is VALID [2022-02-20 19:55:29,085 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {89588#true} {89589#false} #863#return; {89589#false} is VALID [2022-02-20 19:55:29,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {89588#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_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;~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; {89590#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 19:55:29,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {89590#(= ~E_3~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1;assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {89590#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 19:55:29,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {89590#(= ~E_3~0 ~M_E~0)} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#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; {89590#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 19:55:29,087 INFO L290 TraceCheckUtils]: 3: Hoare triple {89590#(= ~E_3~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret29#1, start_simulation2_#t~ret30#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {89590#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 19:55:29,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {89590#(= ~E_3~0 ~M_E~0)} call update_channels2(); {89588#true} is VALID [2022-02-20 19:55:29,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {89588#true} assume true; {89588#true} is VALID [2022-02-20 19:55:29,088 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {89588#true} {89590#(= ~E_3~0 ~M_E~0)} #855#return; {89590#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 19:55:29,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {89590#(= ~E_3~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {89590#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 19:55:29,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {89590#(= ~E_3~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {89590#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 19:55:29,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {89590#(= ~E_3~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {89590#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 19:55:29,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {89590#(= ~E_3~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {89590#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 19:55:29,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {89590#(= ~E_3~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {89590#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 19:55:29,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {89590#(= ~E_3~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {89590#(= ~E_3~0 ~M_E~0)} is VALID [2022-02-20 19:55:29,091 INFO L272 TraceCheckUtils]: 13: Hoare triple {89590#(= ~E_3~0 ~M_E~0)} call fire_delta_events2(); {89644#(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:55:29,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {89644#(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); {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:29,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:29,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:29,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T3_E~0); {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:29,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:29,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:29,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_2~0); {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:55:29,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {89645#(and (= ~E_3~0 |old(~E_3~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_3~0;~E_3~0 := 1; {89646#(not (= |old(~E_3~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:29,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {89646#(not (= |old(~E_3~0)| |old(~M_E~0)|))} assume true; {89646#(not (= |old(~E_3~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:29,095 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89646#(not (= |old(~E_3~0)| |old(~M_E~0)|))} {89590#(= ~E_3~0 ~M_E~0)} #857#return; {89589#false} is VALID [2022-02-20 19:55:29,095 INFO L272 TraceCheckUtils]: 24: Hoare triple {89589#false} call activate_threads2(); {89647#(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:55:29,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {89647#(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~5#1;havoc ~tmp___0~2#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; {89588#true} is VALID [2022-02-20 19:55:29,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {89588#true} assume 1 == ~m_pc~0; {89588#true} is VALID [2022-02-20 19:55:29,096 INFO L290 TraceCheckUtils]: 27: Hoare triple {89588#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~4#1 := 1; {89588#true} is VALID [2022-02-20 19:55:29,096 INFO L290 TraceCheckUtils]: 28: Hoare triple {89588#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {89588#true} is VALID [2022-02-20 19:55:29,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {89588#true} #t~ret24#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret24#1 && #t~ret24#1 <= 2147483647;~tmp~5#1 := #t~ret24#1;havoc #t~ret24#1; {89588#true} is VALID [2022-02-20 19:55:29,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {89588#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {89588#true} is VALID [2022-02-20 19:55:29,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {89588#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; {89588#true} is VALID [2022-02-20 19:55:29,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {89588#true} assume !(1 == ~t1_pc~0); {89588#true} is VALID [2022-02-20 19:55:29,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {89588#true} is_transmit1_triggered_~__retres1~5#1 := 0; {89588#true} is VALID [2022-02-20 19:55:29,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {89588#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {89588#true} is VALID [2022-02-20 19:55:29,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {89588#true} #t~ret25#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp___0~2#1 := #t~ret25#1;havoc #t~ret25#1; {89588#true} is VALID [2022-02-20 19:55:29,097 INFO L290 TraceCheckUtils]: 36: Hoare triple {89588#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {89588#true} is VALID [2022-02-20 19:55:29,097 INFO L290 TraceCheckUtils]: 37: Hoare triple {89588#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; {89588#true} is VALID [2022-02-20 19:55:29,097 INFO L290 TraceCheckUtils]: 38: Hoare triple {89588#true} assume 1 == ~t2_pc~0; {89588#true} is VALID [2022-02-20 19:55:29,098 INFO L290 TraceCheckUtils]: 39: Hoare triple {89588#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~6#1 := 1; {89588#true} is VALID [2022-02-20 19:55:29,098 INFO L290 TraceCheckUtils]: 40: Hoare triple {89588#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {89588#true} is VALID [2022-02-20 19:55:29,098 INFO L290 TraceCheckUtils]: 41: Hoare triple {89588#true} #t~ret26#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___1~1#1 := #t~ret26#1;havoc #t~ret26#1; {89588#true} is VALID [2022-02-20 19:55:29,098 INFO L290 TraceCheckUtils]: 42: Hoare triple {89588#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {89588#true} is VALID [2022-02-20 19:55:29,098 INFO L290 TraceCheckUtils]: 43: Hoare triple {89588#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; {89588#true} is VALID [2022-02-20 19:55:29,098 INFO L290 TraceCheckUtils]: 44: Hoare triple {89588#true} assume !(1 == ~t3_pc~0); {89588#true} is VALID [2022-02-20 19:55:29,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {89588#true} is_transmit3_triggered_~__retres1~7#1 := 0; {89588#true} is VALID [2022-02-20 19:55:29,099 INFO L290 TraceCheckUtils]: 46: Hoare triple {89588#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {89588#true} is VALID [2022-02-20 19:55:29,099 INFO L290 TraceCheckUtils]: 47: Hoare triple {89588#true} #t~ret27#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___2~0#1 := #t~ret27#1;havoc #t~ret27#1; {89588#true} is VALID [2022-02-20 19:55:29,099 INFO L290 TraceCheckUtils]: 48: Hoare triple {89588#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {89588#true} is VALID [2022-02-20 19:55:29,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {89588#true} assume true; {89588#true} is VALID [2022-02-20 19:55:29,099 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {89588#true} {89589#false} #859#return; {89589#false} is VALID [2022-02-20 19:55:29,099 INFO L272 TraceCheckUtils]: 51: Hoare triple {89589#false} call reset_delta_events2(); {89644#(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:55:29,100 INFO L290 TraceCheckUtils]: 52: Hoare triple {89644#(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); {89588#true} is VALID [2022-02-20 19:55:29,100 INFO L290 TraceCheckUtils]: 53: Hoare triple {89588#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {89588#true} is VALID [2022-02-20 19:55:29,100 INFO L290 TraceCheckUtils]: 54: Hoare triple {89588#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {89588#true} is VALID [2022-02-20 19:55:29,100 INFO L290 TraceCheckUtils]: 55: Hoare triple {89588#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {89588#true} is VALID [2022-02-20 19:55:29,100 INFO L290 TraceCheckUtils]: 56: Hoare triple {89588#true} assume !(1 == ~E_M~0); {89588#true} is VALID [2022-02-20 19:55:29,100 INFO L290 TraceCheckUtils]: 57: Hoare triple {89588#true} assume 1 == ~E_1~0;~E_1~0 := 2; {89588#true} is VALID [2022-02-20 19:55:29,100 INFO L290 TraceCheckUtils]: 58: Hoare triple {89588#true} assume 1 == ~E_2~0;~E_2~0 := 2; {89588#true} is VALID [2022-02-20 19:55:29,101 INFO L290 TraceCheckUtils]: 59: Hoare triple {89588#true} assume 1 == ~E_3~0;~E_3~0 := 2; {89588#true} is VALID [2022-02-20 19:55:29,101 INFO L290 TraceCheckUtils]: 60: Hoare triple {89588#true} assume true; {89588#true} is VALID [2022-02-20 19:55:29,101 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {89588#true} {89589#false} #861#return; {89589#false} is VALID [2022-02-20 19:55:29,101 INFO L290 TraceCheckUtils]: 62: Hoare triple {89589#false} assume !false; {89589#false} is VALID [2022-02-20 19:55:29,101 INFO L290 TraceCheckUtils]: 63: Hoare triple {89589#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret19#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {89589#false} is VALID [2022-02-20 19:55:29,101 INFO L290 TraceCheckUtils]: 64: Hoare triple {89589#false} assume !false; {89589#false} is VALID [2022-02-20 19:55:29,102 INFO L272 TraceCheckUtils]: 65: Hoare triple {89589#false} call eval2_#t~ret19#1 := exists_runnable_thread2(); {89588#true} is VALID [2022-02-20 19:55:29,102 INFO L290 TraceCheckUtils]: 66: Hoare triple {89588#true} havoc ~__retres1~8; {89588#true} is VALID [2022-02-20 19:55:29,102 INFO L290 TraceCheckUtils]: 67: Hoare triple {89588#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {89588#true} is VALID [2022-02-20 19:55:29,102 INFO L290 TraceCheckUtils]: 68: Hoare triple {89588#true} #res := ~__retres1~8; {89588#true} is VALID [2022-02-20 19:55:29,102 INFO L290 TraceCheckUtils]: 69: Hoare triple {89588#true} assume true; {89588#true} is VALID [2022-02-20 19:55:29,102 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {89588#true} {89589#false} #863#return; {89589#false} is VALID [2022-02-20 19:55:29,102 INFO L290 TraceCheckUtils]: 71: Hoare triple {89589#false} assume -2147483648 <= eval2_#t~ret19#1 && eval2_#t~ret19#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret19#1;havoc eval2_#t~ret19#1; {89589#false} is VALID [2022-02-20 19:55:29,103 INFO L290 TraceCheckUtils]: 72: Hoare triple {89589#false} assume 0 != eval2_~tmp~4#1; {89589#false} is VALID [2022-02-20 19:55:29,103 INFO L290 TraceCheckUtils]: 73: Hoare triple {89589#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet20#1 && eval2_#t~nondet20#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet20#1;havoc eval2_#t~nondet20#1; {89589#false} is VALID [2022-02-20 19:55:29,103 INFO L290 TraceCheckUtils]: 74: Hoare triple {89589#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1, master_#t~nondet18#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet17#1 && master_#t~nondet17#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet17#1;havoc master_#t~nondet17#1; {89589#false} is VALID [2022-02-20 19:55:29,103 INFO L290 TraceCheckUtils]: 75: Hoare triple {89589#false} assume !(0 == ~m_pc~0); {89589#false} is VALID [2022-02-20 19:55:29,103 INFO L290 TraceCheckUtils]: 76: Hoare triple {89589#false} assume 1 == ~m_pc~0; {89589#false} is VALID [2022-02-20 19:55:29,103 INFO L290 TraceCheckUtils]: 77: Hoare triple {89589#false} assume ~token~0 != 3 + ~local~0; {89589#false} is VALID [2022-02-20 19:55:29,103 INFO L272 TraceCheckUtils]: 78: Hoare triple {89589#false} call error2(); {89589#false} is VALID [2022-02-20 19:55:29,104 INFO L290 TraceCheckUtils]: 79: Hoare triple {89589#false} assume !false; {89589#false} is VALID [2022-02-20 19:55:29,104 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:55:29,104 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:29,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804807874] [2022-02-20 19:55:29,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804807874] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:29,105 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:29,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:55:29,106 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912923349] [2022-02-20 19:55:29,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:29,107 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 19:55:29,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:29,108 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 19:55:29,157 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:55:29,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:55:29,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:29,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:55:29,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:29,158 INFO L87 Difference]: Start difference. First operand 2362 states and 3292 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 19:55:33,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:33,267 INFO L93 Difference]: Finished difference Result 5385 states and 7826 transitions. [2022-02-20 19:55:33,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:55:33,267 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 19:55:33,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:33,268 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 19:55:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 928 transitions. [2022-02-20 19:55:33,273 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 19:55:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 928 transitions. [2022-02-20 19:55:33,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 928 transitions. [2022-02-20 19:55:34,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 928 edges. 928 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.