./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7ec37a095871269c822e7d35e6d840f2de134a68f657807281a5c0e96980df26 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:20:27,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:20:27,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:20:27,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:20:27,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:20:27,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:20:27,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:20:27,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:20:27,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:20:27,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:20:27,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:20:27,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:20:27,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:20:27,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:20:27,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:20:27,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:20:27,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:20:27,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:20:27,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:20:27,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:20:27,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:20:27,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:20:27,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:20:27,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:20:27,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:20:27,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:20:27,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:20:27,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:20:27,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:20:27,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:20:27,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:20:27,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:20:27,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:20:27,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:20:27,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:20:27,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:20:27,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:20:27,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:20:27,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:20:27,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:20:27,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:20:27,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:20:27,450 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:20:27,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:20:27,451 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:20:27,451 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:20:27,452 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:20:27,452 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:20:27,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:20:27,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:20:27,453 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:20:27,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:20:27,454 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:20:27,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:20:27,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:20:27,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:20:27,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:20:27,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:20:27,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:20:27,455 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:20:27,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:20:27,455 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:20:27,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:20:27,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:20:27,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:20:27,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:20:27,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:20:27,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:20:27,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:20:27,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:20:27,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:20:27,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:20:27,457 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:20:27,457 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:20:27,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:20:27,458 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 -> 7ec37a095871269c822e7d35e6d840f2de134a68f657807281a5c0e96980df26 [2022-02-20 19:20:27,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:20:27,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:20:27,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:20:27,696 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:20:27,697 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:20:27,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c [2022-02-20 19:20:27,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8e6adae/873e353997af43139918d01e26827aea/FLAGae10a12db [2022-02-20 19:20:28,374 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:20:28,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c [2022-02-20 19:20:28,413 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8e6adae/873e353997af43139918d01e26827aea/FLAGae10a12db [2022-02-20 19:20:28,505 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8e6adae/873e353997af43139918d01e26827aea [2022-02-20 19:20:28,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:20:28,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:20:28,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:20:28,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:20:28,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:20:28,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:20:28" (1/1) ... [2022-02-20 19:20:28,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4103e036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:28, skipping insertion in model container [2022-02-20 19:20:28,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:20:28" (1/1) ... [2022-02-20 19:20:28,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:20:28,646 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:20:29,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c[380323,380336] [2022-02-20 19:20:29,913 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c[383339,383352] [2022-02-20 19:20:30,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:20:30,037 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:20:30,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c[380323,380336] [2022-02-20 19:20:30,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c[383339,383352] [2022-02-20 19:20:30,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:20:30,705 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:20:30,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:30 WrapperNode [2022-02-20 19:20:30,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:20:30,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:20:30,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:20:30,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:20:30,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:30" (1/1) ... [2022-02-20 19:20:30,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:30" (1/1) ... [2022-02-20 19:20:31,210 INFO L137 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 12682 [2022-02-20 19:20:31,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:20:31,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:20:31,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:20:31,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:20:31,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:30" (1/1) ... [2022-02-20 19:20:31,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:30" (1/1) ... [2022-02-20 19:20:31,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:30" (1/1) ... [2022-02-20 19:20:31,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:30" (1/1) ... [2022-02-20 19:20:31,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:30" (1/1) ... [2022-02-20 19:20:31,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:30" (1/1) ... [2022-02-20 19:20:31,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:30" (1/1) ... [2022-02-20 19:20:31,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:20:31,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:20:31,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:20:31,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:20:31,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:30" (1/1) ... [2022-02-20 19:20:31,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:20:31,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:20:31,624 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:20:31,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:20:31,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:20:31,653 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-02-20 19:20:31,653 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-02-20 19:20:31,653 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:20:31,654 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:20:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-02-20 19:20:31,654 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-02-20 19:20:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-02-20 19:20:31,654 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-02-20 19:20:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-02-20 19:20:31,654 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-02-20 19:20:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-02-20 19:20:31,654 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-02-20 19:20:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-02-20 19:20:31,655 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-02-20 19:20:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:20:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:20:31,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:20:31,751 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:20:31,766 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:20:36,937 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:20:36,954 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:20:36,959 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-02-20 19:20:36,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:20:36 BoogieIcfgContainer [2022-02-20 19:20:36,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:20:36,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:20:36,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:20:36,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:20:36,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:20:28" (1/3) ... [2022-02-20 19:20:36,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cffefff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:20:36, skipping insertion in model container [2022-02-20 19:20:36,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:20:30" (2/3) ... [2022-02-20 19:20:36,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cffefff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:20:36, skipping insertion in model container [2022-02-20 19:20:36,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:20:36" (3/3) ... [2022-02-20 19:20:36,969 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.03.cil-1.c [2022-02-20 19:20:36,973 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:20:36,973 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:20:37,020 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:20:37,032 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:20:37,032 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:20:37,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 2348 states, 2319 states have (on average 1.8559724018973696) internal successors, (4304), 2324 states have internal predecessors, (4304), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 19:20:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 19:20:37,088 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:20:37,089 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:20:37,089 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:20:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:20:37,093 INFO L85 PathProgramCache]: Analyzing trace with hash 520182233, now seen corresponding path program 1 times [2022-02-20 19:20:37,099 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:20:37,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506837857] [2022-02-20 19:20:37,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:20:37,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:20:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:37,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:20:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:37,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-02-20 19:20:37,257 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {2351#true} {2353#(= ~M_E~0 2)} #10721#return; {2353#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:37,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:20:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:37,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {2407#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {2408#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {2408#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {2408#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,303 INFO L290 TraceCheckUtils]: 4: Hoare triple {2408#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {2408#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {2408#(= |old(~M_E~0)| 0)} assume !(0 == ~E_2~0); {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {2408#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {2408#(= |old(~M_E~0)| 0)} assume true; {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,306 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2408#(= |old(~M_E~0)| 0)} {2353#(= ~M_E~0 2)} #10723#return; {2352#false} is VALID [2022-02-20 19:20:37,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:20:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:37,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {2409#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~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; {2351#true} is VALID [2022-02-20 19:20:37,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {2351#true} assume 1 == ~m_pc~0; {2351#true} is VALID [2022-02-20 19:20:37,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {2351#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {2351#true} is VALID [2022-02-20 19:20:37,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {2351#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2351#true} is VALID [2022-02-20 19:20:37,355 INFO L290 TraceCheckUtils]: 4: Hoare triple {2351#true} #t~ret34#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp~1#1 := #t~ret34#1;havoc #t~ret34#1; {2351#true} is VALID [2022-02-20 19:20:37,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {2351#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2351#true} is VALID [2022-02-20 19:20:37,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {2351#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; {2351#true} is VALID [2022-02-20 19:20:37,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {2351#true} assume !(1 == ~t1_pc~0); {2351#true} is VALID [2022-02-20 19:20:37,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {2351#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2351#true} is VALID [2022-02-20 19:20:37,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {2351#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2351#true} is VALID [2022-02-20 19:20:37,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {2351#true} #t~ret35#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___0~0#1 := #t~ret35#1;havoc #t~ret35#1; {2351#true} is VALID [2022-02-20 19:20:37,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {2351#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2351#true} is VALID [2022-02-20 19:20:37,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {2351#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; {2351#true} is VALID [2022-02-20 19:20:37,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {2351#true} assume 1 == ~t2_pc~0; {2351#true} is VALID [2022-02-20 19:20:37,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {2351#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {2351#true} is VALID [2022-02-20 19:20:37,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {2351#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {2351#true} is VALID [2022-02-20 19:20:37,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {2351#true} #t~ret36#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___1~0#1 := #t~ret36#1;havoc #t~ret36#1; {2351#true} is VALID [2022-02-20 19:20:37,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {2351#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {2351#true} is VALID [2022-02-20 19:20:37,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {2351#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~3#1;havoc is_transmit3_triggered_~__retres1~3#1; {2351#true} is VALID [2022-02-20 19:20:37,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {2351#true} assume 1 == ~t3_pc~0; {2351#true} is VALID [2022-02-20 19:20:37,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {2351#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {2351#true} is VALID [2022-02-20 19:20:37,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {2351#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {2351#true} is VALID [2022-02-20 19:20:37,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {2351#true} #t~ret37#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647;~tmp___2~0#1 := #t~ret37#1;havoc #t~ret37#1; {2351#true} is VALID [2022-02-20 19:20:37,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {2351#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {2351#true} is VALID [2022-02-20 19:20:37,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-02-20 19:20:37,359 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2351#true} {2352#false} #10725#return; {2352#false} is VALID [2022-02-20 19:20:37,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:20:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:37,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {2407#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {2351#true} is VALID [2022-02-20 19:20:37,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {2351#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2351#true} is VALID [2022-02-20 19:20:37,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {2351#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {2351#true} is VALID [2022-02-20 19:20:37,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {2351#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {2351#true} is VALID [2022-02-20 19:20:37,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {2351#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2351#true} is VALID [2022-02-20 19:20:37,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {2351#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2351#true} is VALID [2022-02-20 19:20:37,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {2351#true} assume !(1 == ~E_2~0); {2351#true} is VALID [2022-02-20 19:20:37,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {2351#true} assume 1 == ~E_3~0;~E_3~0 := 2; {2351#true} is VALID [2022-02-20 19:20:37,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-02-20 19:20:37,390 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2351#true} {2352#false} #10727#return; {2352#false} is VALID [2022-02-20 19:20:37,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:20:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:37,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {2351#true} havoc ~__retres1~4; {2351#true} is VALID [2022-02-20 19:20:37,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {2351#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {2351#true} is VALID [2022-02-20 19:20:37,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {2351#true} #res := ~__retres1~4; {2351#true} is VALID [2022-02-20 19:20:37,400 INFO L290 TraceCheckUtils]: 3: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-02-20 19:20:37,400 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2351#true} {2352#false} #10729#return; {2352#false} is VALID [2022-02-20 19:20:37,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {2351#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(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {2353#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:37,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {2353#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {2353#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:37,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {2353#(= ~M_E~0 2)} assume !(0 != main_#t~nondet41#1);havoc main_#t~nondet41#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~5#1;havoc main2_~__retres1~5#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {2353#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:37,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {2353#(= ~M_E~0 2)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret39#1, start_simulation_#t~ret40#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; {2353#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:37,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {2353#(= ~M_E~0 2)} call update_channels(); {2351#true} is VALID [2022-02-20 19:20:37,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-02-20 19:20:37,407 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2351#true} {2353#(= ~M_E~0 2)} #10721#return; {2353#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:37,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {2353#(= ~M_E~0 2)} assume { :begin_inline_init_threads } true; {2353#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:37,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {2353#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {2353#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:37,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {2353#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {2353#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:37,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {2353#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {2353#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:37,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {2353#(= ~M_E~0 2)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {2353#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:37,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {2353#(= ~M_E~0 2)} assume { :end_inline_init_threads } true; {2353#(= ~M_E~0 2)} is VALID [2022-02-20 19:20:37,411 INFO L272 TraceCheckUtils]: 13: Hoare triple {2353#(= ~M_E~0 2)} call fire_delta_events(); {2407#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:20:37,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {2407#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {2408#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {2408#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {2408#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {2408#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {2408#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {2408#(= |old(~M_E~0)| 0)} assume !(0 == ~E_2~0); {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {2408#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {2408#(= |old(~M_E~0)| 0)} assume true; {2408#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:20:37,416 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2408#(= |old(~M_E~0)| 0)} {2353#(= ~M_E~0 2)} #10723#return; {2352#false} is VALID [2022-02-20 19:20:37,416 INFO L272 TraceCheckUtils]: 24: Hoare triple {2352#false} call activate_threads(); {2409#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:20:37,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {2409#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~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; {2351#true} is VALID [2022-02-20 19:20:37,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {2351#true} assume 1 == ~m_pc~0; {2351#true} is VALID [2022-02-20 19:20:37,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {2351#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {2351#true} is VALID [2022-02-20 19:20:37,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {2351#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2351#true} is VALID [2022-02-20 19:20:37,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {2351#true} #t~ret34#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp~1#1 := #t~ret34#1;havoc #t~ret34#1; {2351#true} is VALID [2022-02-20 19:20:37,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {2351#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2351#true} is VALID [2022-02-20 19:20:37,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {2351#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; {2351#true} is VALID [2022-02-20 19:20:37,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {2351#true} assume !(1 == ~t1_pc~0); {2351#true} is VALID [2022-02-20 19:20:37,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {2351#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2351#true} is VALID [2022-02-20 19:20:37,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {2351#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2351#true} is VALID [2022-02-20 19:20:37,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {2351#true} #t~ret35#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___0~0#1 := #t~ret35#1;havoc #t~ret35#1; {2351#true} is VALID [2022-02-20 19:20:37,419 INFO L290 TraceCheckUtils]: 36: Hoare triple {2351#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2351#true} is VALID [2022-02-20 19:20:37,419 INFO L290 TraceCheckUtils]: 37: Hoare triple {2351#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; {2351#true} is VALID [2022-02-20 19:20:37,419 INFO L290 TraceCheckUtils]: 38: Hoare triple {2351#true} assume 1 == ~t2_pc~0; {2351#true} is VALID [2022-02-20 19:20:37,420 INFO L290 TraceCheckUtils]: 39: Hoare triple {2351#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {2351#true} is VALID [2022-02-20 19:20:37,420 INFO L290 TraceCheckUtils]: 40: Hoare triple {2351#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {2351#true} is VALID [2022-02-20 19:20:37,421 INFO L290 TraceCheckUtils]: 41: Hoare triple {2351#true} #t~ret36#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___1~0#1 := #t~ret36#1;havoc #t~ret36#1; {2351#true} is VALID [2022-02-20 19:20:37,421 INFO L290 TraceCheckUtils]: 42: Hoare triple {2351#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {2351#true} is VALID [2022-02-20 19:20:37,421 INFO L290 TraceCheckUtils]: 43: Hoare triple {2351#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~3#1;havoc is_transmit3_triggered_~__retres1~3#1; {2351#true} is VALID [2022-02-20 19:20:37,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {2351#true} assume 1 == ~t3_pc~0; {2351#true} is VALID [2022-02-20 19:20:37,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {2351#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {2351#true} is VALID [2022-02-20 19:20:37,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {2351#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {2351#true} is VALID [2022-02-20 19:20:37,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {2351#true} #t~ret37#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647;~tmp___2~0#1 := #t~ret37#1;havoc #t~ret37#1; {2351#true} is VALID [2022-02-20 19:20:37,422 INFO L290 TraceCheckUtils]: 48: Hoare triple {2351#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {2351#true} is VALID [2022-02-20 19:20:37,422 INFO L290 TraceCheckUtils]: 49: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-02-20 19:20:37,424 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2351#true} {2352#false} #10725#return; {2352#false} is VALID [2022-02-20 19:20:37,424 INFO L272 TraceCheckUtils]: 51: Hoare triple {2352#false} call reset_delta_events(); {2407#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:20:37,424 INFO L290 TraceCheckUtils]: 52: Hoare triple {2407#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {2351#true} is VALID [2022-02-20 19:20:37,424 INFO L290 TraceCheckUtils]: 53: Hoare triple {2351#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2351#true} is VALID [2022-02-20 19:20:37,425 INFO L290 TraceCheckUtils]: 54: Hoare triple {2351#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {2351#true} is VALID [2022-02-20 19:20:37,425 INFO L290 TraceCheckUtils]: 55: Hoare triple {2351#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {2351#true} is VALID [2022-02-20 19:20:37,425 INFO L290 TraceCheckUtils]: 56: Hoare triple {2351#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2351#true} is VALID [2022-02-20 19:20:37,425 INFO L290 TraceCheckUtils]: 57: Hoare triple {2351#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2351#true} is VALID [2022-02-20 19:20:37,426 INFO L290 TraceCheckUtils]: 58: Hoare triple {2351#true} assume !(1 == ~E_2~0); {2351#true} is VALID [2022-02-20 19:20:37,426 INFO L290 TraceCheckUtils]: 59: Hoare triple {2351#true} assume 1 == ~E_3~0;~E_3~0 := 2; {2351#true} is VALID [2022-02-20 19:20:37,426 INFO L290 TraceCheckUtils]: 60: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-02-20 19:20:37,426 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {2351#true} {2352#false} #10727#return; {2352#false} is VALID [2022-02-20 19:20:37,426 INFO L290 TraceCheckUtils]: 62: Hoare triple {2352#false} assume !false; {2352#false} is VALID [2022-02-20 19:20:37,427 INFO L290 TraceCheckUtils]: 63: Hoare triple {2352#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret29#1, eval_#t~nondet30#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet32#1, eval_~tmp_ndt_3~0#1, eval_#t~nondet33#1, eval_~tmp_ndt_4~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {2352#false} is VALID [2022-02-20 19:20:37,427 INFO L290 TraceCheckUtils]: 64: Hoare triple {2352#false} assume !false; {2352#false} is VALID [2022-02-20 19:20:37,428 INFO L272 TraceCheckUtils]: 65: Hoare triple {2352#false} call eval_#t~ret29#1 := exists_runnable_thread(); {2351#true} is VALID [2022-02-20 19:20:37,428 INFO L290 TraceCheckUtils]: 66: Hoare triple {2351#true} havoc ~__retres1~4; {2351#true} is VALID [2022-02-20 19:20:37,429 INFO L290 TraceCheckUtils]: 67: Hoare triple {2351#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {2351#true} is VALID [2022-02-20 19:20:37,429 INFO L290 TraceCheckUtils]: 68: Hoare triple {2351#true} #res := ~__retres1~4; {2351#true} is VALID [2022-02-20 19:20:37,435 INFO L290 TraceCheckUtils]: 69: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-02-20 19:20:37,436 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {2351#true} {2352#false} #10729#return; {2352#false} is VALID [2022-02-20 19:20:37,436 INFO L290 TraceCheckUtils]: 71: Hoare triple {2352#false} assume -2147483648 <= eval_#t~ret29#1 && eval_#t~ret29#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret29#1;havoc eval_#t~ret29#1; {2352#false} is VALID [2022-02-20 19:20:37,436 INFO L290 TraceCheckUtils]: 72: Hoare triple {2352#false} assume 0 != eval_~tmp~0#1; {2352#false} is VALID [2022-02-20 19:20:37,437 INFO L290 TraceCheckUtils]: 73: Hoare triple {2352#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet30#1 && eval_#t~nondet30#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet30#1;havoc eval_#t~nondet30#1; {2352#false} is VALID [2022-02-20 19:20:37,437 INFO L290 TraceCheckUtils]: 74: Hoare triple {2352#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1, master_#t~nondet28#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet27#1 && master_#t~nondet27#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet27#1;havoc master_#t~nondet27#1; {2352#false} is VALID [2022-02-20 19:20:37,437 INFO L290 TraceCheckUtils]: 75: Hoare triple {2352#false} assume !(0 == ~m_pc~0); {2352#false} is VALID [2022-02-20 19:20:37,437 INFO L290 TraceCheckUtils]: 76: Hoare triple {2352#false} assume 1 == ~m_pc~0; {2352#false} is VALID [2022-02-20 19:20:37,437 INFO L290 TraceCheckUtils]: 77: Hoare triple {2352#false} assume ~token~0 != 3 + ~local~0; {2352#false} is VALID [2022-02-20 19:20:37,438 INFO L272 TraceCheckUtils]: 78: Hoare triple {2352#false} call error(); {2352#false} is VALID [2022-02-20 19:20:37,438 INFO L290 TraceCheckUtils]: 79: Hoare triple {2352#false} assume !false; {2352#false} is VALID [2022-02-20 19:20:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:20:37,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:20:37,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506837857] [2022-02-20 19:20:37,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506837857] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:20:37,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:20:37,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:20:37,442 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177373279] [2022-02-20 19:20:37,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:20:37,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-02-20 19:20:37,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:20:37,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:20:37,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:20:37,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:20:37,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:20:37,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:20:37,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:20:37,534 INFO L87 Difference]: Start difference. First operand has 2348 states, 2319 states have (on average 1.8559724018973696) internal successors, (4304), 2324 states have internal predecessors, (4304), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:20:48,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:20:48,615 INFO L93 Difference]: Finished difference Result 4921 states and 9054 transitions. [2022-02-20 19:20:48,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:20:48,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-02-20 19:20:48,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:20:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:20:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 9054 transitions. [2022-02-20 19:20:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:20:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 9054 transitions. [2022-02-20 19:20:48,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 9054 transitions. [2022-02-20 19:20:54,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9054 edges. 9054 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:20:54,918 INFO L225 Difference]: With dead ends: 4921 [2022-02-20 19:20:54,918 INFO L226 Difference]: Without dead ends: 2514 [2022-02-20 19:20:54,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:20:54,926 INFO L933 BasicCegarLoop]: 4299 mSDtfsCounter, 4559 mSDsluCounter, 12506 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4569 SdHoareTripleChecker+Valid, 16805 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:20:54,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4569 Valid, 16805 Invalid, 794 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [88 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:20:54,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2022-02-20 19:20:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2427. [2022-02-20 19:20:55,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:20:55,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2514 states. Second operand has 2427 states, 2381 states have (on average 1.8299034019319613) internal successors, (4357), 2385 states have internal predecessors, (4357), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2022-02-20 19:20:55,076 INFO L74 IsIncluded]: Start isIncluded. First operand 2514 states. Second operand has 2427 states, 2381 states have (on average 1.8299034019319613) internal successors, (4357), 2385 states have internal predecessors, (4357), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2022-02-20 19:20:55,082 INFO L87 Difference]: Start difference. First operand 2514 states. Second operand has 2427 states, 2381 states have (on average 1.8299034019319613) internal successors, (4357), 2385 states have internal predecessors, (4357), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2022-02-20 19:20:55,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:20:55,284 INFO L93 Difference]: Finished difference Result 2514 states and 4560 transitions. [2022-02-20 19:20:55,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 4560 transitions. [2022-02-20 19:20:55,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:20:55,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:20:55,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 2427 states, 2381 states have (on average 1.8299034019319613) internal successors, (4357), 2385 states have internal predecessors, (4357), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) Second operand 2514 states. [2022-02-20 19:20:55,305 INFO L87 Difference]: Start difference. First operand has 2427 states, 2381 states have (on average 1.8299034019319613) internal successors, (4357), 2385 states have internal predecessors, (4357), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) Second operand 2514 states. [2022-02-20 19:20:55,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:20:55,491 INFO L93 Difference]: Finished difference Result 2514 states and 4560 transitions. [2022-02-20 19:20:55,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 4560 transitions. [2022-02-20 19:20:55,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:20:55,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:20:55,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:20:55,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:20:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2381 states have (on average 1.8299034019319613) internal successors, (4357), 2385 states have internal predecessors, (4357), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2022-02-20 19:20:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 4420 transitions. [2022-02-20 19:20:55,732 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 4420 transitions. Word has length 80 [2022-02-20 19:20:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:20:55,733 INFO L470 AbstractCegarLoop]: Abstraction has 2427 states and 4420 transitions. [2022-02-20 19:20:55,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:20:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 4420 transitions. [2022-02-20 19:20:55,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 19:20:55,740 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:20:55,740 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:20:55,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:20:55,741 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:20:55,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:20:55,743 INFO L85 PathProgramCache]: Analyzing trace with hash -721258283, now seen corresponding path program 1 times [2022-02-20 19:20:55,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:20:55,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332004232] [2022-02-20 19:20:55,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:20:55,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:20:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:55,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:20:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:55,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {15101#true} assume true; {15101#true} is VALID [2022-02-20 19:20:55,802 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {15101#true} {15103#(= ~T1_E~0 ~M_E~0)} #10721#return; {15103#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:55,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:20:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:55,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {15157#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {15158#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:20:55,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {15158#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:55,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:55,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:55,836 INFO L290 TraceCheckUtils]: 4: Hoare triple {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:55,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:55,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:55,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:55,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:55,839 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {15103#(= ~T1_E~0 ~M_E~0)} #10723#return; {15102#false} is VALID [2022-02-20 19:20:55,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:20:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:55,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {15160#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~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; {15101#true} is VALID [2022-02-20 19:20:55,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {15101#true} assume 1 == ~m_pc~0; {15101#true} is VALID [2022-02-20 19:20:55,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {15101#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {15101#true} is VALID [2022-02-20 19:20:55,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {15101#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {15101#true} is VALID [2022-02-20 19:20:55,860 INFO L290 TraceCheckUtils]: 4: Hoare triple {15101#true} #t~ret34#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp~1#1 := #t~ret34#1;havoc #t~ret34#1; {15101#true} is VALID [2022-02-20 19:20:55,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {15101#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {15101#true} is VALID [2022-02-20 19:20:55,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {15101#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; {15101#true} is VALID [2022-02-20 19:20:55,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {15101#true} assume !(1 == ~t1_pc~0); {15101#true} is VALID [2022-02-20 19:20:55,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {15101#true} is_transmit1_triggered_~__retres1~1#1 := 0; {15101#true} is VALID [2022-02-20 19:20:55,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {15101#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {15101#true} is VALID [2022-02-20 19:20:55,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {15101#true} #t~ret35#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___0~0#1 := #t~ret35#1;havoc #t~ret35#1; {15101#true} is VALID [2022-02-20 19:20:55,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {15101#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {15101#true} is VALID [2022-02-20 19:20:55,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {15101#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; {15101#true} is VALID [2022-02-20 19:20:55,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {15101#true} assume 1 == ~t2_pc~0; {15101#true} is VALID [2022-02-20 19:20:55,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {15101#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {15101#true} is VALID [2022-02-20 19:20:55,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {15101#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {15101#true} is VALID [2022-02-20 19:20:55,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {15101#true} #t~ret36#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___1~0#1 := #t~ret36#1;havoc #t~ret36#1; {15101#true} is VALID [2022-02-20 19:20:55,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {15101#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {15101#true} is VALID [2022-02-20 19:20:55,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {15101#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~3#1;havoc is_transmit3_triggered_~__retres1~3#1; {15101#true} is VALID [2022-02-20 19:20:55,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {15101#true} assume 1 == ~t3_pc~0; {15101#true} is VALID [2022-02-20 19:20:55,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {15101#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {15101#true} is VALID [2022-02-20 19:20:55,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {15101#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {15101#true} is VALID [2022-02-20 19:20:55,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {15101#true} #t~ret37#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647;~tmp___2~0#1 := #t~ret37#1;havoc #t~ret37#1; {15101#true} is VALID [2022-02-20 19:20:55,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {15101#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {15101#true} is VALID [2022-02-20 19:20:55,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {15101#true} assume true; {15101#true} is VALID [2022-02-20 19:20:55,864 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15101#true} {15102#false} #10725#return; {15102#false} is VALID [2022-02-20 19:20:55,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:20:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:55,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {15157#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {15101#true} is VALID [2022-02-20 19:20:55,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {15101#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {15101#true} is VALID [2022-02-20 19:20:55,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {15101#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {15101#true} is VALID [2022-02-20 19:20:55,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {15101#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {15101#true} is VALID [2022-02-20 19:20:55,872 INFO L290 TraceCheckUtils]: 4: Hoare triple {15101#true} assume 1 == ~E_M~0;~E_M~0 := 2; {15101#true} is VALID [2022-02-20 19:20:55,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {15101#true} assume 1 == ~E_1~0;~E_1~0 := 2; {15101#true} is VALID [2022-02-20 19:20:55,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {15101#true} assume !(1 == ~E_2~0); {15101#true} is VALID [2022-02-20 19:20:55,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {15101#true} assume 1 == ~E_3~0;~E_3~0 := 2; {15101#true} is VALID [2022-02-20 19:20:55,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {15101#true} assume true; {15101#true} is VALID [2022-02-20 19:20:55,873 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {15101#true} {15102#false} #10727#return; {15102#false} is VALID [2022-02-20 19:20:55,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:20:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:20:55,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {15101#true} havoc ~__retres1~4; {15101#true} is VALID [2022-02-20 19:20:55,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {15101#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {15101#true} is VALID [2022-02-20 19:20:55,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {15101#true} #res := ~__retres1~4; {15101#true} is VALID [2022-02-20 19:20:55,883 INFO L290 TraceCheckUtils]: 3: Hoare triple {15101#true} assume true; {15101#true} is VALID [2022-02-20 19:20:55,883 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15101#true} {15102#false} #10729#return; {15102#false} is VALID [2022-02-20 19:20:55,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {15101#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(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {15103#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:55,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {15103#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {15103#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:55,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {15103#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet41#1);havoc main_#t~nondet41#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~5#1;havoc main2_~__retres1~5#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {15103#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:55,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {15103#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret39#1, start_simulation_#t~ret40#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; {15103#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:55,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {15103#(= ~T1_E~0 ~M_E~0)} call update_channels(); {15101#true} is VALID [2022-02-20 19:20:55,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {15101#true} assume true; {15101#true} is VALID [2022-02-20 19:20:55,886 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {15101#true} {15103#(= ~T1_E~0 ~M_E~0)} #10721#return; {15103#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:55,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {15103#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {15103#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:55,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {15103#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {15103#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:55,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {15103#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {15103#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:55,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {15103#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {15103#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:55,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {15103#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {15103#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:55,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {15103#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {15103#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:20:55,888 INFO L272 TraceCheckUtils]: 13: Hoare triple {15103#(= ~T1_E~0 ~M_E~0)} call fire_delta_events(); {15157#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:20:55,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {15157#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {15158#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:20:55,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {15158#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:55,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:55,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:55,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:55,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:55,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:55,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:55,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:20:55,893 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15159#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {15103#(= ~T1_E~0 ~M_E~0)} #10723#return; {15102#false} is VALID [2022-02-20 19:20:55,893 INFO L272 TraceCheckUtils]: 24: Hoare triple {15102#false} call activate_threads(); {15160#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:20:55,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {15160#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~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; {15101#true} is VALID [2022-02-20 19:20:55,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {15101#true} assume 1 == ~m_pc~0; {15101#true} is VALID [2022-02-20 19:20:55,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {15101#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {15101#true} is VALID [2022-02-20 19:20:55,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {15101#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {15101#true} is VALID [2022-02-20 19:20:55,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {15101#true} #t~ret34#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp~1#1 := #t~ret34#1;havoc #t~ret34#1; {15101#true} is VALID [2022-02-20 19:20:55,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {15101#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {15101#true} is VALID [2022-02-20 19:20:55,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {15101#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; {15101#true} is VALID [2022-02-20 19:20:55,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {15101#true} assume !(1 == ~t1_pc~0); {15101#true} is VALID [2022-02-20 19:20:55,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {15101#true} is_transmit1_triggered_~__retres1~1#1 := 0; {15101#true} is VALID [2022-02-20 19:20:55,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {15101#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {15101#true} is VALID [2022-02-20 19:20:55,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {15101#true} #t~ret35#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___0~0#1 := #t~ret35#1;havoc #t~ret35#1; {15101#true} is VALID [2022-02-20 19:20:55,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {15101#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {15101#true} is VALID [2022-02-20 19:20:55,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {15101#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; {15101#true} is VALID [2022-02-20 19:20:55,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {15101#true} assume 1 == ~t2_pc~0; {15101#true} is VALID [2022-02-20 19:20:55,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {15101#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {15101#true} is VALID [2022-02-20 19:20:55,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {15101#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {15101#true} is VALID [2022-02-20 19:20:55,896 INFO L290 TraceCheckUtils]: 41: Hoare triple {15101#true} #t~ret36#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___1~0#1 := #t~ret36#1;havoc #t~ret36#1; {15101#true} is VALID [2022-02-20 19:20:55,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {15101#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {15101#true} is VALID [2022-02-20 19:20:55,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {15101#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~3#1;havoc is_transmit3_triggered_~__retres1~3#1; {15101#true} is VALID [2022-02-20 19:20:55,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {15101#true} assume 1 == ~t3_pc~0; {15101#true} is VALID [2022-02-20 19:20:55,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {15101#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {15101#true} is VALID [2022-02-20 19:20:55,897 INFO L290 TraceCheckUtils]: 46: Hoare triple {15101#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {15101#true} is VALID [2022-02-20 19:20:55,897 INFO L290 TraceCheckUtils]: 47: Hoare triple {15101#true} #t~ret37#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647;~tmp___2~0#1 := #t~ret37#1;havoc #t~ret37#1; {15101#true} is VALID [2022-02-20 19:20:55,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {15101#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {15101#true} is VALID [2022-02-20 19:20:55,897 INFO L290 TraceCheckUtils]: 49: Hoare triple {15101#true} assume true; {15101#true} is VALID [2022-02-20 19:20:55,897 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15101#true} {15102#false} #10725#return; {15102#false} is VALID [2022-02-20 19:20:55,897 INFO L272 TraceCheckUtils]: 51: Hoare triple {15102#false} call reset_delta_events(); {15157#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:20:55,898 INFO L290 TraceCheckUtils]: 52: Hoare triple {15157#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {15101#true} is VALID [2022-02-20 19:20:55,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {15101#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {15101#true} is VALID [2022-02-20 19:20:55,898 INFO L290 TraceCheckUtils]: 54: Hoare triple {15101#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {15101#true} is VALID [2022-02-20 19:20:55,898 INFO L290 TraceCheckUtils]: 55: Hoare triple {15101#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {15101#true} is VALID [2022-02-20 19:20:55,898 INFO L290 TraceCheckUtils]: 56: Hoare triple {15101#true} assume 1 == ~E_M~0;~E_M~0 := 2; {15101#true} is VALID [2022-02-20 19:20:55,899 INFO L290 TraceCheckUtils]: 57: Hoare triple {15101#true} assume 1 == ~E_1~0;~E_1~0 := 2; {15101#true} is VALID [2022-02-20 19:20:55,899 INFO L290 TraceCheckUtils]: 58: Hoare triple {15101#true} assume !(1 == ~E_2~0); {15101#true} is VALID [2022-02-20 19:20:55,899 INFO L290 TraceCheckUtils]: 59: Hoare triple {15101#true} assume 1 == ~E_3~0;~E_3~0 := 2; {15101#true} is VALID [2022-02-20 19:20:55,899 INFO L290 TraceCheckUtils]: 60: Hoare triple {15101#true} assume true; {15101#true} is VALID [2022-02-20 19:20:55,899 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {15101#true} {15102#false} #10727#return; {15102#false} is VALID [2022-02-20 19:20:55,900 INFO L290 TraceCheckUtils]: 62: Hoare triple {15102#false} assume !false; {15102#false} is VALID [2022-02-20 19:20:55,900 INFO L290 TraceCheckUtils]: 63: Hoare triple {15102#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret29#1, eval_#t~nondet30#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet32#1, eval_~tmp_ndt_3~0#1, eval_#t~nondet33#1, eval_~tmp_ndt_4~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {15102#false} is VALID [2022-02-20 19:20:55,900 INFO L290 TraceCheckUtils]: 64: Hoare triple {15102#false} assume !false; {15102#false} is VALID [2022-02-20 19:20:55,900 INFO L272 TraceCheckUtils]: 65: Hoare triple {15102#false} call eval_#t~ret29#1 := exists_runnable_thread(); {15101#true} is VALID [2022-02-20 19:20:55,900 INFO L290 TraceCheckUtils]: 66: Hoare triple {15101#true} havoc ~__retres1~4; {15101#true} is VALID [2022-02-20 19:20:55,900 INFO L290 TraceCheckUtils]: 67: Hoare triple {15101#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {15101#true} is VALID [2022-02-20 19:20:55,901 INFO L290 TraceCheckUtils]: 68: Hoare triple {15101#true} #res := ~__retres1~4; {15101#true} is VALID [2022-02-20 19:20:55,901 INFO L290 TraceCheckUtils]: 69: Hoare triple {15101#true} assume true; {15101#true} is VALID [2022-02-20 19:20:55,901 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {15101#true} {15102#false} #10729#return; {15102#false} is VALID [2022-02-20 19:20:55,901 INFO L290 TraceCheckUtils]: 71: Hoare triple {15102#false} assume -2147483648 <= eval_#t~ret29#1 && eval_#t~ret29#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret29#1;havoc eval_#t~ret29#1; {15102#false} is VALID [2022-02-20 19:20:55,901 INFO L290 TraceCheckUtils]: 72: Hoare triple {15102#false} assume 0 != eval_~tmp~0#1; {15102#false} is VALID [2022-02-20 19:20:55,902 INFO L290 TraceCheckUtils]: 73: Hoare triple {15102#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet30#1 && eval_#t~nondet30#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet30#1;havoc eval_#t~nondet30#1; {15102#false} is VALID [2022-02-20 19:20:55,902 INFO L290 TraceCheckUtils]: 74: Hoare triple {15102#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1, master_#t~nondet28#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet27#1 && master_#t~nondet27#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet27#1;havoc master_#t~nondet27#1; {15102#false} is VALID [2022-02-20 19:20:55,902 INFO L290 TraceCheckUtils]: 75: Hoare triple {15102#false} assume !(0 == ~m_pc~0); {15102#false} is VALID [2022-02-20 19:20:55,902 INFO L290 TraceCheckUtils]: 76: Hoare triple {15102#false} assume 1 == ~m_pc~0; {15102#false} is VALID [2022-02-20 19:20:55,902 INFO L290 TraceCheckUtils]: 77: Hoare triple {15102#false} assume ~token~0 != 3 + ~local~0; {15102#false} is VALID [2022-02-20 19:20:55,903 INFO L272 TraceCheckUtils]: 78: Hoare triple {15102#false} call error(); {15102#false} is VALID [2022-02-20 19:20:55,903 INFO L290 TraceCheckUtils]: 79: Hoare triple {15102#false} assume !false; {15102#false} is VALID [2022-02-20 19:20:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:20:55,904 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:20:55,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332004232] [2022-02-20 19:20:55,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332004232] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:20:55,904 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:20:55,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:20:55,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272728073] [2022-02-20 19:20:55,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:20:55,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-02-20 19:20:55,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:20:55,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:20:55,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:20:55,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:20:55,973 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:20:55,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:20:55,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:20:55,974 INFO L87 Difference]: Start difference. First operand 2427 states and 4420 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:21:07,857 INFO L93 Difference]: Finished difference Result 3000 states and 5300 transitions. [2022-02-20 19:21:07,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:21:07,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-02-20 19:21:07,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:21:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4791 transitions. [2022-02-20 19:21:07,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4791 transitions. [2022-02-20 19:21:07,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4791 transitions. [2022-02-20 19:21:11,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4791 edges. 4791 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:21:11,291 INFO L225 Difference]: With dead ends: 3000 [2022-02-20 19:21:11,291 INFO L226 Difference]: Without dead ends: 2705 [2022-02-20 19:21:11,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:21:11,294 INFO L933 BasicCegarLoop]: 4344 mSDtfsCounter, 4483 mSDsluCounter, 16638 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4493 SdHoareTripleChecker+Valid, 20982 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:21:11,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4493 Valid, 20982 Invalid, 1164 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:21:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2022-02-20 19:21:11,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 2565. [2022-02-20 19:21:11,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:21:11,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2705 states. Second operand has 2565 states, 2500 states have (on average 1.8144) internal successors, (4536), 2505 states have internal predecessors, (4536), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2022-02-20 19:21:11,351 INFO L74 IsIncluded]: Start isIncluded. First operand 2705 states. Second operand has 2565 states, 2500 states have (on average 1.8144) internal successors, (4536), 2505 states have internal predecessors, (4536), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2022-02-20 19:21:11,356 INFO L87 Difference]: Start difference. First operand 2705 states. Second operand has 2565 states, 2500 states have (on average 1.8144) internal successors, (4536), 2505 states have internal predecessors, (4536), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2022-02-20 19:21:11,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:21:11,557 INFO L93 Difference]: Finished difference Result 2705 states and 4852 transitions. [2022-02-20 19:21:11,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 4852 transitions. [2022-02-20 19:21:11,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:21:11,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:21:11,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 2565 states, 2500 states have (on average 1.8144) internal successors, (4536), 2505 states have internal predecessors, (4536), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) Second operand 2705 states. [2022-02-20 19:21:11,571 INFO L87 Difference]: Start difference. First operand has 2565 states, 2500 states have (on average 1.8144) internal successors, (4536), 2505 states have internal predecessors, (4536), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) Second operand 2705 states. [2022-02-20 19:21:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:21:11,776 INFO L93 Difference]: Finished difference Result 2705 states and 4852 transitions. [2022-02-20 19:21:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 4852 transitions. [2022-02-20 19:21:11,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:21:11,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:21:11,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:21:11,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:21:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2500 states have (on average 1.8144) internal successors, (4536), 2505 states have internal predecessors, (4536), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2022-02-20 19:21:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 4625 transitions. [2022-02-20 19:21:11,993 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 4625 transitions. Word has length 80 [2022-02-20 19:21:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:21:11,993 INFO L470 AbstractCegarLoop]: Abstraction has 2565 states and 4625 transitions. [2022-02-20 19:21:11,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:11,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 4625 transitions. [2022-02-20 19:21:11,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 19:21:11,995 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:21:11,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:21:11,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:21:11,996 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:21:11,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:21:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1887529175, now seen corresponding path program 1 times [2022-02-20 19:21:11,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:21:11,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261998331] [2022-02-20 19:21:11,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:21:11,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:21:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:12,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:21:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:12,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {26579#true} assume true; {26579#true} is VALID [2022-02-20 19:21:12,055 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {26579#true} {26581#(= ~T2_E~0 ~M_E~0)} #10721#return; {26581#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:12,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:21:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:12,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {26635#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {26636#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:21:12,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {26636#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {26636#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:21:12,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {26636#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:12,101 INFO L290 TraceCheckUtils]: 3: Hoare triple {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:12,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:12,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:12,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:12,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:12,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:12,104 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {26581#(= ~T2_E~0 ~M_E~0)} #10723#return; {26580#false} is VALID [2022-02-20 19:21:12,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:21:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:12,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {26638#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~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; {26579#true} is VALID [2022-02-20 19:21:12,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {26579#true} assume 1 == ~m_pc~0; {26579#true} is VALID [2022-02-20 19:21:12,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {26579#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {26579#true} is VALID [2022-02-20 19:21:12,142 INFO L290 TraceCheckUtils]: 3: Hoare triple {26579#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {26579#true} is VALID [2022-02-20 19:21:12,142 INFO L290 TraceCheckUtils]: 4: Hoare triple {26579#true} #t~ret34#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp~1#1 := #t~ret34#1;havoc #t~ret34#1; {26579#true} is VALID [2022-02-20 19:21:12,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {26579#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {26579#true} is VALID [2022-02-20 19:21:12,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {26579#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; {26579#true} is VALID [2022-02-20 19:21:12,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {26579#true} assume !(1 == ~t1_pc~0); {26579#true} is VALID [2022-02-20 19:21:12,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {26579#true} is_transmit1_triggered_~__retres1~1#1 := 0; {26579#true} is VALID [2022-02-20 19:21:12,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {26579#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {26579#true} is VALID [2022-02-20 19:21:12,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {26579#true} #t~ret35#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___0~0#1 := #t~ret35#1;havoc #t~ret35#1; {26579#true} is VALID [2022-02-20 19:21:12,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {26579#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {26579#true} is VALID [2022-02-20 19:21:12,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {26579#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; {26579#true} is VALID [2022-02-20 19:21:12,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {26579#true} assume 1 == ~t2_pc~0; {26579#true} is VALID [2022-02-20 19:21:12,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {26579#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {26579#true} is VALID [2022-02-20 19:21:12,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {26579#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {26579#true} is VALID [2022-02-20 19:21:12,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {26579#true} #t~ret36#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___1~0#1 := #t~ret36#1;havoc #t~ret36#1; {26579#true} is VALID [2022-02-20 19:21:12,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {26579#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {26579#true} is VALID [2022-02-20 19:21:12,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {26579#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~3#1;havoc is_transmit3_triggered_~__retres1~3#1; {26579#true} is VALID [2022-02-20 19:21:12,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {26579#true} assume 1 == ~t3_pc~0; {26579#true} is VALID [2022-02-20 19:21:12,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {26579#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {26579#true} is VALID [2022-02-20 19:21:12,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {26579#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {26579#true} is VALID [2022-02-20 19:21:12,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {26579#true} #t~ret37#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647;~tmp___2~0#1 := #t~ret37#1;havoc #t~ret37#1; {26579#true} is VALID [2022-02-20 19:21:12,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {26579#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {26579#true} is VALID [2022-02-20 19:21:12,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {26579#true} assume true; {26579#true} is VALID [2022-02-20 19:21:12,147 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {26579#true} {26580#false} #10725#return; {26580#false} is VALID [2022-02-20 19:21:12,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:21:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:12,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {26635#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {26579#true} is VALID [2022-02-20 19:21:12,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {26579#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {26579#true} is VALID [2022-02-20 19:21:12,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {26579#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {26579#true} is VALID [2022-02-20 19:21:12,162 INFO L290 TraceCheckUtils]: 3: Hoare triple {26579#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {26579#true} is VALID [2022-02-20 19:21:12,162 INFO L290 TraceCheckUtils]: 4: Hoare triple {26579#true} assume 1 == ~E_M~0;~E_M~0 := 2; {26579#true} is VALID [2022-02-20 19:21:12,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {26579#true} assume 1 == ~E_1~0;~E_1~0 := 2; {26579#true} is VALID [2022-02-20 19:21:12,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {26579#true} assume !(1 == ~E_2~0); {26579#true} is VALID [2022-02-20 19:21:12,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {26579#true} assume 1 == ~E_3~0;~E_3~0 := 2; {26579#true} is VALID [2022-02-20 19:21:12,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {26579#true} assume true; {26579#true} is VALID [2022-02-20 19:21:12,163 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {26579#true} {26580#false} #10727#return; {26580#false} is VALID [2022-02-20 19:21:12,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:21:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:21:12,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {26579#true} havoc ~__retres1~4; {26579#true} is VALID [2022-02-20 19:21:12,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {26579#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {26579#true} is VALID [2022-02-20 19:21:12,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {26579#true} #res := ~__retres1~4; {26579#true} is VALID [2022-02-20 19:21:12,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {26579#true} assume true; {26579#true} is VALID [2022-02-20 19:21:12,177 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {26579#true} {26580#false} #10729#return; {26580#false} is VALID [2022-02-20 19:21:12,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {26579#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(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {26581#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:12,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {26581#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet41#1, main_#t~ret42#1, main_#t~ret43#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {26581#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:12,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {26581#(= ~T2_E~0 ~M_E~0)} assume !(0 != main_#t~nondet41#1);havoc main_#t~nondet41#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~5#1;havoc main2_~__retres1~5#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {26581#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:12,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {26581#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret39#1, start_simulation_#t~ret40#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; {26581#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:12,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {26581#(= ~T2_E~0 ~M_E~0)} call update_channels(); {26579#true} is VALID [2022-02-20 19:21:12,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {26579#true} assume true; {26579#true} is VALID [2022-02-20 19:21:12,180 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {26579#true} {26581#(= ~T2_E~0 ~M_E~0)} #10721#return; {26581#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:12,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {26581#(= ~T2_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {26581#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:12,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {26581#(= ~T2_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {26581#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:12,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {26581#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {26581#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:12,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {26581#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {26581#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:12,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {26581#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {26581#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:12,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {26581#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {26581#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:21:12,183 INFO L272 TraceCheckUtils]: 13: Hoare triple {26581#(= ~T2_E~0 ~M_E~0)} call fire_delta_events(); {26635#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:21:12,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {26635#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {26636#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:21:12,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {26636#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {26636#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:21:12,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {26636#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:12,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:12,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:12,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:12,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:12,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:12,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:21:12,192 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26637#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {26581#(= ~T2_E~0 ~M_E~0)} #10723#return; {26580#false} is VALID [2022-02-20 19:21:12,192 INFO L272 TraceCheckUtils]: 24: Hoare triple {26580#false} call activate_threads(); {26638#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:21:12,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {26638#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;havoc ~tmp___2~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; {26579#true} is VALID [2022-02-20 19:21:12,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {26579#true} assume 1 == ~m_pc~0; {26579#true} is VALID [2022-02-20 19:21:12,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {26579#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {26579#true} is VALID [2022-02-20 19:21:12,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {26579#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {26579#true} is VALID [2022-02-20 19:21:12,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {26579#true} #t~ret34#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp~1#1 := #t~ret34#1;havoc #t~ret34#1; {26579#true} is VALID [2022-02-20 19:21:12,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {26579#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {26579#true} is VALID [2022-02-20 19:21:12,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {26579#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; {26579#true} is VALID [2022-02-20 19:21:12,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {26579#true} assume !(1 == ~t1_pc~0); {26579#true} is VALID [2022-02-20 19:21:12,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {26579#true} is_transmit1_triggered_~__retres1~1#1 := 0; {26579#true} is VALID [2022-02-20 19:21:12,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {26579#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {26579#true} is VALID [2022-02-20 19:21:12,193 INFO L290 TraceCheckUtils]: 35: Hoare triple {26579#true} #t~ret35#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___0~0#1 := #t~ret35#1;havoc #t~ret35#1; {26579#true} is VALID [2022-02-20 19:21:12,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {26579#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {26579#true} is VALID [2022-02-20 19:21:12,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {26579#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; {26579#true} is VALID [2022-02-20 19:21:12,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {26579#true} assume 1 == ~t2_pc~0; {26579#true} is VALID [2022-02-20 19:21:12,194 INFO L290 TraceCheckUtils]: 39: Hoare triple {26579#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {26579#true} is VALID [2022-02-20 19:21:12,194 INFO L290 TraceCheckUtils]: 40: Hoare triple {26579#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {26579#true} is VALID [2022-02-20 19:21:12,194 INFO L290 TraceCheckUtils]: 41: Hoare triple {26579#true} #t~ret36#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647;~tmp___1~0#1 := #t~ret36#1;havoc #t~ret36#1; {26579#true} is VALID [2022-02-20 19:21:12,194 INFO L290 TraceCheckUtils]: 42: Hoare triple {26579#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {26579#true} is VALID [2022-02-20 19:21:12,195 INFO L290 TraceCheckUtils]: 43: Hoare triple {26579#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~3#1;havoc is_transmit3_triggered_~__retres1~3#1; {26579#true} is VALID [2022-02-20 19:21:12,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {26579#true} assume 1 == ~t3_pc~0; {26579#true} is VALID [2022-02-20 19:21:12,195 INFO L290 TraceCheckUtils]: 45: Hoare triple {26579#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {26579#true} is VALID [2022-02-20 19:21:12,195 INFO L290 TraceCheckUtils]: 46: Hoare triple {26579#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {26579#true} is VALID [2022-02-20 19:21:12,195 INFO L290 TraceCheckUtils]: 47: Hoare triple {26579#true} #t~ret37#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret37#1 && #t~ret37#1 <= 2147483647;~tmp___2~0#1 := #t~ret37#1;havoc #t~ret37#1; {26579#true} is VALID [2022-02-20 19:21:12,196 INFO L290 TraceCheckUtils]: 48: Hoare triple {26579#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {26579#true} is VALID [2022-02-20 19:21:12,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {26579#true} assume true; {26579#true} is VALID [2022-02-20 19:21:12,196 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26579#true} {26580#false} #10725#return; {26580#false} is VALID [2022-02-20 19:21:12,196 INFO L272 TraceCheckUtils]: 51: Hoare triple {26580#false} call reset_delta_events(); {26635#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:21:12,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {26635#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {26579#true} is VALID [2022-02-20 19:21:12,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {26579#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {26579#true} is VALID [2022-02-20 19:21:12,197 INFO L290 TraceCheckUtils]: 54: Hoare triple {26579#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {26579#true} is VALID [2022-02-20 19:21:12,197 INFO L290 TraceCheckUtils]: 55: Hoare triple {26579#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {26579#true} is VALID [2022-02-20 19:21:12,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {26579#true} assume 1 == ~E_M~0;~E_M~0 := 2; {26579#true} is VALID [2022-02-20 19:21:12,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {26579#true} assume 1 == ~E_1~0;~E_1~0 := 2; {26579#true} is VALID [2022-02-20 19:21:12,200 INFO L290 TraceCheckUtils]: 58: Hoare triple {26579#true} assume !(1 == ~E_2~0); {26579#true} is VALID [2022-02-20 19:21:12,201 INFO L290 TraceCheckUtils]: 59: Hoare triple {26579#true} assume 1 == ~E_3~0;~E_3~0 := 2; {26579#true} is VALID [2022-02-20 19:21:12,201 INFO L290 TraceCheckUtils]: 60: Hoare triple {26579#true} assume true; {26579#true} is VALID [2022-02-20 19:21:12,203 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {26579#true} {26580#false} #10727#return; {26580#false} is VALID [2022-02-20 19:21:12,204 INFO L290 TraceCheckUtils]: 62: Hoare triple {26580#false} assume !false; {26580#false} is VALID [2022-02-20 19:21:12,206 INFO L290 TraceCheckUtils]: 63: Hoare triple {26580#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret29#1, eval_#t~nondet30#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet32#1, eval_~tmp_ndt_3~0#1, eval_#t~nondet33#1, eval_~tmp_ndt_4~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {26580#false} is VALID [2022-02-20 19:21:12,207 INFO L290 TraceCheckUtils]: 64: Hoare triple {26580#false} assume !false; {26580#false} is VALID [2022-02-20 19:21:12,210 INFO L272 TraceCheckUtils]: 65: Hoare triple {26580#false} call eval_#t~ret29#1 := exists_runnable_thread(); {26579#true} is VALID [2022-02-20 19:21:12,210 INFO L290 TraceCheckUtils]: 66: Hoare triple {26579#true} havoc ~__retres1~4; {26579#true} is VALID [2022-02-20 19:21:12,210 INFO L290 TraceCheckUtils]: 67: Hoare triple {26579#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {26579#true} is VALID [2022-02-20 19:21:12,210 INFO L290 TraceCheckUtils]: 68: Hoare triple {26579#true} #res := ~__retres1~4; {26579#true} is VALID [2022-02-20 19:21:12,211 INFO L290 TraceCheckUtils]: 69: Hoare triple {26579#true} assume true; {26579#true} is VALID [2022-02-20 19:21:12,211 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {26579#true} {26580#false} #10729#return; {26580#false} is VALID [2022-02-20 19:21:12,211 INFO L290 TraceCheckUtils]: 71: Hoare triple {26580#false} assume -2147483648 <= eval_#t~ret29#1 && eval_#t~ret29#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret29#1;havoc eval_#t~ret29#1; {26580#false} is VALID [2022-02-20 19:21:12,211 INFO L290 TraceCheckUtils]: 72: Hoare triple {26580#false} assume 0 != eval_~tmp~0#1; {26580#false} is VALID [2022-02-20 19:21:12,211 INFO L290 TraceCheckUtils]: 73: Hoare triple {26580#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet30#1 && eval_#t~nondet30#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet30#1;havoc eval_#t~nondet30#1; {26580#false} is VALID [2022-02-20 19:21:12,211 INFO L290 TraceCheckUtils]: 74: Hoare triple {26580#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1, master_#t~nondet28#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet27#1 && master_#t~nondet27#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet27#1;havoc master_#t~nondet27#1; {26580#false} is VALID [2022-02-20 19:21:12,212 INFO L290 TraceCheckUtils]: 75: Hoare triple {26580#false} assume !(0 == ~m_pc~0); {26580#false} is VALID [2022-02-20 19:21:12,212 INFO L290 TraceCheckUtils]: 76: Hoare triple {26580#false} assume 1 == ~m_pc~0; {26580#false} is VALID [2022-02-20 19:21:12,212 INFO L290 TraceCheckUtils]: 77: Hoare triple {26580#false} assume ~token~0 != 3 + ~local~0; {26580#false} is VALID [2022-02-20 19:21:12,212 INFO L272 TraceCheckUtils]: 78: Hoare triple {26580#false} call error(); {26580#false} is VALID [2022-02-20 19:21:12,212 INFO L290 TraceCheckUtils]: 79: Hoare triple {26580#false} assume !false; {26580#false} is VALID [2022-02-20 19:21:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:21:12,214 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:21:12,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261998331] [2022-02-20 19:21:12,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261998331] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:21:12,214 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:21:12,214 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:21:12,214 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869385488] [2022-02-20 19:21:12,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:21:12,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-02-20 19:21:12,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:21:12,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:12,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:21:12,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:21:12,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:21:12,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:21:12,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:21:12,269 INFO L87 Difference]: Start difference. First operand 2565 states and 4625 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:21:23,798 INFO L93 Difference]: Finished difference Result 3497 states and 6053 transitions. [2022-02-20 19:21:23,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:21:23,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-02-20 19:21:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:21:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4796 transitions. [2022-02-20 19:21:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:21:23,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4796 transitions. [2022-02-20 19:21:23,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4796 transitions. [2022-02-20 19:21:27,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4796 edges. 4796 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:21:27,301 INFO L225 Difference]: With dead ends: 3497 [2022-02-20 19:21:27,302 INFO L226 Difference]: Without dead ends: 3064 [2022-02-20 19:21:27,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:21:27,304 INFO L933 BasicCegarLoop]: 4336 mSDtfsCounter, 4480 mSDsluCounter, 16638 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4490 SdHoareTripleChecker+Valid, 20974 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:21:27,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4490 Valid, 20974 Invalid, 1169 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:21:27,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3064 states. [2022-02-20 19:21:27,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3064 to 2842. [2022-02-20 19:21:27,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:21:27,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3064 states. Second operand has 2842 states, 2739 states have (on average 1.78714859437751) internal successors, (4895), 2746 states have internal predecessors, (4895), 67 states have call successors, (67), 31 states have call predecessors, (67), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 19:21:27,360 INFO L74 IsIncluded]: Start isIncluded. First operand 3064 states. Second operand has 2842 states, 2739 states have (on average 1.78714859437751) internal successors, (4895), 2746 states have internal predecessors, (4895), 67 states have call successors, (67), 31 states have call predecessors, (67), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 19:21:27,363 INFO L87 Difference]: Start difference. First operand 3064 states. Second operand has 2842 states, 2739 states have (on average 1.78714859437751) internal successors, (4895), 2746 states have internal predecessors, (4895), 67 states have call successors, (67), 31 states have call predecessors, (67), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-02-20 19:21:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:21:27,619 INFO L93 Difference]: Finished difference Result 3064 states and 5397 transitions. [2022-02-20 19:21:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 5397 transitions. [2022-02-20 19:21:27,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:21:27,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:21:27,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 2842 states, 2739 states have (on average 1.78714859437751) internal successors, (4895), 2746 states have internal predecessors, (4895), 67 states have call successors, (67), 31 states have call predecessors, (67), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) Second operand 3064 states. [2022-02-20 19:21:27,634 INFO L87 Difference]: Start difference. First operand has 2842 states, 2739 states have (on average 1.78714859437751) internal successors, (4895), 2746 states have internal predecessors, (4895), 67 states have call successors, (67), 31 states have call predecessors, (67), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) Second operand 3064 states.