./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.02.cil.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/systemc/transmitter.02.cil.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 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:21:44,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:21:44,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:21:44,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:21:44,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:21:44,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:21:44,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:21:44,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:21:44,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:21:44,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:21:44,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:21:44,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:21:44,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:21:44,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:21:44,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:21:44,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:21:44,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:21:44,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:21:44,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:21:44,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:21:44,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:21:44,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:21:44,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:21:44,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:21:44,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:21:44,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:21:44,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:21:44,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:21:44,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:21:44,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:21:44,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:21:44,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:21:44,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:21:44,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:21:44,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:21:44,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:21:44,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:21:44,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:21:44,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:21:44,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:21:44,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:21:44,580 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:21:44,616 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:21:44,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:21:44,617 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:21:44,617 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:21:44,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:21:44,617 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:21:44,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:21:44,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:21:44,618 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:21:44,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:21:44,619 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:21:44,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:21:44,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:21:44,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:21:44,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:21:44,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:21:44,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:21:44,620 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:21:44,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:21:44,620 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:21:44,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:21:44,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:21:44,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:21:44,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:21:44,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:21:44,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:21:44,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:21:44,621 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:21:44,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:21:44,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:21:44,621 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:21:44,622 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:21:44,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:21:44,622 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 -> 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c [2022-02-20 18:21:44,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:21:44,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:21:44,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:21:44,854 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:21:44,855 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:21:44,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.02.cil.c [2022-02-20 18:21:44,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746b372b6/c34a731d1118474c9217ff81dca92a98/FLAG7e888f648 [2022-02-20 18:21:45,316 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:21:45,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2022-02-20 18:21:45,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746b372b6/c34a731d1118474c9217ff81dca92a98/FLAG7e888f648 [2022-02-20 18:21:45,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746b372b6/c34a731d1118474c9217ff81dca92a98 [2022-02-20 18:21:45,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:21:45,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:21:45,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:21:45,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:21:45,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:21:45,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:21:45" (1/1) ... [2022-02-20 18:21:45,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a92b143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:21:45, skipping insertion in model container [2022-02-20 18:21:45,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:21:45" (1/1) ... [2022-02-20 18:21:45,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:21:45,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:21:45,878 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/systemc/transmitter.02.cil.c[706,719] [2022-02-20 18:21:45,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:21:45,939 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:21:45,946 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/systemc/transmitter.02.cil.c[706,719] [2022-02-20 18:21:45,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:21:46,031 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:21:46,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:21:46 WrapperNode [2022-02-20 18:21:46,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:21:46,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:21:46,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:21:46,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:21:46,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:21:46" (1/1) ... [2022-02-20 18:21:46,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:21:46" (1/1) ... [2022-02-20 18:21:46,124 INFO L137 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 264 [2022-02-20 18:21:46,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:21:46,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:21:46,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:21:46,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:21:46,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:21:46" (1/1) ... [2022-02-20 18:21:46,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:21:46" (1/1) ... [2022-02-20 18:21:46,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:21:46" (1/1) ... [2022-02-20 18:21:46,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:21:46" (1/1) ... [2022-02-20 18:21:46,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:21:46" (1/1) ... [2022-02-20 18:21:46,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:21:46" (1/1) ... [2022-02-20 18:21:46,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:21:46" (1/1) ... [2022-02-20 18:21:46,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:21:46,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:21:46,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:21:46,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:21:46,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:21:46" (1/1) ... [2022-02-20 18:21:46,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:21:46,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:21:46,241 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 18:21:46,263 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 18:21:46,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:21:46,284 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-02-20 18:21:46,284 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-02-20 18:21:46,284 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-02-20 18:21:46,284 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-02-20 18:21:46,285 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 18:21:46,285 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 18:21:46,285 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-02-20 18:21:46,285 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-02-20 18:21:46,285 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-02-20 18:21:46,288 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-02-20 18:21:46,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:21:46,288 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-02-20 18:21:46,288 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-02-20 18:21:46,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:21:46,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:21:46,405 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:21:46,406 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:21:46,803 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:21:46,810 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:21:46,810 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 18:21:46,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:21:46 BoogieIcfgContainer [2022-02-20 18:21:46,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:21:46,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:21:46,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:21:46,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:21:46,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:21:45" (1/3) ... [2022-02-20 18:21:46,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373da5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:21:46, skipping insertion in model container [2022-02-20 18:21:46,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:21:46" (2/3) ... [2022-02-20 18:21:46,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373da5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:21:46, skipping insertion in model container [2022-02-20 18:21:46,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:21:46" (3/3) ... [2022-02-20 18:21:46,825 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2022-02-20 18:21:46,828 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:21:46,829 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:21:46,865 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:21:46,870 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 18:21:46,871 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:21:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 105 states have (on average 1.561904761904762) internal successors, (164), 107 states have internal predecessors, (164), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 18:21:46,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:21:46,908 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:21:46,908 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] [2022-02-20 18:21:46,909 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:21:46,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:21:46,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2055872345, now seen corresponding path program 1 times [2022-02-20 18:21:46,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:21:46,953 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448807580] [2022-02-20 18:21:46,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:21:46,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:21:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:47,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:21:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:47,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {131#true} assume true; {131#true} is VALID [2022-02-20 18:21:47,206 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {131#true} {133#(= ~t2_i~0 1)} #437#return; {133#(= ~t2_i~0 1)} is VALID [2022-02-20 18:21:47,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:21:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:47,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {131#true} is VALID [2022-02-20 18:21:47,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {131#true} is VALID [2022-02-20 18:21:47,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {131#true} is VALID [2022-02-20 18:21:47,263 INFO L290 TraceCheckUtils]: 3: Hoare triple {131#true} assume !(0 == ~E_1~0); {131#true} is VALID [2022-02-20 18:21:47,264 INFO L290 TraceCheckUtils]: 4: Hoare triple {131#true} assume 0 == ~E_2~0;~E_2~0 := 1; {131#true} is VALID [2022-02-20 18:21:47,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {131#true} assume true; {131#true} is VALID [2022-02-20 18:21:47,264 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {131#true} {132#false} #439#return; {132#false} is VALID [2022-02-20 18:21:47,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:21:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:47,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {131#true} is VALID [2022-02-20 18:21:47,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} assume 1 == ~m_pc~0; {131#true} is VALID [2022-02-20 18:21:47,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#true} assume 1 == ~M_E~0;is_master_triggered_~__retres1~0#1 := 1; {131#true} is VALID [2022-02-20 18:21:47,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {131#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {131#true} is VALID [2022-02-20 18:21:47,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {131#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {131#true} is VALID [2022-02-20 18:21:47,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {131#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {131#true} is VALID [2022-02-20 18:21:47,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {131#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {131#true} is VALID [2022-02-20 18:21:47,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {131#true} assume !(1 == ~t1_pc~0); {131#true} is VALID [2022-02-20 18:21:47,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {131#true} is_transmit1_triggered_~__retres1~1#1 := 0; {131#true} is VALID [2022-02-20 18:21:47,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {131#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {131#true} is VALID [2022-02-20 18:21:47,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {131#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {131#true} is VALID [2022-02-20 18:21:47,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {131#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {131#true} is VALID [2022-02-20 18:21:47,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {131#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {131#true} is VALID [2022-02-20 18:21:47,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {131#true} assume 1 == ~t2_pc~0; {131#true} is VALID [2022-02-20 18:21:47,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {131#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {131#true} is VALID [2022-02-20 18:21:47,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {131#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {131#true} is VALID [2022-02-20 18:21:47,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {131#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {131#true} is VALID [2022-02-20 18:21:47,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {131#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {131#true} is VALID [2022-02-20 18:21:47,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {131#true} assume true; {131#true} is VALID [2022-02-20 18:21:47,310 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {131#true} {132#false} #441#return; {132#false} is VALID [2022-02-20 18:21:47,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 18:21:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:47,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {131#true} is VALID [2022-02-20 18:21:47,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {131#true} is VALID [2022-02-20 18:21:47,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {131#true} is VALID [2022-02-20 18:21:47,328 INFO L290 TraceCheckUtils]: 3: Hoare triple {131#true} assume !(1 == ~E_1~0); {131#true} is VALID [2022-02-20 18:21:47,329 INFO L290 TraceCheckUtils]: 4: Hoare triple {131#true} assume 1 == ~E_2~0;~E_2~0 := 2; {131#true} is VALID [2022-02-20 18:21:47,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {131#true} assume true; {131#true} is VALID [2022-02-20 18:21:47,329 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {131#true} {132#false} #443#return; {132#false} is VALID [2022-02-20 18:21:47,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 18:21:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:47,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {131#true} havoc ~__retres1~3; {131#true} is VALID [2022-02-20 18:21:47,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {131#true} is VALID [2022-02-20 18:21:47,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#true} #res := ~__retres1~3; {131#true} is VALID [2022-02-20 18:21:47,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {131#true} assume true; {131#true} is VALID [2022-02-20 18:21:47,341 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {131#true} {132#false} #445#return; {132#false} is VALID [2022-02-20 18:21:47,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {131#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(21, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2; {131#true} is VALID [2022-02-20 18:21:47,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {133#(= ~t2_i~0 1)} is VALID [2022-02-20 18:21:47,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {133#(= ~t2_i~0 1)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {133#(= ~t2_i~0 1)} is VALID [2022-02-20 18:21:47,343 INFO L272 TraceCheckUtils]: 3: Hoare triple {133#(= ~t2_i~0 1)} call update_channels(); {131#true} is VALID [2022-02-20 18:21:47,343 INFO L290 TraceCheckUtils]: 4: Hoare triple {131#true} assume true; {131#true} is VALID [2022-02-20 18:21:47,344 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {131#true} {133#(= ~t2_i~0 1)} #437#return; {133#(= ~t2_i~0 1)} is VALID [2022-02-20 18:21:47,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {133#(= ~t2_i~0 1)} assume { :begin_inline_init_threads } true; {133#(= ~t2_i~0 1)} is VALID [2022-02-20 18:21:47,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#(= ~t2_i~0 1)} assume 1 == ~m_i~0;~m_st~0 := 0; {133#(= ~t2_i~0 1)} is VALID [2022-02-20 18:21:47,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#(= ~t2_i~0 1)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {133#(= ~t2_i~0 1)} is VALID [2022-02-20 18:21:47,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {133#(= ~t2_i~0 1)} assume !(1 == ~t2_i~0);~t2_st~0 := 2; {132#false} is VALID [2022-02-20 18:21:47,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {132#false} assume { :end_inline_init_threads } true; {132#false} is VALID [2022-02-20 18:21:47,348 INFO L272 TraceCheckUtils]: 11: Hoare triple {132#false} call fire_delta_events(); {175#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:21:47,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {175#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {131#true} is VALID [2022-02-20 18:21:47,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {131#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {131#true} is VALID [2022-02-20 18:21:47,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {131#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {131#true} is VALID [2022-02-20 18:21:47,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {131#true} assume !(0 == ~E_1~0); {131#true} is VALID [2022-02-20 18:21:47,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {131#true} assume 0 == ~E_2~0;~E_2~0 := 1; {131#true} is VALID [2022-02-20 18:21:47,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {131#true} assume true; {131#true} is VALID [2022-02-20 18:21:47,354 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {131#true} {132#false} #439#return; {132#false} is VALID [2022-02-20 18:21:47,354 INFO L272 TraceCheckUtils]: 19: Hoare triple {132#false} call activate_threads(); {176#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:21:47,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {176#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {131#true} is VALID [2022-02-20 18:21:47,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {131#true} assume 1 == ~m_pc~0; {131#true} is VALID [2022-02-20 18:21:47,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {131#true} assume 1 == ~M_E~0;is_master_triggered_~__retres1~0#1 := 1; {131#true} is VALID [2022-02-20 18:21:47,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {131#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {131#true} is VALID [2022-02-20 18:21:47,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {131#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {131#true} is VALID [2022-02-20 18:21:47,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {131#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {131#true} is VALID [2022-02-20 18:21:47,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {131#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {131#true} is VALID [2022-02-20 18:21:47,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {131#true} assume !(1 == ~t1_pc~0); {131#true} is VALID [2022-02-20 18:21:47,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {131#true} is_transmit1_triggered_~__retres1~1#1 := 0; {131#true} is VALID [2022-02-20 18:21:47,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {131#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {131#true} is VALID [2022-02-20 18:21:47,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {131#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {131#true} is VALID [2022-02-20 18:21:47,361 INFO L290 TraceCheckUtils]: 31: Hoare triple {131#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {131#true} is VALID [2022-02-20 18:21:47,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {131#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {131#true} is VALID [2022-02-20 18:21:47,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {131#true} assume 1 == ~t2_pc~0; {131#true} is VALID [2022-02-20 18:21:47,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {131#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {131#true} is VALID [2022-02-20 18:21:47,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {131#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {131#true} is VALID [2022-02-20 18:21:47,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {131#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {131#true} is VALID [2022-02-20 18:21:47,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {131#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {131#true} is VALID [2022-02-20 18:21:47,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {131#true} assume true; {131#true} is VALID [2022-02-20 18:21:47,363 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {131#true} {132#false} #441#return; {132#false} is VALID [2022-02-20 18:21:47,363 INFO L272 TraceCheckUtils]: 40: Hoare triple {132#false} call reset_delta_events(); {175#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:21:47,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {175#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {131#true} is VALID [2022-02-20 18:21:47,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {131#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {131#true} is VALID [2022-02-20 18:21:47,363 INFO L290 TraceCheckUtils]: 43: Hoare triple {131#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {131#true} is VALID [2022-02-20 18:21:47,364 INFO L290 TraceCheckUtils]: 44: Hoare triple {131#true} assume !(1 == ~E_1~0); {131#true} is VALID [2022-02-20 18:21:47,364 INFO L290 TraceCheckUtils]: 45: Hoare triple {131#true} assume 1 == ~E_2~0;~E_2~0 := 2; {131#true} is VALID [2022-02-20 18:21:47,364 INFO L290 TraceCheckUtils]: 46: Hoare triple {131#true} assume true; {131#true} is VALID [2022-02-20 18:21:47,364 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {131#true} {132#false} #443#return; {132#false} is VALID [2022-02-20 18:21:47,365 INFO L290 TraceCheckUtils]: 48: Hoare triple {132#false} assume !false; {132#false} is VALID [2022-02-20 18:21:47,365 INFO L290 TraceCheckUtils]: 49: Hoare triple {132#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {132#false} is VALID [2022-02-20 18:21:47,365 INFO L290 TraceCheckUtils]: 50: Hoare triple {132#false} assume !false; {132#false} is VALID [2022-02-20 18:21:47,365 INFO L272 TraceCheckUtils]: 51: Hoare triple {132#false} call eval_#t~ret4#1 := exists_runnable_thread(); {131#true} is VALID [2022-02-20 18:21:47,365 INFO L290 TraceCheckUtils]: 52: Hoare triple {131#true} havoc ~__retres1~3; {131#true} is VALID [2022-02-20 18:21:47,365 INFO L290 TraceCheckUtils]: 53: Hoare triple {131#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {131#true} is VALID [2022-02-20 18:21:47,366 INFO L290 TraceCheckUtils]: 54: Hoare triple {131#true} #res := ~__retres1~3; {131#true} is VALID [2022-02-20 18:21:47,366 INFO L290 TraceCheckUtils]: 55: Hoare triple {131#true} assume true; {131#true} is VALID [2022-02-20 18:21:47,366 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {131#true} {132#false} #445#return; {132#false} is VALID [2022-02-20 18:21:47,366 INFO L290 TraceCheckUtils]: 57: Hoare triple {132#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {132#false} is VALID [2022-02-20 18:21:47,366 INFO L290 TraceCheckUtils]: 58: Hoare triple {132#false} assume 0 != eval_~tmp~0#1; {132#false} is VALID [2022-02-20 18:21:47,367 INFO L290 TraceCheckUtils]: 59: Hoare triple {132#false} assume !(0 == ~m_st~0); {132#false} is VALID [2022-02-20 18:21:47,367 INFO L290 TraceCheckUtils]: 60: Hoare triple {132#false} assume !(0 == ~t1_st~0); {132#false} is VALID [2022-02-20 18:21:47,368 INFO L290 TraceCheckUtils]: 61: Hoare triple {132#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {132#false} is VALID [2022-02-20 18:21:47,369 INFO L290 TraceCheckUtils]: 62: Hoare triple {132#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {132#false} is VALID [2022-02-20 18:21:47,369 INFO L290 TraceCheckUtils]: 63: Hoare triple {132#false} assume !(0 == ~t2_pc~0); {132#false} is VALID [2022-02-20 18:21:47,369 INFO L290 TraceCheckUtils]: 64: Hoare triple {132#false} assume 1 == ~t2_pc~0; {132#false} is VALID [2022-02-20 18:21:47,369 INFO L290 TraceCheckUtils]: 65: Hoare triple {132#false} assume { :begin_inline_error } true; {132#false} is VALID [2022-02-20 18:21:47,369 INFO L290 TraceCheckUtils]: 66: Hoare triple {132#false} assume !false; {132#false} is VALID [2022-02-20 18:21:47,370 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 18:21:47,370 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:21:47,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448807580] [2022-02-20 18:21:47,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448807580] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:21:47,371 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:21:47,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:21:47,372 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607317746] [2022-02-20 18:21:47,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:21:47,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-02-20 18:21:47,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:21:47,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:47,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:21:47,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:21:47,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:21:47,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:21:47,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:21:47,468 INFO L87 Difference]: Start difference. First operand has 128 states, 105 states have (on average 1.561904761904762) internal successors, (164), 107 states have internal predecessors, (164), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:48,245 INFO L93 Difference]: Finished difference Result 277 states and 425 transitions. [2022-02-20 18:21:48,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:21:48,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-02-20 18:21:48,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:21:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 425 transitions. [2022-02-20 18:21:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 425 transitions. [2022-02-20 18:21:48,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 425 transitions. [2022-02-20 18:21:48,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:21:48,596 INFO L225 Difference]: With dead ends: 277 [2022-02-20 18:21:48,597 INFO L226 Difference]: Without dead ends: 153 [2022-02-20 18:21:48,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:21:48,601 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 268 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:21:48,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 325 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:21:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-02-20 18:21:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2022-02-20 18:21:48,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:21:48,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 123 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 18:21:48,633 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 123 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 18:21:48,633 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 123 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 18:21:48,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:48,643 INFO L93 Difference]: Finished difference Result 153 states and 225 transitions. [2022-02-20 18:21:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 225 transitions. [2022-02-20 18:21:48,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:21:48,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:21:48,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 153 states. [2022-02-20 18:21:48,646 INFO L87 Difference]: Start difference. First operand has 123 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 153 states. [2022-02-20 18:21:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:48,653 INFO L93 Difference]: Finished difference Result 153 states and 225 transitions. [2022-02-20 18:21:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 225 transitions. [2022-02-20 18:21:48,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:21:48,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:21:48,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:21:48,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:21:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 18:21:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2022-02-20 18:21:48,660 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 67 [2022-02-20 18:21:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:21:48,660 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2022-02-20 18:21:48,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2022-02-20 18:21:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:21:48,662 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:21:48,663 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] [2022-02-20 18:21:48,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:21:48,663 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:21:48,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:21:48,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1622143259, now seen corresponding path program 1 times [2022-02-20 18:21:48,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:21:48,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779657412] [2022-02-20 18:21:48,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:21:48,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:21:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:48,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:21:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:48,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {1036#true} assume true; {1036#true} is VALID [2022-02-20 18:21:48,710 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {1036#true} {1038#(= ~M_E~0 2)} #437#return; {1038#(= ~M_E~0 2)} is VALID [2022-02-20 18:21:48,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:21:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:48,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {1080#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {1081#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 18:21:48,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {1081#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {1081#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 18:21:48,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {1081#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {1081#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 18:21:48,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {1081#(= |old(~M_E~0)| 0)} assume !(0 == ~E_1~0); {1081#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 18:21:48,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {1081#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {1081#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 18:21:48,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {1081#(= |old(~M_E~0)| 0)} assume true; {1081#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 18:21:48,735 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1081#(= |old(~M_E~0)| 0)} {1038#(= ~M_E~0 2)} #439#return; {1037#false} is VALID [2022-02-20 18:21:48,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:21:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:48,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {1082#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {1036#true} is VALID [2022-02-20 18:21:48,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {1036#true} assume 1 == ~m_pc~0; {1036#true} is VALID [2022-02-20 18:21:48,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {1036#true} assume 1 == ~M_E~0;is_master_triggered_~__retres1~0#1 := 1; {1036#true} is VALID [2022-02-20 18:21:48,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {1036#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {1036#true} is VALID [2022-02-20 18:21:48,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {1036#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {1036#true} is VALID [2022-02-20 18:21:48,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {1036#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {1036#true} is VALID [2022-02-20 18:21:48,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {1036#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {1036#true} is VALID [2022-02-20 18:21:48,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {1036#true} assume !(1 == ~t1_pc~0); {1036#true} is VALID [2022-02-20 18:21:48,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {1036#true} is_transmit1_triggered_~__retres1~1#1 := 0; {1036#true} is VALID [2022-02-20 18:21:48,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {1036#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {1036#true} is VALID [2022-02-20 18:21:48,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {1036#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {1036#true} is VALID [2022-02-20 18:21:48,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {1036#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {1036#true} is VALID [2022-02-20 18:21:48,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {1036#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {1036#true} is VALID [2022-02-20 18:21:48,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {1036#true} assume 1 == ~t2_pc~0; {1036#true} is VALID [2022-02-20 18:21:48,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {1036#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {1036#true} is VALID [2022-02-20 18:21:48,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {1036#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {1036#true} is VALID [2022-02-20 18:21:48,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {1036#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {1036#true} is VALID [2022-02-20 18:21:48,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {1036#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {1036#true} is VALID [2022-02-20 18:21:48,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {1036#true} assume true; {1036#true} is VALID [2022-02-20 18:21:48,755 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1036#true} {1037#false} #441#return; {1037#false} is VALID [2022-02-20 18:21:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 18:21:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:48,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {1080#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {1036#true} is VALID [2022-02-20 18:21:48,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {1036#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {1036#true} is VALID [2022-02-20 18:21:48,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {1036#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {1036#true} is VALID [2022-02-20 18:21:48,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {1036#true} assume !(1 == ~E_1~0); {1036#true} is VALID [2022-02-20 18:21:48,761 INFO L290 TraceCheckUtils]: 4: Hoare triple {1036#true} assume 1 == ~E_2~0;~E_2~0 := 2; {1036#true} is VALID [2022-02-20 18:21:48,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {1036#true} assume true; {1036#true} is VALID [2022-02-20 18:21:48,761 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1036#true} {1037#false} #443#return; {1037#false} is VALID [2022-02-20 18:21:48,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 18:21:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:48,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {1036#true} havoc ~__retres1~3; {1036#true} is VALID [2022-02-20 18:21:48,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {1036#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {1036#true} is VALID [2022-02-20 18:21:48,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {1036#true} #res := ~__retres1~3; {1036#true} is VALID [2022-02-20 18:21:48,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {1036#true} assume true; {1036#true} is VALID [2022-02-20 18:21:48,765 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1036#true} {1037#false} #445#return; {1037#false} is VALID [2022-02-20 18:21:48,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {1036#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(21, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2; {1038#(= ~M_E~0 2)} is VALID [2022-02-20 18:21:48,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {1038#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {1038#(= ~M_E~0 2)} is VALID [2022-02-20 18:21:48,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {1038#(= ~M_E~0 2)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {1038#(= ~M_E~0 2)} is VALID [2022-02-20 18:21:48,767 INFO L272 TraceCheckUtils]: 3: Hoare triple {1038#(= ~M_E~0 2)} call update_channels(); {1036#true} is VALID [2022-02-20 18:21:48,767 INFO L290 TraceCheckUtils]: 4: Hoare triple {1036#true} assume true; {1036#true} is VALID [2022-02-20 18:21:48,767 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1036#true} {1038#(= ~M_E~0 2)} #437#return; {1038#(= ~M_E~0 2)} is VALID [2022-02-20 18:21:48,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {1038#(= ~M_E~0 2)} assume { :begin_inline_init_threads } true; {1038#(= ~M_E~0 2)} is VALID [2022-02-20 18:21:48,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {1038#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {1038#(= ~M_E~0 2)} is VALID [2022-02-20 18:21:48,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {1038#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {1038#(= ~M_E~0 2)} is VALID [2022-02-20 18:21:48,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {1038#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {1038#(= ~M_E~0 2)} is VALID [2022-02-20 18:21:48,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {1038#(= ~M_E~0 2)} assume { :end_inline_init_threads } true; {1038#(= ~M_E~0 2)} is VALID [2022-02-20 18:21:48,770 INFO L272 TraceCheckUtils]: 11: Hoare triple {1038#(= ~M_E~0 2)} call fire_delta_events(); {1080#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:21:48,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {1080#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {1081#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 18:21:48,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {1081#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {1081#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 18:21:48,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {1081#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {1081#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 18:21:48,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {1081#(= |old(~M_E~0)| 0)} assume !(0 == ~E_1~0); {1081#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 18:21:48,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {1081#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {1081#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 18:21:48,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {1081#(= |old(~M_E~0)| 0)} assume true; {1081#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 18:21:48,772 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1081#(= |old(~M_E~0)| 0)} {1038#(= ~M_E~0 2)} #439#return; {1037#false} is VALID [2022-02-20 18:21:48,772 INFO L272 TraceCheckUtils]: 19: Hoare triple {1037#false} call activate_threads(); {1082#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:21:48,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {1082#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {1036#true} is VALID [2022-02-20 18:21:48,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {1036#true} assume 1 == ~m_pc~0; {1036#true} is VALID [2022-02-20 18:21:48,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {1036#true} assume 1 == ~M_E~0;is_master_triggered_~__retres1~0#1 := 1; {1036#true} is VALID [2022-02-20 18:21:48,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {1036#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {1036#true} is VALID [2022-02-20 18:21:48,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {1036#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {1036#true} is VALID [2022-02-20 18:21:48,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {1036#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {1036#true} is VALID [2022-02-20 18:21:48,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {1036#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {1036#true} is VALID [2022-02-20 18:21:48,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {1036#true} assume !(1 == ~t1_pc~0); {1036#true} is VALID [2022-02-20 18:21:48,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {1036#true} is_transmit1_triggered_~__retres1~1#1 := 0; {1036#true} is VALID [2022-02-20 18:21:48,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {1036#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {1036#true} is VALID [2022-02-20 18:21:48,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {1036#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {1036#true} is VALID [2022-02-20 18:21:48,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {1036#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {1036#true} is VALID [2022-02-20 18:21:48,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {1036#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {1036#true} is VALID [2022-02-20 18:21:48,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {1036#true} assume 1 == ~t2_pc~0; {1036#true} is VALID [2022-02-20 18:21:48,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {1036#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {1036#true} is VALID [2022-02-20 18:21:48,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {1036#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {1036#true} is VALID [2022-02-20 18:21:48,775 INFO L290 TraceCheckUtils]: 36: Hoare triple {1036#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {1036#true} is VALID [2022-02-20 18:21:48,775 INFO L290 TraceCheckUtils]: 37: Hoare triple {1036#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {1036#true} is VALID [2022-02-20 18:21:48,776 INFO L290 TraceCheckUtils]: 38: Hoare triple {1036#true} assume true; {1036#true} is VALID [2022-02-20 18:21:48,776 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1036#true} {1037#false} #441#return; {1037#false} is VALID [2022-02-20 18:21:48,776 INFO L272 TraceCheckUtils]: 40: Hoare triple {1037#false} call reset_delta_events(); {1080#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:21:48,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {1080#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {1036#true} is VALID [2022-02-20 18:21:48,776 INFO L290 TraceCheckUtils]: 42: Hoare triple {1036#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {1036#true} is VALID [2022-02-20 18:21:48,776 INFO L290 TraceCheckUtils]: 43: Hoare triple {1036#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {1036#true} is VALID [2022-02-20 18:21:48,776 INFO L290 TraceCheckUtils]: 44: Hoare triple {1036#true} assume !(1 == ~E_1~0); {1036#true} is VALID [2022-02-20 18:21:48,777 INFO L290 TraceCheckUtils]: 45: Hoare triple {1036#true} assume 1 == ~E_2~0;~E_2~0 := 2; {1036#true} is VALID [2022-02-20 18:21:48,777 INFO L290 TraceCheckUtils]: 46: Hoare triple {1036#true} assume true; {1036#true} is VALID [2022-02-20 18:21:48,777 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {1036#true} {1037#false} #443#return; {1037#false} is VALID [2022-02-20 18:21:48,777 INFO L290 TraceCheckUtils]: 48: Hoare triple {1037#false} assume !false; {1037#false} is VALID [2022-02-20 18:21:48,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {1037#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {1037#false} is VALID [2022-02-20 18:21:48,777 INFO L290 TraceCheckUtils]: 50: Hoare triple {1037#false} assume !false; {1037#false} is VALID [2022-02-20 18:21:48,778 INFO L272 TraceCheckUtils]: 51: Hoare triple {1037#false} call eval_#t~ret4#1 := exists_runnable_thread(); {1036#true} is VALID [2022-02-20 18:21:48,778 INFO L290 TraceCheckUtils]: 52: Hoare triple {1036#true} havoc ~__retres1~3; {1036#true} is VALID [2022-02-20 18:21:48,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {1036#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {1036#true} is VALID [2022-02-20 18:21:48,778 INFO L290 TraceCheckUtils]: 54: Hoare triple {1036#true} #res := ~__retres1~3; {1036#true} is VALID [2022-02-20 18:21:48,778 INFO L290 TraceCheckUtils]: 55: Hoare triple {1036#true} assume true; {1036#true} is VALID [2022-02-20 18:21:48,778 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {1036#true} {1037#false} #445#return; {1037#false} is VALID [2022-02-20 18:21:48,778 INFO L290 TraceCheckUtils]: 57: Hoare triple {1037#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {1037#false} is VALID [2022-02-20 18:21:48,779 INFO L290 TraceCheckUtils]: 58: Hoare triple {1037#false} assume 0 != eval_~tmp~0#1; {1037#false} is VALID [2022-02-20 18:21:48,779 INFO L290 TraceCheckUtils]: 59: Hoare triple {1037#false} assume !(0 == ~m_st~0); {1037#false} is VALID [2022-02-20 18:21:48,779 INFO L290 TraceCheckUtils]: 60: Hoare triple {1037#false} assume !(0 == ~t1_st~0); {1037#false} is VALID [2022-02-20 18:21:48,779 INFO L290 TraceCheckUtils]: 61: Hoare triple {1037#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {1037#false} is VALID [2022-02-20 18:21:48,779 INFO L290 TraceCheckUtils]: 62: Hoare triple {1037#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {1037#false} is VALID [2022-02-20 18:21:48,779 INFO L290 TraceCheckUtils]: 63: Hoare triple {1037#false} assume !(0 == ~t2_pc~0); {1037#false} is VALID [2022-02-20 18:21:48,780 INFO L290 TraceCheckUtils]: 64: Hoare triple {1037#false} assume 1 == ~t2_pc~0; {1037#false} is VALID [2022-02-20 18:21:48,780 INFO L290 TraceCheckUtils]: 65: Hoare triple {1037#false} assume { :begin_inline_error } true; {1037#false} is VALID [2022-02-20 18:21:48,780 INFO L290 TraceCheckUtils]: 66: Hoare triple {1037#false} assume !false; {1037#false} is VALID [2022-02-20 18:21:48,780 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 18:21:48,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:21:48,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779657412] [2022-02-20 18:21:48,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779657412] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:21:48,781 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:21:48,781 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:21:48,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72487691] [2022-02-20 18:21:48,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:21:48,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-02-20 18:21:48,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:21:48,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:48,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:21:48,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:21:48,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:21:48,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:21:48,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:21:48,821 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:50,045 INFO L93 Difference]: Finished difference Result 406 states and 597 transitions. [2022-02-20 18:21:50,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:21:50,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-02-20 18:21:50,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:21:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 597 transitions. [2022-02-20 18:21:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 597 transitions. [2022-02-20 18:21:50,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 597 transitions. [2022-02-20 18:21:50,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:21:50,494 INFO L225 Difference]: With dead ends: 406 [2022-02-20 18:21:50,494 INFO L226 Difference]: Without dead ends: 293 [2022-02-20 18:21:50,495 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 18:21:50,496 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 377 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:21:50,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 501 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:21:50,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-02-20 18:21:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 233. [2022-02-20 18:21:50,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:21:50,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 293 states. Second operand has 233 states, 194 states have (on average 1.443298969072165) internal successors, (280), 196 states have internal predecessors, (280), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-02-20 18:21:50,513 INFO L74 IsIncluded]: Start isIncluded. First operand 293 states. Second operand has 233 states, 194 states have (on average 1.443298969072165) internal successors, (280), 196 states have internal predecessors, (280), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-02-20 18:21:50,514 INFO L87 Difference]: Start difference. First operand 293 states. Second operand has 233 states, 194 states have (on average 1.443298969072165) internal successors, (280), 196 states have internal predecessors, (280), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-02-20 18:21:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:50,524 INFO L93 Difference]: Finished difference Result 293 states and 424 transitions. [2022-02-20 18:21:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 424 transitions. [2022-02-20 18:21:50,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:21:50,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:21:50,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 194 states have (on average 1.443298969072165) internal successors, (280), 196 states have internal predecessors, (280), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) Second operand 293 states. [2022-02-20 18:21:50,526 INFO L87 Difference]: Start difference. First operand has 233 states, 194 states have (on average 1.443298969072165) internal successors, (280), 196 states have internal predecessors, (280), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) Second operand 293 states. [2022-02-20 18:21:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:50,536 INFO L93 Difference]: Finished difference Result 293 states and 424 transitions. [2022-02-20 18:21:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 424 transitions. [2022-02-20 18:21:50,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:21:50,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:21:50,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:21:50,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:21:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.443298969072165) internal successors, (280), 196 states have internal predecessors, (280), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-02-20 18:21:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 333 transitions. [2022-02-20 18:21:50,546 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 333 transitions. Word has length 67 [2022-02-20 18:21:50,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:21:50,546 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 333 transitions. [2022-02-20 18:21:50,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 333 transitions. [2022-02-20 18:21:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:21:50,548 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:21:50,548 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] [2022-02-20 18:21:50,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:21:50,548 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:21:50,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:21:50,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1762963514, now seen corresponding path program 1 times [2022-02-20 18:21:50,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:21:50,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34323246] [2022-02-20 18:21:50,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:21:50,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:21:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:50,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:21:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:50,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-02-20 18:21:50,608 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {2536#true} {2538#(not (= ~T1_E~0 0))} #437#return; {2538#(not (= ~T1_E~0 0))} is VALID [2022-02-20 18:21:50,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:21:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:50,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {2580#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {2581#(= |old(~T1_E~0)| ~T1_E~0)} is VALID [2022-02-20 18:21:50,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {2581#(= |old(~T1_E~0)| ~T1_E~0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2582#(= |old(~T1_E~0)| 0)} is VALID [2022-02-20 18:21:50,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {2582#(= |old(~T1_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {2582#(= |old(~T1_E~0)| 0)} is VALID [2022-02-20 18:21:50,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {2582#(= |old(~T1_E~0)| 0)} assume !(0 == ~E_1~0); {2582#(= |old(~T1_E~0)| 0)} is VALID [2022-02-20 18:21:50,659 INFO L290 TraceCheckUtils]: 4: Hoare triple {2582#(= |old(~T1_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {2582#(= |old(~T1_E~0)| 0)} is VALID [2022-02-20 18:21:50,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {2582#(= |old(~T1_E~0)| 0)} assume true; {2582#(= |old(~T1_E~0)| 0)} is VALID [2022-02-20 18:21:50,660 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2582#(= |old(~T1_E~0)| 0)} {2538#(not (= ~T1_E~0 0))} #439#return; {2537#false} is VALID [2022-02-20 18:21:50,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:21:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:50,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {2583#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {2536#true} is VALID [2022-02-20 18:21:50,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {2536#true} assume !(1 == ~m_pc~0); {2536#true} is VALID [2022-02-20 18:21:50,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} is_master_triggered_~__retres1~0#1 := 0; {2536#true} is VALID [2022-02-20 18:21:50,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {2536#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2536#true} is VALID [2022-02-20 18:21:50,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {2536#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {2536#true} is VALID [2022-02-20 18:21:50,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {2536#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2536#true} is VALID [2022-02-20 18:21:50,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {2536#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {2536#true} is VALID [2022-02-20 18:21:50,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {2536#true} assume !(1 == ~t1_pc~0); {2536#true} is VALID [2022-02-20 18:21:50,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2536#true} is VALID [2022-02-20 18:21:50,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2536#true} is VALID [2022-02-20 18:21:50,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {2536#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {2536#true} is VALID [2022-02-20 18:21:50,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {2536#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2536#true} is VALID [2022-02-20 18:21:50,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {2536#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {2536#true} is VALID [2022-02-20 18:21:50,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {2536#true} assume 1 == ~t2_pc~0; {2536#true} is VALID [2022-02-20 18:21:50,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {2536#true} is VALID [2022-02-20 18:21:50,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {2536#true} is VALID [2022-02-20 18:21:50,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {2536#true} is VALID [2022-02-20 18:21:50,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {2536#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {2536#true} is VALID [2022-02-20 18:21:50,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-02-20 18:21:50,693 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2536#true} {2537#false} #441#return; {2537#false} is VALID [2022-02-20 18:21:50,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 18:21:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:50,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {2580#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {2536#true} is VALID [2022-02-20 18:21:50,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {2536#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2536#true} is VALID [2022-02-20 18:21:50,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {2536#true} is VALID [2022-02-20 18:21:50,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {2536#true} assume !(1 == ~E_1~0); {2536#true} is VALID [2022-02-20 18:21:50,711 INFO L290 TraceCheckUtils]: 4: Hoare triple {2536#true} assume 1 == ~E_2~0;~E_2~0 := 2; {2536#true} is VALID [2022-02-20 18:21:50,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-02-20 18:21:50,712 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2536#true} {2537#false} #443#return; {2537#false} is VALID [2022-02-20 18:21:50,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 18:21:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:50,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {2536#true} havoc ~__retres1~3; {2536#true} is VALID [2022-02-20 18:21:50,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {2536#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {2536#true} is VALID [2022-02-20 18:21:50,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} #res := ~__retres1~3; {2536#true} is VALID [2022-02-20 18:21:50,718 INFO L290 TraceCheckUtils]: 3: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-02-20 18:21:50,718 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2536#true} {2537#false} #445#return; {2537#false} is VALID [2022-02-20 18:21:50,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {2536#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(21, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2; {2538#(not (= ~T1_E~0 0))} is VALID [2022-02-20 18:21:50,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {2538#(not (= ~T1_E~0 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {2538#(not (= ~T1_E~0 0))} is VALID [2022-02-20 18:21:50,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {2538#(not (= ~T1_E~0 0))} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {2538#(not (= ~T1_E~0 0))} is VALID [2022-02-20 18:21:50,720 INFO L272 TraceCheckUtils]: 3: Hoare triple {2538#(not (= ~T1_E~0 0))} call update_channels(); {2536#true} is VALID [2022-02-20 18:21:50,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-02-20 18:21:50,721 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2536#true} {2538#(not (= ~T1_E~0 0))} #437#return; {2538#(not (= ~T1_E~0 0))} is VALID [2022-02-20 18:21:50,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {2538#(not (= ~T1_E~0 0))} assume { :begin_inline_init_threads } true; {2538#(not (= ~T1_E~0 0))} is VALID [2022-02-20 18:21:50,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {2538#(not (= ~T1_E~0 0))} assume 1 == ~m_i~0;~m_st~0 := 0; {2538#(not (= ~T1_E~0 0))} is VALID [2022-02-20 18:21:50,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {2538#(not (= ~T1_E~0 0))} assume 1 == ~t1_i~0;~t1_st~0 := 0; {2538#(not (= ~T1_E~0 0))} is VALID [2022-02-20 18:21:50,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {2538#(not (= ~T1_E~0 0))} assume 1 == ~t2_i~0;~t2_st~0 := 0; {2538#(not (= ~T1_E~0 0))} is VALID [2022-02-20 18:21:50,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {2538#(not (= ~T1_E~0 0))} assume { :end_inline_init_threads } true; {2538#(not (= ~T1_E~0 0))} is VALID [2022-02-20 18:21:50,723 INFO L272 TraceCheckUtils]: 11: Hoare triple {2538#(not (= ~T1_E~0 0))} call fire_delta_events(); {2580#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:21:50,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {2580#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {2581#(= |old(~T1_E~0)| ~T1_E~0)} is VALID [2022-02-20 18:21:50,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {2581#(= |old(~T1_E~0)| ~T1_E~0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2582#(= |old(~T1_E~0)| 0)} is VALID [2022-02-20 18:21:50,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {2582#(= |old(~T1_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {2582#(= |old(~T1_E~0)| 0)} is VALID [2022-02-20 18:21:50,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {2582#(= |old(~T1_E~0)| 0)} assume !(0 == ~E_1~0); {2582#(= |old(~T1_E~0)| 0)} is VALID [2022-02-20 18:21:50,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {2582#(= |old(~T1_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {2582#(= |old(~T1_E~0)| 0)} is VALID [2022-02-20 18:21:50,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {2582#(= |old(~T1_E~0)| 0)} assume true; {2582#(= |old(~T1_E~0)| 0)} is VALID [2022-02-20 18:21:50,730 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2582#(= |old(~T1_E~0)| 0)} {2538#(not (= ~T1_E~0 0))} #439#return; {2537#false} is VALID [2022-02-20 18:21:50,730 INFO L272 TraceCheckUtils]: 19: Hoare triple {2537#false} call activate_threads(); {2583#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:21:50,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {2583#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {2536#true} is VALID [2022-02-20 18:21:50,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {2536#true} assume !(1 == ~m_pc~0); {2536#true} is VALID [2022-02-20 18:21:50,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {2536#true} is_master_triggered_~__retres1~0#1 := 0; {2536#true} is VALID [2022-02-20 18:21:50,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {2536#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2536#true} is VALID [2022-02-20 18:21:50,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {2536#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {2536#true} is VALID [2022-02-20 18:21:50,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {2536#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2536#true} is VALID [2022-02-20 18:21:50,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {2536#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {2536#true} is VALID [2022-02-20 18:21:50,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {2536#true} assume !(1 == ~t1_pc~0); {2536#true} is VALID [2022-02-20 18:21:50,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {2536#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2536#true} is VALID [2022-02-20 18:21:50,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {2536#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2536#true} is VALID [2022-02-20 18:21:50,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {2536#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {2536#true} is VALID [2022-02-20 18:21:50,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {2536#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2536#true} is VALID [2022-02-20 18:21:50,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {2536#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {2536#true} is VALID [2022-02-20 18:21:50,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {2536#true} assume 1 == ~t2_pc~0; {2536#true} is VALID [2022-02-20 18:21:50,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {2536#true} is VALID [2022-02-20 18:21:50,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {2536#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {2536#true} is VALID [2022-02-20 18:21:50,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {2536#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {2536#true} is VALID [2022-02-20 18:21:50,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {2536#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {2536#true} is VALID [2022-02-20 18:21:50,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-02-20 18:21:50,734 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2536#true} {2537#false} #441#return; {2537#false} is VALID [2022-02-20 18:21:50,734 INFO L272 TraceCheckUtils]: 40: Hoare triple {2537#false} call reset_delta_events(); {2580#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:21:50,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {2580#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {2536#true} is VALID [2022-02-20 18:21:50,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {2536#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2536#true} is VALID [2022-02-20 18:21:50,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {2536#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {2536#true} is VALID [2022-02-20 18:21:50,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {2536#true} assume !(1 == ~E_1~0); {2536#true} is VALID [2022-02-20 18:21:50,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {2536#true} assume 1 == ~E_2~0;~E_2~0 := 2; {2536#true} is VALID [2022-02-20 18:21:50,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-02-20 18:21:50,735 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2536#true} {2537#false} #443#return; {2537#false} is VALID [2022-02-20 18:21:50,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-02-20 18:21:50,736 INFO L290 TraceCheckUtils]: 49: Hoare triple {2537#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {2537#false} is VALID [2022-02-20 18:21:50,736 INFO L290 TraceCheckUtils]: 50: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-02-20 18:21:50,736 INFO L272 TraceCheckUtils]: 51: Hoare triple {2537#false} call eval_#t~ret4#1 := exists_runnable_thread(); {2536#true} is VALID [2022-02-20 18:21:50,736 INFO L290 TraceCheckUtils]: 52: Hoare triple {2536#true} havoc ~__retres1~3; {2536#true} is VALID [2022-02-20 18:21:50,736 INFO L290 TraceCheckUtils]: 53: Hoare triple {2536#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {2536#true} is VALID [2022-02-20 18:21:50,745 INFO L290 TraceCheckUtils]: 54: Hoare triple {2536#true} #res := ~__retres1~3; {2536#true} is VALID [2022-02-20 18:21:50,745 INFO L290 TraceCheckUtils]: 55: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-02-20 18:21:50,753 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2536#true} {2537#false} #445#return; {2537#false} is VALID [2022-02-20 18:21:50,753 INFO L290 TraceCheckUtils]: 57: Hoare triple {2537#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {2537#false} is VALID [2022-02-20 18:21:50,753 INFO L290 TraceCheckUtils]: 58: Hoare triple {2537#false} assume 0 != eval_~tmp~0#1; {2537#false} is VALID [2022-02-20 18:21:50,754 INFO L290 TraceCheckUtils]: 59: Hoare triple {2537#false} assume !(0 == ~m_st~0); {2537#false} is VALID [2022-02-20 18:21:50,754 INFO L290 TraceCheckUtils]: 60: Hoare triple {2537#false} assume !(0 == ~t1_st~0); {2537#false} is VALID [2022-02-20 18:21:50,754 INFO L290 TraceCheckUtils]: 61: Hoare triple {2537#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {2537#false} is VALID [2022-02-20 18:21:50,754 INFO L290 TraceCheckUtils]: 62: Hoare triple {2537#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {2537#false} is VALID [2022-02-20 18:21:50,754 INFO L290 TraceCheckUtils]: 63: Hoare triple {2537#false} assume !(0 == ~t2_pc~0); {2537#false} is VALID [2022-02-20 18:21:50,754 INFO L290 TraceCheckUtils]: 64: Hoare triple {2537#false} assume 1 == ~t2_pc~0; {2537#false} is VALID [2022-02-20 18:21:50,755 INFO L290 TraceCheckUtils]: 65: Hoare triple {2537#false} assume { :begin_inline_error } true; {2537#false} is VALID [2022-02-20 18:21:50,755 INFO L290 TraceCheckUtils]: 66: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-02-20 18:21:50,755 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 18:21:50,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:21:50,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34323246] [2022-02-20 18:21:50,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34323246] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:21:50,756 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:21:50,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:21:50,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448791518] [2022-02-20 18:21:50,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:21:50,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-02-20 18:21:50,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:21:50,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:50,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:21:50,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:21:50,797 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:21:50,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:21:50,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:21:50,798 INFO L87 Difference]: Start difference. First operand 233 states and 333 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:51,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:51,777 INFO L93 Difference]: Finished difference Result 516 states and 750 transitions. [2022-02-20 18:21:51,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:21:51,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-02-20 18:21:51,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:21:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 397 transitions. [2022-02-20 18:21:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 397 transitions. [2022-02-20 18:21:51,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 397 transitions. [2022-02-20 18:21:52,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:21:52,043 INFO L225 Difference]: With dead ends: 516 [2022-02-20 18:21:52,043 INFO L226 Difference]: Without dead ends: 293 [2022-02-20 18:21:52,044 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 18:21:52,050 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 279 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:21:52,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 446 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:21:52,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-02-20 18:21:52,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 233. [2022-02-20 18:21:52,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:21:52,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 293 states. Second operand has 233 states, 194 states have (on average 1.4329896907216495) internal successors, (278), 196 states have internal predecessors, (278), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-02-20 18:21:52,082 INFO L74 IsIncluded]: Start isIncluded. First operand 293 states. Second operand has 233 states, 194 states have (on average 1.4329896907216495) internal successors, (278), 196 states have internal predecessors, (278), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-02-20 18:21:52,083 INFO L87 Difference]: Start difference. First operand 293 states. Second operand has 233 states, 194 states have (on average 1.4329896907216495) internal successors, (278), 196 states have internal predecessors, (278), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-02-20 18:21:52,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:52,092 INFO L93 Difference]: Finished difference Result 293 states and 425 transitions. [2022-02-20 18:21:52,092 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 425 transitions. [2022-02-20 18:21:52,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:21:52,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:21:52,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 194 states have (on average 1.4329896907216495) internal successors, (278), 196 states have internal predecessors, (278), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) Second operand 293 states. [2022-02-20 18:21:52,095 INFO L87 Difference]: Start difference. First operand has 233 states, 194 states have (on average 1.4329896907216495) internal successors, (278), 196 states have internal predecessors, (278), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) Second operand 293 states. [2022-02-20 18:21:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:52,104 INFO L93 Difference]: Finished difference Result 293 states and 425 transitions. [2022-02-20 18:21:52,105 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 425 transitions. [2022-02-20 18:21:52,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:21:52,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:21:52,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:21:52,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:21:52,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.4329896907216495) internal successors, (278), 196 states have internal predecessors, (278), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-02-20 18:21:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 331 transitions. [2022-02-20 18:21:52,126 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 331 transitions. Word has length 67 [2022-02-20 18:21:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:21:52,126 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 331 transitions. [2022-02-20 18:21:52,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 331 transitions. [2022-02-20 18:21:52,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:21:52,127 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:21:52,127 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] [2022-02-20 18:21:52,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:21:52,128 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:21:52,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:21:52,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1655984776, now seen corresponding path program 1 times [2022-02-20 18:21:52,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:21:52,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109500296] [2022-02-20 18:21:52,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:21:52,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:21:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:52,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:21:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:52,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {4180#true} assume true; {4180#true} is VALID [2022-02-20 18:21:52,153 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {4180#true} {4182#(= ~T2_E~0 ~M_E~0)} #437#return; {4182#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:21:52,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:21:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:52,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {4224#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {4225#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 18:21:52,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {4225#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {4225#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 18:21:52,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {4225#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {4226#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:21:52,178 INFO L290 TraceCheckUtils]: 3: Hoare triple {4226#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {4226#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:21:52,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {4226#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {4226#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:21:52,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {4226#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {4226#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:21:52,179 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4226#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {4182#(= ~T2_E~0 ~M_E~0)} #439#return; {4181#false} is VALID [2022-02-20 18:21:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:21:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:52,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {4227#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {4180#true} is VALID [2022-02-20 18:21:52,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {4180#true} assume !(1 == ~m_pc~0); {4180#true} is VALID [2022-02-20 18:21:52,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {4180#true} is_master_triggered_~__retres1~0#1 := 0; {4180#true} is VALID [2022-02-20 18:21:52,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {4180#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {4180#true} is VALID [2022-02-20 18:21:52,194 INFO L290 TraceCheckUtils]: 4: Hoare triple {4180#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {4180#true} is VALID [2022-02-20 18:21:52,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {4180#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {4180#true} is VALID [2022-02-20 18:21:52,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {4180#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {4180#true} is VALID [2022-02-20 18:21:52,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {4180#true} assume !(1 == ~t1_pc~0); {4180#true} is VALID [2022-02-20 18:21:52,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {4180#true} is_transmit1_triggered_~__retres1~1#1 := 0; {4180#true} is VALID [2022-02-20 18:21:52,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {4180#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {4180#true} is VALID [2022-02-20 18:21:52,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {4180#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {4180#true} is VALID [2022-02-20 18:21:52,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {4180#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {4180#true} is VALID [2022-02-20 18:21:52,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {4180#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {4180#true} is VALID [2022-02-20 18:21:52,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {4180#true} assume 1 == ~t2_pc~0; {4180#true} is VALID [2022-02-20 18:21:52,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {4180#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {4180#true} is VALID [2022-02-20 18:21:52,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {4180#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {4180#true} is VALID [2022-02-20 18:21:52,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {4180#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {4180#true} is VALID [2022-02-20 18:21:52,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {4180#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {4180#true} is VALID [2022-02-20 18:21:52,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {4180#true} assume true; {4180#true} is VALID [2022-02-20 18:21:52,196 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {4180#true} {4181#false} #441#return; {4181#false} is VALID [2022-02-20 18:21:52,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 18:21:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:52,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {4224#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {4180#true} is VALID [2022-02-20 18:21:52,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {4180#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {4180#true} is VALID [2022-02-20 18:21:52,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {4180#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {4180#true} is VALID [2022-02-20 18:21:52,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {4180#true} assume !(1 == ~E_1~0); {4180#true} is VALID [2022-02-20 18:21:52,201 INFO L290 TraceCheckUtils]: 4: Hoare triple {4180#true} assume 1 == ~E_2~0;~E_2~0 := 2; {4180#true} is VALID [2022-02-20 18:21:52,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {4180#true} assume true; {4180#true} is VALID [2022-02-20 18:21:52,201 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4180#true} {4181#false} #443#return; {4181#false} is VALID [2022-02-20 18:21:52,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 18:21:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:52,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {4180#true} havoc ~__retres1~3; {4180#true} is VALID [2022-02-20 18:21:52,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {4180#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {4180#true} is VALID [2022-02-20 18:21:52,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {4180#true} #res := ~__retres1~3; {4180#true} is VALID [2022-02-20 18:21:52,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {4180#true} assume true; {4180#true} is VALID [2022-02-20 18:21:52,205 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4180#true} {4181#false} #445#return; {4181#false} is VALID [2022-02-20 18:21:52,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {4180#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(21, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2; {4182#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:21:52,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {4182#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {4182#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:21:52,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {4182#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {4182#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:21:52,206 INFO L272 TraceCheckUtils]: 3: Hoare triple {4182#(= ~T2_E~0 ~M_E~0)} call update_channels(); {4180#true} is VALID [2022-02-20 18:21:52,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {4180#true} assume true; {4180#true} is VALID [2022-02-20 18:21:52,207 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4180#true} {4182#(= ~T2_E~0 ~M_E~0)} #437#return; {4182#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:21:52,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {4182#(= ~T2_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {4182#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:21:52,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {4182#(= ~T2_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {4182#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:21:52,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {4182#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {4182#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:21:52,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {4182#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {4182#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:21:52,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {4182#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {4182#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:21:52,211 INFO L272 TraceCheckUtils]: 11: Hoare triple {4182#(= ~T2_E~0 ~M_E~0)} call fire_delta_events(); {4224#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:21:52,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {4224#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {4225#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 18:21:52,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {4225#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {4225#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 18:21:52,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {4225#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {4226#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:21:52,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {4226#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {4226#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:21:52,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {4226#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {4226#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:21:52,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {4226#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {4226#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:21:52,218 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4226#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {4182#(= ~T2_E~0 ~M_E~0)} #439#return; {4181#false} is VALID [2022-02-20 18:21:52,218 INFO L272 TraceCheckUtils]: 19: Hoare triple {4181#false} call activate_threads(); {4227#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:21:52,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {4227#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {4180#true} is VALID [2022-02-20 18:21:52,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {4180#true} assume !(1 == ~m_pc~0); {4180#true} is VALID [2022-02-20 18:21:52,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {4180#true} is_master_triggered_~__retres1~0#1 := 0; {4180#true} is VALID [2022-02-20 18:21:52,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {4180#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {4180#true} is VALID [2022-02-20 18:21:52,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {4180#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {4180#true} is VALID [2022-02-20 18:21:52,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {4180#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {4180#true} is VALID [2022-02-20 18:21:52,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {4180#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {4180#true} is VALID [2022-02-20 18:21:52,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {4180#true} assume !(1 == ~t1_pc~0); {4180#true} is VALID [2022-02-20 18:21:52,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {4180#true} is_transmit1_triggered_~__retres1~1#1 := 0; {4180#true} is VALID [2022-02-20 18:21:52,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {4180#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {4180#true} is VALID [2022-02-20 18:21:52,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {4180#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {4180#true} is VALID [2022-02-20 18:21:52,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {4180#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {4180#true} is VALID [2022-02-20 18:21:52,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {4180#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {4180#true} is VALID [2022-02-20 18:21:52,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {4180#true} assume 1 == ~t2_pc~0; {4180#true} is VALID [2022-02-20 18:21:52,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {4180#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {4180#true} is VALID [2022-02-20 18:21:52,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {4180#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {4180#true} is VALID [2022-02-20 18:21:52,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {4180#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {4180#true} is VALID [2022-02-20 18:21:52,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {4180#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {4180#true} is VALID [2022-02-20 18:21:52,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {4180#true} assume true; {4180#true} is VALID [2022-02-20 18:21:52,221 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4180#true} {4181#false} #441#return; {4181#false} is VALID [2022-02-20 18:21:52,221 INFO L272 TraceCheckUtils]: 40: Hoare triple {4181#false} call reset_delta_events(); {4224#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:21:52,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {4224#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {4180#true} is VALID [2022-02-20 18:21:52,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {4180#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {4180#true} is VALID [2022-02-20 18:21:52,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {4180#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {4180#true} is VALID [2022-02-20 18:21:52,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {4180#true} assume !(1 == ~E_1~0); {4180#true} is VALID [2022-02-20 18:21:52,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {4180#true} assume 1 == ~E_2~0;~E_2~0 := 2; {4180#true} is VALID [2022-02-20 18:21:52,222 INFO L290 TraceCheckUtils]: 46: Hoare triple {4180#true} assume true; {4180#true} is VALID [2022-02-20 18:21:52,222 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {4180#true} {4181#false} #443#return; {4181#false} is VALID [2022-02-20 18:21:52,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {4181#false} assume !false; {4181#false} is VALID [2022-02-20 18:21:52,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {4181#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {4181#false} is VALID [2022-02-20 18:21:52,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {4181#false} assume !false; {4181#false} is VALID [2022-02-20 18:21:52,222 INFO L272 TraceCheckUtils]: 51: Hoare triple {4181#false} call eval_#t~ret4#1 := exists_runnable_thread(); {4180#true} is VALID [2022-02-20 18:21:52,223 INFO L290 TraceCheckUtils]: 52: Hoare triple {4180#true} havoc ~__retres1~3; {4180#true} is VALID [2022-02-20 18:21:52,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {4180#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {4180#true} is VALID [2022-02-20 18:21:52,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {4180#true} #res := ~__retres1~3; {4180#true} is VALID [2022-02-20 18:21:52,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {4180#true} assume true; {4180#true} is VALID [2022-02-20 18:21:52,223 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4180#true} {4181#false} #445#return; {4181#false} is VALID [2022-02-20 18:21:52,223 INFO L290 TraceCheckUtils]: 57: Hoare triple {4181#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {4181#false} is VALID [2022-02-20 18:21:52,223 INFO L290 TraceCheckUtils]: 58: Hoare triple {4181#false} assume 0 != eval_~tmp~0#1; {4181#false} is VALID [2022-02-20 18:21:52,223 INFO L290 TraceCheckUtils]: 59: Hoare triple {4181#false} assume !(0 == ~m_st~0); {4181#false} is VALID [2022-02-20 18:21:52,224 INFO L290 TraceCheckUtils]: 60: Hoare triple {4181#false} assume !(0 == ~t1_st~0); {4181#false} is VALID [2022-02-20 18:21:52,224 INFO L290 TraceCheckUtils]: 61: Hoare triple {4181#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {4181#false} is VALID [2022-02-20 18:21:52,224 INFO L290 TraceCheckUtils]: 62: Hoare triple {4181#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {4181#false} is VALID [2022-02-20 18:21:52,224 INFO L290 TraceCheckUtils]: 63: Hoare triple {4181#false} assume !(0 == ~t2_pc~0); {4181#false} is VALID [2022-02-20 18:21:52,224 INFO L290 TraceCheckUtils]: 64: Hoare triple {4181#false} assume 1 == ~t2_pc~0; {4181#false} is VALID [2022-02-20 18:21:52,224 INFO L290 TraceCheckUtils]: 65: Hoare triple {4181#false} assume { :begin_inline_error } true; {4181#false} is VALID [2022-02-20 18:21:52,224 INFO L290 TraceCheckUtils]: 66: Hoare triple {4181#false} assume !false; {4181#false} is VALID [2022-02-20 18:21:52,225 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 18:21:52,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:21:52,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109500296] [2022-02-20 18:21:52,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109500296] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:21:52,225 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:21:52,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:21:52,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484880196] [2022-02-20 18:21:52,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:21:52,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-02-20 18:21:52,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:21:52,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:52,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:21:52,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:21:52,265 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:21:52,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:21:52,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:21:52,266 INFO L87 Difference]: Start difference. First operand 233 states and 331 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:54,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:54,096 INFO L93 Difference]: Finished difference Result 689 states and 986 transitions. [2022-02-20 18:21:54,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:21:54,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-02-20 18:21:54,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:21:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 639 transitions. [2022-02-20 18:21:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:54,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 639 transitions. [2022-02-20 18:21:54,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 639 transitions. [2022-02-20 18:21:54,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 639 edges. 639 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:21:54,626 INFO L225 Difference]: With dead ends: 689 [2022-02-20 18:21:54,627 INFO L226 Difference]: Without dead ends: 466 [2022-02-20 18:21:54,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:21:54,637 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 384 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 18:21:54,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 887 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 18:21:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-02-20 18:21:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 337. [2022-02-20 18:21:54,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:21:54,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 466 states. Second operand has 337 states, 281 states have (on average 1.4234875444839858) internal successors, (400), 284 states have internal predecessors, (400), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-02-20 18:21:54,655 INFO L74 IsIncluded]: Start isIncluded. First operand 466 states. Second operand has 337 states, 281 states have (on average 1.4234875444839858) internal successors, (400), 284 states have internal predecessors, (400), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-02-20 18:21:54,656 INFO L87 Difference]: Start difference. First operand 466 states. Second operand has 337 states, 281 states have (on average 1.4234875444839858) internal successors, (400), 284 states have internal predecessors, (400), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-02-20 18:21:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:54,667 INFO L93 Difference]: Finished difference Result 466 states and 666 transitions. [2022-02-20 18:21:54,667 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 666 transitions. [2022-02-20 18:21:54,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:21:54,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:21:54,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 337 states, 281 states have (on average 1.4234875444839858) internal successors, (400), 284 states have internal predecessors, (400), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) Second operand 466 states. [2022-02-20 18:21:54,671 INFO L87 Difference]: Start difference. First operand has 337 states, 281 states have (on average 1.4234875444839858) internal successors, (400), 284 states have internal predecessors, (400), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) Second operand 466 states. [2022-02-20 18:21:54,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:54,683 INFO L93 Difference]: Finished difference Result 466 states and 666 transitions. [2022-02-20 18:21:54,684 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 666 transitions. [2022-02-20 18:21:54,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:21:54,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:21:54,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:21:54,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:21:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 281 states have (on average 1.4234875444839858) internal successors, (400), 284 states have internal predecessors, (400), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-02-20 18:21:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 475 transitions. [2022-02-20 18:21:54,694 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 475 transitions. Word has length 67 [2022-02-20 18:21:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:21:54,694 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 475 transitions. [2022-02-20 18:21:54,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 475 transitions. [2022-02-20 18:21:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:21:54,696 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:21:54,696 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] [2022-02-20 18:21:54,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:21:54,697 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:21:54,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:21:54,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1212084102, now seen corresponding path program 1 times [2022-02-20 18:21:54,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:21:54,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461745751] [2022-02-20 18:21:54,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:21:54,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:21:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:54,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:21:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:54,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {6547#true} assume true; {6547#true} is VALID [2022-02-20 18:21:54,742 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {6547#true} {6549#(= ~E_2~0 ~M_E~0)} #437#return; {6549#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:21:54,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:21:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:54,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {6591#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {6592#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 18:21:54,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {6592#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {6592#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 18:21:54,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {6592#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {6592#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 18:21:54,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {6592#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {6592#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 18:21:54,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {6592#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_2~0;~E_2~0 := 1; {6593#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:21:54,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {6593#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume true; {6593#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:21:54,787 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6593#(not (= |old(~E_2~0)| |old(~M_E~0)|))} {6549#(= ~E_2~0 ~M_E~0)} #439#return; {6548#false} is VALID [2022-02-20 18:21:54,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:21:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:54,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {6594#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {6547#true} is VALID [2022-02-20 18:21:54,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {6547#true} assume !(1 == ~m_pc~0); {6547#true} is VALID [2022-02-20 18:21:54,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {6547#true} is_master_triggered_~__retres1~0#1 := 0; {6547#true} is VALID [2022-02-20 18:21:54,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {6547#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {6547#true} is VALID [2022-02-20 18:21:54,817 INFO L290 TraceCheckUtils]: 4: Hoare triple {6547#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {6547#true} is VALID [2022-02-20 18:21:54,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {6547#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {6547#true} is VALID [2022-02-20 18:21:54,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {6547#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {6547#true} is VALID [2022-02-20 18:21:54,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {6547#true} assume !(1 == ~t1_pc~0); {6547#true} is VALID [2022-02-20 18:21:54,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {6547#true} is_transmit1_triggered_~__retres1~1#1 := 0; {6547#true} is VALID [2022-02-20 18:21:54,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {6547#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {6547#true} is VALID [2022-02-20 18:21:54,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {6547#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {6547#true} is VALID [2022-02-20 18:21:54,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {6547#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {6547#true} is VALID [2022-02-20 18:21:54,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {6547#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {6547#true} is VALID [2022-02-20 18:21:54,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {6547#true} assume 1 == ~t2_pc~0; {6547#true} is VALID [2022-02-20 18:21:54,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {6547#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {6547#true} is VALID [2022-02-20 18:21:54,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {6547#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {6547#true} is VALID [2022-02-20 18:21:54,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {6547#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {6547#true} is VALID [2022-02-20 18:21:54,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {6547#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {6547#true} is VALID [2022-02-20 18:21:54,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {6547#true} assume true; {6547#true} is VALID [2022-02-20 18:21:54,819 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6547#true} {6548#false} #441#return; {6548#false} is VALID [2022-02-20 18:21:54,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 18:21:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:54,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {6591#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {6547#true} is VALID [2022-02-20 18:21:54,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {6547#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {6547#true} is VALID [2022-02-20 18:21:54,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {6547#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {6547#true} is VALID [2022-02-20 18:21:54,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {6547#true} assume !(1 == ~E_1~0); {6547#true} is VALID [2022-02-20 18:21:54,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {6547#true} assume 1 == ~E_2~0;~E_2~0 := 2; {6547#true} is VALID [2022-02-20 18:21:54,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {6547#true} assume true; {6547#true} is VALID [2022-02-20 18:21:54,825 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6547#true} {6548#false} #443#return; {6548#false} is VALID [2022-02-20 18:21:54,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 18:21:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:54,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {6547#true} havoc ~__retres1~3; {6547#true} is VALID [2022-02-20 18:21:54,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {6547#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {6547#true} is VALID [2022-02-20 18:21:54,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {6547#true} #res := ~__retres1~3; {6547#true} is VALID [2022-02-20 18:21:54,829 INFO L290 TraceCheckUtils]: 3: Hoare triple {6547#true} assume true; {6547#true} is VALID [2022-02-20 18:21:54,829 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6547#true} {6548#false} #445#return; {6548#false} is VALID [2022-02-20 18:21:54,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {6547#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(21, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2; {6549#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:21:54,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {6549#(= ~E_2~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {6549#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:21:54,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {6549#(= ~E_2~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {6549#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:21:54,831 INFO L272 TraceCheckUtils]: 3: Hoare triple {6549#(= ~E_2~0 ~M_E~0)} call update_channels(); {6547#true} is VALID [2022-02-20 18:21:54,831 INFO L290 TraceCheckUtils]: 4: Hoare triple {6547#true} assume true; {6547#true} is VALID [2022-02-20 18:21:54,832 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6547#true} {6549#(= ~E_2~0 ~M_E~0)} #437#return; {6549#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:21:54,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {6549#(= ~E_2~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {6549#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:21:54,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {6549#(= ~E_2~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {6549#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:21:54,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {6549#(= ~E_2~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {6549#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:21:54,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {6549#(= ~E_2~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {6549#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:21:54,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {6549#(= ~E_2~0 ~M_E~0)} assume { :end_inline_init_threads } true; {6549#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:21:54,834 INFO L272 TraceCheckUtils]: 11: Hoare triple {6549#(= ~E_2~0 ~M_E~0)} call fire_delta_events(); {6591#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:21:54,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {6591#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {6592#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 18:21:54,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {6592#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {6592#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 18:21:54,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {6592#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {6592#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 18:21:54,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {6592#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_1~0); {6592#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 18:21:54,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {6592#(and (= ~E_2~0 |old(~E_2~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_2~0;~E_2~0 := 1; {6593#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:21:54,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {6593#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume true; {6593#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:21:54,836 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6593#(not (= |old(~E_2~0)| |old(~M_E~0)|))} {6549#(= ~E_2~0 ~M_E~0)} #439#return; {6548#false} is VALID [2022-02-20 18:21:54,837 INFO L272 TraceCheckUtils]: 19: Hoare triple {6548#false} call activate_threads(); {6594#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:21:54,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {6594#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {6547#true} is VALID [2022-02-20 18:21:54,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {6547#true} assume !(1 == ~m_pc~0); {6547#true} is VALID [2022-02-20 18:21:54,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {6547#true} is_master_triggered_~__retres1~0#1 := 0; {6547#true} is VALID [2022-02-20 18:21:54,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {6547#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {6547#true} is VALID [2022-02-20 18:21:54,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {6547#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {6547#true} is VALID [2022-02-20 18:21:54,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {6547#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {6547#true} is VALID [2022-02-20 18:21:54,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {6547#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {6547#true} is VALID [2022-02-20 18:21:54,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {6547#true} assume !(1 == ~t1_pc~0); {6547#true} is VALID [2022-02-20 18:21:54,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {6547#true} is_transmit1_triggered_~__retres1~1#1 := 0; {6547#true} is VALID [2022-02-20 18:21:54,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {6547#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {6547#true} is VALID [2022-02-20 18:21:54,838 INFO L290 TraceCheckUtils]: 30: Hoare triple {6547#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {6547#true} is VALID [2022-02-20 18:21:54,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {6547#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {6547#true} is VALID [2022-02-20 18:21:54,838 INFO L290 TraceCheckUtils]: 32: Hoare triple {6547#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {6547#true} is VALID [2022-02-20 18:21:54,838 INFO L290 TraceCheckUtils]: 33: Hoare triple {6547#true} assume 1 == ~t2_pc~0; {6547#true} is VALID [2022-02-20 18:21:54,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {6547#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {6547#true} is VALID [2022-02-20 18:21:54,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {6547#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {6547#true} is VALID [2022-02-20 18:21:54,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {6547#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {6547#true} is VALID [2022-02-20 18:21:54,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {6547#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {6547#true} is VALID [2022-02-20 18:21:54,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {6547#true} assume true; {6547#true} is VALID [2022-02-20 18:21:54,839 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6547#true} {6548#false} #441#return; {6548#false} is VALID [2022-02-20 18:21:54,839 INFO L272 TraceCheckUtils]: 40: Hoare triple {6548#false} call reset_delta_events(); {6591#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:21:54,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {6591#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {6547#true} is VALID [2022-02-20 18:21:54,839 INFO L290 TraceCheckUtils]: 42: Hoare triple {6547#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {6547#true} is VALID [2022-02-20 18:21:54,839 INFO L290 TraceCheckUtils]: 43: Hoare triple {6547#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {6547#true} is VALID [2022-02-20 18:21:54,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {6547#true} assume !(1 == ~E_1~0); {6547#true} is VALID [2022-02-20 18:21:54,840 INFO L290 TraceCheckUtils]: 45: Hoare triple {6547#true} assume 1 == ~E_2~0;~E_2~0 := 2; {6547#true} is VALID [2022-02-20 18:21:54,840 INFO L290 TraceCheckUtils]: 46: Hoare triple {6547#true} assume true; {6547#true} is VALID [2022-02-20 18:21:54,840 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6547#true} {6548#false} #443#return; {6548#false} is VALID [2022-02-20 18:21:54,840 INFO L290 TraceCheckUtils]: 48: Hoare triple {6548#false} assume !false; {6548#false} is VALID [2022-02-20 18:21:54,840 INFO L290 TraceCheckUtils]: 49: Hoare triple {6548#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {6548#false} is VALID [2022-02-20 18:21:54,840 INFO L290 TraceCheckUtils]: 50: Hoare triple {6548#false} assume !false; {6548#false} is VALID [2022-02-20 18:21:54,840 INFO L272 TraceCheckUtils]: 51: Hoare triple {6548#false} call eval_#t~ret4#1 := exists_runnable_thread(); {6547#true} is VALID [2022-02-20 18:21:54,841 INFO L290 TraceCheckUtils]: 52: Hoare triple {6547#true} havoc ~__retres1~3; {6547#true} is VALID [2022-02-20 18:21:54,841 INFO L290 TraceCheckUtils]: 53: Hoare triple {6547#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {6547#true} is VALID [2022-02-20 18:21:54,841 INFO L290 TraceCheckUtils]: 54: Hoare triple {6547#true} #res := ~__retres1~3; {6547#true} is VALID [2022-02-20 18:21:54,841 INFO L290 TraceCheckUtils]: 55: Hoare triple {6547#true} assume true; {6547#true} is VALID [2022-02-20 18:21:54,841 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6547#true} {6548#false} #445#return; {6548#false} is VALID [2022-02-20 18:21:54,841 INFO L290 TraceCheckUtils]: 57: Hoare triple {6548#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {6548#false} is VALID [2022-02-20 18:21:54,841 INFO L290 TraceCheckUtils]: 58: Hoare triple {6548#false} assume 0 != eval_~tmp~0#1; {6548#false} is VALID [2022-02-20 18:21:54,841 INFO L290 TraceCheckUtils]: 59: Hoare triple {6548#false} assume !(0 == ~m_st~0); {6548#false} is VALID [2022-02-20 18:21:54,842 INFO L290 TraceCheckUtils]: 60: Hoare triple {6548#false} assume !(0 == ~t1_st~0); {6548#false} is VALID [2022-02-20 18:21:54,842 INFO L290 TraceCheckUtils]: 61: Hoare triple {6548#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {6548#false} is VALID [2022-02-20 18:21:54,842 INFO L290 TraceCheckUtils]: 62: Hoare triple {6548#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {6548#false} is VALID [2022-02-20 18:21:54,842 INFO L290 TraceCheckUtils]: 63: Hoare triple {6548#false} assume !(0 == ~t2_pc~0); {6548#false} is VALID [2022-02-20 18:21:54,842 INFO L290 TraceCheckUtils]: 64: Hoare triple {6548#false} assume 1 == ~t2_pc~0; {6548#false} is VALID [2022-02-20 18:21:54,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {6548#false} assume { :begin_inline_error } true; {6548#false} is VALID [2022-02-20 18:21:54,842 INFO L290 TraceCheckUtils]: 66: Hoare triple {6548#false} assume !false; {6548#false} is VALID [2022-02-20 18:21:54,843 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 18:21:54,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:21:54,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461745751] [2022-02-20 18:21:54,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461745751] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:21:54,843 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:21:54,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:21:54,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934220078] [2022-02-20 18:21:54,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:21:54,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-02-20 18:21:54,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:21:54,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:54,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:21:54,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:21:54,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:21:54,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:21:54,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:21:54,884 INFO L87 Difference]: Start difference. First operand 337 states and 475 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:56,793 INFO L93 Difference]: Finished difference Result 1074 states and 1524 transitions. [2022-02-20 18:21:56,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 18:21:56,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-02-20 18:21:56,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:21:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 657 transitions. [2022-02-20 18:21:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 657 transitions. [2022-02-20 18:21:56,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 657 transitions. [2022-02-20 18:21:57,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 657 edges. 657 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:21:57,314 INFO L225 Difference]: With dead ends: 1074 [2022-02-20 18:21:57,314 INFO L226 Difference]: Without dead ends: 747 [2022-02-20 18:21:57,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:21:57,315 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 396 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 18:21:57,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 854 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 18:21:57,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-02-20 18:21:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 544. [2022-02-20 18:21:57,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:21:57,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 747 states. Second operand has 544 states, 456 states have (on average 1.4232456140350878) internal successors, (649), 461 states have internal predecessors, (649), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 18:21:57,339 INFO L74 IsIncluded]: Start isIncluded. First operand 747 states. Second operand has 544 states, 456 states have (on average 1.4232456140350878) internal successors, (649), 461 states have internal predecessors, (649), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 18:21:57,340 INFO L87 Difference]: Start difference. First operand 747 states. Second operand has 544 states, 456 states have (on average 1.4232456140350878) internal successors, (649), 461 states have internal predecessors, (649), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 18:21:57,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:57,361 INFO L93 Difference]: Finished difference Result 747 states and 1055 transitions. [2022-02-20 18:21:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1055 transitions. [2022-02-20 18:21:57,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:21:57,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:21:57,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 544 states, 456 states have (on average 1.4232456140350878) internal successors, (649), 461 states have internal predecessors, (649), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) Second operand 747 states. [2022-02-20 18:21:57,365 INFO L87 Difference]: Start difference. First operand has 544 states, 456 states have (on average 1.4232456140350878) internal successors, (649), 461 states have internal predecessors, (649), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) Second operand 747 states. [2022-02-20 18:21:57,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:57,386 INFO L93 Difference]: Finished difference Result 747 states and 1055 transitions. [2022-02-20 18:21:57,386 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1055 transitions. [2022-02-20 18:21:57,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:21:57,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:21:57,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:21:57,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:21:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 456 states have (on average 1.4232456140350878) internal successors, (649), 461 states have internal predecessors, (649), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 18:21:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 768 transitions. [2022-02-20 18:21:57,404 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 768 transitions. Word has length 67 [2022-02-20 18:21:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:21:57,404 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 768 transitions. [2022-02-20 18:21:57,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 768 transitions. [2022-02-20 18:21:57,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:21:57,406 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:21:57,406 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] [2022-02-20 18:21:57,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:21:57,406 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:21:57,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:21:57,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1054297084, now seen corresponding path program 1 times [2022-02-20 18:21:57,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:21:57,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43750784] [2022-02-20 18:21:57,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:21:57,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:21:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:57,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:21:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:57,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {10257#true} assume true; {10257#true} is VALID [2022-02-20 18:21:57,428 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {10257#true} {10257#true} #437#return; {10257#true} is VALID [2022-02-20 18:21:57,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:21:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:57,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {10300#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {10257#true} is VALID [2022-02-20 18:21:57,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {10257#true} assume !(0 == ~T1_E~0); {10257#true} is VALID [2022-02-20 18:21:57,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {10257#true} assume !(0 == ~T2_E~0); {10257#true} is VALID [2022-02-20 18:21:57,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {10257#true} assume !(0 == ~E_1~0); {10257#true} is VALID [2022-02-20 18:21:57,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {10257#true} assume !(0 == ~E_2~0); {10257#true} is VALID [2022-02-20 18:21:57,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {10257#true} assume true; {10257#true} is VALID [2022-02-20 18:21:57,438 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10257#true} {10257#true} #439#return; {10257#true} is VALID [2022-02-20 18:21:57,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:21:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:57,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {10301#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {10257#true} is VALID [2022-02-20 18:21:57,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {10257#true} assume !(1 == ~m_pc~0); {10257#true} is VALID [2022-02-20 18:21:57,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {10257#true} is_master_triggered_~__retres1~0#1 := 0; {10302#(and (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|) (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))} is VALID [2022-02-20 18:21:57,491 INFO L290 TraceCheckUtils]: 3: Hoare triple {10302#(and (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|) (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {10303#(and (<= 0 |activate_threads_is_master_triggered_#res#1|) (<= |activate_threads_is_master_triggered_#res#1| 0))} is VALID [2022-02-20 18:21:57,492 INFO L290 TraceCheckUtils]: 4: Hoare triple {10303#(and (<= 0 |activate_threads_is_master_triggered_#res#1|) (<= |activate_threads_is_master_triggered_#res#1| 0))} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {10304#(and (< 0 (+ |activate_threads_~tmp~1#1| 1)) (<= |activate_threads_~tmp~1#1| 0))} is VALID [2022-02-20 18:21:57,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {10304#(and (< 0 (+ |activate_threads_~tmp~1#1| 1)) (<= |activate_threads_~tmp~1#1| 0))} assume 0 != ~tmp~1#1;~m_st~0 := 0; {10258#false} is VALID [2022-02-20 18:21:57,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {10258#false} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {10258#false} is VALID [2022-02-20 18:21:57,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {10258#false} assume !(1 == ~t1_pc~0); {10258#false} is VALID [2022-02-20 18:21:57,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {10258#false} is_transmit1_triggered_~__retres1~1#1 := 0; {10258#false} is VALID [2022-02-20 18:21:57,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {10258#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {10258#false} is VALID [2022-02-20 18:21:57,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {10258#false} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {10258#false} is VALID [2022-02-20 18:21:57,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {10258#false} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {10258#false} is VALID [2022-02-20 18:21:57,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {10258#false} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {10258#false} is VALID [2022-02-20 18:21:57,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {10258#false} assume 1 == ~t2_pc~0; {10258#false} is VALID [2022-02-20 18:21:57,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {10258#false} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {10258#false} is VALID [2022-02-20 18:21:57,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {10258#false} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {10258#false} is VALID [2022-02-20 18:21:57,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {10258#false} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {10258#false} is VALID [2022-02-20 18:21:57,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {10258#false} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {10258#false} is VALID [2022-02-20 18:21:57,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {10258#false} assume true; {10258#false} is VALID [2022-02-20 18:21:57,494 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {10258#false} {10257#true} #441#return; {10258#false} is VALID [2022-02-20 18:21:57,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 18:21:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:57,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {10300#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {10257#true} is VALID [2022-02-20 18:21:57,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {10257#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {10257#true} is VALID [2022-02-20 18:21:57,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {10257#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {10257#true} is VALID [2022-02-20 18:21:57,498 INFO L290 TraceCheckUtils]: 3: Hoare triple {10257#true} assume !(1 == ~E_1~0); {10257#true} is VALID [2022-02-20 18:21:57,498 INFO L290 TraceCheckUtils]: 4: Hoare triple {10257#true} assume 1 == ~E_2~0;~E_2~0 := 2; {10257#true} is VALID [2022-02-20 18:21:57,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {10257#true} assume true; {10257#true} is VALID [2022-02-20 18:21:57,498 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10257#true} {10258#false} #443#return; {10258#false} is VALID [2022-02-20 18:21:57,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 18:21:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:57,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {10257#true} havoc ~__retres1~3; {10257#true} is VALID [2022-02-20 18:21:57,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {10257#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {10257#true} is VALID [2022-02-20 18:21:57,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {10257#true} #res := ~__retres1~3; {10257#true} is VALID [2022-02-20 18:21:57,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {10257#true} assume true; {10257#true} is VALID [2022-02-20 18:21:57,502 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10257#true} {10258#false} #445#return; {10258#false} is VALID [2022-02-20 18:21:57,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {10257#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(21, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2; {10257#true} is VALID [2022-02-20 18:21:57,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {10257#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {10257#true} is VALID [2022-02-20 18:21:57,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {10257#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {10257#true} is VALID [2022-02-20 18:21:57,503 INFO L272 TraceCheckUtils]: 3: Hoare triple {10257#true} call update_channels(); {10257#true} is VALID [2022-02-20 18:21:57,503 INFO L290 TraceCheckUtils]: 4: Hoare triple {10257#true} assume true; {10257#true} is VALID [2022-02-20 18:21:57,503 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10257#true} {10257#true} #437#return; {10257#true} is VALID [2022-02-20 18:21:57,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {10257#true} assume { :begin_inline_init_threads } true; {10257#true} is VALID [2022-02-20 18:21:57,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {10257#true} assume 1 == ~m_i~0;~m_st~0 := 0; {10257#true} is VALID [2022-02-20 18:21:57,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {10257#true} assume 1 == ~t1_i~0;~t1_st~0 := 0; {10257#true} is VALID [2022-02-20 18:21:57,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {10257#true} assume 1 == ~t2_i~0;~t2_st~0 := 0; {10257#true} is VALID [2022-02-20 18:21:57,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {10257#true} assume { :end_inline_init_threads } true; {10257#true} is VALID [2022-02-20 18:21:57,504 INFO L272 TraceCheckUtils]: 11: Hoare triple {10257#true} call fire_delta_events(); {10300#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:21:57,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {10300#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {10257#true} is VALID [2022-02-20 18:21:57,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {10257#true} assume !(0 == ~T1_E~0); {10257#true} is VALID [2022-02-20 18:21:57,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {10257#true} assume !(0 == ~T2_E~0); {10257#true} is VALID [2022-02-20 18:21:57,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {10257#true} assume !(0 == ~E_1~0); {10257#true} is VALID [2022-02-20 18:21:57,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {10257#true} assume !(0 == ~E_2~0); {10257#true} is VALID [2022-02-20 18:21:57,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {10257#true} assume true; {10257#true} is VALID [2022-02-20 18:21:57,505 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10257#true} {10257#true} #439#return; {10257#true} is VALID [2022-02-20 18:21:57,505 INFO L272 TraceCheckUtils]: 19: Hoare triple {10257#true} call activate_threads(); {10301#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:21:57,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {10301#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {10257#true} is VALID [2022-02-20 18:21:57,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {10257#true} assume !(1 == ~m_pc~0); {10257#true} is VALID [2022-02-20 18:21:57,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {10257#true} is_master_triggered_~__retres1~0#1 := 0; {10302#(and (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|) (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))} is VALID [2022-02-20 18:21:57,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {10302#(and (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|) (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {10303#(and (<= 0 |activate_threads_is_master_triggered_#res#1|) (<= |activate_threads_is_master_triggered_#res#1| 0))} is VALID [2022-02-20 18:21:57,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {10303#(and (<= 0 |activate_threads_is_master_triggered_#res#1|) (<= |activate_threads_is_master_triggered_#res#1| 0))} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {10304#(and (< 0 (+ |activate_threads_~tmp~1#1| 1)) (<= |activate_threads_~tmp~1#1| 0))} is VALID [2022-02-20 18:21:57,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {10304#(and (< 0 (+ |activate_threads_~tmp~1#1| 1)) (<= |activate_threads_~tmp~1#1| 0))} assume 0 != ~tmp~1#1;~m_st~0 := 0; {10258#false} is VALID [2022-02-20 18:21:57,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {10258#false} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {10258#false} is VALID [2022-02-20 18:21:57,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {10258#false} assume !(1 == ~t1_pc~0); {10258#false} is VALID [2022-02-20 18:21:57,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {10258#false} is_transmit1_triggered_~__retres1~1#1 := 0; {10258#false} is VALID [2022-02-20 18:21:57,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {10258#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {10258#false} is VALID [2022-02-20 18:21:57,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {10258#false} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {10258#false} is VALID [2022-02-20 18:21:57,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {10258#false} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {10258#false} is VALID [2022-02-20 18:21:57,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {10258#false} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {10258#false} is VALID [2022-02-20 18:21:57,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {10258#false} assume 1 == ~t2_pc~0; {10258#false} is VALID [2022-02-20 18:21:57,508 INFO L290 TraceCheckUtils]: 34: Hoare triple {10258#false} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {10258#false} is VALID [2022-02-20 18:21:57,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {10258#false} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {10258#false} is VALID [2022-02-20 18:21:57,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {10258#false} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {10258#false} is VALID [2022-02-20 18:21:57,508 INFO L290 TraceCheckUtils]: 37: Hoare triple {10258#false} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {10258#false} is VALID [2022-02-20 18:21:57,509 INFO L290 TraceCheckUtils]: 38: Hoare triple {10258#false} assume true; {10258#false} is VALID [2022-02-20 18:21:57,509 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10258#false} {10257#true} #441#return; {10258#false} is VALID [2022-02-20 18:21:57,509 INFO L272 TraceCheckUtils]: 40: Hoare triple {10258#false} call reset_delta_events(); {10300#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:21:57,509 INFO L290 TraceCheckUtils]: 41: Hoare triple {10300#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {10257#true} is VALID [2022-02-20 18:21:57,509 INFO L290 TraceCheckUtils]: 42: Hoare triple {10257#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {10257#true} is VALID [2022-02-20 18:21:57,509 INFO L290 TraceCheckUtils]: 43: Hoare triple {10257#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {10257#true} is VALID [2022-02-20 18:21:57,509 INFO L290 TraceCheckUtils]: 44: Hoare triple {10257#true} assume !(1 == ~E_1~0); {10257#true} is VALID [2022-02-20 18:21:57,509 INFO L290 TraceCheckUtils]: 45: Hoare triple {10257#true} assume 1 == ~E_2~0;~E_2~0 := 2; {10257#true} is VALID [2022-02-20 18:21:57,509 INFO L290 TraceCheckUtils]: 46: Hoare triple {10257#true} assume true; {10257#true} is VALID [2022-02-20 18:21:57,510 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10257#true} {10258#false} #443#return; {10258#false} is VALID [2022-02-20 18:21:57,510 INFO L290 TraceCheckUtils]: 48: Hoare triple {10258#false} assume !false; {10258#false} is VALID [2022-02-20 18:21:57,510 INFO L290 TraceCheckUtils]: 49: Hoare triple {10258#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {10258#false} is VALID [2022-02-20 18:21:57,510 INFO L290 TraceCheckUtils]: 50: Hoare triple {10258#false} assume !false; {10258#false} is VALID [2022-02-20 18:21:57,510 INFO L272 TraceCheckUtils]: 51: Hoare triple {10258#false} call eval_#t~ret4#1 := exists_runnable_thread(); {10257#true} is VALID [2022-02-20 18:21:57,510 INFO L290 TraceCheckUtils]: 52: Hoare triple {10257#true} havoc ~__retres1~3; {10257#true} is VALID [2022-02-20 18:21:57,510 INFO L290 TraceCheckUtils]: 53: Hoare triple {10257#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {10257#true} is VALID [2022-02-20 18:21:57,510 INFO L290 TraceCheckUtils]: 54: Hoare triple {10257#true} #res := ~__retres1~3; {10257#true} is VALID [2022-02-20 18:21:57,511 INFO L290 TraceCheckUtils]: 55: Hoare triple {10257#true} assume true; {10257#true} is VALID [2022-02-20 18:21:57,511 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {10257#true} {10258#false} #445#return; {10258#false} is VALID [2022-02-20 18:21:57,511 INFO L290 TraceCheckUtils]: 57: Hoare triple {10258#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {10258#false} is VALID [2022-02-20 18:21:57,511 INFO L290 TraceCheckUtils]: 58: Hoare triple {10258#false} assume 0 != eval_~tmp~0#1; {10258#false} is VALID [2022-02-20 18:21:57,511 INFO L290 TraceCheckUtils]: 59: Hoare triple {10258#false} assume !(0 == ~m_st~0); {10258#false} is VALID [2022-02-20 18:21:57,511 INFO L290 TraceCheckUtils]: 60: Hoare triple {10258#false} assume !(0 == ~t1_st~0); {10258#false} is VALID [2022-02-20 18:21:57,511 INFO L290 TraceCheckUtils]: 61: Hoare triple {10258#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {10258#false} is VALID [2022-02-20 18:21:57,511 INFO L290 TraceCheckUtils]: 62: Hoare triple {10258#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {10258#false} is VALID [2022-02-20 18:21:57,511 INFO L290 TraceCheckUtils]: 63: Hoare triple {10258#false} assume !(0 == ~t2_pc~0); {10258#false} is VALID [2022-02-20 18:21:57,512 INFO L290 TraceCheckUtils]: 64: Hoare triple {10258#false} assume 1 == ~t2_pc~0; {10258#false} is VALID [2022-02-20 18:21:57,512 INFO L290 TraceCheckUtils]: 65: Hoare triple {10258#false} assume { :begin_inline_error } true; {10258#false} is VALID [2022-02-20 18:21:57,512 INFO L290 TraceCheckUtils]: 66: Hoare triple {10258#false} assume !false; {10258#false} is VALID [2022-02-20 18:21:57,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 18:21:57,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:21:57,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43750784] [2022-02-20 18:21:57,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43750784] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:21:57,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:21:57,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:21:57,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159353850] [2022-02-20 18:21:57,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:21:57,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-02-20 18:21:57,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:21:57,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:57,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:21:57,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:21:57,549 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:21:57,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:21:57,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:21:57,550 INFO L87 Difference]: Start difference. First operand 544 states and 768 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:59,002 INFO L93 Difference]: Finished difference Result 1203 states and 1727 transitions. [2022-02-20 18:21:59,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:21:59,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-02-20 18:21:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:21:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 443 transitions. [2022-02-20 18:21:59,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 443 transitions. [2022-02-20 18:21:59,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 443 transitions. [2022-02-20 18:21:59,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:21:59,352 INFO L225 Difference]: With dead ends: 1203 [2022-02-20 18:21:59,352 INFO L226 Difference]: Without dead ends: 670 [2022-02-20 18:21:59,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:21:59,354 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 254 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:21:59,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 580 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:21:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-02-20 18:21:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 547. [2022-02-20 18:21:59,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:21:59,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 670 states. Second operand has 547 states, 459 states have (on average 1.411764705882353) internal successors, (648), 464 states have internal predecessors, (648), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 18:21:59,437 INFO L74 IsIncluded]: Start isIncluded. First operand 670 states. Second operand has 547 states, 459 states have (on average 1.411764705882353) internal successors, (648), 464 states have internal predecessors, (648), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 18:21:59,438 INFO L87 Difference]: Start difference. First operand 670 states. Second operand has 547 states, 459 states have (on average 1.411764705882353) internal successors, (648), 464 states have internal predecessors, (648), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 18:21:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:59,457 INFO L93 Difference]: Finished difference Result 670 states and 950 transitions. [2022-02-20 18:21:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 950 transitions. [2022-02-20 18:21:59,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:21:59,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:21:59,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 547 states, 459 states have (on average 1.411764705882353) internal successors, (648), 464 states have internal predecessors, (648), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) Second operand 670 states. [2022-02-20 18:21:59,462 INFO L87 Difference]: Start difference. First operand has 547 states, 459 states have (on average 1.411764705882353) internal successors, (648), 464 states have internal predecessors, (648), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) Second operand 670 states. [2022-02-20 18:21:59,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:21:59,484 INFO L93 Difference]: Finished difference Result 670 states and 950 transitions. [2022-02-20 18:21:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 950 transitions. [2022-02-20 18:21:59,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:21:59,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:21:59,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:21:59,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:21:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 459 states have (on average 1.411764705882353) internal successors, (648), 464 states have internal predecessors, (648), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 18:21:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 767 transitions. [2022-02-20 18:21:59,502 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 767 transitions. Word has length 67 [2022-02-20 18:21:59,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:21:59,503 INFO L470 AbstractCegarLoop]: Abstraction has 547 states and 767 transitions. [2022-02-20 18:21:59,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:59,503 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 767 transitions. [2022-02-20 18:21:59,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:21:59,504 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:21:59,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:21:59,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:21:59,504 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:21:59,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:21:59,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1302443578, now seen corresponding path program 1 times [2022-02-20 18:21:59,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:21:59,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268804506] [2022-02-20 18:21:59,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:21:59,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:21:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:59,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:21:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:59,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {13977#true} assume true; {13977#true} is VALID [2022-02-20 18:21:59,534 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {13977#true} {13977#true} #437#return; {13977#true} is VALID [2022-02-20 18:21:59,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:21:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:59,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {14020#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {13977#true} is VALID [2022-02-20 18:21:59,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {13977#true} assume !(0 == ~T1_E~0); {13977#true} is VALID [2022-02-20 18:21:59,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {13977#true} assume !(0 == ~T2_E~0); {13977#true} is VALID [2022-02-20 18:21:59,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {13977#true} assume !(0 == ~E_1~0); {13977#true} is VALID [2022-02-20 18:21:59,542 INFO L290 TraceCheckUtils]: 4: Hoare triple {13977#true} assume !(0 == ~E_2~0); {13977#true} is VALID [2022-02-20 18:21:59,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {13977#true} assume true; {13977#true} is VALID [2022-02-20 18:21:59,543 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {13977#true} {13977#true} #439#return; {13977#true} is VALID [2022-02-20 18:21:59,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:21:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:59,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {14021#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {13977#true} is VALID [2022-02-20 18:21:59,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {13977#true} assume !(1 == ~m_pc~0); {13977#true} is VALID [2022-02-20 18:21:59,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {13977#true} is_master_triggered_~__retres1~0#1 := 0; {13977#true} is VALID [2022-02-20 18:21:59,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {13977#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {13977#true} is VALID [2022-02-20 18:21:59,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {13977#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {13977#true} is VALID [2022-02-20 18:21:59,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {13977#true} assume !(0 != ~tmp~1#1); {13977#true} is VALID [2022-02-20 18:21:59,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {13977#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {13977#true} is VALID [2022-02-20 18:21:59,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {13977#true} assume !(1 == ~t1_pc~0); {13977#true} is VALID [2022-02-20 18:21:59,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {13977#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14022#(and (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0) (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|))} is VALID [2022-02-20 18:21:59,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {14022#(and (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0) (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|))} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {14023#(and (<= |activate_threads_is_transmit1_triggered_#res#1| 0) (<= 0 |activate_threads_is_transmit1_triggered_#res#1|))} is VALID [2022-02-20 18:21:59,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {14023#(and (<= |activate_threads_is_transmit1_triggered_#res#1| 0) (<= 0 |activate_threads_is_transmit1_triggered_#res#1|))} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {14024#(and (<= |activate_threads_~tmp___0~0#1| 0) (< 0 (+ |activate_threads_~tmp___0~0#1| 1)))} is VALID [2022-02-20 18:21:59,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {14024#(and (<= |activate_threads_~tmp___0~0#1| 0) (< 0 (+ |activate_threads_~tmp___0~0#1| 1)))} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {13978#false} is VALID [2022-02-20 18:21:59,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {13978#false} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {13978#false} is VALID [2022-02-20 18:21:59,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {13978#false} assume 1 == ~t2_pc~0; {13978#false} is VALID [2022-02-20 18:21:59,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {13978#false} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {13978#false} is VALID [2022-02-20 18:21:59,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {13978#false} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {13978#false} is VALID [2022-02-20 18:21:59,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {13978#false} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {13978#false} is VALID [2022-02-20 18:21:59,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {13978#false} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {13978#false} is VALID [2022-02-20 18:21:59,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {13978#false} assume true; {13978#false} is VALID [2022-02-20 18:21:59,591 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {13978#false} {13977#true} #441#return; {13978#false} is VALID [2022-02-20 18:21:59,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 18:21:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:59,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {14020#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {13977#true} is VALID [2022-02-20 18:21:59,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {13977#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {13977#true} is VALID [2022-02-20 18:21:59,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {13977#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {13977#true} is VALID [2022-02-20 18:21:59,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {13977#true} assume !(1 == ~E_1~0); {13977#true} is VALID [2022-02-20 18:21:59,595 INFO L290 TraceCheckUtils]: 4: Hoare triple {13977#true} assume 1 == ~E_2~0;~E_2~0 := 2; {13977#true} is VALID [2022-02-20 18:21:59,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {13977#true} assume true; {13977#true} is VALID [2022-02-20 18:21:59,595 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {13977#true} {13978#false} #443#return; {13978#false} is VALID [2022-02-20 18:21:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 18:21:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:21:59,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {13977#true} havoc ~__retres1~3; {13977#true} is VALID [2022-02-20 18:21:59,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {13977#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {13977#true} is VALID [2022-02-20 18:21:59,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {13977#true} #res := ~__retres1~3; {13977#true} is VALID [2022-02-20 18:21:59,598 INFO L290 TraceCheckUtils]: 3: Hoare triple {13977#true} assume true; {13977#true} is VALID [2022-02-20 18:21:59,598 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13977#true} {13978#false} #445#return; {13978#false} is VALID [2022-02-20 18:21:59,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {13977#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(21, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2; {13977#true} is VALID [2022-02-20 18:21:59,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {13977#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {13977#true} is VALID [2022-02-20 18:21:59,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {13977#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {13977#true} is VALID [2022-02-20 18:21:59,599 INFO L272 TraceCheckUtils]: 3: Hoare triple {13977#true} call update_channels(); {13977#true} is VALID [2022-02-20 18:21:59,599 INFO L290 TraceCheckUtils]: 4: Hoare triple {13977#true} assume true; {13977#true} is VALID [2022-02-20 18:21:59,599 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13977#true} {13977#true} #437#return; {13977#true} is VALID [2022-02-20 18:21:59,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {13977#true} assume { :begin_inline_init_threads } true; {13977#true} is VALID [2022-02-20 18:21:59,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {13977#true} assume 1 == ~m_i~0;~m_st~0 := 0; {13977#true} is VALID [2022-02-20 18:21:59,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {13977#true} assume 1 == ~t1_i~0;~t1_st~0 := 0; {13977#true} is VALID [2022-02-20 18:21:59,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {13977#true} assume 1 == ~t2_i~0;~t2_st~0 := 0; {13977#true} is VALID [2022-02-20 18:21:59,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {13977#true} assume { :end_inline_init_threads } true; {13977#true} is VALID [2022-02-20 18:21:59,600 INFO L272 TraceCheckUtils]: 11: Hoare triple {13977#true} call fire_delta_events(); {14020#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:21:59,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {14020#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {13977#true} is VALID [2022-02-20 18:21:59,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {13977#true} assume !(0 == ~T1_E~0); {13977#true} is VALID [2022-02-20 18:21:59,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {13977#true} assume !(0 == ~T2_E~0); {13977#true} is VALID [2022-02-20 18:21:59,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {13977#true} assume !(0 == ~E_1~0); {13977#true} is VALID [2022-02-20 18:21:59,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {13977#true} assume !(0 == ~E_2~0); {13977#true} is VALID [2022-02-20 18:21:59,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {13977#true} assume true; {13977#true} is VALID [2022-02-20 18:21:59,601 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13977#true} {13977#true} #439#return; {13977#true} is VALID [2022-02-20 18:21:59,601 INFO L272 TraceCheckUtils]: 19: Hoare triple {13977#true} call activate_threads(); {14021#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:21:59,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {14021#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {13977#true} is VALID [2022-02-20 18:21:59,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {13977#true} assume !(1 == ~m_pc~0); {13977#true} is VALID [2022-02-20 18:21:59,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {13977#true} is_master_triggered_~__retres1~0#1 := 0; {13977#true} is VALID [2022-02-20 18:21:59,602 INFO L290 TraceCheckUtils]: 23: Hoare triple {13977#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {13977#true} is VALID [2022-02-20 18:21:59,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {13977#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {13977#true} is VALID [2022-02-20 18:21:59,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {13977#true} assume !(0 != ~tmp~1#1); {13977#true} is VALID [2022-02-20 18:21:59,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {13977#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {13977#true} is VALID [2022-02-20 18:21:59,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {13977#true} assume !(1 == ~t1_pc~0); {13977#true} is VALID [2022-02-20 18:21:59,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {13977#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14022#(and (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0) (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|))} is VALID [2022-02-20 18:21:59,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {14022#(and (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0) (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|))} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {14023#(and (<= |activate_threads_is_transmit1_triggered_#res#1| 0) (<= 0 |activate_threads_is_transmit1_triggered_#res#1|))} is VALID [2022-02-20 18:21:59,603 INFO L290 TraceCheckUtils]: 30: Hoare triple {14023#(and (<= |activate_threads_is_transmit1_triggered_#res#1| 0) (<= 0 |activate_threads_is_transmit1_triggered_#res#1|))} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {14024#(and (<= |activate_threads_~tmp___0~0#1| 0) (< 0 (+ |activate_threads_~tmp___0~0#1| 1)))} is VALID [2022-02-20 18:21:59,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {14024#(and (<= |activate_threads_~tmp___0~0#1| 0) (< 0 (+ |activate_threads_~tmp___0~0#1| 1)))} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {13978#false} is VALID [2022-02-20 18:21:59,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {13978#false} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {13978#false} is VALID [2022-02-20 18:21:59,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {13978#false} assume 1 == ~t2_pc~0; {13978#false} is VALID [2022-02-20 18:21:59,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {13978#false} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {13978#false} is VALID [2022-02-20 18:21:59,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {13978#false} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {13978#false} is VALID [2022-02-20 18:21:59,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {13978#false} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {13978#false} is VALID [2022-02-20 18:21:59,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {13978#false} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {13978#false} is VALID [2022-02-20 18:21:59,605 INFO L290 TraceCheckUtils]: 38: Hoare triple {13978#false} assume true; {13978#false} is VALID [2022-02-20 18:21:59,605 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13978#false} {13977#true} #441#return; {13978#false} is VALID [2022-02-20 18:21:59,605 INFO L272 TraceCheckUtils]: 40: Hoare triple {13978#false} call reset_delta_events(); {14020#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:21:59,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {14020#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {13977#true} is VALID [2022-02-20 18:21:59,605 INFO L290 TraceCheckUtils]: 42: Hoare triple {13977#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {13977#true} is VALID [2022-02-20 18:21:59,605 INFO L290 TraceCheckUtils]: 43: Hoare triple {13977#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {13977#true} is VALID [2022-02-20 18:21:59,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {13977#true} assume !(1 == ~E_1~0); {13977#true} is VALID [2022-02-20 18:21:59,605 INFO L290 TraceCheckUtils]: 45: Hoare triple {13977#true} assume 1 == ~E_2~0;~E_2~0 := 2; {13977#true} is VALID [2022-02-20 18:21:59,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {13977#true} assume true; {13977#true} is VALID [2022-02-20 18:21:59,606 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13977#true} {13978#false} #443#return; {13978#false} is VALID [2022-02-20 18:21:59,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {13978#false} assume !false; {13978#false} is VALID [2022-02-20 18:21:59,606 INFO L290 TraceCheckUtils]: 49: Hoare triple {13978#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {13978#false} is VALID [2022-02-20 18:21:59,606 INFO L290 TraceCheckUtils]: 50: Hoare triple {13978#false} assume !false; {13978#false} is VALID [2022-02-20 18:21:59,606 INFO L272 TraceCheckUtils]: 51: Hoare triple {13978#false} call eval_#t~ret4#1 := exists_runnable_thread(); {13977#true} is VALID [2022-02-20 18:21:59,606 INFO L290 TraceCheckUtils]: 52: Hoare triple {13977#true} havoc ~__retres1~3; {13977#true} is VALID [2022-02-20 18:21:59,606 INFO L290 TraceCheckUtils]: 53: Hoare triple {13977#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {13977#true} is VALID [2022-02-20 18:21:59,607 INFO L290 TraceCheckUtils]: 54: Hoare triple {13977#true} #res := ~__retres1~3; {13977#true} is VALID [2022-02-20 18:21:59,607 INFO L290 TraceCheckUtils]: 55: Hoare triple {13977#true} assume true; {13977#true} is VALID [2022-02-20 18:21:59,607 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13977#true} {13978#false} #445#return; {13978#false} is VALID [2022-02-20 18:21:59,607 INFO L290 TraceCheckUtils]: 57: Hoare triple {13978#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {13978#false} is VALID [2022-02-20 18:21:59,607 INFO L290 TraceCheckUtils]: 58: Hoare triple {13978#false} assume 0 != eval_~tmp~0#1; {13978#false} is VALID [2022-02-20 18:21:59,607 INFO L290 TraceCheckUtils]: 59: Hoare triple {13978#false} assume !(0 == ~m_st~0); {13978#false} is VALID [2022-02-20 18:21:59,607 INFO L290 TraceCheckUtils]: 60: Hoare triple {13978#false} assume !(0 == ~t1_st~0); {13978#false} is VALID [2022-02-20 18:21:59,607 INFO L290 TraceCheckUtils]: 61: Hoare triple {13978#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {13978#false} is VALID [2022-02-20 18:21:59,607 INFO L290 TraceCheckUtils]: 62: Hoare triple {13978#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {13978#false} is VALID [2022-02-20 18:21:59,608 INFO L290 TraceCheckUtils]: 63: Hoare triple {13978#false} assume !(0 == ~t2_pc~0); {13978#false} is VALID [2022-02-20 18:21:59,608 INFO L290 TraceCheckUtils]: 64: Hoare triple {13978#false} assume 1 == ~t2_pc~0; {13978#false} is VALID [2022-02-20 18:21:59,608 INFO L290 TraceCheckUtils]: 65: Hoare triple {13978#false} assume { :begin_inline_error } true; {13978#false} is VALID [2022-02-20 18:21:59,608 INFO L290 TraceCheckUtils]: 66: Hoare triple {13978#false} assume !false; {13978#false} is VALID [2022-02-20 18:21:59,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 18:21:59,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:21:59,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268804506] [2022-02-20 18:21:59,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268804506] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:21:59,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:21:59,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:21:59,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768820362] [2022-02-20 18:21:59,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:21:59,610 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-02-20 18:21:59,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:21:59,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:21:59,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:21:59,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:21:59,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:21:59,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:21:59,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:21:59,648 INFO L87 Difference]: Start difference. First operand 547 states and 767 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:01,133 INFO L93 Difference]: Finished difference Result 1269 states and 1814 transitions. [2022-02-20 18:22:01,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:22:01,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-02-20 18:22:01,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:22:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 440 transitions. [2022-02-20 18:22:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 440 transitions. [2022-02-20 18:22:01,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 440 transitions. [2022-02-20 18:22:01,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:22:01,480 INFO L225 Difference]: With dead ends: 1269 [2022-02-20 18:22:01,481 INFO L226 Difference]: Without dead ends: 733 [2022-02-20 18:22:01,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-02-20 18:22:01,483 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 254 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:22:01,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 569 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:22:01,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2022-02-20 18:22:01,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 562. [2022-02-20 18:22:01,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:22:01,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 733 states. Second operand has 562 states, 474 states have (on average 1.3987341772151898) internal successors, (663), 479 states have internal predecessors, (663), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 18:22:01,634 INFO L74 IsIncluded]: Start isIncluded. First operand 733 states. Second operand has 562 states, 474 states have (on average 1.3987341772151898) internal successors, (663), 479 states have internal predecessors, (663), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 18:22:01,635 INFO L87 Difference]: Start difference. First operand 733 states. Second operand has 562 states, 474 states have (on average 1.3987341772151898) internal successors, (663), 479 states have internal predecessors, (663), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 18:22:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:01,655 INFO L93 Difference]: Finished difference Result 733 states and 1037 transitions. [2022-02-20 18:22:01,655 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1037 transitions. [2022-02-20 18:22:01,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:22:01,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:22:01,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 562 states, 474 states have (on average 1.3987341772151898) internal successors, (663), 479 states have internal predecessors, (663), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) Second operand 733 states. [2022-02-20 18:22:01,660 INFO L87 Difference]: Start difference. First operand has 562 states, 474 states have (on average 1.3987341772151898) internal successors, (663), 479 states have internal predecessors, (663), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) Second operand 733 states. [2022-02-20 18:22:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:01,682 INFO L93 Difference]: Finished difference Result 733 states and 1037 transitions. [2022-02-20 18:22:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1037 transitions. [2022-02-20 18:22:01,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:22:01,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:22:01,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:22:01,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:22:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 474 states have (on average 1.3987341772151898) internal successors, (663), 479 states have internal predecessors, (663), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 18:22:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 782 transitions. [2022-02-20 18:22:01,701 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 782 transitions. Word has length 67 [2022-02-20 18:22:01,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:22:01,702 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 782 transitions. [2022-02-20 18:22:01,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 782 transitions. [2022-02-20 18:22:01,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:22:01,706 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:22:01,707 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] [2022-02-20 18:22:01,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:22:01,707 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:22:01,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:22:01,707 INFO L85 PathProgramCache]: Analyzing trace with hash 908076792, now seen corresponding path program 1 times [2022-02-20 18:22:01,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:22:01,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545432774] [2022-02-20 18:22:01,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:22:01,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:22:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:01,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:22:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:01,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {17938#true} assume true; {17938#true} is VALID [2022-02-20 18:22:01,754 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {17938#true} {17940#(= ~m_pc~0 ~t2_pc~0)} #437#return; {17940#(= ~m_pc~0 ~t2_pc~0)} is VALID [2022-02-20 18:22:01,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:22:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:01,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {17982#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {17938#true} is VALID [2022-02-20 18:22:01,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {17938#true} assume !(0 == ~T1_E~0); {17938#true} is VALID [2022-02-20 18:22:01,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {17938#true} assume !(0 == ~T2_E~0); {17938#true} is VALID [2022-02-20 18:22:01,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {17938#true} assume !(0 == ~E_1~0); {17938#true} is VALID [2022-02-20 18:22:01,765 INFO L290 TraceCheckUtils]: 4: Hoare triple {17938#true} assume !(0 == ~E_2~0); {17938#true} is VALID [2022-02-20 18:22:01,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {17938#true} assume true; {17938#true} is VALID [2022-02-20 18:22:01,766 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {17938#true} {17940#(= ~m_pc~0 ~t2_pc~0)} #439#return; {17940#(= ~m_pc~0 ~t2_pc~0)} is VALID [2022-02-20 18:22:01,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:22:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:01,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {17983#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {17938#true} is VALID [2022-02-20 18:22:01,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {17938#true} assume !(1 == ~m_pc~0); {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_~__retres1~0#1 := 0; {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,834 INFO L290 TraceCheckUtils]: 4: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp~1#1); {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(1 == ~t1_pc~0); {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_transmit1_triggered_~__retres1~1#1 := 0; {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp___0~0#1); {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume 1 == ~t2_pc~0; {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} is VALID [2022-02-20 18:22:01,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} is VALID [2022-02-20 18:22:01,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} is VALID [2022-02-20 18:22:01,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} is VALID [2022-02-20 18:22:01,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} is VALID [2022-02-20 18:22:01,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} assume true; {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} is VALID [2022-02-20 18:22:01,839 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} {17940#(= ~m_pc~0 ~t2_pc~0)} #441#return; {17939#false} is VALID [2022-02-20 18:22:01,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 18:22:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:01,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {17982#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {17938#true} is VALID [2022-02-20 18:22:01,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {17938#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {17938#true} is VALID [2022-02-20 18:22:01,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {17938#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {17938#true} is VALID [2022-02-20 18:22:01,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {17938#true} assume !(1 == ~E_1~0); {17938#true} is VALID [2022-02-20 18:22:01,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {17938#true} assume 1 == ~E_2~0;~E_2~0 := 2; {17938#true} is VALID [2022-02-20 18:22:01,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {17938#true} assume true; {17938#true} is VALID [2022-02-20 18:22:01,845 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {17938#true} {17939#false} #443#return; {17939#false} is VALID [2022-02-20 18:22:01,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 18:22:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:01,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {17938#true} havoc ~__retres1~3; {17938#true} is VALID [2022-02-20 18:22:01,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {17938#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {17938#true} is VALID [2022-02-20 18:22:01,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {17938#true} #res := ~__retres1~3; {17938#true} is VALID [2022-02-20 18:22:01,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {17938#true} assume true; {17938#true} is VALID [2022-02-20 18:22:01,848 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17938#true} {17939#false} #445#return; {17939#false} is VALID [2022-02-20 18:22:01,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {17938#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(21, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2; {17940#(= ~m_pc~0 ~t2_pc~0)} is VALID [2022-02-20 18:22:01,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {17940#(= ~m_pc~0 ~t2_pc~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {17940#(= ~m_pc~0 ~t2_pc~0)} is VALID [2022-02-20 18:22:01,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {17940#(= ~m_pc~0 ~t2_pc~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {17940#(= ~m_pc~0 ~t2_pc~0)} is VALID [2022-02-20 18:22:01,849 INFO L272 TraceCheckUtils]: 3: Hoare triple {17940#(= ~m_pc~0 ~t2_pc~0)} call update_channels(); {17938#true} is VALID [2022-02-20 18:22:01,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {17938#true} assume true; {17938#true} is VALID [2022-02-20 18:22:01,856 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17938#true} {17940#(= ~m_pc~0 ~t2_pc~0)} #437#return; {17940#(= ~m_pc~0 ~t2_pc~0)} is VALID [2022-02-20 18:22:01,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {17940#(= ~m_pc~0 ~t2_pc~0)} assume { :begin_inline_init_threads } true; {17940#(= ~m_pc~0 ~t2_pc~0)} is VALID [2022-02-20 18:22:01,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {17940#(= ~m_pc~0 ~t2_pc~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {17940#(= ~m_pc~0 ~t2_pc~0)} is VALID [2022-02-20 18:22:01,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {17940#(= ~m_pc~0 ~t2_pc~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {17940#(= ~m_pc~0 ~t2_pc~0)} is VALID [2022-02-20 18:22:01,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {17940#(= ~m_pc~0 ~t2_pc~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {17940#(= ~m_pc~0 ~t2_pc~0)} is VALID [2022-02-20 18:22:01,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {17940#(= ~m_pc~0 ~t2_pc~0)} assume { :end_inline_init_threads } true; {17940#(= ~m_pc~0 ~t2_pc~0)} is VALID [2022-02-20 18:22:01,858 INFO L272 TraceCheckUtils]: 11: Hoare triple {17940#(= ~m_pc~0 ~t2_pc~0)} call fire_delta_events(); {17982#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:01,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {17982#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {17938#true} is VALID [2022-02-20 18:22:01,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {17938#true} assume !(0 == ~T1_E~0); {17938#true} is VALID [2022-02-20 18:22:01,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {17938#true} assume !(0 == ~T2_E~0); {17938#true} is VALID [2022-02-20 18:22:01,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {17938#true} assume !(0 == ~E_1~0); {17938#true} is VALID [2022-02-20 18:22:01,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {17938#true} assume !(0 == ~E_2~0); {17938#true} is VALID [2022-02-20 18:22:01,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {17938#true} assume true; {17938#true} is VALID [2022-02-20 18:22:01,859 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17938#true} {17940#(= ~m_pc~0 ~t2_pc~0)} #439#return; {17940#(= ~m_pc~0 ~t2_pc~0)} is VALID [2022-02-20 18:22:01,859 INFO L272 TraceCheckUtils]: 19: Hoare triple {17940#(= ~m_pc~0 ~t2_pc~0)} call activate_threads(); {17983#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:22:01,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {17983#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {17938#true} is VALID [2022-02-20 18:22:01,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {17938#true} assume !(1 == ~m_pc~0); {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_~__retres1~0#1 := 0; {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp~1#1); {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(1 == ~t1_pc~0); {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_transmit1_triggered_~__retres1~1#1 := 0; {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,862 INFO L290 TraceCheckUtils]: 31: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp___0~0#1); {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 18:22:01,863 INFO L290 TraceCheckUtils]: 33: Hoare triple {17984#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume 1 == ~t2_pc~0; {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} is VALID [2022-02-20 18:22:01,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} is VALID [2022-02-20 18:22:01,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} is VALID [2022-02-20 18:22:01,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} is VALID [2022-02-20 18:22:01,865 INFO L290 TraceCheckUtils]: 37: Hoare triple {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} is VALID [2022-02-20 18:22:01,865 INFO L290 TraceCheckUtils]: 38: Hoare triple {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} assume true; {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} is VALID [2022-02-20 18:22:01,866 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17985#(and (or (not (<= ~m_pc~0 0)) (<= 1 ~t2_pc~0)) (or (<= ~m_pc~0 0) (and (not (<= ~m_pc~0 1)) (<= ~t2_pc~0 1))))} {17940#(= ~m_pc~0 ~t2_pc~0)} #441#return; {17939#false} is VALID [2022-02-20 18:22:01,866 INFO L272 TraceCheckUtils]: 40: Hoare triple {17939#false} call reset_delta_events(); {17982#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:01,866 INFO L290 TraceCheckUtils]: 41: Hoare triple {17982#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {17938#true} is VALID [2022-02-20 18:22:01,866 INFO L290 TraceCheckUtils]: 42: Hoare triple {17938#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {17938#true} is VALID [2022-02-20 18:22:01,866 INFO L290 TraceCheckUtils]: 43: Hoare triple {17938#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {17938#true} is VALID [2022-02-20 18:22:01,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {17938#true} assume !(1 == ~E_1~0); {17938#true} is VALID [2022-02-20 18:22:01,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {17938#true} assume 1 == ~E_2~0;~E_2~0 := 2; {17938#true} is VALID [2022-02-20 18:22:01,867 INFO L290 TraceCheckUtils]: 46: Hoare triple {17938#true} assume true; {17938#true} is VALID [2022-02-20 18:22:01,867 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17938#true} {17939#false} #443#return; {17939#false} is VALID [2022-02-20 18:22:01,867 INFO L290 TraceCheckUtils]: 48: Hoare triple {17939#false} assume !false; {17939#false} is VALID [2022-02-20 18:22:01,867 INFO L290 TraceCheckUtils]: 49: Hoare triple {17939#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {17939#false} is VALID [2022-02-20 18:22:01,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {17939#false} assume !false; {17939#false} is VALID [2022-02-20 18:22:01,867 INFO L272 TraceCheckUtils]: 51: Hoare triple {17939#false} call eval_#t~ret4#1 := exists_runnable_thread(); {17938#true} is VALID [2022-02-20 18:22:01,868 INFO L290 TraceCheckUtils]: 52: Hoare triple {17938#true} havoc ~__retres1~3; {17938#true} is VALID [2022-02-20 18:22:01,868 INFO L290 TraceCheckUtils]: 53: Hoare triple {17938#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {17938#true} is VALID [2022-02-20 18:22:01,868 INFO L290 TraceCheckUtils]: 54: Hoare triple {17938#true} #res := ~__retres1~3; {17938#true} is VALID [2022-02-20 18:22:01,868 INFO L290 TraceCheckUtils]: 55: Hoare triple {17938#true} assume true; {17938#true} is VALID [2022-02-20 18:22:01,868 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {17938#true} {17939#false} #445#return; {17939#false} is VALID [2022-02-20 18:22:01,868 INFO L290 TraceCheckUtils]: 57: Hoare triple {17939#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {17939#false} is VALID [2022-02-20 18:22:01,868 INFO L290 TraceCheckUtils]: 58: Hoare triple {17939#false} assume 0 != eval_~tmp~0#1; {17939#false} is VALID [2022-02-20 18:22:01,868 INFO L290 TraceCheckUtils]: 59: Hoare triple {17939#false} assume !(0 == ~m_st~0); {17939#false} is VALID [2022-02-20 18:22:01,868 INFO L290 TraceCheckUtils]: 60: Hoare triple {17939#false} assume !(0 == ~t1_st~0); {17939#false} is VALID [2022-02-20 18:22:01,869 INFO L290 TraceCheckUtils]: 61: Hoare triple {17939#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {17939#false} is VALID [2022-02-20 18:22:01,869 INFO L290 TraceCheckUtils]: 62: Hoare triple {17939#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {17939#false} is VALID [2022-02-20 18:22:01,869 INFO L290 TraceCheckUtils]: 63: Hoare triple {17939#false} assume !(0 == ~t2_pc~0); {17939#false} is VALID [2022-02-20 18:22:01,869 INFO L290 TraceCheckUtils]: 64: Hoare triple {17939#false} assume 1 == ~t2_pc~0; {17939#false} is VALID [2022-02-20 18:22:01,869 INFO L290 TraceCheckUtils]: 65: Hoare triple {17939#false} assume { :begin_inline_error } true; {17939#false} is VALID [2022-02-20 18:22:01,869 INFO L290 TraceCheckUtils]: 66: Hoare triple {17939#false} assume !false; {17939#false} is VALID [2022-02-20 18:22:01,870 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 18:22:01,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:22:01,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545432774] [2022-02-20 18:22:01,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545432774] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:22:01,870 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:22:01,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:22:01,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569200233] [2022-02-20 18:22:01,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:22:01,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-02-20 18:22:01,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:22:01,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:01,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:22:01,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:22:01,912 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:22:01,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:22:01,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:22:01,913 INFO L87 Difference]: Start difference. First operand 562 states and 782 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:06,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:06,389 INFO L93 Difference]: Finished difference Result 2996 states and 4324 transitions. [2022-02-20 18:22:06,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 18:22:06,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-02-20 18:22:06,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:22:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 967 transitions. [2022-02-20 18:22:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 967 transitions. [2022-02-20 18:22:06,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 967 transitions. [2022-02-20 18:22:07,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 967 edges. 967 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:22:07,429 INFO L225 Difference]: With dead ends: 2996 [2022-02-20 18:22:07,430 INFO L226 Difference]: Without dead ends: 2445 [2022-02-20 18:22:07,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:22:07,432 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 895 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:22:07,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [915 Valid, 879 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 18:22:07,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2022-02-20 18:22:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 1559. [2022-02-20 18:22:08,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:22:08,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2445 states. Second operand has 1559 states, 1314 states have (on average 1.3987823439878235) internal successors, (1838), 1332 states have internal predecessors, (1838), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-02-20 18:22:08,517 INFO L74 IsIncluded]: Start isIncluded. First operand 2445 states. Second operand has 1559 states, 1314 states have (on average 1.3987823439878235) internal successors, (1838), 1332 states have internal predecessors, (1838), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-02-20 18:22:08,520 INFO L87 Difference]: Start difference. First operand 2445 states. Second operand has 1559 states, 1314 states have (on average 1.3987823439878235) internal successors, (1838), 1332 states have internal predecessors, (1838), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-02-20 18:22:08,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:08,684 INFO L93 Difference]: Finished difference Result 2445 states and 3455 transitions. [2022-02-20 18:22:08,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3455 transitions. [2022-02-20 18:22:08,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:22:08,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:22:08,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 1559 states, 1314 states have (on average 1.3987823439878235) internal successors, (1838), 1332 states have internal predecessors, (1838), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) Second operand 2445 states. [2022-02-20 18:22:08,704 INFO L87 Difference]: Start difference. First operand has 1559 states, 1314 states have (on average 1.3987823439878235) internal successors, (1838), 1332 states have internal predecessors, (1838), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) Second operand 2445 states. [2022-02-20 18:22:08,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:08,884 INFO L93 Difference]: Finished difference Result 2445 states and 3455 transitions. [2022-02-20 18:22:08,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3455 transitions. [2022-02-20 18:22:08,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:22:08,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:22:08,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:22:08,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:22:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1314 states have (on average 1.3987823439878235) internal successors, (1838), 1332 states have internal predecessors, (1838), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-02-20 18:22:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2171 transitions. [2022-02-20 18:22:09,008 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2171 transitions. Word has length 67 [2022-02-20 18:22:09,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:22:09,008 INFO L470 AbstractCegarLoop]: Abstraction has 1559 states and 2171 transitions. [2022-02-20 18:22:09,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2171 transitions. [2022-02-20 18:22:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-20 18:22:09,011 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:22:09,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:22:09,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:22:09,011 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:22:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:22:09,020 INFO L85 PathProgramCache]: Analyzing trace with hash 918077039, now seen corresponding path program 1 times [2022-02-20 18:22:09,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:22:09,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645072518] [2022-02-20 18:22:09,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:22:09,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:22:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:09,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:22:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:09,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {28930#true} assume true; {28930#true} is VALID [2022-02-20 18:22:09,051 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {28930#true} {28930#true} #437#return; {28930#true} is VALID [2022-02-20 18:22:09,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:22:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:09,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {28978#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {28930#true} is VALID [2022-02-20 18:22:09,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {28930#true} assume !(0 == ~T1_E~0); {28930#true} is VALID [2022-02-20 18:22:09,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {28930#true} assume !(0 == ~T2_E~0); {28930#true} is VALID [2022-02-20 18:22:09,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {28930#true} assume !(0 == ~E_1~0); {28930#true} is VALID [2022-02-20 18:22:09,063 INFO L290 TraceCheckUtils]: 4: Hoare triple {28930#true} assume !(0 == ~E_2~0); {28930#true} is VALID [2022-02-20 18:22:09,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {28930#true} assume true; {28930#true} is VALID [2022-02-20 18:22:09,063 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28930#true} {28930#true} #439#return; {28930#true} is VALID [2022-02-20 18:22:09,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:22:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:09,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {28979#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {28930#true} is VALID [2022-02-20 18:22:09,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {28930#true} assume !(1 == ~m_pc~0); {28930#true} is VALID [2022-02-20 18:22:09,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {28930#true} is_master_triggered_~__retres1~0#1 := 0; {28930#true} is VALID [2022-02-20 18:22:09,115 INFO L290 TraceCheckUtils]: 3: Hoare triple {28930#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {28930#true} is VALID [2022-02-20 18:22:09,115 INFO L290 TraceCheckUtils]: 4: Hoare triple {28930#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {28930#true} is VALID [2022-02-20 18:22:09,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {28930#true} assume !(0 != ~tmp~1#1); {28930#true} is VALID [2022-02-20 18:22:09,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {28930#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {28930#true} is VALID [2022-02-20 18:22:09,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {28930#true} assume !(1 == ~t1_pc~0); {28930#true} is VALID [2022-02-20 18:22:09,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {28930#true} is_transmit1_triggered_~__retres1~1#1 := 0; {28930#true} is VALID [2022-02-20 18:22:09,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {28930#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {28930#true} is VALID [2022-02-20 18:22:09,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {28930#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {28930#true} is VALID [2022-02-20 18:22:09,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {28930#true} assume !(0 != ~tmp___0~0#1); {28930#true} is VALID [2022-02-20 18:22:09,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {28930#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {28930#true} is VALID [2022-02-20 18:22:09,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {28930#true} assume !(1 == ~t2_pc~0); {28930#true} is VALID [2022-02-20 18:22:09,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {28930#true} is_transmit2_triggered_~__retres1~2#1 := 0; {28980#(and (<= |activate_threads_is_transmit2_triggered_~__retres1~2#1| 0) (<= 0 |activate_threads_is_transmit2_triggered_~__retres1~2#1|))} is VALID [2022-02-20 18:22:09,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {28980#(and (<= |activate_threads_is_transmit2_triggered_~__retres1~2#1| 0) (<= 0 |activate_threads_is_transmit2_triggered_~__retres1~2#1|))} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {28981#(and (<= 0 |activate_threads_is_transmit2_triggered_#res#1|) (<= |activate_threads_is_transmit2_triggered_#res#1| 0))} is VALID [2022-02-20 18:22:09,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {28981#(and (<= 0 |activate_threads_is_transmit2_triggered_#res#1|) (<= |activate_threads_is_transmit2_triggered_#res#1| 0))} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {28982#(and (<= |activate_threads_~tmp___1~0#1| 0) (< 0 (+ |activate_threads_~tmp___1~0#1| 1)))} is VALID [2022-02-20 18:22:09,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {28982#(and (<= |activate_threads_~tmp___1~0#1| 0) (< 0 (+ |activate_threads_~tmp___1~0#1| 1)))} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {28931#false} is VALID [2022-02-20 18:22:09,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {28931#false} assume true; {28931#false} is VALID [2022-02-20 18:22:09,118 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {28931#false} {28930#true} #441#return; {28931#false} is VALID [2022-02-20 18:22:09,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 18:22:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:09,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {28978#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {28930#true} is VALID [2022-02-20 18:22:09,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {28930#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {28930#true} is VALID [2022-02-20 18:22:09,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {28930#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {28930#true} is VALID [2022-02-20 18:22:09,123 INFO L290 TraceCheckUtils]: 3: Hoare triple {28930#true} assume !(1 == ~E_1~0); {28930#true} is VALID [2022-02-20 18:22:09,123 INFO L290 TraceCheckUtils]: 4: Hoare triple {28930#true} assume 1 == ~E_2~0;~E_2~0 := 2; {28930#true} is VALID [2022-02-20 18:22:09,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {28930#true} assume true; {28930#true} is VALID [2022-02-20 18:22:09,123 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28930#true} {28931#false} #443#return; {28931#false} is VALID [2022-02-20 18:22:09,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 18:22:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:09,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {28930#true} havoc ~__retres1~3; {28930#true} is VALID [2022-02-20 18:22:09,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {28930#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {28930#true} is VALID [2022-02-20 18:22:09,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {28930#true} #res := ~__retres1~3; {28930#true} is VALID [2022-02-20 18:22:09,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {28930#true} assume true; {28930#true} is VALID [2022-02-20 18:22:09,127 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28930#true} {28931#false} #445#return; {28931#false} is VALID [2022-02-20 18:22:09,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 18:22:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:09,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {28930#true} havoc ~__retres1~3; {28930#true} is VALID [2022-02-20 18:22:09,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {28930#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {28930#true} is VALID [2022-02-20 18:22:09,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {28930#true} #res := ~__retres1~3; {28930#true} is VALID [2022-02-20 18:22:09,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {28930#true} assume true; {28930#true} is VALID [2022-02-20 18:22:09,133 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28930#true} {28931#false} #445#return; {28931#false} is VALID [2022-02-20 18:22:09,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {28930#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(21, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2; {28930#true} is VALID [2022-02-20 18:22:09,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {28930#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {28930#true} is VALID [2022-02-20 18:22:09,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {28930#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {28930#true} is VALID [2022-02-20 18:22:09,133 INFO L272 TraceCheckUtils]: 3: Hoare triple {28930#true} call update_channels(); {28930#true} is VALID [2022-02-20 18:22:09,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {28930#true} assume true; {28930#true} is VALID [2022-02-20 18:22:09,133 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28930#true} {28930#true} #437#return; {28930#true} is VALID [2022-02-20 18:22:09,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {28930#true} assume { :begin_inline_init_threads } true; {28930#true} is VALID [2022-02-20 18:22:09,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {28930#true} assume 1 == ~m_i~0;~m_st~0 := 0; {28930#true} is VALID [2022-02-20 18:22:09,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {28930#true} assume 1 == ~t1_i~0;~t1_st~0 := 0; {28930#true} is VALID [2022-02-20 18:22:09,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {28930#true} assume 1 == ~t2_i~0;~t2_st~0 := 0; {28930#true} is VALID [2022-02-20 18:22:09,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {28930#true} assume { :end_inline_init_threads } true; {28930#true} is VALID [2022-02-20 18:22:09,135 INFO L272 TraceCheckUtils]: 11: Hoare triple {28930#true} call fire_delta_events(); {28978#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:09,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {28978#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {28930#true} is VALID [2022-02-20 18:22:09,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {28930#true} assume !(0 == ~T1_E~0); {28930#true} is VALID [2022-02-20 18:22:09,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {28930#true} assume !(0 == ~T2_E~0); {28930#true} is VALID [2022-02-20 18:22:09,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {28930#true} assume !(0 == ~E_1~0); {28930#true} is VALID [2022-02-20 18:22:09,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {28930#true} assume !(0 == ~E_2~0); {28930#true} is VALID [2022-02-20 18:22:09,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {28930#true} assume true; {28930#true} is VALID [2022-02-20 18:22:09,136 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {28930#true} {28930#true} #439#return; {28930#true} is VALID [2022-02-20 18:22:09,136 INFO L272 TraceCheckUtils]: 19: Hoare triple {28930#true} call activate_threads(); {28979#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:22:09,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {28979#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {28930#true} is VALID [2022-02-20 18:22:09,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {28930#true} assume !(1 == ~m_pc~0); {28930#true} is VALID [2022-02-20 18:22:09,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {28930#true} is_master_triggered_~__retres1~0#1 := 0; {28930#true} is VALID [2022-02-20 18:22:09,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {28930#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {28930#true} is VALID [2022-02-20 18:22:09,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {28930#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {28930#true} is VALID [2022-02-20 18:22:09,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {28930#true} assume !(0 != ~tmp~1#1); {28930#true} is VALID [2022-02-20 18:22:09,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {28930#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {28930#true} is VALID [2022-02-20 18:22:09,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {28930#true} assume !(1 == ~t1_pc~0); {28930#true} is VALID [2022-02-20 18:22:09,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {28930#true} is_transmit1_triggered_~__retres1~1#1 := 0; {28930#true} is VALID [2022-02-20 18:22:09,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {28930#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {28930#true} is VALID [2022-02-20 18:22:09,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {28930#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {28930#true} is VALID [2022-02-20 18:22:09,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {28930#true} assume !(0 != ~tmp___0~0#1); {28930#true} is VALID [2022-02-20 18:22:09,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {28930#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {28930#true} is VALID [2022-02-20 18:22:09,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {28930#true} assume !(1 == ~t2_pc~0); {28930#true} is VALID [2022-02-20 18:22:09,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {28930#true} is_transmit2_triggered_~__retres1~2#1 := 0; {28980#(and (<= |activate_threads_is_transmit2_triggered_~__retres1~2#1| 0) (<= 0 |activate_threads_is_transmit2_triggered_~__retres1~2#1|))} is VALID [2022-02-20 18:22:09,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {28980#(and (<= |activate_threads_is_transmit2_triggered_~__retres1~2#1| 0) (<= 0 |activate_threads_is_transmit2_triggered_~__retres1~2#1|))} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {28981#(and (<= 0 |activate_threads_is_transmit2_triggered_#res#1|) (<= |activate_threads_is_transmit2_triggered_#res#1| 0))} is VALID [2022-02-20 18:22:09,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {28981#(and (<= 0 |activate_threads_is_transmit2_triggered_#res#1|) (<= |activate_threads_is_transmit2_triggered_#res#1| 0))} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {28982#(and (<= |activate_threads_~tmp___1~0#1| 0) (< 0 (+ |activate_threads_~tmp___1~0#1| 1)))} is VALID [2022-02-20 18:22:09,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {28982#(and (<= |activate_threads_~tmp___1~0#1| 0) (< 0 (+ |activate_threads_~tmp___1~0#1| 1)))} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {28931#false} is VALID [2022-02-20 18:22:09,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {28931#false} assume true; {28931#false} is VALID [2022-02-20 18:22:09,140 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28931#false} {28930#true} #441#return; {28931#false} is VALID [2022-02-20 18:22:09,140 INFO L272 TraceCheckUtils]: 40: Hoare triple {28931#false} call reset_delta_events(); {28978#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:09,141 INFO L290 TraceCheckUtils]: 41: Hoare triple {28978#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {28930#true} is VALID [2022-02-20 18:22:09,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {28930#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {28930#true} is VALID [2022-02-20 18:22:09,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {28930#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {28930#true} is VALID [2022-02-20 18:22:09,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {28930#true} assume !(1 == ~E_1~0); {28930#true} is VALID [2022-02-20 18:22:09,141 INFO L290 TraceCheckUtils]: 45: Hoare triple {28930#true} assume 1 == ~E_2~0;~E_2~0 := 2; {28930#true} is VALID [2022-02-20 18:22:09,141 INFO L290 TraceCheckUtils]: 46: Hoare triple {28930#true} assume true; {28930#true} is VALID [2022-02-20 18:22:09,141 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28930#true} {28931#false} #443#return; {28931#false} is VALID [2022-02-20 18:22:09,142 INFO L290 TraceCheckUtils]: 48: Hoare triple {28931#false} assume !false; {28931#false} is VALID [2022-02-20 18:22:09,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {28931#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {28931#false} is VALID [2022-02-20 18:22:09,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {28931#false} assume !false; {28931#false} is VALID [2022-02-20 18:22:09,142 INFO L272 TraceCheckUtils]: 51: Hoare triple {28931#false} call eval_#t~ret4#1 := exists_runnable_thread(); {28930#true} is VALID [2022-02-20 18:22:09,142 INFO L290 TraceCheckUtils]: 52: Hoare triple {28930#true} havoc ~__retres1~3; {28930#true} is VALID [2022-02-20 18:22:09,142 INFO L290 TraceCheckUtils]: 53: Hoare triple {28930#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {28930#true} is VALID [2022-02-20 18:22:09,142 INFO L290 TraceCheckUtils]: 54: Hoare triple {28930#true} #res := ~__retres1~3; {28930#true} is VALID [2022-02-20 18:22:09,143 INFO L290 TraceCheckUtils]: 55: Hoare triple {28930#true} assume true; {28930#true} is VALID [2022-02-20 18:22:09,143 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {28930#true} {28931#false} #445#return; {28931#false} is VALID [2022-02-20 18:22:09,143 INFO L290 TraceCheckUtils]: 57: Hoare triple {28931#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {28931#false} is VALID [2022-02-20 18:22:09,143 INFO L290 TraceCheckUtils]: 58: Hoare triple {28931#false} assume 0 != eval_~tmp~0#1; {28931#false} is VALID [2022-02-20 18:22:09,143 INFO L290 TraceCheckUtils]: 59: Hoare triple {28931#false} assume !(0 == ~m_st~0); {28931#false} is VALID [2022-02-20 18:22:09,143 INFO L290 TraceCheckUtils]: 60: Hoare triple {28931#false} assume !(0 == ~t1_st~0); {28931#false} is VALID [2022-02-20 18:22:09,143 INFO L290 TraceCheckUtils]: 61: Hoare triple {28931#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {28931#false} is VALID [2022-02-20 18:22:09,144 INFO L290 TraceCheckUtils]: 62: Hoare triple {28931#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {28931#false} is VALID [2022-02-20 18:22:09,144 INFO L290 TraceCheckUtils]: 63: Hoare triple {28931#false} assume 0 == ~t2_pc~0; {28931#false} is VALID [2022-02-20 18:22:09,144 INFO L290 TraceCheckUtils]: 64: Hoare triple {28931#false} assume !false; {28931#false} is VALID [2022-02-20 18:22:09,144 INFO L290 TraceCheckUtils]: 65: Hoare triple {28931#false} ~t2_pc~0 := 1;~t2_st~0 := 2; {28931#false} is VALID [2022-02-20 18:22:09,144 INFO L290 TraceCheckUtils]: 66: Hoare triple {28931#false} assume { :end_inline_transmit2 } true; {28931#false} is VALID [2022-02-20 18:22:09,144 INFO L290 TraceCheckUtils]: 67: Hoare triple {28931#false} assume !false; {28931#false} is VALID [2022-02-20 18:22:09,144 INFO L272 TraceCheckUtils]: 68: Hoare triple {28931#false} call eval_#t~ret4#1 := exists_runnable_thread(); {28930#true} is VALID [2022-02-20 18:22:09,145 INFO L290 TraceCheckUtils]: 69: Hoare triple {28930#true} havoc ~__retres1~3; {28930#true} is VALID [2022-02-20 18:22:09,145 INFO L290 TraceCheckUtils]: 70: Hoare triple {28930#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {28930#true} is VALID [2022-02-20 18:22:09,145 INFO L290 TraceCheckUtils]: 71: Hoare triple {28930#true} #res := ~__retres1~3; {28930#true} is VALID [2022-02-20 18:22:09,145 INFO L290 TraceCheckUtils]: 72: Hoare triple {28930#true} assume true; {28930#true} is VALID [2022-02-20 18:22:09,145 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {28930#true} {28931#false} #445#return; {28931#false} is VALID [2022-02-20 18:22:09,145 INFO L290 TraceCheckUtils]: 74: Hoare triple {28931#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {28931#false} is VALID [2022-02-20 18:22:09,145 INFO L290 TraceCheckUtils]: 75: Hoare triple {28931#false} assume 0 != eval_~tmp~0#1; {28931#false} is VALID [2022-02-20 18:22:09,146 INFO L290 TraceCheckUtils]: 76: Hoare triple {28931#false} assume !(0 == ~m_st~0); {28931#false} is VALID [2022-02-20 18:22:09,146 INFO L290 TraceCheckUtils]: 77: Hoare triple {28931#false} assume !(0 == ~t1_st~0); {28931#false} is VALID [2022-02-20 18:22:09,146 INFO L290 TraceCheckUtils]: 78: Hoare triple {28931#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {28931#false} is VALID [2022-02-20 18:22:09,146 INFO L290 TraceCheckUtils]: 79: Hoare triple {28931#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {28931#false} is VALID [2022-02-20 18:22:09,146 INFO L290 TraceCheckUtils]: 80: Hoare triple {28931#false} assume !(0 == ~t2_pc~0); {28931#false} is VALID [2022-02-20 18:22:09,146 INFO L290 TraceCheckUtils]: 81: Hoare triple {28931#false} assume 1 == ~t2_pc~0; {28931#false} is VALID [2022-02-20 18:22:09,146 INFO L290 TraceCheckUtils]: 82: Hoare triple {28931#false} assume { :begin_inline_error } true; {28931#false} is VALID [2022-02-20 18:22:09,147 INFO L290 TraceCheckUtils]: 83: Hoare triple {28931#false} assume !false; {28931#false} is VALID [2022-02-20 18:22:09,147 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 18:22:09,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:22:09,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645072518] [2022-02-20 18:22:09,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645072518] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:22:09,148 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:22:09,148 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:22:09,148 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248631113] [2022-02-20 18:22:09,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:22:09,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-02-20 18:22:09,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:22:09,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:09,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:22:09,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:22:09,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:22:09,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:22:09,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:22:09,191 INFO L87 Difference]: Start difference. First operand 1559 states and 2171 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:11,998 INFO L93 Difference]: Finished difference Result 3474 states and 4944 transitions. [2022-02-20 18:22:11,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:22:11,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-02-20 18:22:11,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:22:11,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:12,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 407 transitions. [2022-02-20 18:22:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:12,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 407 transitions. [2022-02-20 18:22:12,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 407 transitions. [2022-02-20 18:22:12,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:22:12,340 INFO L225 Difference]: With dead ends: 3474 [2022-02-20 18:22:12,341 INFO L226 Difference]: Without dead ends: 1926 [2022-02-20 18:22:12,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-02-20 18:22:12,344 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 171 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:22:12,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 569 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:22:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2022-02-20 18:22:13,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1589. [2022-02-20 18:22:13,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:22:13,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1926 states. Second operand has 1589 states, 1344 states have (on average 1.3861607142857142) internal successors, (1863), 1362 states have internal predecessors, (1863), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-02-20 18:22:13,286 INFO L74 IsIncluded]: Start isIncluded. First operand 1926 states. Second operand has 1589 states, 1344 states have (on average 1.3861607142857142) internal successors, (1863), 1362 states have internal predecessors, (1863), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-02-20 18:22:13,288 INFO L87 Difference]: Start difference. First operand 1926 states. Second operand has 1589 states, 1344 states have (on average 1.3861607142857142) internal successors, (1863), 1362 states have internal predecessors, (1863), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-02-20 18:22:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:13,392 INFO L93 Difference]: Finished difference Result 1926 states and 2696 transitions. [2022-02-20 18:22:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2696 transitions. [2022-02-20 18:22:13,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:22:13,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:22:13,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 1589 states, 1344 states have (on average 1.3861607142857142) internal successors, (1863), 1362 states have internal predecessors, (1863), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) Second operand 1926 states. [2022-02-20 18:22:13,402 INFO L87 Difference]: Start difference. First operand has 1589 states, 1344 states have (on average 1.3861607142857142) internal successors, (1863), 1362 states have internal predecessors, (1863), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) Second operand 1926 states. [2022-02-20 18:22:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:13,502 INFO L93 Difference]: Finished difference Result 1926 states and 2696 transitions. [2022-02-20 18:22:13,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2696 transitions. [2022-02-20 18:22:13,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:22:13,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:22:13,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:22:13,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:22:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1344 states have (on average 1.3861607142857142) internal successors, (1863), 1362 states have internal predecessors, (1863), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-02-20 18:22:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2196 transitions. [2022-02-20 18:22:13,612 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2196 transitions. Word has length 84 [2022-02-20 18:22:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:22:13,612 INFO L470 AbstractCegarLoop]: Abstraction has 1589 states and 2196 transitions. [2022-02-20 18:22:13,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2196 transitions. [2022-02-20 18:22:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-20 18:22:13,614 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:22:13,614 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:22:13,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:22:13,615 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:22:13,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:22:13,615 INFO L85 PathProgramCache]: Analyzing trace with hash 564988657, now seen corresponding path program 1 times [2022-02-20 18:22:13,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:22:13,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827625849] [2022-02-20 18:22:13,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:22:13,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:22:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:13,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:22:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:13,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {39574#true} assume true; {39574#true} is VALID [2022-02-20 18:22:13,644 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {39574#true} {39576#(not (= ~T1_E~0 1))} #437#return; {39576#(not (= ~T1_E~0 1))} is VALID [2022-02-20 18:22:13,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:22:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:13,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {39623#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {39624#(= |old(~T1_E~0)| ~T1_E~0)} is VALID [2022-02-20 18:22:13,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {39624#(= |old(~T1_E~0)| ~T1_E~0)} assume !(0 == ~T1_E~0); {39624#(= |old(~T1_E~0)| ~T1_E~0)} is VALID [2022-02-20 18:22:13,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {39624#(= |old(~T1_E~0)| ~T1_E~0)} assume !(0 == ~T2_E~0); {39624#(= |old(~T1_E~0)| ~T1_E~0)} is VALID [2022-02-20 18:22:13,658 INFO L290 TraceCheckUtils]: 3: Hoare triple {39624#(= |old(~T1_E~0)| ~T1_E~0)} assume !(0 == ~E_1~0); {39624#(= |old(~T1_E~0)| ~T1_E~0)} is VALID [2022-02-20 18:22:13,658 INFO L290 TraceCheckUtils]: 4: Hoare triple {39624#(= |old(~T1_E~0)| ~T1_E~0)} assume !(0 == ~E_2~0); {39624#(= |old(~T1_E~0)| ~T1_E~0)} is VALID [2022-02-20 18:22:13,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {39624#(= |old(~T1_E~0)| ~T1_E~0)} assume true; {39624#(= |old(~T1_E~0)| ~T1_E~0)} is VALID [2022-02-20 18:22:13,659 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {39624#(= |old(~T1_E~0)| ~T1_E~0)} {39576#(not (= ~T1_E~0 1))} #439#return; {39576#(not (= ~T1_E~0 1))} is VALID [2022-02-20 18:22:13,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:22:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:13,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {39625#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {39574#true} is VALID [2022-02-20 18:22:13,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {39574#true} assume !(1 == ~m_pc~0); {39574#true} is VALID [2022-02-20 18:22:13,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {39574#true} is_master_triggered_~__retres1~0#1 := 0; {39574#true} is VALID [2022-02-20 18:22:13,670 INFO L290 TraceCheckUtils]: 3: Hoare triple {39574#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {39574#true} is VALID [2022-02-20 18:22:13,670 INFO L290 TraceCheckUtils]: 4: Hoare triple {39574#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {39574#true} is VALID [2022-02-20 18:22:13,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {39574#true} assume !(0 != ~tmp~1#1); {39574#true} is VALID [2022-02-20 18:22:13,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {39574#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {39574#true} is VALID [2022-02-20 18:22:13,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {39574#true} assume !(1 == ~t1_pc~0); {39574#true} is VALID [2022-02-20 18:22:13,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {39574#true} is_transmit1_triggered_~__retres1~1#1 := 0; {39574#true} is VALID [2022-02-20 18:22:13,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {39574#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {39574#true} is VALID [2022-02-20 18:22:13,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {39574#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {39574#true} is VALID [2022-02-20 18:22:13,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {39574#true} assume !(0 != ~tmp___0~0#1); {39574#true} is VALID [2022-02-20 18:22:13,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {39574#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {39574#true} is VALID [2022-02-20 18:22:13,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {39574#true} assume !(1 == ~t2_pc~0); {39574#true} is VALID [2022-02-20 18:22:13,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {39574#true} is_transmit2_triggered_~__retres1~2#1 := 0; {39574#true} is VALID [2022-02-20 18:22:13,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {39574#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {39574#true} is VALID [2022-02-20 18:22:13,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {39574#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {39574#true} is VALID [2022-02-20 18:22:13,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {39574#true} assume !(0 != ~tmp___1~0#1); {39574#true} is VALID [2022-02-20 18:22:13,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {39574#true} assume true; {39574#true} is VALID [2022-02-20 18:22:13,672 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {39574#true} {39576#(not (= ~T1_E~0 1))} #441#return; {39576#(not (= ~T1_E~0 1))} is VALID [2022-02-20 18:22:13,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 18:22:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:13,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {39623#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {39624#(= |old(~T1_E~0)| ~T1_E~0)} is VALID [2022-02-20 18:22:13,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {39624#(= |old(~T1_E~0)| ~T1_E~0)} assume 1 == ~T1_E~0;~T1_E~0 := 2; {39626#(= |old(~T1_E~0)| 1)} is VALID [2022-02-20 18:22:13,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {39626#(= |old(~T1_E~0)| 1)} assume 1 == ~T2_E~0;~T2_E~0 := 2; {39626#(= |old(~T1_E~0)| 1)} is VALID [2022-02-20 18:22:13,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {39626#(= |old(~T1_E~0)| 1)} assume !(1 == ~E_1~0); {39626#(= |old(~T1_E~0)| 1)} is VALID [2022-02-20 18:22:13,681 INFO L290 TraceCheckUtils]: 4: Hoare triple {39626#(= |old(~T1_E~0)| 1)} assume 1 == ~E_2~0;~E_2~0 := 2; {39626#(= |old(~T1_E~0)| 1)} is VALID [2022-02-20 18:22:13,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {39626#(= |old(~T1_E~0)| 1)} assume true; {39626#(= |old(~T1_E~0)| 1)} is VALID [2022-02-20 18:22:13,682 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {39626#(= |old(~T1_E~0)| 1)} {39576#(not (= ~T1_E~0 1))} #443#return; {39575#false} is VALID [2022-02-20 18:22:13,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 18:22:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:13,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {39574#true} havoc ~__retres1~3; {39574#true} is VALID [2022-02-20 18:22:13,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {39574#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {39574#true} is VALID [2022-02-20 18:22:13,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {39574#true} #res := ~__retres1~3; {39574#true} is VALID [2022-02-20 18:22:13,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {39574#true} assume true; {39574#true} is VALID [2022-02-20 18:22:13,685 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {39574#true} {39575#false} #445#return; {39575#false} is VALID [2022-02-20 18:22:13,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 18:22:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:13,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {39574#true} havoc ~__retres1~3; {39574#true} is VALID [2022-02-20 18:22:13,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {39574#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {39574#true} is VALID [2022-02-20 18:22:13,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {39574#true} #res := ~__retres1~3; {39574#true} is VALID [2022-02-20 18:22:13,687 INFO L290 TraceCheckUtils]: 3: Hoare triple {39574#true} assume true; {39574#true} is VALID [2022-02-20 18:22:13,687 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {39574#true} {39575#false} #445#return; {39575#false} is VALID [2022-02-20 18:22:13,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {39574#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(21, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2; {39576#(not (= ~T1_E~0 1))} is VALID [2022-02-20 18:22:13,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {39576#(not (= ~T1_E~0 1))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {39576#(not (= ~T1_E~0 1))} is VALID [2022-02-20 18:22:13,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {39576#(not (= ~T1_E~0 1))} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {39576#(not (= ~T1_E~0 1))} is VALID [2022-02-20 18:22:13,688 INFO L272 TraceCheckUtils]: 3: Hoare triple {39576#(not (= ~T1_E~0 1))} call update_channels(); {39574#true} is VALID [2022-02-20 18:22:13,688 INFO L290 TraceCheckUtils]: 4: Hoare triple {39574#true} assume true; {39574#true} is VALID [2022-02-20 18:22:13,689 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {39574#true} {39576#(not (= ~T1_E~0 1))} #437#return; {39576#(not (= ~T1_E~0 1))} is VALID [2022-02-20 18:22:13,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {39576#(not (= ~T1_E~0 1))} assume { :begin_inline_init_threads } true; {39576#(not (= ~T1_E~0 1))} is VALID [2022-02-20 18:22:13,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {39576#(not (= ~T1_E~0 1))} assume 1 == ~m_i~0;~m_st~0 := 0; {39576#(not (= ~T1_E~0 1))} is VALID [2022-02-20 18:22:13,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {39576#(not (= ~T1_E~0 1))} assume 1 == ~t1_i~0;~t1_st~0 := 0; {39576#(not (= ~T1_E~0 1))} is VALID [2022-02-20 18:22:13,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {39576#(not (= ~T1_E~0 1))} assume 1 == ~t2_i~0;~t2_st~0 := 0; {39576#(not (= ~T1_E~0 1))} is VALID [2022-02-20 18:22:13,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {39576#(not (= ~T1_E~0 1))} assume { :end_inline_init_threads } true; {39576#(not (= ~T1_E~0 1))} is VALID [2022-02-20 18:22:13,691 INFO L272 TraceCheckUtils]: 11: Hoare triple {39576#(not (= ~T1_E~0 1))} call fire_delta_events(); {39623#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:13,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {39623#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {39624#(= |old(~T1_E~0)| ~T1_E~0)} is VALID [2022-02-20 18:22:13,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {39624#(= |old(~T1_E~0)| ~T1_E~0)} assume !(0 == ~T1_E~0); {39624#(= |old(~T1_E~0)| ~T1_E~0)} is VALID [2022-02-20 18:22:13,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {39624#(= |old(~T1_E~0)| ~T1_E~0)} assume !(0 == ~T2_E~0); {39624#(= |old(~T1_E~0)| ~T1_E~0)} is VALID [2022-02-20 18:22:13,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {39624#(= |old(~T1_E~0)| ~T1_E~0)} assume !(0 == ~E_1~0); {39624#(= |old(~T1_E~0)| ~T1_E~0)} is VALID [2022-02-20 18:22:13,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {39624#(= |old(~T1_E~0)| ~T1_E~0)} assume !(0 == ~E_2~0); {39624#(= |old(~T1_E~0)| ~T1_E~0)} is VALID [2022-02-20 18:22:13,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {39624#(= |old(~T1_E~0)| ~T1_E~0)} assume true; {39624#(= |old(~T1_E~0)| ~T1_E~0)} is VALID [2022-02-20 18:22:13,693 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {39624#(= |old(~T1_E~0)| ~T1_E~0)} {39576#(not (= ~T1_E~0 1))} #439#return; {39576#(not (= ~T1_E~0 1))} is VALID [2022-02-20 18:22:13,693 INFO L272 TraceCheckUtils]: 19: Hoare triple {39576#(not (= ~T1_E~0 1))} call activate_threads(); {39625#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:22:13,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {39625#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {39574#true} is VALID [2022-02-20 18:22:13,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {39574#true} assume !(1 == ~m_pc~0); {39574#true} is VALID [2022-02-20 18:22:13,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {39574#true} is_master_triggered_~__retres1~0#1 := 0; {39574#true} is VALID [2022-02-20 18:22:13,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {39574#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {39574#true} is VALID [2022-02-20 18:22:13,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {39574#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {39574#true} is VALID [2022-02-20 18:22:13,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {39574#true} assume !(0 != ~tmp~1#1); {39574#true} is VALID [2022-02-20 18:22:13,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {39574#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {39574#true} is VALID [2022-02-20 18:22:13,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {39574#true} assume !(1 == ~t1_pc~0); {39574#true} is VALID [2022-02-20 18:22:13,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {39574#true} is_transmit1_triggered_~__retres1~1#1 := 0; {39574#true} is VALID [2022-02-20 18:22:13,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {39574#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {39574#true} is VALID [2022-02-20 18:22:13,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {39574#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {39574#true} is VALID [2022-02-20 18:22:13,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {39574#true} assume !(0 != ~tmp___0~0#1); {39574#true} is VALID [2022-02-20 18:22:13,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {39574#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {39574#true} is VALID [2022-02-20 18:22:13,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {39574#true} assume !(1 == ~t2_pc~0); {39574#true} is VALID [2022-02-20 18:22:13,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {39574#true} is_transmit2_triggered_~__retres1~2#1 := 0; {39574#true} is VALID [2022-02-20 18:22:13,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {39574#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {39574#true} is VALID [2022-02-20 18:22:13,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {39574#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {39574#true} is VALID [2022-02-20 18:22:13,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {39574#true} assume !(0 != ~tmp___1~0#1); {39574#true} is VALID [2022-02-20 18:22:13,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {39574#true} assume true; {39574#true} is VALID [2022-02-20 18:22:13,696 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {39574#true} {39576#(not (= ~T1_E~0 1))} #441#return; {39576#(not (= ~T1_E~0 1))} is VALID [2022-02-20 18:22:13,697 INFO L272 TraceCheckUtils]: 40: Hoare triple {39576#(not (= ~T1_E~0 1))} call reset_delta_events(); {39623#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:13,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {39623#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {39624#(= |old(~T1_E~0)| ~T1_E~0)} is VALID [2022-02-20 18:22:13,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {39624#(= |old(~T1_E~0)| ~T1_E~0)} assume 1 == ~T1_E~0;~T1_E~0 := 2; {39626#(= |old(~T1_E~0)| 1)} is VALID [2022-02-20 18:22:13,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {39626#(= |old(~T1_E~0)| 1)} assume 1 == ~T2_E~0;~T2_E~0 := 2; {39626#(= |old(~T1_E~0)| 1)} is VALID [2022-02-20 18:22:13,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {39626#(= |old(~T1_E~0)| 1)} assume !(1 == ~E_1~0); {39626#(= |old(~T1_E~0)| 1)} is VALID [2022-02-20 18:22:13,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {39626#(= |old(~T1_E~0)| 1)} assume 1 == ~E_2~0;~E_2~0 := 2; {39626#(= |old(~T1_E~0)| 1)} is VALID [2022-02-20 18:22:13,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {39626#(= |old(~T1_E~0)| 1)} assume true; {39626#(= |old(~T1_E~0)| 1)} is VALID [2022-02-20 18:22:13,699 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {39626#(= |old(~T1_E~0)| 1)} {39576#(not (= ~T1_E~0 1))} #443#return; {39575#false} is VALID [2022-02-20 18:22:13,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {39575#false} assume !false; {39575#false} is VALID [2022-02-20 18:22:13,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {39575#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {39575#false} is VALID [2022-02-20 18:22:13,699 INFO L290 TraceCheckUtils]: 50: Hoare triple {39575#false} assume !false; {39575#false} is VALID [2022-02-20 18:22:13,699 INFO L272 TraceCheckUtils]: 51: Hoare triple {39575#false} call eval_#t~ret4#1 := exists_runnable_thread(); {39574#true} is VALID [2022-02-20 18:22:13,699 INFO L290 TraceCheckUtils]: 52: Hoare triple {39574#true} havoc ~__retres1~3; {39574#true} is VALID [2022-02-20 18:22:13,699 INFO L290 TraceCheckUtils]: 53: Hoare triple {39574#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {39574#true} is VALID [2022-02-20 18:22:13,699 INFO L290 TraceCheckUtils]: 54: Hoare triple {39574#true} #res := ~__retres1~3; {39574#true} is VALID [2022-02-20 18:22:13,700 INFO L290 TraceCheckUtils]: 55: Hoare triple {39574#true} assume true; {39574#true} is VALID [2022-02-20 18:22:13,700 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {39574#true} {39575#false} #445#return; {39575#false} is VALID [2022-02-20 18:22:13,700 INFO L290 TraceCheckUtils]: 57: Hoare triple {39575#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {39575#false} is VALID [2022-02-20 18:22:13,700 INFO L290 TraceCheckUtils]: 58: Hoare triple {39575#false} assume 0 != eval_~tmp~0#1; {39575#false} is VALID [2022-02-20 18:22:13,700 INFO L290 TraceCheckUtils]: 59: Hoare triple {39575#false} assume !(0 == ~m_st~0); {39575#false} is VALID [2022-02-20 18:22:13,700 INFO L290 TraceCheckUtils]: 60: Hoare triple {39575#false} assume !(0 == ~t1_st~0); {39575#false} is VALID [2022-02-20 18:22:13,700 INFO L290 TraceCheckUtils]: 61: Hoare triple {39575#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {39575#false} is VALID [2022-02-20 18:22:13,700 INFO L290 TraceCheckUtils]: 62: Hoare triple {39575#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {39575#false} is VALID [2022-02-20 18:22:13,701 INFO L290 TraceCheckUtils]: 63: Hoare triple {39575#false} assume 0 == ~t2_pc~0; {39575#false} is VALID [2022-02-20 18:22:13,701 INFO L290 TraceCheckUtils]: 64: Hoare triple {39575#false} assume !false; {39575#false} is VALID [2022-02-20 18:22:13,701 INFO L290 TraceCheckUtils]: 65: Hoare triple {39575#false} ~t2_pc~0 := 1;~t2_st~0 := 2; {39575#false} is VALID [2022-02-20 18:22:13,701 INFO L290 TraceCheckUtils]: 66: Hoare triple {39575#false} assume { :end_inline_transmit2 } true; {39575#false} is VALID [2022-02-20 18:22:13,701 INFO L290 TraceCheckUtils]: 67: Hoare triple {39575#false} assume !false; {39575#false} is VALID [2022-02-20 18:22:13,701 INFO L272 TraceCheckUtils]: 68: Hoare triple {39575#false} call eval_#t~ret4#1 := exists_runnable_thread(); {39574#true} is VALID [2022-02-20 18:22:13,701 INFO L290 TraceCheckUtils]: 69: Hoare triple {39574#true} havoc ~__retres1~3; {39574#true} is VALID [2022-02-20 18:22:13,701 INFO L290 TraceCheckUtils]: 70: Hoare triple {39574#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {39574#true} is VALID [2022-02-20 18:22:13,701 INFO L290 TraceCheckUtils]: 71: Hoare triple {39574#true} #res := ~__retres1~3; {39574#true} is VALID [2022-02-20 18:22:13,702 INFO L290 TraceCheckUtils]: 72: Hoare triple {39574#true} assume true; {39574#true} is VALID [2022-02-20 18:22:13,702 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {39574#true} {39575#false} #445#return; {39575#false} is VALID [2022-02-20 18:22:13,702 INFO L290 TraceCheckUtils]: 74: Hoare triple {39575#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {39575#false} is VALID [2022-02-20 18:22:13,702 INFO L290 TraceCheckUtils]: 75: Hoare triple {39575#false} assume 0 != eval_~tmp~0#1; {39575#false} is VALID [2022-02-20 18:22:13,702 INFO L290 TraceCheckUtils]: 76: Hoare triple {39575#false} assume !(0 == ~m_st~0); {39575#false} is VALID [2022-02-20 18:22:13,702 INFO L290 TraceCheckUtils]: 77: Hoare triple {39575#false} assume !(0 == ~t1_st~0); {39575#false} is VALID [2022-02-20 18:22:13,702 INFO L290 TraceCheckUtils]: 78: Hoare triple {39575#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {39575#false} is VALID [2022-02-20 18:22:13,702 INFO L290 TraceCheckUtils]: 79: Hoare triple {39575#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {39575#false} is VALID [2022-02-20 18:22:13,703 INFO L290 TraceCheckUtils]: 80: Hoare triple {39575#false} assume !(0 == ~t2_pc~0); {39575#false} is VALID [2022-02-20 18:22:13,703 INFO L290 TraceCheckUtils]: 81: Hoare triple {39575#false} assume 1 == ~t2_pc~0; {39575#false} is VALID [2022-02-20 18:22:13,703 INFO L290 TraceCheckUtils]: 82: Hoare triple {39575#false} assume { :begin_inline_error } true; {39575#false} is VALID [2022-02-20 18:22:13,703 INFO L290 TraceCheckUtils]: 83: Hoare triple {39575#false} assume !false; {39575#false} is VALID [2022-02-20 18:22:13,703 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 18:22:13,703 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:22:13,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827625849] [2022-02-20 18:22:13,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827625849] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:22:13,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:22:13,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:22:13,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403025048] [2022-02-20 18:22:13,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:22:13,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-02-20 18:22:13,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:22:13,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:13,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:22:13,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:22:13,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:22:13,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:22:13,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:22:13,743 INFO L87 Difference]: Start difference. First operand 1589 states and 2196 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:16,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:16,422 INFO L93 Difference]: Finished difference Result 3422 states and 4752 transitions. [2022-02-20 18:22:16,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:22:16,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-02-20 18:22:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:22:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 381 transitions. [2022-02-20 18:22:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 381 transitions. [2022-02-20 18:22:16,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 381 transitions. [2022-02-20 18:22:16,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:22:16,744 INFO L225 Difference]: With dead ends: 3422 [2022-02-20 18:22:16,744 INFO L226 Difference]: Without dead ends: 1845 [2022-02-20 18:22:16,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:22:16,747 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 326 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:22:16,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 415 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:22:16,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2022-02-20 18:22:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1577. [2022-02-20 18:22:17,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:22:17,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1845 states. Second operand has 1577 states, 1332 states have (on average 1.3626126126126126) internal successors, (1815), 1350 states have internal predecessors, (1815), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-02-20 18:22:17,641 INFO L74 IsIncluded]: Start isIncluded. First operand 1845 states. Second operand has 1577 states, 1332 states have (on average 1.3626126126126126) internal successors, (1815), 1350 states have internal predecessors, (1815), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-02-20 18:22:17,642 INFO L87 Difference]: Start difference. First operand 1845 states. Second operand has 1577 states, 1332 states have (on average 1.3626126126126126) internal successors, (1815), 1350 states have internal predecessors, (1815), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-02-20 18:22:17,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:17,744 INFO L93 Difference]: Finished difference Result 1845 states and 2513 transitions. [2022-02-20 18:22:17,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2513 transitions. [2022-02-20 18:22:17,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:22:17,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:22:17,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 1577 states, 1332 states have (on average 1.3626126126126126) internal successors, (1815), 1350 states have internal predecessors, (1815), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) Second operand 1845 states. [2022-02-20 18:22:17,754 INFO L87 Difference]: Start difference. First operand has 1577 states, 1332 states have (on average 1.3626126126126126) internal successors, (1815), 1350 states have internal predecessors, (1815), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) Second operand 1845 states. [2022-02-20 18:22:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:17,858 INFO L93 Difference]: Finished difference Result 1845 states and 2513 transitions. [2022-02-20 18:22:17,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2513 transitions. [2022-02-20 18:22:17,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:22:17,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:22:17,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:22:17,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:22:17,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1332 states have (on average 1.3626126126126126) internal successors, (1815), 1350 states have internal predecessors, (1815), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-02-20 18:22:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2148 transitions. [2022-02-20 18:22:17,967 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2148 transitions. Word has length 84 [2022-02-20 18:22:17,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:22:17,967 INFO L470 AbstractCegarLoop]: Abstraction has 1577 states and 2148 transitions. [2022-02-20 18:22:17,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2148 transitions. [2022-02-20 18:22:17,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-20 18:22:17,969 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:22:17,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:22:17,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:22:17,969 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:22:17,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:22:17,970 INFO L85 PathProgramCache]: Analyzing trace with hash 813135151, now seen corresponding path program 1 times [2022-02-20 18:22:17,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:22:17,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843828462] [2022-02-20 18:22:17,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:22:17,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:22:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:17,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:22:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:18,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {50000#true} assume true; {50000#true} is VALID [2022-02-20 18:22:18,001 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {50000#true} {50002#(= ~T2_E~0 ~M_E~0)} #437#return; {50002#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:22:18,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:22:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:18,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {50049#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} is VALID [2022-02-20 18:22:18,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} assume !(0 == ~T1_E~0); {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} is VALID [2022-02-20 18:22:18,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} assume !(0 == ~T2_E~0); {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} is VALID [2022-02-20 18:22:18,022 INFO L290 TraceCheckUtils]: 3: Hoare triple {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} assume !(0 == ~E_1~0); {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} is VALID [2022-02-20 18:22:18,022 INFO L290 TraceCheckUtils]: 4: Hoare triple {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} assume !(0 == ~E_2~0); {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} is VALID [2022-02-20 18:22:18,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} assume true; {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} is VALID [2022-02-20 18:22:18,023 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} {50002#(= ~T2_E~0 ~M_E~0)} #439#return; {50002#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:22:18,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:22:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:18,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {50051#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {50000#true} is VALID [2022-02-20 18:22:18,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {50000#true} assume !(1 == ~m_pc~0); {50000#true} is VALID [2022-02-20 18:22:18,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {50000#true} is_master_triggered_~__retres1~0#1 := 0; {50000#true} is VALID [2022-02-20 18:22:18,035 INFO L290 TraceCheckUtils]: 3: Hoare triple {50000#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {50000#true} is VALID [2022-02-20 18:22:18,035 INFO L290 TraceCheckUtils]: 4: Hoare triple {50000#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {50000#true} is VALID [2022-02-20 18:22:18,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {50000#true} assume !(0 != ~tmp~1#1); {50000#true} is VALID [2022-02-20 18:22:18,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {50000#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {50000#true} is VALID [2022-02-20 18:22:18,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {50000#true} assume !(1 == ~t1_pc~0); {50000#true} is VALID [2022-02-20 18:22:18,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {50000#true} is_transmit1_triggered_~__retres1~1#1 := 0; {50000#true} is VALID [2022-02-20 18:22:18,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {50000#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {50000#true} is VALID [2022-02-20 18:22:18,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {50000#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {50000#true} is VALID [2022-02-20 18:22:18,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {50000#true} assume !(0 != ~tmp___0~0#1); {50000#true} is VALID [2022-02-20 18:22:18,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {50000#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {50000#true} is VALID [2022-02-20 18:22:18,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {50000#true} assume !(1 == ~t2_pc~0); {50000#true} is VALID [2022-02-20 18:22:18,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {50000#true} is_transmit2_triggered_~__retres1~2#1 := 0; {50000#true} is VALID [2022-02-20 18:22:18,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {50000#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {50000#true} is VALID [2022-02-20 18:22:18,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {50000#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {50000#true} is VALID [2022-02-20 18:22:18,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {50000#true} assume !(0 != ~tmp___1~0#1); {50000#true} is VALID [2022-02-20 18:22:18,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {50000#true} assume true; {50000#true} is VALID [2022-02-20 18:22:18,037 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {50000#true} {50002#(= ~T2_E~0 ~M_E~0)} #441#return; {50002#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:22:18,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 18:22:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:18,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {50049#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {50052#(and (not (= |old(~M_E~0)| 1)) (= |old(~T2_E~0)| ~T2_E~0))} is VALID [2022-02-20 18:22:18,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {50052#(and (not (= |old(~M_E~0)| 1)) (= |old(~T2_E~0)| ~T2_E~0))} assume !(1 == ~T1_E~0); {50052#(and (not (= |old(~M_E~0)| 1)) (= |old(~T2_E~0)| ~T2_E~0))} is VALID [2022-02-20 18:22:18,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {50052#(and (not (= |old(~M_E~0)| 1)) (= |old(~T2_E~0)| ~T2_E~0))} assume 1 == ~T2_E~0;~T2_E~0 := 2; {50053#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:22:18,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {50053#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(1 == ~E_1~0); {50053#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:22:18,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {50053#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 1 == ~E_2~0;~E_2~0 := 2; {50053#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:22:18,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {50053#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {50053#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:22:18,057 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {50053#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {50002#(= ~T2_E~0 ~M_E~0)} #443#return; {50001#false} is VALID [2022-02-20 18:22:18,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 18:22:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:18,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {50000#true} havoc ~__retres1~3; {50000#true} is VALID [2022-02-20 18:22:18,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {50000#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {50000#true} is VALID [2022-02-20 18:22:18,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {50000#true} #res := ~__retres1~3; {50000#true} is VALID [2022-02-20 18:22:18,061 INFO L290 TraceCheckUtils]: 3: Hoare triple {50000#true} assume true; {50000#true} is VALID [2022-02-20 18:22:18,061 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {50000#true} {50001#false} #445#return; {50001#false} is VALID [2022-02-20 18:22:18,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 18:22:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:18,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {50000#true} havoc ~__retres1~3; {50000#true} is VALID [2022-02-20 18:22:18,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {50000#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {50000#true} is VALID [2022-02-20 18:22:18,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {50000#true} #res := ~__retres1~3; {50000#true} is VALID [2022-02-20 18:22:18,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {50000#true} assume true; {50000#true} is VALID [2022-02-20 18:22:18,063 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {50000#true} {50001#false} #445#return; {50001#false} is VALID [2022-02-20 18:22:18,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {50000#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(21, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2; {50002#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:22:18,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {50002#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {50002#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:22:18,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {50002#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {50002#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:22:18,065 INFO L272 TraceCheckUtils]: 3: Hoare triple {50002#(= ~T2_E~0 ~M_E~0)} call update_channels(); {50000#true} is VALID [2022-02-20 18:22:18,065 INFO L290 TraceCheckUtils]: 4: Hoare triple {50000#true} assume true; {50000#true} is VALID [2022-02-20 18:22:18,065 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {50000#true} {50002#(= ~T2_E~0 ~M_E~0)} #437#return; {50002#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:22:18,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {50002#(= ~T2_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {50002#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:22:18,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {50002#(= ~T2_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {50002#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:22:18,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {50002#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {50002#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:22:18,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {50002#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {50002#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:22:18,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {50002#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {50002#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:22:18,067 INFO L272 TraceCheckUtils]: 11: Hoare triple {50002#(= ~T2_E~0 ~M_E~0)} call fire_delta_events(); {50049#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:18,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {50049#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} is VALID [2022-02-20 18:22:18,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} assume !(0 == ~T1_E~0); {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} is VALID [2022-02-20 18:22:18,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} assume !(0 == ~T2_E~0); {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} is VALID [2022-02-20 18:22:18,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} assume !(0 == ~E_1~0); {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} is VALID [2022-02-20 18:22:18,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} assume !(0 == ~E_2~0); {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} is VALID [2022-02-20 18:22:18,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} assume true; {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} is VALID [2022-02-20 18:22:18,070 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {50050#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T2_E~0)| ~T2_E~0))} {50002#(= ~T2_E~0 ~M_E~0)} #439#return; {50002#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:22:18,070 INFO L272 TraceCheckUtils]: 19: Hoare triple {50002#(= ~T2_E~0 ~M_E~0)} call activate_threads(); {50051#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:22:18,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {50051#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {50000#true} is VALID [2022-02-20 18:22:18,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {50000#true} assume !(1 == ~m_pc~0); {50000#true} is VALID [2022-02-20 18:22:18,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {50000#true} is_master_triggered_~__retres1~0#1 := 0; {50000#true} is VALID [2022-02-20 18:22:18,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {50000#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {50000#true} is VALID [2022-02-20 18:22:18,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {50000#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {50000#true} is VALID [2022-02-20 18:22:18,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {50000#true} assume !(0 != ~tmp~1#1); {50000#true} is VALID [2022-02-20 18:22:18,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {50000#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {50000#true} is VALID [2022-02-20 18:22:18,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {50000#true} assume !(1 == ~t1_pc~0); {50000#true} is VALID [2022-02-20 18:22:18,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {50000#true} is_transmit1_triggered_~__retres1~1#1 := 0; {50000#true} is VALID [2022-02-20 18:22:18,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {50000#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {50000#true} is VALID [2022-02-20 18:22:18,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {50000#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {50000#true} is VALID [2022-02-20 18:22:18,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {50000#true} assume !(0 != ~tmp___0~0#1); {50000#true} is VALID [2022-02-20 18:22:18,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {50000#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {50000#true} is VALID [2022-02-20 18:22:18,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {50000#true} assume !(1 == ~t2_pc~0); {50000#true} is VALID [2022-02-20 18:22:18,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {50000#true} is_transmit2_triggered_~__retres1~2#1 := 0; {50000#true} is VALID [2022-02-20 18:22:18,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {50000#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {50000#true} is VALID [2022-02-20 18:22:18,072 INFO L290 TraceCheckUtils]: 36: Hoare triple {50000#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {50000#true} is VALID [2022-02-20 18:22:18,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {50000#true} assume !(0 != ~tmp___1~0#1); {50000#true} is VALID [2022-02-20 18:22:18,072 INFO L290 TraceCheckUtils]: 38: Hoare triple {50000#true} assume true; {50000#true} is VALID [2022-02-20 18:22:18,073 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {50000#true} {50002#(= ~T2_E~0 ~M_E~0)} #441#return; {50002#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 18:22:18,073 INFO L272 TraceCheckUtils]: 40: Hoare triple {50002#(= ~T2_E~0 ~M_E~0)} call reset_delta_events(); {50049#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:18,073 INFO L290 TraceCheckUtils]: 41: Hoare triple {50049#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {50052#(and (not (= |old(~M_E~0)| 1)) (= |old(~T2_E~0)| ~T2_E~0))} is VALID [2022-02-20 18:22:18,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {50052#(and (not (= |old(~M_E~0)| 1)) (= |old(~T2_E~0)| ~T2_E~0))} assume !(1 == ~T1_E~0); {50052#(and (not (= |old(~M_E~0)| 1)) (= |old(~T2_E~0)| ~T2_E~0))} is VALID [2022-02-20 18:22:18,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {50052#(and (not (= |old(~M_E~0)| 1)) (= |old(~T2_E~0)| ~T2_E~0))} assume 1 == ~T2_E~0;~T2_E~0 := 2; {50053#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:22:18,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {50053#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(1 == ~E_1~0); {50053#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:22:18,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {50053#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 1 == ~E_2~0;~E_2~0 := 2; {50053#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:22:18,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {50053#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {50053#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:22:18,076 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {50053#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {50002#(= ~T2_E~0 ~M_E~0)} #443#return; {50001#false} is VALID [2022-02-20 18:22:18,076 INFO L290 TraceCheckUtils]: 48: Hoare triple {50001#false} assume !false; {50001#false} is VALID [2022-02-20 18:22:18,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {50001#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {50001#false} is VALID [2022-02-20 18:22:18,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {50001#false} assume !false; {50001#false} is VALID [2022-02-20 18:22:18,076 INFO L272 TraceCheckUtils]: 51: Hoare triple {50001#false} call eval_#t~ret4#1 := exists_runnable_thread(); {50000#true} is VALID [2022-02-20 18:22:18,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {50000#true} havoc ~__retres1~3; {50000#true} is VALID [2022-02-20 18:22:18,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {50000#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {50000#true} is VALID [2022-02-20 18:22:18,076 INFO L290 TraceCheckUtils]: 54: Hoare triple {50000#true} #res := ~__retres1~3; {50000#true} is VALID [2022-02-20 18:22:18,077 INFO L290 TraceCheckUtils]: 55: Hoare triple {50000#true} assume true; {50000#true} is VALID [2022-02-20 18:22:18,077 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {50000#true} {50001#false} #445#return; {50001#false} is VALID [2022-02-20 18:22:18,077 INFO L290 TraceCheckUtils]: 57: Hoare triple {50001#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {50001#false} is VALID [2022-02-20 18:22:18,077 INFO L290 TraceCheckUtils]: 58: Hoare triple {50001#false} assume 0 != eval_~tmp~0#1; {50001#false} is VALID [2022-02-20 18:22:18,077 INFO L290 TraceCheckUtils]: 59: Hoare triple {50001#false} assume !(0 == ~m_st~0); {50001#false} is VALID [2022-02-20 18:22:18,077 INFO L290 TraceCheckUtils]: 60: Hoare triple {50001#false} assume !(0 == ~t1_st~0); {50001#false} is VALID [2022-02-20 18:22:18,077 INFO L290 TraceCheckUtils]: 61: Hoare triple {50001#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {50001#false} is VALID [2022-02-20 18:22:18,077 INFO L290 TraceCheckUtils]: 62: Hoare triple {50001#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {50001#false} is VALID [2022-02-20 18:22:18,078 INFO L290 TraceCheckUtils]: 63: Hoare triple {50001#false} assume 0 == ~t2_pc~0; {50001#false} is VALID [2022-02-20 18:22:18,078 INFO L290 TraceCheckUtils]: 64: Hoare triple {50001#false} assume !false; {50001#false} is VALID [2022-02-20 18:22:18,078 INFO L290 TraceCheckUtils]: 65: Hoare triple {50001#false} ~t2_pc~0 := 1;~t2_st~0 := 2; {50001#false} is VALID [2022-02-20 18:22:18,078 INFO L290 TraceCheckUtils]: 66: Hoare triple {50001#false} assume { :end_inline_transmit2 } true; {50001#false} is VALID [2022-02-20 18:22:18,078 INFO L290 TraceCheckUtils]: 67: Hoare triple {50001#false} assume !false; {50001#false} is VALID [2022-02-20 18:22:18,078 INFO L272 TraceCheckUtils]: 68: Hoare triple {50001#false} call eval_#t~ret4#1 := exists_runnable_thread(); {50000#true} is VALID [2022-02-20 18:22:18,078 INFO L290 TraceCheckUtils]: 69: Hoare triple {50000#true} havoc ~__retres1~3; {50000#true} is VALID [2022-02-20 18:22:18,078 INFO L290 TraceCheckUtils]: 70: Hoare triple {50000#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {50000#true} is VALID [2022-02-20 18:22:18,078 INFO L290 TraceCheckUtils]: 71: Hoare triple {50000#true} #res := ~__retres1~3; {50000#true} is VALID [2022-02-20 18:22:18,079 INFO L290 TraceCheckUtils]: 72: Hoare triple {50000#true} assume true; {50000#true} is VALID [2022-02-20 18:22:18,079 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {50000#true} {50001#false} #445#return; {50001#false} is VALID [2022-02-20 18:22:18,079 INFO L290 TraceCheckUtils]: 74: Hoare triple {50001#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {50001#false} is VALID [2022-02-20 18:22:18,079 INFO L290 TraceCheckUtils]: 75: Hoare triple {50001#false} assume 0 != eval_~tmp~0#1; {50001#false} is VALID [2022-02-20 18:22:18,079 INFO L290 TraceCheckUtils]: 76: Hoare triple {50001#false} assume !(0 == ~m_st~0); {50001#false} is VALID [2022-02-20 18:22:18,079 INFO L290 TraceCheckUtils]: 77: Hoare triple {50001#false} assume !(0 == ~t1_st~0); {50001#false} is VALID [2022-02-20 18:22:18,079 INFO L290 TraceCheckUtils]: 78: Hoare triple {50001#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {50001#false} is VALID [2022-02-20 18:22:18,079 INFO L290 TraceCheckUtils]: 79: Hoare triple {50001#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {50001#false} is VALID [2022-02-20 18:22:18,080 INFO L290 TraceCheckUtils]: 80: Hoare triple {50001#false} assume !(0 == ~t2_pc~0); {50001#false} is VALID [2022-02-20 18:22:18,080 INFO L290 TraceCheckUtils]: 81: Hoare triple {50001#false} assume 1 == ~t2_pc~0; {50001#false} is VALID [2022-02-20 18:22:18,080 INFO L290 TraceCheckUtils]: 82: Hoare triple {50001#false} assume { :begin_inline_error } true; {50001#false} is VALID [2022-02-20 18:22:18,080 INFO L290 TraceCheckUtils]: 83: Hoare triple {50001#false} assume !false; {50001#false} is VALID [2022-02-20 18:22:18,080 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 18:22:18,080 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:22:18,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843828462] [2022-02-20 18:22:18,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843828462] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:22:18,081 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:22:18,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:22:18,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371924564] [2022-02-20 18:22:18,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:22:18,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-02-20 18:22:18,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:22:18,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:18,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:22:18,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:22:18,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:22:18,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:22:18,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:22:18,125 INFO L87 Difference]: Start difference. First operand 1577 states and 2148 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:21,329 INFO L93 Difference]: Finished difference Result 2572 states and 3512 transitions. [2022-02-20 18:22:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 18:22:21,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-02-20 18:22:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:22:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 645 transitions. [2022-02-20 18:22:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 645 transitions. [2022-02-20 18:22:21,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 645 transitions. [2022-02-20 18:22:21,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 645 edges. 645 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:22:21,923 INFO L225 Difference]: With dead ends: 2572 [2022-02-20 18:22:21,923 INFO L226 Difference]: Without dead ends: 1597 [2022-02-20 18:22:21,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:22:21,925 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 589 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 18:22:21,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [599 Valid, 585 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 18:22:21,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2022-02-20 18:22:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1258. [2022-02-20 18:22:22,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:22:22,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1597 states. Second operand has 1258 states, 1061 states have (on average 1.349670122525919) internal successors, (1432), 1072 states have internal predecessors, (1432), 119 states have call successors, (119), 71 states have call predecessors, (119), 77 states have return successors, (140), 116 states have call predecessors, (140), 119 states have call successors, (140) [2022-02-20 18:22:22,945 INFO L74 IsIncluded]: Start isIncluded. First operand 1597 states. Second operand has 1258 states, 1061 states have (on average 1.349670122525919) internal successors, (1432), 1072 states have internal predecessors, (1432), 119 states have call successors, (119), 71 states have call predecessors, (119), 77 states have return successors, (140), 116 states have call predecessors, (140), 119 states have call successors, (140) [2022-02-20 18:22:22,946 INFO L87 Difference]: Start difference. First operand 1597 states. Second operand has 1258 states, 1061 states have (on average 1.349670122525919) internal successors, (1432), 1072 states have internal predecessors, (1432), 119 states have call successors, (119), 71 states have call predecessors, (119), 77 states have return successors, (140), 116 states have call predecessors, (140), 119 states have call successors, (140) [2022-02-20 18:22:23,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:23,020 INFO L93 Difference]: Finished difference Result 1597 states and 2160 transitions. [2022-02-20 18:22:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2160 transitions. [2022-02-20 18:22:23,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:22:23,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:22:23,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 1258 states, 1061 states have (on average 1.349670122525919) internal successors, (1432), 1072 states have internal predecessors, (1432), 119 states have call successors, (119), 71 states have call predecessors, (119), 77 states have return successors, (140), 116 states have call predecessors, (140), 119 states have call successors, (140) Second operand 1597 states. [2022-02-20 18:22:23,025 INFO L87 Difference]: Start difference. First operand has 1258 states, 1061 states have (on average 1.349670122525919) internal successors, (1432), 1072 states have internal predecessors, (1432), 119 states have call successors, (119), 71 states have call predecessors, (119), 77 states have return successors, (140), 116 states have call predecessors, (140), 119 states have call successors, (140) Second operand 1597 states. [2022-02-20 18:22:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:23,099 INFO L93 Difference]: Finished difference Result 1597 states and 2160 transitions. [2022-02-20 18:22:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2160 transitions. [2022-02-20 18:22:23,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:22:23,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:22:23,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:22:23,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:22:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1061 states have (on average 1.349670122525919) internal successors, (1432), 1072 states have internal predecessors, (1432), 119 states have call successors, (119), 71 states have call predecessors, (119), 77 states have return successors, (140), 116 states have call predecessors, (140), 119 states have call successors, (140) [2022-02-20 18:22:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1691 transitions. [2022-02-20 18:22:23,166 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1691 transitions. Word has length 84 [2022-02-20 18:22:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:22:23,166 INFO L470 AbstractCegarLoop]: Abstraction has 1258 states and 1691 transitions. [2022-02-20 18:22:23,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1691 transitions. [2022-02-20 18:22:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-20 18:22:23,167 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:22:23,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:22:23,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:22:23,168 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:22:23,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:22:23,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1236781873, now seen corresponding path program 1 times [2022-02-20 18:22:23,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:22:23,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563957851] [2022-02-20 18:22:23,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:22:23,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:22:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:23,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:22:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:23,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {58383#true} assume true; {58383#true} is VALID [2022-02-20 18:22:23,197 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {58383#true} {58385#(= ~E_2~0 ~M_E~0)} #437#return; {58385#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:22:23,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:22:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:23,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {58432#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~T1_E~0); {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~T2_E~0); {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,218 INFO L290 TraceCheckUtils]: 3: Hoare triple {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~E_1~0); {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,218 INFO L290 TraceCheckUtils]: 4: Hoare triple {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~E_2~0); {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume true; {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,219 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} {58385#(= ~E_2~0 ~M_E~0)} #439#return; {58385#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:22:23,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:22:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:23,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {58434#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {58383#true} is VALID [2022-02-20 18:22:23,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {58383#true} assume !(1 == ~m_pc~0); {58383#true} is VALID [2022-02-20 18:22:23,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {58383#true} is_master_triggered_~__retres1~0#1 := 0; {58383#true} is VALID [2022-02-20 18:22:23,230 INFO L290 TraceCheckUtils]: 3: Hoare triple {58383#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {58383#true} is VALID [2022-02-20 18:22:23,231 INFO L290 TraceCheckUtils]: 4: Hoare triple {58383#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {58383#true} is VALID [2022-02-20 18:22:23,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {58383#true} assume !(0 != ~tmp~1#1); {58383#true} is VALID [2022-02-20 18:22:23,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {58383#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {58383#true} is VALID [2022-02-20 18:22:23,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {58383#true} assume !(1 == ~t1_pc~0); {58383#true} is VALID [2022-02-20 18:22:23,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {58383#true} is_transmit1_triggered_~__retres1~1#1 := 0; {58383#true} is VALID [2022-02-20 18:22:23,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {58383#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {58383#true} is VALID [2022-02-20 18:22:23,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {58383#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {58383#true} is VALID [2022-02-20 18:22:23,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {58383#true} assume !(0 != ~tmp___0~0#1); {58383#true} is VALID [2022-02-20 18:22:23,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {58383#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {58383#true} is VALID [2022-02-20 18:22:23,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {58383#true} assume !(1 == ~t2_pc~0); {58383#true} is VALID [2022-02-20 18:22:23,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {58383#true} is_transmit2_triggered_~__retres1~2#1 := 0; {58383#true} is VALID [2022-02-20 18:22:23,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {58383#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {58383#true} is VALID [2022-02-20 18:22:23,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {58383#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {58383#true} is VALID [2022-02-20 18:22:23,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {58383#true} assume !(0 != ~tmp___1~0#1); {58383#true} is VALID [2022-02-20 18:22:23,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {58383#true} assume true; {58383#true} is VALID [2022-02-20 18:22:23,233 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {58383#true} {58385#(= ~E_2~0 ~M_E~0)} #441#return; {58385#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:22:23,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 18:22:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:23,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {58432#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {58435#(and (not (= |old(~M_E~0)| 1)) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {58435#(and (not (= |old(~M_E~0)| 1)) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~T1_E~0); {58435#(and (not (= |old(~M_E~0)| 1)) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {58435#(and (not (= |old(~M_E~0)| 1)) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~T2_E~0); {58435#(and (not (= |old(~M_E~0)| 1)) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {58435#(and (not (= |old(~M_E~0)| 1)) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~E_1~0); {58435#(and (not (= |old(~M_E~0)| 1)) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,258 INFO L290 TraceCheckUtils]: 4: Hoare triple {58435#(and (not (= |old(~M_E~0)| 1)) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~E_2~0;~E_2~0 := 2; {58436#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:22:23,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {58436#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume true; {58436#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:22:23,258 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {58436#(not (= |old(~E_2~0)| |old(~M_E~0)|))} {58385#(= ~E_2~0 ~M_E~0)} #443#return; {58384#false} is VALID [2022-02-20 18:22:23,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 18:22:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:23,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {58383#true} havoc ~__retres1~3; {58383#true} is VALID [2022-02-20 18:22:23,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {58383#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {58383#true} is VALID [2022-02-20 18:22:23,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {58383#true} #res := ~__retres1~3; {58383#true} is VALID [2022-02-20 18:22:23,261 INFO L290 TraceCheckUtils]: 3: Hoare triple {58383#true} assume true; {58383#true} is VALID [2022-02-20 18:22:23,261 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {58383#true} {58384#false} #445#return; {58384#false} is VALID [2022-02-20 18:22:23,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 18:22:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:23,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {58383#true} havoc ~__retres1~3; {58383#true} is VALID [2022-02-20 18:22:23,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {58383#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {58383#true} is VALID [2022-02-20 18:22:23,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {58383#true} #res := ~__retres1~3; {58383#true} is VALID [2022-02-20 18:22:23,265 INFO L290 TraceCheckUtils]: 3: Hoare triple {58383#true} assume true; {58383#true} is VALID [2022-02-20 18:22:23,265 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {58383#true} {58384#false} #445#return; {58384#false} is VALID [2022-02-20 18:22:23,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {58383#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(21, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2; {58385#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:22:23,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {58385#(= ~E_2~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {58385#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:22:23,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {58385#(= ~E_2~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {58385#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:22:23,266 INFO L272 TraceCheckUtils]: 3: Hoare triple {58385#(= ~E_2~0 ~M_E~0)} call update_channels(); {58383#true} is VALID [2022-02-20 18:22:23,266 INFO L290 TraceCheckUtils]: 4: Hoare triple {58383#true} assume true; {58383#true} is VALID [2022-02-20 18:22:23,267 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {58383#true} {58385#(= ~E_2~0 ~M_E~0)} #437#return; {58385#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:22:23,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {58385#(= ~E_2~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {58385#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:22:23,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {58385#(= ~E_2~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {58385#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:22:23,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {58385#(= ~E_2~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {58385#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:22:23,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {58385#(= ~E_2~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {58385#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:22:23,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {58385#(= ~E_2~0 ~M_E~0)} assume { :end_inline_init_threads } true; {58385#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:22:23,269 INFO L272 TraceCheckUtils]: 11: Hoare triple {58385#(= ~E_2~0 ~M_E~0)} call fire_delta_events(); {58432#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {58432#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~T1_E~0); {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~T2_E~0); {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~E_1~0); {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~E_2~0); {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume true; {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,271 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {58433#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_2~0 |old(~E_2~0)|))} {58385#(= ~E_2~0 ~M_E~0)} #439#return; {58385#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:22:23,272 INFO L272 TraceCheckUtils]: 19: Hoare triple {58385#(= ~E_2~0 ~M_E~0)} call activate_threads(); {58434#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:22:23,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {58434#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {58383#true} is VALID [2022-02-20 18:22:23,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {58383#true} assume !(1 == ~m_pc~0); {58383#true} is VALID [2022-02-20 18:22:23,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {58383#true} is_master_triggered_~__retres1~0#1 := 0; {58383#true} is VALID [2022-02-20 18:22:23,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {58383#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {58383#true} is VALID [2022-02-20 18:22:23,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {58383#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {58383#true} is VALID [2022-02-20 18:22:23,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {58383#true} assume !(0 != ~tmp~1#1); {58383#true} is VALID [2022-02-20 18:22:23,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {58383#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {58383#true} is VALID [2022-02-20 18:22:23,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {58383#true} assume !(1 == ~t1_pc~0); {58383#true} is VALID [2022-02-20 18:22:23,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {58383#true} is_transmit1_triggered_~__retres1~1#1 := 0; {58383#true} is VALID [2022-02-20 18:22:23,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {58383#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {58383#true} is VALID [2022-02-20 18:22:23,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {58383#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {58383#true} is VALID [2022-02-20 18:22:23,273 INFO L290 TraceCheckUtils]: 31: Hoare triple {58383#true} assume !(0 != ~tmp___0~0#1); {58383#true} is VALID [2022-02-20 18:22:23,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {58383#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {58383#true} is VALID [2022-02-20 18:22:23,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {58383#true} assume !(1 == ~t2_pc~0); {58383#true} is VALID [2022-02-20 18:22:23,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {58383#true} is_transmit2_triggered_~__retres1~2#1 := 0; {58383#true} is VALID [2022-02-20 18:22:23,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {58383#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {58383#true} is VALID [2022-02-20 18:22:23,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {58383#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {58383#true} is VALID [2022-02-20 18:22:23,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {58383#true} assume !(0 != ~tmp___1~0#1); {58383#true} is VALID [2022-02-20 18:22:23,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {58383#true} assume true; {58383#true} is VALID [2022-02-20 18:22:23,275 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {58383#true} {58385#(= ~E_2~0 ~M_E~0)} #441#return; {58385#(= ~E_2~0 ~M_E~0)} is VALID [2022-02-20 18:22:23,275 INFO L272 TraceCheckUtils]: 40: Hoare triple {58385#(= ~E_2~0 ~M_E~0)} call reset_delta_events(); {58432#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {58432#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {58435#(and (not (= |old(~M_E~0)| 1)) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,276 INFO L290 TraceCheckUtils]: 42: Hoare triple {58435#(and (not (= |old(~M_E~0)| 1)) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~T1_E~0); {58435#(and (not (= |old(~M_E~0)| 1)) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,276 INFO L290 TraceCheckUtils]: 43: Hoare triple {58435#(and (not (= |old(~M_E~0)| 1)) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~T2_E~0); {58435#(and (not (= |old(~M_E~0)| 1)) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,277 INFO L290 TraceCheckUtils]: 44: Hoare triple {58435#(and (not (= |old(~M_E~0)| 1)) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~E_1~0); {58435#(and (not (= |old(~M_E~0)| 1)) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:23,277 INFO L290 TraceCheckUtils]: 45: Hoare triple {58435#(and (not (= |old(~M_E~0)| 1)) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~E_2~0;~E_2~0 := 2; {58436#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:22:23,277 INFO L290 TraceCheckUtils]: 46: Hoare triple {58436#(not (= |old(~E_2~0)| |old(~M_E~0)|))} assume true; {58436#(not (= |old(~E_2~0)| |old(~M_E~0)|))} is VALID [2022-02-20 18:22:23,278 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {58436#(not (= |old(~E_2~0)| |old(~M_E~0)|))} {58385#(= ~E_2~0 ~M_E~0)} #443#return; {58384#false} is VALID [2022-02-20 18:22:23,278 INFO L290 TraceCheckUtils]: 48: Hoare triple {58384#false} assume !false; {58384#false} is VALID [2022-02-20 18:22:23,278 INFO L290 TraceCheckUtils]: 49: Hoare triple {58384#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {58384#false} is VALID [2022-02-20 18:22:23,278 INFO L290 TraceCheckUtils]: 50: Hoare triple {58384#false} assume !false; {58384#false} is VALID [2022-02-20 18:22:23,278 INFO L272 TraceCheckUtils]: 51: Hoare triple {58384#false} call eval_#t~ret4#1 := exists_runnable_thread(); {58383#true} is VALID [2022-02-20 18:22:23,278 INFO L290 TraceCheckUtils]: 52: Hoare triple {58383#true} havoc ~__retres1~3; {58383#true} is VALID [2022-02-20 18:22:23,278 INFO L290 TraceCheckUtils]: 53: Hoare triple {58383#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {58383#true} is VALID [2022-02-20 18:22:23,278 INFO L290 TraceCheckUtils]: 54: Hoare triple {58383#true} #res := ~__retres1~3; {58383#true} is VALID [2022-02-20 18:22:23,278 INFO L290 TraceCheckUtils]: 55: Hoare triple {58383#true} assume true; {58383#true} is VALID [2022-02-20 18:22:23,279 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {58383#true} {58384#false} #445#return; {58384#false} is VALID [2022-02-20 18:22:23,279 INFO L290 TraceCheckUtils]: 57: Hoare triple {58384#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {58384#false} is VALID [2022-02-20 18:22:23,279 INFO L290 TraceCheckUtils]: 58: Hoare triple {58384#false} assume 0 != eval_~tmp~0#1; {58384#false} is VALID [2022-02-20 18:22:23,279 INFO L290 TraceCheckUtils]: 59: Hoare triple {58384#false} assume !(0 == ~m_st~0); {58384#false} is VALID [2022-02-20 18:22:23,279 INFO L290 TraceCheckUtils]: 60: Hoare triple {58384#false} assume !(0 == ~t1_st~0); {58384#false} is VALID [2022-02-20 18:22:23,279 INFO L290 TraceCheckUtils]: 61: Hoare triple {58384#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {58384#false} is VALID [2022-02-20 18:22:23,279 INFO L290 TraceCheckUtils]: 62: Hoare triple {58384#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {58384#false} is VALID [2022-02-20 18:22:23,279 INFO L290 TraceCheckUtils]: 63: Hoare triple {58384#false} assume 0 == ~t2_pc~0; {58384#false} is VALID [2022-02-20 18:22:23,280 INFO L290 TraceCheckUtils]: 64: Hoare triple {58384#false} assume !false; {58384#false} is VALID [2022-02-20 18:22:23,280 INFO L290 TraceCheckUtils]: 65: Hoare triple {58384#false} ~t2_pc~0 := 1;~t2_st~0 := 2; {58384#false} is VALID [2022-02-20 18:22:23,280 INFO L290 TraceCheckUtils]: 66: Hoare triple {58384#false} assume { :end_inline_transmit2 } true; {58384#false} is VALID [2022-02-20 18:22:23,280 INFO L290 TraceCheckUtils]: 67: Hoare triple {58384#false} assume !false; {58384#false} is VALID [2022-02-20 18:22:23,280 INFO L272 TraceCheckUtils]: 68: Hoare triple {58384#false} call eval_#t~ret4#1 := exists_runnable_thread(); {58383#true} is VALID [2022-02-20 18:22:23,280 INFO L290 TraceCheckUtils]: 69: Hoare triple {58383#true} havoc ~__retres1~3; {58383#true} is VALID [2022-02-20 18:22:23,280 INFO L290 TraceCheckUtils]: 70: Hoare triple {58383#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {58383#true} is VALID [2022-02-20 18:22:23,280 INFO L290 TraceCheckUtils]: 71: Hoare triple {58383#true} #res := ~__retres1~3; {58383#true} is VALID [2022-02-20 18:22:23,280 INFO L290 TraceCheckUtils]: 72: Hoare triple {58383#true} assume true; {58383#true} is VALID [2022-02-20 18:22:23,281 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {58383#true} {58384#false} #445#return; {58384#false} is VALID [2022-02-20 18:22:23,281 INFO L290 TraceCheckUtils]: 74: Hoare triple {58384#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {58384#false} is VALID [2022-02-20 18:22:23,281 INFO L290 TraceCheckUtils]: 75: Hoare triple {58384#false} assume 0 != eval_~tmp~0#1; {58384#false} is VALID [2022-02-20 18:22:23,281 INFO L290 TraceCheckUtils]: 76: Hoare triple {58384#false} assume !(0 == ~m_st~0); {58384#false} is VALID [2022-02-20 18:22:23,281 INFO L290 TraceCheckUtils]: 77: Hoare triple {58384#false} assume !(0 == ~t1_st~0); {58384#false} is VALID [2022-02-20 18:22:23,281 INFO L290 TraceCheckUtils]: 78: Hoare triple {58384#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {58384#false} is VALID [2022-02-20 18:22:23,281 INFO L290 TraceCheckUtils]: 79: Hoare triple {58384#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {58384#false} is VALID [2022-02-20 18:22:23,281 INFO L290 TraceCheckUtils]: 80: Hoare triple {58384#false} assume !(0 == ~t2_pc~0); {58384#false} is VALID [2022-02-20 18:22:23,282 INFO L290 TraceCheckUtils]: 81: Hoare triple {58384#false} assume 1 == ~t2_pc~0; {58384#false} is VALID [2022-02-20 18:22:23,282 INFO L290 TraceCheckUtils]: 82: Hoare triple {58384#false} assume { :begin_inline_error } true; {58384#false} is VALID [2022-02-20 18:22:23,282 INFO L290 TraceCheckUtils]: 83: Hoare triple {58384#false} assume !false; {58384#false} is VALID [2022-02-20 18:22:23,282 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 18:22:23,282 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:22:23,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563957851] [2022-02-20 18:22:23,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563957851] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:22:23,283 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:22:23,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:22:23,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752058589] [2022-02-20 18:22:23,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:22:23,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-02-20 18:22:23,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:22:23,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:23,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:22:23,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:22:23,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:22:23,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:22:23,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:22:23,326 INFO L87 Difference]: Start difference. First operand 1258 states and 1691 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:26,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:26,142 INFO L93 Difference]: Finished difference Result 2777 states and 3732 transitions. [2022-02-20 18:22:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 18:22:26,142 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-02-20 18:22:26,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:22:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 652 transitions. [2022-02-20 18:22:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 652 transitions. [2022-02-20 18:22:26,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 652 transitions. [2022-02-20 18:22:26,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 652 edges. 652 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:22:26,745 INFO L225 Difference]: With dead ends: 2777 [2022-02-20 18:22:26,745 INFO L226 Difference]: Without dead ends: 1622 [2022-02-20 18:22:26,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2022-02-20 18:22:26,750 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 486 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:22:26,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 663 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 18:22:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2022-02-20 18:22:27,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1246. [2022-02-20 18:22:27,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:22:27,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1622 states. Second operand has 1246 states, 1052 states have (on average 1.3450570342205324) internal successors, (1415), 1060 states have internal predecessors, (1415), 119 states have call successors, (119), 71 states have call predecessors, (119), 74 states have return successors, (133), 115 states have call predecessors, (133), 119 states have call successors, (133) [2022-02-20 18:22:27,410 INFO L74 IsIncluded]: Start isIncluded. First operand 1622 states. Second operand has 1246 states, 1052 states have (on average 1.3450570342205324) internal successors, (1415), 1060 states have internal predecessors, (1415), 119 states have call successors, (119), 71 states have call predecessors, (119), 74 states have return successors, (133), 115 states have call predecessors, (133), 119 states have call successors, (133) [2022-02-20 18:22:27,428 INFO L87 Difference]: Start difference. First operand 1622 states. Second operand has 1246 states, 1052 states have (on average 1.3450570342205324) internal successors, (1415), 1060 states have internal predecessors, (1415), 119 states have call successors, (119), 71 states have call predecessors, (119), 74 states have return successors, (133), 115 states have call predecessors, (133), 119 states have call successors, (133) [2022-02-20 18:22:27,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:27,506 INFO L93 Difference]: Finished difference Result 1622 states and 2165 transitions. [2022-02-20 18:22:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2165 transitions. [2022-02-20 18:22:27,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:22:27,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:22:27,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 1246 states, 1052 states have (on average 1.3450570342205324) internal successors, (1415), 1060 states have internal predecessors, (1415), 119 states have call successors, (119), 71 states have call predecessors, (119), 74 states have return successors, (133), 115 states have call predecessors, (133), 119 states have call successors, (133) Second operand 1622 states. [2022-02-20 18:22:27,512 INFO L87 Difference]: Start difference. First operand has 1246 states, 1052 states have (on average 1.3450570342205324) internal successors, (1415), 1060 states have internal predecessors, (1415), 119 states have call successors, (119), 71 states have call predecessors, (119), 74 states have return successors, (133), 115 states have call predecessors, (133), 119 states have call successors, (133) Second operand 1622 states. [2022-02-20 18:22:27,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:27,587 INFO L93 Difference]: Finished difference Result 1622 states and 2165 transitions. [2022-02-20 18:22:27,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2165 transitions. [2022-02-20 18:22:27,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:22:27,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:22:27,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:22:27,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:22:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1052 states have (on average 1.3450570342205324) internal successors, (1415), 1060 states have internal predecessors, (1415), 119 states have call successors, (119), 71 states have call predecessors, (119), 74 states have return successors, (133), 115 states have call predecessors, (133), 119 states have call successors, (133) [2022-02-20 18:22:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1667 transitions. [2022-02-20 18:22:27,652 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1667 transitions. Word has length 84 [2022-02-20 18:22:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:22:27,653 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 1667 transitions. [2022-02-20 18:22:27,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:22:27,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1667 transitions. [2022-02-20 18:22:27,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-20 18:22:27,654 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:22:27,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:22:27,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:22:27,654 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:22:27,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:22:27,655 INFO L85 PathProgramCache]: Analyzing trace with hash -608585293, now seen corresponding path program 1 times [2022-02-20 18:22:27,655 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:22:27,655 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214548889] [2022-02-20 18:22:27,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:22:27,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:22:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:27,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:22:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:27,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {67092#true} assume true; {67092#true} is VALID [2022-02-20 18:22:27,685 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {67092#true} {67092#true} #437#return; {67092#true} is VALID [2022-02-20 18:22:27,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:22:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:27,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {67141#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {67092#true} is VALID [2022-02-20 18:22:27,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {67092#true} assume !(0 == ~T1_E~0); {67092#true} is VALID [2022-02-20 18:22:27,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {67092#true} assume !(0 == ~T2_E~0); {67092#true} is VALID [2022-02-20 18:22:27,693 INFO L290 TraceCheckUtils]: 3: Hoare triple {67092#true} assume !(0 == ~E_1~0); {67092#true} is VALID [2022-02-20 18:22:27,693 INFO L290 TraceCheckUtils]: 4: Hoare triple {67092#true} assume !(0 == ~E_2~0); {67092#true} is VALID [2022-02-20 18:22:27,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {67092#true} assume true; {67092#true} is VALID [2022-02-20 18:22:27,693 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {67092#true} {67096#(= ~m_st~0 0)} #439#return; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:22:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:27,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {67142#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume !(1 == ~m_pc~0); {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} is_master_triggered_~__retres1~0#1 := 0; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,708 INFO L290 TraceCheckUtils]: 4: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume !(0 != ~tmp~1#1); {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume !(1 == ~t1_pc~0); {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} is_transmit1_triggered_~__retres1~1#1 := 0; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume !(0 != ~tmp___0~0#1); {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume !(1 == ~t2_pc~0); {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} is_transmit2_triggered_~__retres1~2#1 := 0; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume !(0 != ~tmp___1~0#1); {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume true; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,712 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {67143#(= ~m_st~0 |old(~m_st~0)|)} {67096#(= ~m_st~0 0)} #441#return; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 18:22:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:27,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {67141#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {67092#true} is VALID [2022-02-20 18:22:27,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {67092#true} assume !(1 == ~T1_E~0); {67092#true} is VALID [2022-02-20 18:22:27,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {67092#true} assume !(1 == ~T2_E~0); {67092#true} is VALID [2022-02-20 18:22:27,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {67092#true} assume !(1 == ~E_1~0); {67092#true} is VALID [2022-02-20 18:22:27,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {67092#true} assume !(1 == ~E_2~0); {67092#true} is VALID [2022-02-20 18:22:27,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {67092#true} assume true; {67092#true} is VALID [2022-02-20 18:22:27,717 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {67092#true} {67096#(= ~m_st~0 0)} #443#return; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 18:22:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:27,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {67092#true} havoc ~__retres1~3; {67092#true} is VALID [2022-02-20 18:22:27,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {67092#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {67096#(= ~m_st~0 0)} #res := ~__retres1~3; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {67096#(= ~m_st~0 0)} assume true; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,725 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67096#(= ~m_st~0 0)} {67096#(= ~m_st~0 0)} #445#return; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 18:22:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:27,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {67092#true} havoc ~__retres1~3; {67092#true} is VALID [2022-02-20 18:22:27,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {67092#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {67092#true} is VALID [2022-02-20 18:22:27,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {67092#true} #res := ~__retres1~3; {67092#true} is VALID [2022-02-20 18:22:27,749 INFO L290 TraceCheckUtils]: 3: Hoare triple {67092#true} assume true; {67092#true} is VALID [2022-02-20 18:22:27,750 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67092#true} {67093#false} #445#return; {67093#false} is VALID [2022-02-20 18:22:27,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {67092#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(21, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2; {67092#true} is VALID [2022-02-20 18:22:27,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {67092#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {67092#true} is VALID [2022-02-20 18:22:27,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {67092#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {67092#true} is VALID [2022-02-20 18:22:27,750 INFO L272 TraceCheckUtils]: 3: Hoare triple {67092#true} call update_channels(); {67092#true} is VALID [2022-02-20 18:22:27,750 INFO L290 TraceCheckUtils]: 4: Hoare triple {67092#true} assume true; {67092#true} is VALID [2022-02-20 18:22:27,750 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {67092#true} {67092#true} #437#return; {67092#true} is VALID [2022-02-20 18:22:27,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {67092#true} assume { :begin_inline_init_threads } true; {67092#true} is VALID [2022-02-20 18:22:27,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {67092#true} assume 1 == ~m_i~0;~m_st~0 := 0; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {67096#(= ~m_st~0 0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {67096#(= ~m_st~0 0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {67096#(= ~m_st~0 0)} assume { :end_inline_init_threads } true; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,752 INFO L272 TraceCheckUtils]: 11: Hoare triple {67096#(= ~m_st~0 0)} call fire_delta_events(); {67141#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:27,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {67141#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {67092#true} is VALID [2022-02-20 18:22:27,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {67092#true} assume !(0 == ~T1_E~0); {67092#true} is VALID [2022-02-20 18:22:27,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {67092#true} assume !(0 == ~T2_E~0); {67092#true} is VALID [2022-02-20 18:22:27,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {67092#true} assume !(0 == ~E_1~0); {67092#true} is VALID [2022-02-20 18:22:27,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {67092#true} assume !(0 == ~E_2~0); {67092#true} is VALID [2022-02-20 18:22:27,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {67092#true} assume true; {67092#true} is VALID [2022-02-20 18:22:27,753 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {67092#true} {67096#(= ~m_st~0 0)} #439#return; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,754 INFO L272 TraceCheckUtils]: 19: Hoare triple {67096#(= ~m_st~0 0)} call activate_threads(); {67142#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:22:27,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {67142#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume !(1 == ~m_pc~0); {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} is_master_triggered_~__retres1~0#1 := 0; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume !(0 != ~tmp~1#1); {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume !(1 == ~t1_pc~0); {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} is_transmit1_triggered_~__retres1~1#1 := 0; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume !(0 != ~tmp___0~0#1); {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume !(1 == ~t2_pc~0); {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} is_transmit2_triggered_~__retres1~2#1 := 0; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,759 INFO L290 TraceCheckUtils]: 36: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,759 INFO L290 TraceCheckUtils]: 37: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume !(0 != ~tmp___1~0#1); {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {67143#(= ~m_st~0 |old(~m_st~0)|)} assume true; {67143#(= ~m_st~0 |old(~m_st~0)|)} is VALID [2022-02-20 18:22:27,759 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {67143#(= ~m_st~0 |old(~m_st~0)|)} {67096#(= ~m_st~0 0)} #441#return; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,760 INFO L272 TraceCheckUtils]: 40: Hoare triple {67096#(= ~m_st~0 0)} call reset_delta_events(); {67141#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:27,760 INFO L290 TraceCheckUtils]: 41: Hoare triple {67141#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {67092#true} is VALID [2022-02-20 18:22:27,760 INFO L290 TraceCheckUtils]: 42: Hoare triple {67092#true} assume !(1 == ~T1_E~0); {67092#true} is VALID [2022-02-20 18:22:27,760 INFO L290 TraceCheckUtils]: 43: Hoare triple {67092#true} assume !(1 == ~T2_E~0); {67092#true} is VALID [2022-02-20 18:22:27,760 INFO L290 TraceCheckUtils]: 44: Hoare triple {67092#true} assume !(1 == ~E_1~0); {67092#true} is VALID [2022-02-20 18:22:27,761 INFO L290 TraceCheckUtils]: 45: Hoare triple {67092#true} assume !(1 == ~E_2~0); {67092#true} is VALID [2022-02-20 18:22:27,761 INFO L290 TraceCheckUtils]: 46: Hoare triple {67092#true} assume true; {67092#true} is VALID [2022-02-20 18:22:27,761 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {67092#true} {67096#(= ~m_st~0 0)} #443#return; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,761 INFO L290 TraceCheckUtils]: 48: Hoare triple {67096#(= ~m_st~0 0)} assume !false; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {67096#(= ~m_st~0 0)} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,762 INFO L290 TraceCheckUtils]: 50: Hoare triple {67096#(= ~m_st~0 0)} assume !false; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,762 INFO L272 TraceCheckUtils]: 51: Hoare triple {67096#(= ~m_st~0 0)} call eval_#t~ret4#1 := exists_runnable_thread(); {67092#true} is VALID [2022-02-20 18:22:27,762 INFO L290 TraceCheckUtils]: 52: Hoare triple {67092#true} havoc ~__retres1~3; {67092#true} is VALID [2022-02-20 18:22:27,762 INFO L290 TraceCheckUtils]: 53: Hoare triple {67092#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,763 INFO L290 TraceCheckUtils]: 54: Hoare triple {67096#(= ~m_st~0 0)} #res := ~__retres1~3; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,763 INFO L290 TraceCheckUtils]: 55: Hoare triple {67096#(= ~m_st~0 0)} assume true; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,763 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {67096#(= ~m_st~0 0)} {67096#(= ~m_st~0 0)} #445#return; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {67096#(= ~m_st~0 0)} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,764 INFO L290 TraceCheckUtils]: 58: Hoare triple {67096#(= ~m_st~0 0)} assume 0 != eval_~tmp~0#1; {67096#(= ~m_st~0 0)} is VALID [2022-02-20 18:22:27,764 INFO L290 TraceCheckUtils]: 59: Hoare triple {67096#(= ~m_st~0 0)} assume !(0 == ~m_st~0); {67093#false} is VALID [2022-02-20 18:22:27,764 INFO L290 TraceCheckUtils]: 60: Hoare triple {67093#false} assume !(0 == ~t1_st~0); {67093#false} is VALID [2022-02-20 18:22:27,764 INFO L290 TraceCheckUtils]: 61: Hoare triple {67093#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {67093#false} is VALID [2022-02-20 18:22:27,764 INFO L290 TraceCheckUtils]: 62: Hoare triple {67093#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {67093#false} is VALID [2022-02-20 18:22:27,765 INFO L290 TraceCheckUtils]: 63: Hoare triple {67093#false} assume 0 == ~t2_pc~0; {67093#false} is VALID [2022-02-20 18:22:27,765 INFO L290 TraceCheckUtils]: 64: Hoare triple {67093#false} assume !false; {67093#false} is VALID [2022-02-20 18:22:27,765 INFO L290 TraceCheckUtils]: 65: Hoare triple {67093#false} ~t2_pc~0 := 1;~t2_st~0 := 2; {67093#false} is VALID [2022-02-20 18:22:27,765 INFO L290 TraceCheckUtils]: 66: Hoare triple {67093#false} assume { :end_inline_transmit2 } true; {67093#false} is VALID [2022-02-20 18:22:27,765 INFO L290 TraceCheckUtils]: 67: Hoare triple {67093#false} assume !false; {67093#false} is VALID [2022-02-20 18:22:27,765 INFO L272 TraceCheckUtils]: 68: Hoare triple {67093#false} call eval_#t~ret4#1 := exists_runnable_thread(); {67092#true} is VALID [2022-02-20 18:22:27,765 INFO L290 TraceCheckUtils]: 69: Hoare triple {67092#true} havoc ~__retres1~3; {67092#true} is VALID [2022-02-20 18:22:27,765 INFO L290 TraceCheckUtils]: 70: Hoare triple {67092#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {67092#true} is VALID [2022-02-20 18:22:27,766 INFO L290 TraceCheckUtils]: 71: Hoare triple {67092#true} #res := ~__retres1~3; {67092#true} is VALID [2022-02-20 18:22:27,766 INFO L290 TraceCheckUtils]: 72: Hoare triple {67092#true} assume true; {67092#true} is VALID [2022-02-20 18:22:27,766 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {67092#true} {67093#false} #445#return; {67093#false} is VALID [2022-02-20 18:22:27,766 INFO L290 TraceCheckUtils]: 74: Hoare triple {67093#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {67093#false} is VALID [2022-02-20 18:22:27,766 INFO L290 TraceCheckUtils]: 75: Hoare triple {67093#false} assume 0 != eval_~tmp~0#1; {67093#false} is VALID [2022-02-20 18:22:27,766 INFO L290 TraceCheckUtils]: 76: Hoare triple {67093#false} assume !(0 == ~m_st~0); {67093#false} is VALID [2022-02-20 18:22:27,766 INFO L290 TraceCheckUtils]: 77: Hoare triple {67093#false} assume !(0 == ~t1_st~0); {67093#false} is VALID [2022-02-20 18:22:27,766 INFO L290 TraceCheckUtils]: 78: Hoare triple {67093#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {67093#false} is VALID [2022-02-20 18:22:27,766 INFO L290 TraceCheckUtils]: 79: Hoare triple {67093#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {67093#false} is VALID [2022-02-20 18:22:27,767 INFO L290 TraceCheckUtils]: 80: Hoare triple {67093#false} assume !(0 == ~t2_pc~0); {67093#false} is VALID [2022-02-20 18:22:27,767 INFO L290 TraceCheckUtils]: 81: Hoare triple {67093#false} assume 1 == ~t2_pc~0; {67093#false} is VALID [2022-02-20 18:22:27,767 INFO L290 TraceCheckUtils]: 82: Hoare triple {67093#false} assume { :begin_inline_error } true; {67093#false} is VALID [2022-02-20 18:22:27,767 INFO L290 TraceCheckUtils]: 83: Hoare triple {67093#false} assume !false; {67093#false} is VALID [2022-02-20 18:22:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 18:22:27,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:22:27,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214548889] [2022-02-20 18:22:27,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214548889] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:22:27,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944013655] [2022-02-20 18:22:27,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:22:27,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:22:27,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:22:27,770 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 18:22:27,772 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 18:22:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:27,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 18:22:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:27,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:22:28,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {67092#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(21, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2; {67092#true} is VALID [2022-02-20 18:22:28,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {67092#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {67092#true} is VALID [2022-02-20 18:22:28,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {67092#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {67092#true} is VALID [2022-02-20 18:22:28,067 INFO L272 TraceCheckUtils]: 3: Hoare triple {67092#true} call update_channels(); {67092#true} is VALID [2022-02-20 18:22:28,067 INFO L290 TraceCheckUtils]: 4: Hoare triple {67092#true} assume true; {67092#true} is VALID [2022-02-20 18:22:28,067 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {67092#true} {67092#true} #437#return; {67092#true} is VALID [2022-02-20 18:22:28,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {67092#true} assume { :begin_inline_init_threads } true; {67092#true} is VALID [2022-02-20 18:22:28,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {67092#true} assume 1 == ~m_i~0;~m_st~0 := 0; {67092#true} is VALID [2022-02-20 18:22:28,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {67092#true} assume 1 == ~t1_i~0;~t1_st~0 := 0; {67092#true} is VALID [2022-02-20 18:22:28,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {67092#true} assume 1 == ~t2_i~0;~t2_st~0 := 0; {67092#true} is VALID [2022-02-20 18:22:28,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {67092#true} assume { :end_inline_init_threads } true; {67092#true} is VALID [2022-02-20 18:22:28,068 INFO L272 TraceCheckUtils]: 11: Hoare triple {67092#true} call fire_delta_events(); {67092#true} is VALID [2022-02-20 18:22:28,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {67092#true} assume !(0 == ~M_E~0); {67092#true} is VALID [2022-02-20 18:22:28,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {67092#true} assume !(0 == ~T1_E~0); {67092#true} is VALID [2022-02-20 18:22:28,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {67092#true} assume !(0 == ~T2_E~0); {67092#true} is VALID [2022-02-20 18:22:28,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {67092#true} assume !(0 == ~E_1~0); {67092#true} is VALID [2022-02-20 18:22:28,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {67092#true} assume !(0 == ~E_2~0); {67092#true} is VALID [2022-02-20 18:22:28,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {67092#true} assume true; {67092#true} is VALID [2022-02-20 18:22:28,069 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {67092#true} {67092#true} #439#return; {67092#true} is VALID [2022-02-20 18:22:28,069 INFO L272 TraceCheckUtils]: 19: Hoare triple {67092#true} call activate_threads(); {67092#true} is VALID [2022-02-20 18:22:28,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {67092#true} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {67092#true} is VALID [2022-02-20 18:22:28,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {67092#true} assume !(1 == ~m_pc~0); {67092#true} is VALID [2022-02-20 18:22:28,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {67092#true} is_master_triggered_~__retres1~0#1 := 0; {67092#true} is VALID [2022-02-20 18:22:28,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {67092#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {67092#true} is VALID [2022-02-20 18:22:28,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {67092#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {67092#true} is VALID [2022-02-20 18:22:28,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {67092#true} assume !(0 != ~tmp~1#1); {67092#true} is VALID [2022-02-20 18:22:28,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {67092#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {67092#true} is VALID [2022-02-20 18:22:28,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {67092#true} assume !(1 == ~t1_pc~0); {67092#true} is VALID [2022-02-20 18:22:28,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {67092#true} is_transmit1_triggered_~__retres1~1#1 := 0; {67092#true} is VALID [2022-02-20 18:22:28,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {67092#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {67092#true} is VALID [2022-02-20 18:22:28,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {67092#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {67092#true} is VALID [2022-02-20 18:22:28,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {67092#true} assume !(0 != ~tmp___0~0#1); {67092#true} is VALID [2022-02-20 18:22:28,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {67092#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {67092#true} is VALID [2022-02-20 18:22:28,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {67092#true} assume !(1 == ~t2_pc~0); {67092#true} is VALID [2022-02-20 18:22:28,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {67092#true} is_transmit2_triggered_~__retres1~2#1 := 0; {67092#true} is VALID [2022-02-20 18:22:28,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {67092#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {67092#true} is VALID [2022-02-20 18:22:28,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {67092#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {67092#true} is VALID [2022-02-20 18:22:28,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {67092#true} assume !(0 != ~tmp___1~0#1); {67092#true} is VALID [2022-02-20 18:22:28,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {67092#true} assume true; {67092#true} is VALID [2022-02-20 18:22:28,074 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {67092#true} {67092#true} #441#return; {67092#true} is VALID [2022-02-20 18:22:28,074 INFO L272 TraceCheckUtils]: 40: Hoare triple {67092#true} call reset_delta_events(); {67092#true} is VALID [2022-02-20 18:22:28,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {67092#true} assume !(1 == ~M_E~0); {67092#true} is VALID [2022-02-20 18:22:28,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {67092#true} assume !(1 == ~T1_E~0); {67092#true} is VALID [2022-02-20 18:22:28,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {67092#true} assume !(1 == ~T2_E~0); {67092#true} is VALID [2022-02-20 18:22:28,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {67092#true} assume !(1 == ~E_1~0); {67092#true} is VALID [2022-02-20 18:22:28,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {67092#true} assume !(1 == ~E_2~0); {67092#true} is VALID [2022-02-20 18:22:28,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {67092#true} assume true; {67092#true} is VALID [2022-02-20 18:22:28,075 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {67092#true} {67092#true} #443#return; {67092#true} is VALID [2022-02-20 18:22:28,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {67092#true} assume !false; {67092#true} is VALID [2022-02-20 18:22:28,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {67092#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {67092#true} is VALID [2022-02-20 18:22:28,075 INFO L290 TraceCheckUtils]: 50: Hoare triple {67092#true} assume !false; {67092#true} is VALID [2022-02-20 18:22:28,075 INFO L272 TraceCheckUtils]: 51: Hoare triple {67092#true} call eval_#t~ret4#1 := exists_runnable_thread(); {67092#true} is VALID [2022-02-20 18:22:28,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {67092#true} havoc ~__retres1~3; {67092#true} is VALID [2022-02-20 18:22:28,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {67092#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {67092#true} is VALID [2022-02-20 18:22:28,076 INFO L290 TraceCheckUtils]: 54: Hoare triple {67092#true} #res := ~__retres1~3; {67092#true} is VALID [2022-02-20 18:22:28,076 INFO L290 TraceCheckUtils]: 55: Hoare triple {67092#true} assume true; {67092#true} is VALID [2022-02-20 18:22:28,089 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {67092#true} {67092#true} #445#return; {67092#true} is VALID [2022-02-20 18:22:28,089 INFO L290 TraceCheckUtils]: 57: Hoare triple {67092#true} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {67092#true} is VALID [2022-02-20 18:22:28,089 INFO L290 TraceCheckUtils]: 58: Hoare triple {67092#true} assume 0 != eval_~tmp~0#1; {67092#true} is VALID [2022-02-20 18:22:28,090 INFO L290 TraceCheckUtils]: 59: Hoare triple {67092#true} assume !(0 == ~m_st~0); {67092#true} is VALID [2022-02-20 18:22:28,090 INFO L290 TraceCheckUtils]: 60: Hoare triple {67092#true} assume !(0 == ~t1_st~0); {67092#true} is VALID [2022-02-20 18:22:28,090 INFO L290 TraceCheckUtils]: 61: Hoare triple {67092#true} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {67092#true} is VALID [2022-02-20 18:22:28,090 INFO L290 TraceCheckUtils]: 62: Hoare triple {67092#true} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {67092#true} is VALID [2022-02-20 18:22:28,090 INFO L290 TraceCheckUtils]: 63: Hoare triple {67092#true} assume 0 == ~t2_pc~0; {67092#true} is VALID [2022-02-20 18:22:28,090 INFO L290 TraceCheckUtils]: 64: Hoare triple {67092#true} assume !false; {67092#true} is VALID [2022-02-20 18:22:28,091 INFO L290 TraceCheckUtils]: 65: Hoare triple {67092#true} ~t2_pc~0 := 1;~t2_st~0 := 2; {67342#(<= 2 ~t2_st~0)} is VALID [2022-02-20 18:22:28,091 INFO L290 TraceCheckUtils]: 66: Hoare triple {67342#(<= 2 ~t2_st~0)} assume { :end_inline_transmit2 } true; {67342#(<= 2 ~t2_st~0)} is VALID [2022-02-20 18:22:28,091 INFO L290 TraceCheckUtils]: 67: Hoare triple {67342#(<= 2 ~t2_st~0)} assume !false; {67342#(<= 2 ~t2_st~0)} is VALID [2022-02-20 18:22:28,092 INFO L272 TraceCheckUtils]: 68: Hoare triple {67342#(<= 2 ~t2_st~0)} call eval_#t~ret4#1 := exists_runnable_thread(); {67342#(<= 2 ~t2_st~0)} is VALID [2022-02-20 18:22:28,092 INFO L290 TraceCheckUtils]: 69: Hoare triple {67342#(<= 2 ~t2_st~0)} havoc ~__retres1~3; {67342#(<= 2 ~t2_st~0)} is VALID [2022-02-20 18:22:28,093 INFO L290 TraceCheckUtils]: 70: Hoare triple {67342#(<= 2 ~t2_st~0)} assume 0 == ~m_st~0;~__retres1~3 := 1; {67342#(<= 2 ~t2_st~0)} is VALID [2022-02-20 18:22:28,093 INFO L290 TraceCheckUtils]: 71: Hoare triple {67342#(<= 2 ~t2_st~0)} #res := ~__retres1~3; {67342#(<= 2 ~t2_st~0)} is VALID [2022-02-20 18:22:28,093 INFO L290 TraceCheckUtils]: 72: Hoare triple {67342#(<= 2 ~t2_st~0)} assume true; {67342#(<= 2 ~t2_st~0)} is VALID [2022-02-20 18:22:28,094 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {67342#(<= 2 ~t2_st~0)} {67342#(<= 2 ~t2_st~0)} #445#return; {67342#(<= 2 ~t2_st~0)} is VALID [2022-02-20 18:22:28,094 INFO L290 TraceCheckUtils]: 74: Hoare triple {67342#(<= 2 ~t2_st~0)} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {67342#(<= 2 ~t2_st~0)} is VALID [2022-02-20 18:22:28,094 INFO L290 TraceCheckUtils]: 75: Hoare triple {67342#(<= 2 ~t2_st~0)} assume 0 != eval_~tmp~0#1; {67342#(<= 2 ~t2_st~0)} is VALID [2022-02-20 18:22:28,094 INFO L290 TraceCheckUtils]: 76: Hoare triple {67342#(<= 2 ~t2_st~0)} assume !(0 == ~m_st~0); {67342#(<= 2 ~t2_st~0)} is VALID [2022-02-20 18:22:28,095 INFO L290 TraceCheckUtils]: 77: Hoare triple {67342#(<= 2 ~t2_st~0)} assume !(0 == ~t1_st~0); {67342#(<= 2 ~t2_st~0)} is VALID [2022-02-20 18:22:28,095 INFO L290 TraceCheckUtils]: 78: Hoare triple {67342#(<= 2 ~t2_st~0)} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {67093#false} is VALID [2022-02-20 18:22:28,095 INFO L290 TraceCheckUtils]: 79: Hoare triple {67093#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {67093#false} is VALID [2022-02-20 18:22:28,095 INFO L290 TraceCheckUtils]: 80: Hoare triple {67093#false} assume !(0 == ~t2_pc~0); {67093#false} is VALID [2022-02-20 18:22:28,095 INFO L290 TraceCheckUtils]: 81: Hoare triple {67093#false} assume 1 == ~t2_pc~0; {67093#false} is VALID [2022-02-20 18:22:28,095 INFO L290 TraceCheckUtils]: 82: Hoare triple {67093#false} assume { :begin_inline_error } true; {67093#false} is VALID [2022-02-20 18:22:28,095 INFO L290 TraceCheckUtils]: 83: Hoare triple {67093#false} assume !false; {67093#false} is VALID [2022-02-20 18:22:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:22:28,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:22:28,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944013655] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:22:28,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 18:22:28,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-02-20 18:22:28,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366628892] [2022-02-20 18:22:28,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:22:28,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 84 [2022-02-20 18:22:28,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:22:28,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 18:22:28,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:22:28,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:22:28,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:22:28,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:22:28,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:22:28,140 INFO L87 Difference]: Start difference. First operand 1246 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 18:22:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:30,056 INFO L93 Difference]: Finished difference Result 2883 states and 3926 transitions. [2022-02-20 18:22:30,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:22:30,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 84 [2022-02-20 18:22:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:22:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 18:22:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2022-02-20 18:22:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 18:22:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2022-02-20 18:22:30,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 477 transitions. [2022-02-20 18:22:30,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:22:30,523 INFO L225 Difference]: With dead ends: 2883 [2022-02-20 18:22:30,524 INFO L226 Difference]: Without dead ends: 2039 [2022-02-20 18:22:30,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:22:30,526 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 129 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:22:30,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 474 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:22:30,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2022-02-20 18:22:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2039. [2022-02-20 18:22:32,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:22:32,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2039 states. Second operand has 2039 states, 1721 states have (on average 1.335270191748983) internal successors, (2298), 1731 states have internal predecessors, (2298), 194 states have call successors, (194), 118 states have call predecessors, (194), 123 states have return successors, (258), 190 states have call predecessors, (258), 194 states have call successors, (258) [2022-02-20 18:22:32,355 INFO L74 IsIncluded]: Start isIncluded. First operand 2039 states. Second operand has 2039 states, 1721 states have (on average 1.335270191748983) internal successors, (2298), 1731 states have internal predecessors, (2298), 194 states have call successors, (194), 118 states have call predecessors, (194), 123 states have return successors, (258), 190 states have call predecessors, (258), 194 states have call successors, (258) [2022-02-20 18:22:32,357 INFO L87 Difference]: Start difference. First operand 2039 states. Second operand has 2039 states, 1721 states have (on average 1.335270191748983) internal successors, (2298), 1731 states have internal predecessors, (2298), 194 states have call successors, (194), 118 states have call predecessors, (194), 123 states have return successors, (258), 190 states have call predecessors, (258), 194 states have call successors, (258) [2022-02-20 18:22:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:32,478 INFO L93 Difference]: Finished difference Result 2039 states and 2750 transitions. [2022-02-20 18:22:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2750 transitions. [2022-02-20 18:22:32,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:22:32,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:22:32,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 2039 states, 1721 states have (on average 1.335270191748983) internal successors, (2298), 1731 states have internal predecessors, (2298), 194 states have call successors, (194), 118 states have call predecessors, (194), 123 states have return successors, (258), 190 states have call predecessors, (258), 194 states have call successors, (258) Second operand 2039 states. [2022-02-20 18:22:32,487 INFO L87 Difference]: Start difference. First operand has 2039 states, 1721 states have (on average 1.335270191748983) internal successors, (2298), 1731 states have internal predecessors, (2298), 194 states have call successors, (194), 118 states have call predecessors, (194), 123 states have return successors, (258), 190 states have call predecessors, (258), 194 states have call successors, (258) Second operand 2039 states. [2022-02-20 18:22:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:32,605 INFO L93 Difference]: Finished difference Result 2039 states and 2750 transitions. [2022-02-20 18:22:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2750 transitions. [2022-02-20 18:22:32,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:22:32,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:22:32,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:22:32,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:22:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2039 states, 1721 states have (on average 1.335270191748983) internal successors, (2298), 1731 states have internal predecessors, (2298), 194 states have call successors, (194), 118 states have call predecessors, (194), 123 states have return successors, (258), 190 states have call predecessors, (258), 194 states have call successors, (258) [2022-02-20 18:22:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2750 transitions. [2022-02-20 18:22:32,808 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2750 transitions. Word has length 84 [2022-02-20 18:22:32,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:22:32,808 INFO L470 AbstractCegarLoop]: Abstraction has 2039 states and 2750 transitions. [2022-02-20 18:22:32,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 18:22:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2750 transitions. [2022-02-20 18:22:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-20 18:22:32,809 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:22:32,810 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:22:32,829 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 18:22:33,015 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,SelfDestructingSolverStorable12 [2022-02-20 18:22:33,018 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:22:33,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:22:33,018 INFO L85 PathProgramCache]: Analyzing trace with hash -55730782, now seen corresponding path program 1 times [2022-02-20 18:22:33,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:22:33,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372958775] [2022-02-20 18:22:33,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:22:33,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:22:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:33,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:22:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:33,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {78142#true} assume true; {78142#true} is VALID [2022-02-20 18:22:33,049 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {78142#true} {78142#true} #437#return; {78142#true} is VALID [2022-02-20 18:22:33,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:22:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:33,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {78209#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {78142#true} is VALID [2022-02-20 18:22:33,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {78142#true} assume !(0 == ~T1_E~0); {78142#true} is VALID [2022-02-20 18:22:33,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {78142#true} assume !(0 == ~T2_E~0); {78142#true} is VALID [2022-02-20 18:22:33,058 INFO L290 TraceCheckUtils]: 3: Hoare triple {78142#true} assume !(0 == ~E_1~0); {78142#true} is VALID [2022-02-20 18:22:33,058 INFO L290 TraceCheckUtils]: 4: Hoare triple {78142#true} assume !(0 == ~E_2~0); {78142#true} is VALID [2022-02-20 18:22:33,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {78142#true} assume true; {78142#true} is VALID [2022-02-20 18:22:33,059 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {78142#true} {78146#(= ~t1_st~0 0)} #439#return; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:22:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:33,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {78210#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~m_pc~0); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_~__retres1~0#1 := 0; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,077 INFO L290 TraceCheckUtils]: 4: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp~1#1); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~t1_pc~0); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_~__retres1~1#1 := 0; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp___0~0#1); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~t2_pc~0); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit2_triggered_~__retres1~2#1 := 0; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp___1~0#1); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume true; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,081 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {78211#(= |old(~t1_st~0)| ~t1_st~0)} {78146#(= ~t1_st~0 0)} #441#return; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 18:22:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:33,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {78209#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {78142#true} is VALID [2022-02-20 18:22:33,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {78142#true} assume !(1 == ~T1_E~0); {78142#true} is VALID [2022-02-20 18:22:33,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {78142#true} assume !(1 == ~T2_E~0); {78142#true} is VALID [2022-02-20 18:22:33,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {78142#true} assume !(1 == ~E_1~0); {78142#true} is VALID [2022-02-20 18:22:33,085 INFO L290 TraceCheckUtils]: 4: Hoare triple {78142#true} assume !(1 == ~E_2~0); {78142#true} is VALID [2022-02-20 18:22:33,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {78142#true} assume true; {78142#true} is VALID [2022-02-20 18:22:33,085 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {78142#true} {78146#(= ~t1_st~0 0)} #443#return; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 18:22:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:33,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {78142#true} havoc ~__retres1~3; {78142#true} is VALID [2022-02-20 18:22:33,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {78142#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {78142#true} is VALID [2022-02-20 18:22:33,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {78142#true} #res := ~__retres1~3; {78142#true} is VALID [2022-02-20 18:22:33,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {78142#true} assume true; {78142#true} is VALID [2022-02-20 18:22:33,090 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {78142#true} {78146#(= ~t1_st~0 0)} #445#return; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-02-20 18:22:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:33,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-20 18:22:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:33,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {78210#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~m_pc~0); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_~__retres1~0#1 := 0; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,142 INFO L290 TraceCheckUtils]: 3: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,142 INFO L290 TraceCheckUtils]: 4: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp~1#1); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~t1_pc~0); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_~__retres1~1#1 := 0; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp___0~0#1); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~t2_pc~0); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit2_triggered_~__retres1~2#1 := 0; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp___1~0#1); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume true; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,148 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {78211#(= |old(~t1_st~0)| ~t1_st~0)} {78210#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} #435#return; {78232#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} is VALID [2022-02-20 18:22:33,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {78210#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} call activate_threads(); {78210#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:22:33,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {78210#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~m_pc~0); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_~__retres1~0#1 := 0; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,149 INFO L290 TraceCheckUtils]: 4: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp~1#1); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~t1_pc~0); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_~__retres1~1#1 := 0; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp___0~0#1); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~t2_pc~0); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit2_triggered_~__retres1~2#1 := 0; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp___1~0#1); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume true; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,154 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {78211#(= |old(~t1_st~0)| ~t1_st~0)} {78210#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} #435#return; {78232#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} is VALID [2022-02-20 18:22:33,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {78232#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} assume true; {78232#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} is VALID [2022-02-20 18:22:33,155 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {78232#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} {78146#(= ~t1_st~0 0)} #447#return; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {78142#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(21, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2; {78142#true} is VALID [2022-02-20 18:22:33,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {78142#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {78142#true} is VALID [2022-02-20 18:22:33,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {78142#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {78142#true} is VALID [2022-02-20 18:22:33,156 INFO L272 TraceCheckUtils]: 3: Hoare triple {78142#true} call update_channels(); {78142#true} is VALID [2022-02-20 18:22:33,156 INFO L290 TraceCheckUtils]: 4: Hoare triple {78142#true} assume true; {78142#true} is VALID [2022-02-20 18:22:33,156 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {78142#true} {78142#true} #437#return; {78142#true} is VALID [2022-02-20 18:22:33,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {78142#true} assume { :begin_inline_init_threads } true; {78142#true} is VALID [2022-02-20 18:22:33,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {78142#true} assume 1 == ~m_i~0;~m_st~0 := 0; {78142#true} is VALID [2022-02-20 18:22:33,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {78142#true} assume 1 == ~t1_i~0;~t1_st~0 := 0; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {78146#(= ~t1_st~0 0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {78146#(= ~t1_st~0 0)} assume { :end_inline_init_threads } true; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,158 INFO L272 TraceCheckUtils]: 11: Hoare triple {78146#(= ~t1_st~0 0)} call fire_delta_events(); {78209#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:33,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {78209#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {78142#true} is VALID [2022-02-20 18:22:33,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {78142#true} assume !(0 == ~T1_E~0); {78142#true} is VALID [2022-02-20 18:22:33,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {78142#true} assume !(0 == ~T2_E~0); {78142#true} is VALID [2022-02-20 18:22:33,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {78142#true} assume !(0 == ~E_1~0); {78142#true} is VALID [2022-02-20 18:22:33,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {78142#true} assume !(0 == ~E_2~0); {78142#true} is VALID [2022-02-20 18:22:33,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {78142#true} assume true; {78142#true} is VALID [2022-02-20 18:22:33,158 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {78142#true} {78146#(= ~t1_st~0 0)} #439#return; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,159 INFO L272 TraceCheckUtils]: 19: Hoare triple {78146#(= ~t1_st~0 0)} call activate_threads(); {78210#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:22:33,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {78210#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~m_pc~0); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_~__retres1~0#1 := 0; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp~1#1); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~t1_pc~0); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_~__retres1~1#1 := 0; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp___0~0#1); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,162 INFO L290 TraceCheckUtils]: 32: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~t2_pc~0); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit2_triggered_~__retres1~2#1 := 0; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,163 INFO L290 TraceCheckUtils]: 36: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp___1~0#1); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume true; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,164 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {78211#(= |old(~t1_st~0)| ~t1_st~0)} {78146#(= ~t1_st~0 0)} #441#return; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,165 INFO L272 TraceCheckUtils]: 40: Hoare triple {78146#(= ~t1_st~0 0)} call reset_delta_events(); {78209#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:33,165 INFO L290 TraceCheckUtils]: 41: Hoare triple {78209#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {78142#true} is VALID [2022-02-20 18:22:33,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {78142#true} assume !(1 == ~T1_E~0); {78142#true} is VALID [2022-02-20 18:22:33,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {78142#true} assume !(1 == ~T2_E~0); {78142#true} is VALID [2022-02-20 18:22:33,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {78142#true} assume !(1 == ~E_1~0); {78142#true} is VALID [2022-02-20 18:22:33,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {78142#true} assume !(1 == ~E_2~0); {78142#true} is VALID [2022-02-20 18:22:33,165 INFO L290 TraceCheckUtils]: 46: Hoare triple {78142#true} assume true; {78142#true} is VALID [2022-02-20 18:22:33,166 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {78142#true} {78146#(= ~t1_st~0 0)} #443#return; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {78146#(= ~t1_st~0 0)} assume !false; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {78146#(= ~t1_st~0 0)} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,167 INFO L290 TraceCheckUtils]: 50: Hoare triple {78146#(= ~t1_st~0 0)} assume !false; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,167 INFO L272 TraceCheckUtils]: 51: Hoare triple {78146#(= ~t1_st~0 0)} call eval_#t~ret4#1 := exists_runnable_thread(); {78142#true} is VALID [2022-02-20 18:22:33,167 INFO L290 TraceCheckUtils]: 52: Hoare triple {78142#true} havoc ~__retres1~3; {78142#true} is VALID [2022-02-20 18:22:33,167 INFO L290 TraceCheckUtils]: 53: Hoare triple {78142#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {78142#true} is VALID [2022-02-20 18:22:33,167 INFO L290 TraceCheckUtils]: 54: Hoare triple {78142#true} #res := ~__retres1~3; {78142#true} is VALID [2022-02-20 18:22:33,167 INFO L290 TraceCheckUtils]: 55: Hoare triple {78142#true} assume true; {78142#true} is VALID [2022-02-20 18:22:33,167 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {78142#true} {78146#(= ~t1_st~0 0)} #445#return; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,168 INFO L290 TraceCheckUtils]: 57: Hoare triple {78146#(= ~t1_st~0 0)} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,168 INFO L290 TraceCheckUtils]: 58: Hoare triple {78146#(= ~t1_st~0 0)} assume 0 != eval_~tmp~0#1; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,168 INFO L290 TraceCheckUtils]: 59: Hoare triple {78146#(= ~t1_st~0 0)} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet5#1 && eval_#t~nondet5#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,169 INFO L290 TraceCheckUtils]: 60: Hoare triple {78146#(= ~t1_st~0 0)} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,169 INFO L290 TraceCheckUtils]: 61: Hoare triple {78146#(= ~t1_st~0 0)} assume 0 == ~m_pc~0; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,169 INFO L290 TraceCheckUtils]: 62: Hoare triple {78146#(= ~t1_st~0 0)} assume !false; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,170 INFO L290 TraceCheckUtils]: 63: Hoare triple {78146#(= ~t1_st~0 0)} ~E_1~0 := 1; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,170 INFO L272 TraceCheckUtils]: 64: Hoare triple {78146#(= ~t1_st~0 0)} call immediate_notify(); {78210#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:22:33,170 INFO L272 TraceCheckUtils]: 65: Hoare triple {78210#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} call activate_threads(); {78210#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:22:33,171 INFO L290 TraceCheckUtils]: 66: Hoare triple {78210#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,171 INFO L290 TraceCheckUtils]: 67: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~m_pc~0); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,171 INFO L290 TraceCheckUtils]: 68: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_~__retres1~0#1 := 0; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,172 INFO L290 TraceCheckUtils]: 69: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,172 INFO L290 TraceCheckUtils]: 70: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,172 INFO L290 TraceCheckUtils]: 71: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp~1#1); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,173 INFO L290 TraceCheckUtils]: 72: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,173 INFO L290 TraceCheckUtils]: 73: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~t1_pc~0); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,173 INFO L290 TraceCheckUtils]: 74: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_~__retres1~1#1 := 0; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,173 INFO L290 TraceCheckUtils]: 75: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,174 INFO L290 TraceCheckUtils]: 76: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,174 INFO L290 TraceCheckUtils]: 77: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp___0~0#1); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,174 INFO L290 TraceCheckUtils]: 78: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,175 INFO L290 TraceCheckUtils]: 79: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~t2_pc~0); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,175 INFO L290 TraceCheckUtils]: 80: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit2_triggered_~__retres1~2#1 := 0; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,175 INFO L290 TraceCheckUtils]: 81: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,175 INFO L290 TraceCheckUtils]: 82: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,176 INFO L290 TraceCheckUtils]: 83: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp___1~0#1); {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,176 INFO L290 TraceCheckUtils]: 84: Hoare triple {78211#(= |old(~t1_st~0)| ~t1_st~0)} assume true; {78211#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 18:22:33,176 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {78211#(= |old(~t1_st~0)| ~t1_st~0)} {78210#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} #435#return; {78232#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} is VALID [2022-02-20 18:22:33,177 INFO L290 TraceCheckUtils]: 86: Hoare triple {78232#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} assume true; {78232#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} is VALID [2022-02-20 18:22:33,177 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {78232#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} {78146#(= ~t1_st~0 0)} #447#return; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,178 INFO L290 TraceCheckUtils]: 88: Hoare triple {78146#(= ~t1_st~0 0)} ~E_1~0 := 2; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,178 INFO L290 TraceCheckUtils]: 89: Hoare triple {78146#(= ~t1_st~0 0)} assume !false; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,178 INFO L290 TraceCheckUtils]: 90: Hoare triple {78146#(= ~t1_st~0 0)} ~m_pc~0 := 1;~m_st~0 := 2; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,179 INFO L290 TraceCheckUtils]: 91: Hoare triple {78146#(= ~t1_st~0 0)} assume { :end_inline_master } true; {78146#(= ~t1_st~0 0)} is VALID [2022-02-20 18:22:33,179 INFO L290 TraceCheckUtils]: 92: Hoare triple {78146#(= ~t1_st~0 0)} assume !(0 == ~t1_st~0); {78143#false} is VALID [2022-02-20 18:22:33,179 INFO L290 TraceCheckUtils]: 93: Hoare triple {78143#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {78143#false} is VALID [2022-02-20 18:22:33,179 INFO L290 TraceCheckUtils]: 94: Hoare triple {78143#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {78143#false} is VALID [2022-02-20 18:22:33,179 INFO L290 TraceCheckUtils]: 95: Hoare triple {78143#false} assume !(0 == ~t2_pc~0); {78143#false} is VALID [2022-02-20 18:22:33,179 INFO L290 TraceCheckUtils]: 96: Hoare triple {78143#false} assume 1 == ~t2_pc~0; {78143#false} is VALID [2022-02-20 18:22:33,179 INFO L290 TraceCheckUtils]: 97: Hoare triple {78143#false} assume { :begin_inline_error } true; {78143#false} is VALID [2022-02-20 18:22:33,179 INFO L290 TraceCheckUtils]: 98: Hoare triple {78143#false} assume !false; {78143#false} is VALID [2022-02-20 18:22:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 18:22:33,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:22:33,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372958775] [2022-02-20 18:22:33,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372958775] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:22:33,180 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:22:33,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:22:33,180 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623443392] [2022-02-20 18:22:33,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:22:33,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2022-02-20 18:22:33,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:22:33,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 18:22:33,235 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 18:22:33,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:22:33,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:22:33,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:22:33,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:22:33,236 INFO L87 Difference]: Start difference. First operand 2039 states and 2750 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 18:22:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:39,861 INFO L93 Difference]: Finished difference Result 6620 states and 9061 transitions. [2022-02-20 18:22:39,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:22:39,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2022-02-20 18:22:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:22:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 18:22:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 593 transitions. [2022-02-20 18:22:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 18:22:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 593 transitions. [2022-02-20 18:22:39,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 593 transitions. [2022-02-20 18:22:40,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:22:41,172 INFO L225 Difference]: With dead ends: 6620 [2022-02-20 18:22:41,172 INFO L226 Difference]: Without dead ends: 4593 [2022-02-20 18:22:41,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:22:41,177 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 697 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:22:41,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [705 Valid, 452 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:22:41,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2022-02-20 18:22:45,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4197. [2022-02-20 18:22:45,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:22:45,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4593 states. Second operand has 4197 states, 3533 states have (on average 1.3102179450891593) internal successors, (4629), 3587 states have internal predecessors, (4629), 366 states have call successors, (366), 230 states have call predecessors, (366), 297 states have return successors, (707), 381 states have call predecessors, (707), 366 states have call successors, (707) [2022-02-20 18:22:45,501 INFO L74 IsIncluded]: Start isIncluded. First operand 4593 states. Second operand has 4197 states, 3533 states have (on average 1.3102179450891593) internal successors, (4629), 3587 states have internal predecessors, (4629), 366 states have call successors, (366), 230 states have call predecessors, (366), 297 states have return successors, (707), 381 states have call predecessors, (707), 366 states have call successors, (707) [2022-02-20 18:22:45,507 INFO L87 Difference]: Start difference. First operand 4593 states. Second operand has 4197 states, 3533 states have (on average 1.3102179450891593) internal successors, (4629), 3587 states have internal predecessors, (4629), 366 states have call successors, (366), 230 states have call predecessors, (366), 297 states have return successors, (707), 381 states have call predecessors, (707), 366 states have call successors, (707) [2022-02-20 18:22:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:46,105 INFO L93 Difference]: Finished difference Result 4593 states and 6229 transitions. [2022-02-20 18:22:46,105 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 6229 transitions. [2022-02-20 18:22:46,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:22:46,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:22:46,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 4197 states, 3533 states have (on average 1.3102179450891593) internal successors, (4629), 3587 states have internal predecessors, (4629), 366 states have call successors, (366), 230 states have call predecessors, (366), 297 states have return successors, (707), 381 states have call predecessors, (707), 366 states have call successors, (707) Second operand 4593 states. [2022-02-20 18:22:46,119 INFO L87 Difference]: Start difference. First operand has 4197 states, 3533 states have (on average 1.3102179450891593) internal successors, (4629), 3587 states have internal predecessors, (4629), 366 states have call successors, (366), 230 states have call predecessors, (366), 297 states have return successors, (707), 381 states have call predecessors, (707), 366 states have call successors, (707) Second operand 4593 states. [2022-02-20 18:22:46,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:22:46,731 INFO L93 Difference]: Finished difference Result 4593 states and 6229 transitions. [2022-02-20 18:22:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 6229 transitions. [2022-02-20 18:22:46,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:22:46,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:22:46,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:22:46,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:22:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4197 states, 3533 states have (on average 1.3102179450891593) internal successors, (4629), 3587 states have internal predecessors, (4629), 366 states have call successors, (366), 230 states have call predecessors, (366), 297 states have return successors, (707), 381 states have call predecessors, (707), 366 states have call successors, (707) [2022-02-20 18:22:47,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4197 states to 4197 states and 5702 transitions. [2022-02-20 18:22:47,517 INFO L78 Accepts]: Start accepts. Automaton has 4197 states and 5702 transitions. Word has length 99 [2022-02-20 18:22:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:22:47,517 INFO L470 AbstractCegarLoop]: Abstraction has 4197 states and 5702 transitions. [2022-02-20 18:22:47,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 18:22:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 4197 states and 5702 transitions. [2022-02-20 18:22:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-20 18:22:47,518 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:22:47,519 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:22:47,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 18:22:47,519 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:22:47,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:22:47,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1996312796, now seen corresponding path program 1 times [2022-02-20 18:22:47,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:22:47,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758097421] [2022-02-20 18:22:47,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:22:47,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:22:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:47,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:22:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:47,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {101904#true} assume true; {101904#true} is VALID [2022-02-20 18:22:47,539 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {101904#true} {101906#(= ~t1_i~0 1)} #437#return; {101906#(= ~t1_i~0 1)} is VALID [2022-02-20 18:22:47,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:22:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:47,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {101971#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {101904#true} is VALID [2022-02-20 18:22:47,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {101904#true} assume !(0 == ~T1_E~0); {101904#true} is VALID [2022-02-20 18:22:47,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {101904#true} assume !(0 == ~T2_E~0); {101904#true} is VALID [2022-02-20 18:22:47,549 INFO L290 TraceCheckUtils]: 3: Hoare triple {101904#true} assume !(0 == ~E_1~0); {101904#true} is VALID [2022-02-20 18:22:47,549 INFO L290 TraceCheckUtils]: 4: Hoare triple {101904#true} assume !(0 == ~E_2~0); {101904#true} is VALID [2022-02-20 18:22:47,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {101904#true} assume true; {101904#true} is VALID [2022-02-20 18:22:47,549 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {101904#true} {101905#false} #439#return; {101905#false} is VALID [2022-02-20 18:22:47,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:22:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:47,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {101972#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {101904#true} is VALID [2022-02-20 18:22:47,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {101904#true} assume !(1 == ~m_pc~0); {101904#true} is VALID [2022-02-20 18:22:47,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {101904#true} is_master_triggered_~__retres1~0#1 := 0; {101904#true} is VALID [2022-02-20 18:22:47,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {101904#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {101904#true} is VALID [2022-02-20 18:22:47,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {101904#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {101904#true} is VALID [2022-02-20 18:22:47,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {101904#true} assume !(0 != ~tmp~1#1); {101904#true} is VALID [2022-02-20 18:22:47,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {101904#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {101904#true} is VALID [2022-02-20 18:22:47,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {101904#true} assume !(1 == ~t1_pc~0); {101904#true} is VALID [2022-02-20 18:22:47,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {101904#true} is_transmit1_triggered_~__retres1~1#1 := 0; {101904#true} is VALID [2022-02-20 18:22:47,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {101904#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {101904#true} is VALID [2022-02-20 18:22:47,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {101904#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {101904#true} is VALID [2022-02-20 18:22:47,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {101904#true} assume !(0 != ~tmp___0~0#1); {101904#true} is VALID [2022-02-20 18:22:47,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {101904#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {101904#true} is VALID [2022-02-20 18:22:47,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {101904#true} assume !(1 == ~t2_pc~0); {101904#true} is VALID [2022-02-20 18:22:47,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {101904#true} is_transmit2_triggered_~__retres1~2#1 := 0; {101904#true} is VALID [2022-02-20 18:22:47,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {101904#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {101904#true} is VALID [2022-02-20 18:22:47,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {101904#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {101904#true} is VALID [2022-02-20 18:22:47,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {101904#true} assume !(0 != ~tmp___1~0#1); {101904#true} is VALID [2022-02-20 18:22:47,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {101904#true} assume true; {101904#true} is VALID [2022-02-20 18:22:47,563 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {101904#true} {101905#false} #441#return; {101905#false} is VALID [2022-02-20 18:22:47,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 18:22:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:47,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {101971#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {101904#true} is VALID [2022-02-20 18:22:47,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {101904#true} assume !(1 == ~T1_E~0); {101904#true} is VALID [2022-02-20 18:22:47,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {101904#true} assume !(1 == ~T2_E~0); {101904#true} is VALID [2022-02-20 18:22:47,566 INFO L290 TraceCheckUtils]: 3: Hoare triple {101904#true} assume !(1 == ~E_1~0); {101904#true} is VALID [2022-02-20 18:22:47,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {101904#true} assume !(1 == ~E_2~0); {101904#true} is VALID [2022-02-20 18:22:47,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {101904#true} assume true; {101904#true} is VALID [2022-02-20 18:22:47,566 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {101904#true} {101905#false} #443#return; {101905#false} is VALID [2022-02-20 18:22:47,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 18:22:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:47,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {101904#true} havoc ~__retres1~3; {101904#true} is VALID [2022-02-20 18:22:47,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {101904#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {101904#true} is VALID [2022-02-20 18:22:47,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {101904#true} #res := ~__retres1~3; {101904#true} is VALID [2022-02-20 18:22:47,569 INFO L290 TraceCheckUtils]: 3: Hoare triple {101904#true} assume true; {101904#true} is VALID [2022-02-20 18:22:47,569 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {101904#true} {101905#false} #445#return; {101905#false} is VALID [2022-02-20 18:22:47,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-02-20 18:22:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:47,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-20 18:22:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:22:47,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {101972#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {101904#true} is VALID [2022-02-20 18:22:47,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {101904#true} assume !(1 == ~m_pc~0); {101904#true} is VALID [2022-02-20 18:22:47,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {101904#true} is_master_triggered_~__retres1~0#1 := 0; {101904#true} is VALID [2022-02-20 18:22:47,578 INFO L290 TraceCheckUtils]: 3: Hoare triple {101904#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {101904#true} is VALID [2022-02-20 18:22:47,578 INFO L290 TraceCheckUtils]: 4: Hoare triple {101904#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {101904#true} is VALID [2022-02-20 18:22:47,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {101904#true} assume !(0 != ~tmp~1#1); {101904#true} is VALID [2022-02-20 18:22:47,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {101904#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {101904#true} is VALID [2022-02-20 18:22:47,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {101904#true} assume !(1 == ~t1_pc~0); {101904#true} is VALID [2022-02-20 18:22:47,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {101904#true} is_transmit1_triggered_~__retres1~1#1 := 0; {101904#true} is VALID [2022-02-20 18:22:47,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {101904#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {101904#true} is VALID [2022-02-20 18:22:47,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {101904#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {101904#true} is VALID [2022-02-20 18:22:47,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {101904#true} assume !(0 != ~tmp___0~0#1); {101904#true} is VALID [2022-02-20 18:22:47,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {101904#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {101904#true} is VALID [2022-02-20 18:22:47,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {101904#true} assume !(1 == ~t2_pc~0); {101904#true} is VALID [2022-02-20 18:22:47,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {101904#true} is_transmit2_triggered_~__retres1~2#1 := 0; {101904#true} is VALID [2022-02-20 18:22:47,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {101904#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {101904#true} is VALID [2022-02-20 18:22:47,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {101904#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {101904#true} is VALID [2022-02-20 18:22:47,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {101904#true} assume !(0 != ~tmp___1~0#1); {101904#true} is VALID [2022-02-20 18:22:47,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {101904#true} assume true; {101904#true} is VALID [2022-02-20 18:22:47,580 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {101904#true} {101972#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} #435#return; {101904#true} is VALID [2022-02-20 18:22:47,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {101972#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} call activate_threads(); {101972#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:22:47,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {101972#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {101904#true} is VALID [2022-02-20 18:22:47,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {101904#true} assume !(1 == ~m_pc~0); {101904#true} is VALID [2022-02-20 18:22:47,581 INFO L290 TraceCheckUtils]: 3: Hoare triple {101904#true} is_master_triggered_~__retres1~0#1 := 0; {101904#true} is VALID [2022-02-20 18:22:47,581 INFO L290 TraceCheckUtils]: 4: Hoare triple {101904#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {101904#true} is VALID [2022-02-20 18:22:47,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {101904#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {101904#true} is VALID [2022-02-20 18:22:47,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {101904#true} assume !(0 != ~tmp~1#1); {101904#true} is VALID [2022-02-20 18:22:47,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {101904#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {101904#true} is VALID [2022-02-20 18:22:47,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {101904#true} assume !(1 == ~t1_pc~0); {101904#true} is VALID [2022-02-20 18:22:47,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {101904#true} is_transmit1_triggered_~__retres1~1#1 := 0; {101904#true} is VALID [2022-02-20 18:22:47,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {101904#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {101904#true} is VALID [2022-02-20 18:22:47,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {101904#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {101904#true} is VALID [2022-02-20 18:22:47,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {101904#true} assume !(0 != ~tmp___0~0#1); {101904#true} is VALID [2022-02-20 18:22:47,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {101904#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {101904#true} is VALID [2022-02-20 18:22:47,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {101904#true} assume !(1 == ~t2_pc~0); {101904#true} is VALID [2022-02-20 18:22:47,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {101904#true} is_transmit2_triggered_~__retres1~2#1 := 0; {101904#true} is VALID [2022-02-20 18:22:47,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {101904#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {101904#true} is VALID [2022-02-20 18:22:47,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {101904#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {101904#true} is VALID [2022-02-20 18:22:47,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {101904#true} assume !(0 != ~tmp___1~0#1); {101904#true} is VALID [2022-02-20 18:22:47,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {101904#true} assume true; {101904#true} is VALID [2022-02-20 18:22:47,584 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {101904#true} {101972#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} #435#return; {101904#true} is VALID [2022-02-20 18:22:47,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {101904#true} assume true; {101904#true} is VALID [2022-02-20 18:22:47,584 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {101904#true} {101905#false} #447#return; {101905#false} is VALID [2022-02-20 18:22:47,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {101904#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(21, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2; {101904#true} is VALID [2022-02-20 18:22:47,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {101904#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {101906#(= ~t1_i~0 1)} is VALID [2022-02-20 18:22:47,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {101906#(= ~t1_i~0 1)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret12#1, start_simulation_#t~ret13#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0; {101906#(= ~t1_i~0 1)} is VALID [2022-02-20 18:22:47,585 INFO L272 TraceCheckUtils]: 3: Hoare triple {101906#(= ~t1_i~0 1)} call update_channels(); {101904#true} is VALID [2022-02-20 18:22:47,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {101904#true} assume true; {101904#true} is VALID [2022-02-20 18:22:47,585 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {101904#true} {101906#(= ~t1_i~0 1)} #437#return; {101906#(= ~t1_i~0 1)} is VALID [2022-02-20 18:22:47,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {101906#(= ~t1_i~0 1)} assume { :begin_inline_init_threads } true; {101906#(= ~t1_i~0 1)} is VALID [2022-02-20 18:22:47,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {101906#(= ~t1_i~0 1)} assume 1 == ~m_i~0;~m_st~0 := 0; {101906#(= ~t1_i~0 1)} is VALID [2022-02-20 18:22:47,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {101906#(= ~t1_i~0 1)} assume !(1 == ~t1_i~0);~t1_st~0 := 2; {101905#false} is VALID [2022-02-20 18:22:47,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {101905#false} assume 1 == ~t2_i~0;~t2_st~0 := 0; {101905#false} is VALID [2022-02-20 18:22:47,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {101905#false} assume { :end_inline_init_threads } true; {101905#false} is VALID [2022-02-20 18:22:47,586 INFO L272 TraceCheckUtils]: 11: Hoare triple {101905#false} call fire_delta_events(); {101971#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:47,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {101971#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {101904#true} is VALID [2022-02-20 18:22:47,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {101904#true} assume !(0 == ~T1_E~0); {101904#true} is VALID [2022-02-20 18:22:47,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {101904#true} assume !(0 == ~T2_E~0); {101904#true} is VALID [2022-02-20 18:22:47,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {101904#true} assume !(0 == ~E_1~0); {101904#true} is VALID [2022-02-20 18:22:47,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {101904#true} assume !(0 == ~E_2~0); {101904#true} is VALID [2022-02-20 18:22:47,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {101904#true} assume true; {101904#true} is VALID [2022-02-20 18:22:47,587 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {101904#true} {101905#false} #439#return; {101905#false} is VALID [2022-02-20 18:22:47,587 INFO L272 TraceCheckUtils]: 19: Hoare triple {101905#false} call activate_threads(); {101972#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:22:47,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {101972#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {101904#true} is VALID [2022-02-20 18:22:47,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {101904#true} assume !(1 == ~m_pc~0); {101904#true} is VALID [2022-02-20 18:22:47,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {101904#true} is_master_triggered_~__retres1~0#1 := 0; {101904#true} is VALID [2022-02-20 18:22:47,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {101904#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {101904#true} is VALID [2022-02-20 18:22:47,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {101904#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {101904#true} is VALID [2022-02-20 18:22:47,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {101904#true} assume !(0 != ~tmp~1#1); {101904#true} is VALID [2022-02-20 18:22:47,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {101904#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {101904#true} is VALID [2022-02-20 18:22:47,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {101904#true} assume !(1 == ~t1_pc~0); {101904#true} is VALID [2022-02-20 18:22:47,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {101904#true} is_transmit1_triggered_~__retres1~1#1 := 0; {101904#true} is VALID [2022-02-20 18:22:47,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {101904#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {101904#true} is VALID [2022-02-20 18:22:47,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {101904#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {101904#true} is VALID [2022-02-20 18:22:47,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {101904#true} assume !(0 != ~tmp___0~0#1); {101904#true} is VALID [2022-02-20 18:22:47,589 INFO L290 TraceCheckUtils]: 32: Hoare triple {101904#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {101904#true} is VALID [2022-02-20 18:22:47,589 INFO L290 TraceCheckUtils]: 33: Hoare triple {101904#true} assume !(1 == ~t2_pc~0); {101904#true} is VALID [2022-02-20 18:22:47,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {101904#true} is_transmit2_triggered_~__retres1~2#1 := 0; {101904#true} is VALID [2022-02-20 18:22:47,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {101904#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {101904#true} is VALID [2022-02-20 18:22:47,589 INFO L290 TraceCheckUtils]: 36: Hoare triple {101904#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {101904#true} is VALID [2022-02-20 18:22:47,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {101904#true} assume !(0 != ~tmp___1~0#1); {101904#true} is VALID [2022-02-20 18:22:47,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {101904#true} assume true; {101904#true} is VALID [2022-02-20 18:22:47,590 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {101904#true} {101905#false} #441#return; {101905#false} is VALID [2022-02-20 18:22:47,590 INFO L272 TraceCheckUtils]: 40: Hoare triple {101905#false} call reset_delta_events(); {101971#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 18:22:47,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {101971#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {101904#true} is VALID [2022-02-20 18:22:47,590 INFO L290 TraceCheckUtils]: 42: Hoare triple {101904#true} assume !(1 == ~T1_E~0); {101904#true} is VALID [2022-02-20 18:22:47,590 INFO L290 TraceCheckUtils]: 43: Hoare triple {101904#true} assume !(1 == ~T2_E~0); {101904#true} is VALID [2022-02-20 18:22:47,590 INFO L290 TraceCheckUtils]: 44: Hoare triple {101904#true} assume !(1 == ~E_1~0); {101904#true} is VALID [2022-02-20 18:22:47,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {101904#true} assume !(1 == ~E_2~0); {101904#true} is VALID [2022-02-20 18:22:47,591 INFO L290 TraceCheckUtils]: 46: Hoare triple {101904#true} assume true; {101904#true} is VALID [2022-02-20 18:22:47,591 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {101904#true} {101905#false} #443#return; {101905#false} is VALID [2022-02-20 18:22:47,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {101905#false} assume !false; {101905#false} is VALID [2022-02-20 18:22:47,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {101905#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {101905#false} is VALID [2022-02-20 18:22:47,591 INFO L290 TraceCheckUtils]: 50: Hoare triple {101905#false} assume !false; {101905#false} is VALID [2022-02-20 18:22:47,591 INFO L272 TraceCheckUtils]: 51: Hoare triple {101905#false} call eval_#t~ret4#1 := exists_runnable_thread(); {101904#true} is VALID [2022-02-20 18:22:47,591 INFO L290 TraceCheckUtils]: 52: Hoare triple {101904#true} havoc ~__retres1~3; {101904#true} is VALID [2022-02-20 18:22:47,591 INFO L290 TraceCheckUtils]: 53: Hoare triple {101904#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {101904#true} is VALID [2022-02-20 18:22:47,592 INFO L290 TraceCheckUtils]: 54: Hoare triple {101904#true} #res := ~__retres1~3; {101904#true} is VALID [2022-02-20 18:22:47,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {101904#true} assume true; {101904#true} is VALID [2022-02-20 18:22:47,592 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {101904#true} {101905#false} #445#return; {101905#false} is VALID [2022-02-20 18:22:47,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {101905#false} assume -2147483648 <= eval_#t~ret4#1 && eval_#t~ret4#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {101905#false} is VALID [2022-02-20 18:22:47,592 INFO L290 TraceCheckUtils]: 58: Hoare triple {101905#false} assume 0 != eval_~tmp~0#1; {101905#false} is VALID [2022-02-20 18:22:47,592 INFO L290 TraceCheckUtils]: 59: Hoare triple {101905#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet5#1 && eval_#t~nondet5#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; {101905#false} is VALID [2022-02-20 18:22:47,592 INFO L290 TraceCheckUtils]: 60: Hoare triple {101905#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true; {101905#false} is VALID [2022-02-20 18:22:47,592 INFO L290 TraceCheckUtils]: 61: Hoare triple {101905#false} assume 0 == ~m_pc~0; {101905#false} is VALID [2022-02-20 18:22:47,592 INFO L290 TraceCheckUtils]: 62: Hoare triple {101905#false} assume !false; {101905#false} is VALID [2022-02-20 18:22:47,593 INFO L290 TraceCheckUtils]: 63: Hoare triple {101905#false} ~E_1~0 := 1; {101905#false} is VALID [2022-02-20 18:22:47,593 INFO L272 TraceCheckUtils]: 64: Hoare triple {101905#false} call immediate_notify(); {101972#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:22:47,593 INFO L272 TraceCheckUtils]: 65: Hoare triple {101972#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} call activate_threads(); {101972#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 18:22:47,593 INFO L290 TraceCheckUtils]: 66: Hoare triple {101972#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {101904#true} is VALID [2022-02-20 18:22:47,594 INFO L290 TraceCheckUtils]: 67: Hoare triple {101904#true} assume !(1 == ~m_pc~0); {101904#true} is VALID [2022-02-20 18:22:47,594 INFO L290 TraceCheckUtils]: 68: Hoare triple {101904#true} is_master_triggered_~__retres1~0#1 := 0; {101904#true} is VALID [2022-02-20 18:22:47,594 INFO L290 TraceCheckUtils]: 69: Hoare triple {101904#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {101904#true} is VALID [2022-02-20 18:22:47,594 INFO L290 TraceCheckUtils]: 70: Hoare triple {101904#true} #t~ret8#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647;~tmp~1#1 := #t~ret8#1;havoc #t~ret8#1; {101904#true} is VALID [2022-02-20 18:22:47,594 INFO L290 TraceCheckUtils]: 71: Hoare triple {101904#true} assume !(0 != ~tmp~1#1); {101904#true} is VALID [2022-02-20 18:22:47,594 INFO L290 TraceCheckUtils]: 72: Hoare triple {101904#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; {101904#true} is VALID [2022-02-20 18:22:47,594 INFO L290 TraceCheckUtils]: 73: Hoare triple {101904#true} assume !(1 == ~t1_pc~0); {101904#true} is VALID [2022-02-20 18:22:47,594 INFO L290 TraceCheckUtils]: 74: Hoare triple {101904#true} is_transmit1_triggered_~__retres1~1#1 := 0; {101904#true} is VALID [2022-02-20 18:22:47,595 INFO L290 TraceCheckUtils]: 75: Hoare triple {101904#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {101904#true} is VALID [2022-02-20 18:22:47,595 INFO L290 TraceCheckUtils]: 76: Hoare triple {101904#true} #t~ret9#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647;~tmp___0~0#1 := #t~ret9#1;havoc #t~ret9#1; {101904#true} is VALID [2022-02-20 18:22:47,595 INFO L290 TraceCheckUtils]: 77: Hoare triple {101904#true} assume !(0 != ~tmp___0~0#1); {101904#true} is VALID [2022-02-20 18:22:47,595 INFO L290 TraceCheckUtils]: 78: Hoare triple {101904#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {101904#true} is VALID [2022-02-20 18:22:47,595 INFO L290 TraceCheckUtils]: 79: Hoare triple {101904#true} assume !(1 == ~t2_pc~0); {101904#true} is VALID [2022-02-20 18:22:47,595 INFO L290 TraceCheckUtils]: 80: Hoare triple {101904#true} is_transmit2_triggered_~__retres1~2#1 := 0; {101904#true} is VALID [2022-02-20 18:22:47,595 INFO L290 TraceCheckUtils]: 81: Hoare triple {101904#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {101904#true} is VALID [2022-02-20 18:22:47,595 INFO L290 TraceCheckUtils]: 82: Hoare triple {101904#true} #t~ret10#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647;~tmp___1~0#1 := #t~ret10#1;havoc #t~ret10#1; {101904#true} is VALID [2022-02-20 18:22:47,596 INFO L290 TraceCheckUtils]: 83: Hoare triple {101904#true} assume !(0 != ~tmp___1~0#1); {101904#true} is VALID [2022-02-20 18:22:47,596 INFO L290 TraceCheckUtils]: 84: Hoare triple {101904#true} assume true; {101904#true} is VALID [2022-02-20 18:22:47,596 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {101904#true} {101972#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} #435#return; {101904#true} is VALID [2022-02-20 18:22:47,596 INFO L290 TraceCheckUtils]: 86: Hoare triple {101904#true} assume true; {101904#true} is VALID [2022-02-20 18:22:47,596 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {101904#true} {101905#false} #447#return; {101905#false} is VALID [2022-02-20 18:22:47,596 INFO L290 TraceCheckUtils]: 88: Hoare triple {101905#false} ~E_1~0 := 2; {101905#false} is VALID [2022-02-20 18:22:47,596 INFO L290 TraceCheckUtils]: 89: Hoare triple {101905#false} assume !false; {101905#false} is VALID [2022-02-20 18:22:47,596 INFO L290 TraceCheckUtils]: 90: Hoare triple {101905#false} ~m_pc~0 := 1;~m_st~0 := 2; {101905#false} is VALID [2022-02-20 18:22:47,596 INFO L290 TraceCheckUtils]: 91: Hoare triple {101905#false} assume { :end_inline_master } true; {101905#false} is VALID [2022-02-20 18:22:47,597 INFO L290 TraceCheckUtils]: 92: Hoare triple {101905#false} assume !(0 == ~t1_st~0); {101905#false} is VALID [2022-02-20 18:22:47,597 INFO L290 TraceCheckUtils]: 93: Hoare triple {101905#false} assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;assume -2147483648 <= eval_#t~nondet7#1 && eval_#t~nondet7#1 <= 2147483647;eval_~tmp_ndt_3~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; {101905#false} is VALID [2022-02-20 18:22:47,597 INFO L290 TraceCheckUtils]: 94: Hoare triple {101905#false} assume 0 != eval_~tmp_ndt_3~0#1;~t2_st~0 := 1;assume { :begin_inline_transmit2 } true; {101905#false} is VALID [2022-02-20 18:22:47,597 INFO L290 TraceCheckUtils]: 95: Hoare triple {101905#false} assume !(0 == ~t2_pc~0); {101905#false} is VALID [2022-02-20 18:22:47,597 INFO L290 TraceCheckUtils]: 96: Hoare triple {101905#false} assume 1 == ~t2_pc~0; {101905#false} is VALID [2022-02-20 18:22:47,597 INFO L290 TraceCheckUtils]: 97: Hoare triple {101905#false} assume { :begin_inline_error } true; {101905#false} is VALID [2022-02-20 18:22:47,597 INFO L290 TraceCheckUtils]: 98: Hoare triple {101905#false} assume !false; {101905#false} is VALID [2022-02-20 18:22:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 18:22:47,598 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:22:47,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758097421] [2022-02-20 18:22:47,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758097421] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:22:47,598 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:22:47,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:22:47,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937369515] [2022-02-20 18:22:47,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:22:47,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2022-02-20 18:22:47,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:22:47,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 18:22:47,647 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 18:22:47,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:22:47,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:22:47,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:22:47,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:22:47,649 INFO L87 Difference]: Start difference. First operand 4197 states and 5702 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)