./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+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_label43+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 d5e8784cabcb38b73600d610d5b7e0bbbbf790f527b046ae80f9a34c4ea82403 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:17:22,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:17:22,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:17:22,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:17:22,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:17:22,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:17:22,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:17:22,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:17:22,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:17:22,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:17:22,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:17:22,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:17:22,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:17:22,474 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:17:22,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:17:22,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:17:22,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:17:22,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:17:22,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:17:22,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:17:22,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:17:22,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:17:22,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:17:22,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:17:22,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:17:22,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:17:22,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:17:22,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:17:22,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:17:22,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:17:22,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:17:22,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:17:22,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:17:22,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:17:22,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:17:22,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:17:22,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:17:22,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:17:22,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:17:22,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:17:22,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:17:22,502 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:17:22,527 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:17:22,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:17:22,529 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:17:22,529 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:17:22,530 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:17:22,530 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:17:22,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:17:22,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:17:22,530 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:17:22,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:17:22,531 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:17:22,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:17:22,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:17:22,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:17:22,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:17:22,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:17:22,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:17:22,532 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:17:22,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:17:22,532 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:17:22,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:17:22,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:17:22,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:17:22,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:17:22,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:17:22,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:17:22,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:17:22,534 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:17:22,534 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:17:22,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:17:22,534 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:17:22,534 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:17:22,534 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:17:22,534 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 -> d5e8784cabcb38b73600d610d5b7e0bbbbf790f527b046ae80f9a34c4ea82403 [2022-02-20 19:17:22,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:17:22,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:17:22,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:17:22,725 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:17:22,726 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:17:22,727 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.03.cil-1.c [2022-02-20 19:17:22,779 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf3cfe59/6cbe452088334838bcf552d8d0c167f4/FLAGd73bc0b37 [2022-02-20 19:17:23,459 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:17:23,459 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.03.cil-1.c [2022-02-20 19:17:23,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf3cfe59/6cbe452088334838bcf552d8d0c167f4/FLAGd73bc0b37 [2022-02-20 19:17:23,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf3cfe59/6cbe452088334838bcf552d8d0c167f4 [2022-02-20 19:17:23,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:17:23,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:17:23,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:17:23,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:17:23,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:17:23,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:17:23" (1/1) ... [2022-02-20 19:17:23,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea9a9ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:23, skipping insertion in model container [2022-02-20 19:17:23,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:17:23" (1/1) ... [2022-02-20 19:17:23,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:17:23,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:17:25,135 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_label43+token_ring.03.cil-1.c[381679,381692] [2022-02-20 19:17:25,155 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_label43+token_ring.03.cil-1.c[383339,383352] [2022-02-20 19:17:25,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:17:25,287 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:17:25,894 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_label43+token_ring.03.cil-1.c[381679,381692] [2022-02-20 19:17:25,903 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_label43+token_ring.03.cil-1.c[383339,383352] [2022-02-20 19:17:25,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:17:25,966 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:17:25,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:25 WrapperNode [2022-02-20 19:17:25,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:17:25,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:17:25,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:17:25,967 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:17:25,972 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:17:25" (1/1) ... [2022-02-20 19:17:26,034 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:17:25" (1/1) ... [2022-02-20 19:17:26,365 INFO L137 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 12682 [2022-02-20 19:17:26,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:17:26,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:17:26,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:17:26,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:17:26,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:25" (1/1) ... [2022-02-20 19:17:26,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:25" (1/1) ... [2022-02-20 19:17:26,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:25" (1/1) ... [2022-02-20 19:17:26,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:25" (1/1) ... [2022-02-20 19:17:26,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:25" (1/1) ... [2022-02-20 19:17:26,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:25" (1/1) ... [2022-02-20 19:17:26,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:25" (1/1) ... [2022-02-20 19:17:26,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:17:26,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:17:26,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:17:26,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:17:26,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:25" (1/1) ... [2022-02-20 19:17:26,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:17:26,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:17:26,859 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:17:26,879 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:17:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:17:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-02-20 19:17:26,897 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-02-20 19:17:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:17:26,897 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:17:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-02-20 19:17:26,897 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-02-20 19:17:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-02-20 19:17:26,898 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-02-20 19:17:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-02-20 19:17:26,898 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-02-20 19:17:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-02-20 19:17:26,898 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-02-20 19:17:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-02-20 19:17:26,898 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-02-20 19:17:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:17:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:17:26,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:17:27,010 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:17:27,024 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:17:31,650 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:17:31,673 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:17:31,673 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-02-20 19:17:31,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:17:31 BoogieIcfgContainer [2022-02-20 19:17:31,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:17:31,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:17:31,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:17:31,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:17:31,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:17:23" (1/3) ... [2022-02-20 19:17:31,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4b5140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:17:31, skipping insertion in model container [2022-02-20 19:17:31,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:25" (2/3) ... [2022-02-20 19:17:31,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4b5140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:17:31, skipping insertion in model container [2022-02-20 19:17:31,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:17:31" (3/3) ... [2022-02-20 19:17:31,695 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.03.cil-1.c [2022-02-20 19:17:31,699 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:17:31,699 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:17:31,744 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:17:31,750 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:17:31,751 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:17:31,801 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:17:31,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 19:17:31,808 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:17:31,808 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:17:31,809 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:17:31,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:17:31,812 INFO L85 PathProgramCache]: Analyzing trace with hash 520182233, now seen corresponding path program 1 times [2022-02-20 19:17:31,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:17:31,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998771793] [2022-02-20 19:17:31,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:17:31,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:17:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:31,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:17:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:31,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-02-20 19:17:31,997 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:17:32,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:17:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:32,077 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:17:32,078 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:17:32,078 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:17:32,079 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:17:32,079 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:17:32,079 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:17:32,080 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:17:32,080 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:17:32,081 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:17:32,081 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:17:32,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:17:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:32,138 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:17:32,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {2351#true} assume 1 == ~m_pc~0; {2351#true} is VALID [2022-02-20 19:17:32,139 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:17:32,139 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:17:32,140 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:17:32,140 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:17:32,140 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:17:32,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {2351#true} assume !(1 == ~t1_pc~0); {2351#true} is VALID [2022-02-20 19:17:32,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {2351#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2351#true} is VALID [2022-02-20 19:17:32,141 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:17:32,141 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:17:32,142 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:17:32,142 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:17:32,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {2351#true} assume 1 == ~t2_pc~0; {2351#true} is VALID [2022-02-20 19:17:32,142 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:17:32,143 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:17:32,143 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:17:32,143 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:17:32,143 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:17:32,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {2351#true} assume 1 == ~t3_pc~0; {2351#true} is VALID [2022-02-20 19:17:32,144 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:17:32,144 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:17:32,144 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:17:32,145 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:17:32,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-02-20 19:17:32,145 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2351#true} {2352#false} #10725#return; {2352#false} is VALID [2022-02-20 19:17:32,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:17:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:32,164 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:17:32,164 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:17:32,164 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:17:32,165 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:17:32,165 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:17:32,165 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:17:32,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {2351#true} assume !(1 == ~E_2~0); {2351#true} is VALID [2022-02-20 19:17:32,165 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:17:32,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-02-20 19:17:32,166 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2351#true} {2352#false} #10727#return; {2352#false} is VALID [2022-02-20 19:17:32,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:17:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:32,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {2351#true} havoc ~__retres1~4; {2351#true} is VALID [2022-02-20 19:17:32,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {2351#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {2351#true} is VALID [2022-02-20 19:17:32,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {2351#true} #res := ~__retres1~4; {2351#true} is VALID [2022-02-20 19:17:32,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-02-20 19:17:32,172 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2351#true} {2352#false} #10729#return; {2352#false} is VALID [2022-02-20 19:17:32,173 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:17:32,174 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:17:32,174 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:17:32,175 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:17:32,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {2353#(= ~M_E~0 2)} call update_channels(); {2351#true} is VALID [2022-02-20 19:17:32,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-02-20 19:17:32,176 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:17:32,176 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:17:32,176 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:17:32,177 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:17:32,177 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:17:32,178 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:17:32,178 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:17:32,179 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:17:32,180 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:17:32,180 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:17:32,180 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:17:32,181 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:17:32,181 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:17:32,182 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:17:32,182 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:17:32,182 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:17:32,183 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:17:32,183 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:17:32,183 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:17:32,184 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:17:32,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {2351#true} assume 1 == ~m_pc~0; {2351#true} is VALID [2022-02-20 19:17:32,184 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:17:32,184 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:17:32,184 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:17:32,185 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:17:32,185 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:17:32,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {2351#true} assume !(1 == ~t1_pc~0); {2351#true} is VALID [2022-02-20 19:17:32,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {2351#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2351#true} is VALID [2022-02-20 19:17:32,185 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:17:32,185 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:17:32,186 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:17:32,186 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:17:32,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {2351#true} assume 1 == ~t2_pc~0; {2351#true} is VALID [2022-02-20 19:17:32,186 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:17:32,186 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:17:32,187 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:17:32,187 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:17:32,187 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:17:32,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {2351#true} assume 1 == ~t3_pc~0; {2351#true} is VALID [2022-02-20 19:17:32,187 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:17:32,187 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:17:32,188 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:17:32,188 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:17:32,188 INFO L290 TraceCheckUtils]: 49: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-02-20 19:17:32,188 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2351#true} {2352#false} #10725#return; {2352#false} is VALID [2022-02-20 19:17:32,188 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:17:32,188 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:17:32,189 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:17:32,189 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:17:32,189 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:17:32,189 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:17:32,189 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:17:32,190 INFO L290 TraceCheckUtils]: 58: Hoare triple {2351#true} assume !(1 == ~E_2~0); {2351#true} is VALID [2022-02-20 19:17:32,190 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:17:32,190 INFO L290 TraceCheckUtils]: 60: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-02-20 19:17:32,190 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {2351#true} {2352#false} #10727#return; {2352#false} is VALID [2022-02-20 19:17:32,190 INFO L290 TraceCheckUtils]: 62: Hoare triple {2352#false} assume !false; {2352#false} is VALID [2022-02-20 19:17:32,190 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:17:32,191 INFO L290 TraceCheckUtils]: 64: Hoare triple {2352#false} assume !false; {2352#false} is VALID [2022-02-20 19:17:32,191 INFO L272 TraceCheckUtils]: 65: Hoare triple {2352#false} call eval_#t~ret29#1 := exists_runnable_thread(); {2351#true} is VALID [2022-02-20 19:17:32,191 INFO L290 TraceCheckUtils]: 66: Hoare triple {2351#true} havoc ~__retres1~4; {2351#true} is VALID [2022-02-20 19:17:32,191 INFO L290 TraceCheckUtils]: 67: Hoare triple {2351#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {2351#true} is VALID [2022-02-20 19:17:32,191 INFO L290 TraceCheckUtils]: 68: Hoare triple {2351#true} #res := ~__retres1~4; {2351#true} is VALID [2022-02-20 19:17:32,192 INFO L290 TraceCheckUtils]: 69: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-02-20 19:17:32,192 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {2351#true} {2352#false} #10729#return; {2352#false} is VALID [2022-02-20 19:17:32,192 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:17:32,192 INFO L290 TraceCheckUtils]: 72: Hoare triple {2352#false} assume 0 != eval_~tmp~0#1; {2352#false} is VALID [2022-02-20 19:17:32,192 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:17:32,192 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:17:32,193 INFO L290 TraceCheckUtils]: 75: Hoare triple {2352#false} assume !(0 == ~m_pc~0); {2352#false} is VALID [2022-02-20 19:17:32,193 INFO L290 TraceCheckUtils]: 76: Hoare triple {2352#false} assume 1 == ~m_pc~0; {2352#false} is VALID [2022-02-20 19:17:32,193 INFO L290 TraceCheckUtils]: 77: Hoare triple {2352#false} assume ~token~0 != 3 + ~local~0; {2352#false} is VALID [2022-02-20 19:17:32,193 INFO L272 TraceCheckUtils]: 78: Hoare triple {2352#false} call error(); {2352#false} is VALID [2022-02-20 19:17:32,193 INFO L290 TraceCheckUtils]: 79: Hoare triple {2352#false} assume !false; {2352#false} is VALID [2022-02-20 19:17:32,194 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:17:32,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:17:32,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998771793] [2022-02-20 19:17:32,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998771793] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:17:32,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:17:32,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:17:32,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653628804] [2022-02-20 19:17:32,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:17:32,207 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:17:32,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:17:32,211 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:17:32,269 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:17:32,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:17:32,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:17:32,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:17:32,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:17:32,295 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:17:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:17:42,908 INFO L93 Difference]: Finished difference Result 4921 states and 9054 transitions. [2022-02-20 19:17:42,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:17:42,909 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:17:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:17:42,910 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:17:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 9054 transitions. [2022-02-20 19:17:42,987 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:17:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 9054 transitions. [2022-02-20 19:17:43,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 9054 transitions. [2022-02-20 19:17:48,829 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:17:49,195 INFO L225 Difference]: With dead ends: 4921 [2022-02-20 19:17:49,196 INFO L226 Difference]: Without dead ends: 2514 [2022-02-20 19:17:49,204 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:17:49,208 INFO L933 BasicCegarLoop]: 4299 mSDtfsCounter, 4559 mSDsluCounter, 12506 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:17:49,210 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.7s Time] [2022-02-20 19:17:49,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2022-02-20 19:17:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2427. [2022-02-20 19:17:49,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:17:49,331 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:17:49,338 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:17:49,343 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:17:49,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:17:49,525 INFO L93 Difference]: Finished difference Result 2514 states and 4560 transitions. [2022-02-20 19:17:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 4560 transitions. [2022-02-20 19:17:49,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:17:49,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:17:49,542 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:17:49,548 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:17:49,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:17:49,731 INFO L93 Difference]: Finished difference Result 2514 states and 4560 transitions. [2022-02-20 19:17:49,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 4560 transitions. [2022-02-20 19:17:49,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:17:49,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:17:49,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:17:49,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:17:49,747 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:17:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 4420 transitions. [2022-02-20 19:17:49,932 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 4420 transitions. Word has length 80 [2022-02-20 19:17:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:17:49,933 INFO L470 AbstractCegarLoop]: Abstraction has 2427 states and 4420 transitions. [2022-02-20 19:17:49,933 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:17:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 4420 transitions. [2022-02-20 19:17:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 19:17:49,935 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:17:49,935 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:17:49,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:17:49,937 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:17:49,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:17:49,938 INFO L85 PathProgramCache]: Analyzing trace with hash -721258283, now seen corresponding path program 1 times [2022-02-20 19:17:49,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:17:49,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044855162] [2022-02-20 19:17:49,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:17:49,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:17:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:49,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:17:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:49,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {15101#true} assume true; {15101#true} is VALID [2022-02-20 19:17:49,980 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:17:49,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:17:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:50,010 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:17:50,011 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:17:50,011 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:17:50,011 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:17:50,012 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:17:50,012 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:17:50,012 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:17:50,013 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:17:50,013 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:17:50,013 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:17:50,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:17:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:50,038 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:17:50,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {15101#true} assume 1 == ~m_pc~0; {15101#true} is VALID [2022-02-20 19:17:50,039 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:17:50,039 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:17:50,039 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:17:50,040 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:17:50,040 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:17:50,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {15101#true} assume !(1 == ~t1_pc~0); {15101#true} is VALID [2022-02-20 19:17:50,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {15101#true} is_transmit1_triggered_~__retres1~1#1 := 0; {15101#true} is VALID [2022-02-20 19:17:50,040 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:17:50,040 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:17:50,041 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:17:50,041 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:17:50,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {15101#true} assume 1 == ~t2_pc~0; {15101#true} is VALID [2022-02-20 19:17:50,041 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:17:50,041 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:17:50,041 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:17:50,042 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:17:50,042 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:17:50,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {15101#true} assume 1 == ~t3_pc~0; {15101#true} is VALID [2022-02-20 19:17:50,042 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:17:50,042 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:17:50,042 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:17:50,043 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:17:50,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {15101#true} assume true; {15101#true} is VALID [2022-02-20 19:17:50,043 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15101#true} {15102#false} #10725#return; {15102#false} is VALID [2022-02-20 19:17:50,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:17:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:50,051 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:17:50,051 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:17:50,051 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:17:50,051 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:17:50,051 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:17:50,051 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:17:50,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {15101#true} assume !(1 == ~E_2~0); {15101#true} is VALID [2022-02-20 19:17:50,052 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:17:50,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {15101#true} assume true; {15101#true} is VALID [2022-02-20 19:17:50,052 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {15101#true} {15102#false} #10727#return; {15102#false} is VALID [2022-02-20 19:17:50,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:17:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:50,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {15101#true} havoc ~__retres1~4; {15101#true} is VALID [2022-02-20 19:17:50,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {15101#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {15101#true} is VALID [2022-02-20 19:17:50,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {15101#true} #res := ~__retres1~4; {15101#true} is VALID [2022-02-20 19:17:50,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {15101#true} assume true; {15101#true} is VALID [2022-02-20 19:17:50,064 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15101#true} {15102#false} #10729#return; {15102#false} is VALID [2022-02-20 19:17:50,065 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:17:50,065 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:17:50,066 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:17:50,066 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:17:50,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {15103#(= ~T1_E~0 ~M_E~0)} call update_channels(); {15101#true} is VALID [2022-02-20 19:17:50,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {15101#true} assume true; {15101#true} is VALID [2022-02-20 19:17:50,067 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:17:50,067 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:17:50,067 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:17:50,067 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:17:50,068 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:17:50,068 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:17:50,068 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:17:50,069 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:17:50,069 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:17:50,072 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:17:50,073 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:17:50,073 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:17:50,074 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:17:50,074 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:17:50,075 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:17:50,075 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:17:50,075 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:17:50,076 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:17:50,076 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:17:50,076 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:17:50,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {15101#true} assume 1 == ~m_pc~0; {15101#true} is VALID [2022-02-20 19:17:50,077 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:17:50,077 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:17:50,077 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:17:50,077 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:17:50,078 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:17:50,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {15101#true} assume !(1 == ~t1_pc~0); {15101#true} is VALID [2022-02-20 19:17:50,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {15101#true} is_transmit1_triggered_~__retres1~1#1 := 0; {15101#true} is VALID [2022-02-20 19:17:50,078 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:17:50,078 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:17:50,080 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:17:50,080 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:17:50,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {15101#true} assume 1 == ~t2_pc~0; {15101#true} is VALID [2022-02-20 19:17:50,080 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:17:50,080 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:17:50,081 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:17:50,082 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:17:50,082 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:17:50,082 INFO L290 TraceCheckUtils]: 44: Hoare triple {15101#true} assume 1 == ~t3_pc~0; {15101#true} is VALID [2022-02-20 19:17:50,083 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:17:50,083 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:17:50,083 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:17:50,083 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:17:50,083 INFO L290 TraceCheckUtils]: 49: Hoare triple {15101#true} assume true; {15101#true} is VALID [2022-02-20 19:17:50,083 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15101#true} {15102#false} #10725#return; {15102#false} is VALID [2022-02-20 19:17:50,084 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:17:50,085 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:17:50,086 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:17:50,086 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:17:50,088 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:17:50,088 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:17:50,088 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:17:50,088 INFO L290 TraceCheckUtils]: 58: Hoare triple {15101#true} assume !(1 == ~E_2~0); {15101#true} is VALID [2022-02-20 19:17:50,088 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:17:50,088 INFO L290 TraceCheckUtils]: 60: Hoare triple {15101#true} assume true; {15101#true} is VALID [2022-02-20 19:17:50,089 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {15101#true} {15102#false} #10727#return; {15102#false} is VALID [2022-02-20 19:17:50,089 INFO L290 TraceCheckUtils]: 62: Hoare triple {15102#false} assume !false; {15102#false} is VALID [2022-02-20 19:17:50,089 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:17:50,089 INFO L290 TraceCheckUtils]: 64: Hoare triple {15102#false} assume !false; {15102#false} is VALID [2022-02-20 19:17:50,089 INFO L272 TraceCheckUtils]: 65: Hoare triple {15102#false} call eval_#t~ret29#1 := exists_runnable_thread(); {15101#true} is VALID [2022-02-20 19:17:50,090 INFO L290 TraceCheckUtils]: 66: Hoare triple {15101#true} havoc ~__retres1~4; {15101#true} is VALID [2022-02-20 19:17:50,091 INFO L290 TraceCheckUtils]: 67: Hoare triple {15101#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {15101#true} is VALID [2022-02-20 19:17:50,092 INFO L290 TraceCheckUtils]: 68: Hoare triple {15101#true} #res := ~__retres1~4; {15101#true} is VALID [2022-02-20 19:17:50,092 INFO L290 TraceCheckUtils]: 69: Hoare triple {15101#true} assume true; {15101#true} is VALID [2022-02-20 19:17:50,092 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {15101#true} {15102#false} #10729#return; {15102#false} is VALID [2022-02-20 19:17:50,094 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:17:50,095 INFO L290 TraceCheckUtils]: 72: Hoare triple {15102#false} assume 0 != eval_~tmp~0#1; {15102#false} is VALID [2022-02-20 19:17:50,095 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:17:50,095 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:17:50,095 INFO L290 TraceCheckUtils]: 75: Hoare triple {15102#false} assume !(0 == ~m_pc~0); {15102#false} is VALID [2022-02-20 19:17:50,095 INFO L290 TraceCheckUtils]: 76: Hoare triple {15102#false} assume 1 == ~m_pc~0; {15102#false} is VALID [2022-02-20 19:17:50,095 INFO L290 TraceCheckUtils]: 77: Hoare triple {15102#false} assume ~token~0 != 3 + ~local~0; {15102#false} is VALID [2022-02-20 19:17:50,095 INFO L272 TraceCheckUtils]: 78: Hoare triple {15102#false} call error(); {15102#false} is VALID [2022-02-20 19:17:50,095 INFO L290 TraceCheckUtils]: 79: Hoare triple {15102#false} assume !false; {15102#false} is VALID [2022-02-20 19:17:50,096 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:17:50,096 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:17:50,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044855162] [2022-02-20 19:17:50,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044855162] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:17:50,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:17:50,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:17:50,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796969352] [2022-02-20 19:17:50,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:17:50,098 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:17:50,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:17:50,098 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:17:50,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:17:50,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:17:50,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:17:50,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:17:50,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:17:50,159 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:18:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:18:01,641 INFO L93 Difference]: Finished difference Result 3000 states and 5300 transitions. [2022-02-20 19:18:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:18:01,642 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:18:01,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:18:01,642 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:18:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4791 transitions. [2022-02-20 19:18:01,672 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:18:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4791 transitions. [2022-02-20 19:18:01,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4791 transitions. [2022-02-20 19:18:04,799 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:18:04,989 INFO L225 Difference]: With dead ends: 3000 [2022-02-20 19:18:04,989 INFO L226 Difference]: Without dead ends: 2705 [2022-02-20 19:18:04,991 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:18:04,991 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:18:04,992 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:18:04,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2022-02-20 19:18:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 2565. [2022-02-20 19:18:05,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:18:05,039 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:18:05,045 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:18:05,052 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:18:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:18:05,246 INFO L93 Difference]: Finished difference Result 2705 states and 4852 transitions. [2022-02-20 19:18:05,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 4852 transitions. [2022-02-20 19:18:05,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:18:05,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:18:05,255 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:18:05,258 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:18:05,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:18:05,452 INFO L93 Difference]: Finished difference Result 2705 states and 4852 transitions. [2022-02-20 19:18:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 4852 transitions. [2022-02-20 19:18:05,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:18:05,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:18:05,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:18:05,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:18:05,460 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:18:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 4625 transitions. [2022-02-20 19:18:05,651 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 4625 transitions. Word has length 80 [2022-02-20 19:18:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:18:05,651 INFO L470 AbstractCegarLoop]: Abstraction has 2565 states and 4625 transitions. [2022-02-20 19:18:05,652 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:18:05,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 4625 transitions. [2022-02-20 19:18:05,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 19:18:05,654 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:18:05,654 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:18:05,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:18:05,654 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:18:05,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:18:05,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1887529175, now seen corresponding path program 1 times [2022-02-20 19:18:05,655 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:18:05,655 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805318884] [2022-02-20 19:18:05,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:18:05,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:18:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:05,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:18:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:05,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {26579#true} assume true; {26579#true} is VALID [2022-02-20 19:18:05,702 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:18:05,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:18:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:05,755 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:18:05,755 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:18:05,756 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:18:05,756 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:18:05,757 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:18:05,757 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:18:05,757 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:18:05,758 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:18:05,758 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:18:05,759 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:18:05,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:18:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:05,777 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:18:05,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {26579#true} assume 1 == ~m_pc~0; {26579#true} is VALID [2022-02-20 19:18:05,777 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:18:05,778 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:18:05,778 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:18:05,778 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:18:05,778 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:18:05,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {26579#true} assume !(1 == ~t1_pc~0); {26579#true} is VALID [2022-02-20 19:18:05,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {26579#true} is_transmit1_triggered_~__retres1~1#1 := 0; {26579#true} is VALID [2022-02-20 19:18:05,778 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:18:05,779 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:18:05,779 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:18:05,779 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:18:05,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {26579#true} assume 1 == ~t2_pc~0; {26579#true} is VALID [2022-02-20 19:18:05,779 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:18:05,779 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:18:05,780 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:18:05,780 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:18:05,780 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:18:05,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {26579#true} assume 1 == ~t3_pc~0; {26579#true} is VALID [2022-02-20 19:18:05,780 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:18:05,780 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:18:05,780 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:18:05,781 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:18:05,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {26579#true} assume true; {26579#true} is VALID [2022-02-20 19:18:05,781 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {26579#true} {26580#false} #10725#return; {26580#false} is VALID [2022-02-20 19:18:05,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:18:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:05,787 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:18:05,787 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:18:05,787 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:18:05,787 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:18:05,787 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:18:05,788 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:18:05,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {26579#true} assume !(1 == ~E_2~0); {26579#true} is VALID [2022-02-20 19:18:05,788 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:18:05,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {26579#true} assume true; {26579#true} is VALID [2022-02-20 19:18:05,788 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {26579#true} {26580#false} #10727#return; {26580#false} is VALID [2022-02-20 19:18:05,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:18:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:05,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {26579#true} havoc ~__retres1~4; {26579#true} is VALID [2022-02-20 19:18:05,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {26579#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {26579#true} is VALID [2022-02-20 19:18:05,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {26579#true} #res := ~__retres1~4; {26579#true} is VALID [2022-02-20 19:18:05,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {26579#true} assume true; {26579#true} is VALID [2022-02-20 19:18:05,792 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {26579#true} {26580#false} #10729#return; {26580#false} is VALID [2022-02-20 19:18:05,793 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:18:05,793 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:18:05,794 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:18:05,794 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:18:05,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {26581#(= ~T2_E~0 ~M_E~0)} call update_channels(); {26579#true} is VALID [2022-02-20 19:18:05,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {26579#true} assume true; {26579#true} is VALID [2022-02-20 19:18:05,795 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:18:05,795 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:18:05,795 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:18:05,796 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:18:05,796 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:18:05,796 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:18:05,797 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:18:05,797 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:18:05,798 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:18:05,798 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:18:05,798 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:18:05,799 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:18:05,799 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:18:05,799 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:18:05,800 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:18:05,800 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:18:05,800 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:18:05,801 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:18:05,801 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:18:05,801 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:18:05,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {26579#true} assume 1 == ~m_pc~0; {26579#true} is VALID [2022-02-20 19:18:05,801 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:18:05,802 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:18:05,802 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:18:05,802 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:18:05,802 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:18:05,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {26579#true} assume !(1 == ~t1_pc~0); {26579#true} is VALID [2022-02-20 19:18:05,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {26579#true} is_transmit1_triggered_~__retres1~1#1 := 0; {26579#true} is VALID [2022-02-20 19:18:05,803 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:18:05,803 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:18:05,803 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:18:05,803 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:18:05,804 INFO L290 TraceCheckUtils]: 38: Hoare triple {26579#true} assume 1 == ~t2_pc~0; {26579#true} is VALID [2022-02-20 19:18:05,804 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:18:05,804 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:18:05,804 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:18:05,804 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:18:05,804 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:18:05,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {26579#true} assume 1 == ~t3_pc~0; {26579#true} is VALID [2022-02-20 19:18:05,805 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:18:05,805 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:18:05,805 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:18:05,805 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:18:05,805 INFO L290 TraceCheckUtils]: 49: Hoare triple {26579#true} assume true; {26579#true} is VALID [2022-02-20 19:18:05,806 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26579#true} {26580#false} #10725#return; {26580#false} is VALID [2022-02-20 19:18:05,807 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:18:05,807 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:18:05,810 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:18:05,811 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:18:05,811 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:18:05,811 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:18:05,811 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:18:05,811 INFO L290 TraceCheckUtils]: 58: Hoare triple {26579#true} assume !(1 == ~E_2~0); {26579#true} is VALID [2022-02-20 19:18:05,811 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:18:05,811 INFO L290 TraceCheckUtils]: 60: Hoare triple {26579#true} assume true; {26579#true} is VALID [2022-02-20 19:18:05,812 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {26579#true} {26580#false} #10727#return; {26580#false} is VALID [2022-02-20 19:18:05,812 INFO L290 TraceCheckUtils]: 62: Hoare triple {26580#false} assume !false; {26580#false} is VALID [2022-02-20 19:18:05,812 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:18:05,812 INFO L290 TraceCheckUtils]: 64: Hoare triple {26580#false} assume !false; {26580#false} is VALID [2022-02-20 19:18:05,812 INFO L272 TraceCheckUtils]: 65: Hoare triple {26580#false} call eval_#t~ret29#1 := exists_runnable_thread(); {26579#true} is VALID [2022-02-20 19:18:05,812 INFO L290 TraceCheckUtils]: 66: Hoare triple {26579#true} havoc ~__retres1~4; {26579#true} is VALID [2022-02-20 19:18:05,812 INFO L290 TraceCheckUtils]: 67: Hoare triple {26579#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {26579#true} is VALID [2022-02-20 19:18:05,812 INFO L290 TraceCheckUtils]: 68: Hoare triple {26579#true} #res := ~__retres1~4; {26579#true} is VALID [2022-02-20 19:18:05,813 INFO L290 TraceCheckUtils]: 69: Hoare triple {26579#true} assume true; {26579#true} is VALID [2022-02-20 19:18:05,813 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {26579#true} {26580#false} #10729#return; {26580#false} is VALID [2022-02-20 19:18:05,813 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:18:05,813 INFO L290 TraceCheckUtils]: 72: Hoare triple {26580#false} assume 0 != eval_~tmp~0#1; {26580#false} is VALID [2022-02-20 19:18:05,813 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:18:05,814 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:18:05,814 INFO L290 TraceCheckUtils]: 75: Hoare triple {26580#false} assume !(0 == ~m_pc~0); {26580#false} is VALID [2022-02-20 19:18:05,814 INFO L290 TraceCheckUtils]: 76: Hoare triple {26580#false} assume 1 == ~m_pc~0; {26580#false} is VALID [2022-02-20 19:18:05,815 INFO L290 TraceCheckUtils]: 77: Hoare triple {26580#false} assume ~token~0 != 3 + ~local~0; {26580#false} is VALID [2022-02-20 19:18:05,815 INFO L272 TraceCheckUtils]: 78: Hoare triple {26580#false} call error(); {26580#false} is VALID [2022-02-20 19:18:05,815 INFO L290 TraceCheckUtils]: 79: Hoare triple {26580#false} assume !false; {26580#false} is VALID [2022-02-20 19:18:05,815 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:18:05,816 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:18:05,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805318884] [2022-02-20 19:18:05,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805318884] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:18:05,817 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:18:05,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:18:05,817 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839828432] [2022-02-20 19:18:05,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:18:05,818 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:18:05,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:18:05,819 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:18:05,862 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:18:05,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:18:05,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:18:05,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:18:05,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:18:05,863 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:18:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:18:16,943 INFO L93 Difference]: Finished difference Result 3497 states and 6053 transitions. [2022-02-20 19:18:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:18:16,943 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:18:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:18:16,943 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:18:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4796 transitions. [2022-02-20 19:18:16,965 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:18:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4796 transitions. [2022-02-20 19:18:16,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4796 transitions. [2022-02-20 19:18:20,022 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:18:20,311 INFO L225 Difference]: With dead ends: 3497 [2022-02-20 19:18:20,311 INFO L226 Difference]: Without dead ends: 3064 [2022-02-20 19:18:20,312 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:18:20,313 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:18:20,313 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:18:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3064 states. [2022-02-20 19:18:20,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3064 to 2842. [2022-02-20 19:18:20,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:18:20,363 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:18:20,367 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:18:20,371 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:18:20,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:18:20,605 INFO L93 Difference]: Finished difference Result 3064 states and 5397 transitions. [2022-02-20 19:18:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 5397 transitions. [2022-02-20 19:18:20,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:18:20,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:18:20,615 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:18:20,619 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. [2022-02-20 19:18:20,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:18:20,852 INFO L93 Difference]: Finished difference Result 3064 states and 5397 transitions. [2022-02-20 19:18:20,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 5397 transitions. [2022-02-20 19:18:20,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:18:20,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:18:20,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:18:20,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:18:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. 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:18:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2842 states and 5040 transitions. [2022-02-20 19:18:21,106 INFO L78 Accepts]: Start accepts. Automaton has 2842 states and 5040 transitions. Word has length 80 [2022-02-20 19:18:21,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:18:21,107 INFO L470 AbstractCegarLoop]: Abstraction has 2842 states and 5040 transitions. [2022-02-20 19:18:21,107 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:18:21,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2842 states and 5040 transitions. [2022-02-20 19:18:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 19:18:21,109 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:18:21,110 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:18:21,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:18:21,110 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:18:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:18:21,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1833136277, now seen corresponding path program 1 times [2022-02-20 19:18:21,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:18:21,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589287058] [2022-02-20 19:18:21,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:18:21,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:18:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:21,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:18:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:21,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {39776#true} assume true; {39776#true} is VALID [2022-02-20 19:18:21,166 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {39776#true} {39778#(= ~T3_E~0 ~M_E~0)} #10721#return; {39778#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:21,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:18:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:21,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {39832#(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); {39833#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:18:21,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {39833#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~T1_E~0); {39833#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:18:21,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {39833#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~T2_E~0); {39833#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:18:21,192 INFO L290 TraceCheckUtils]: 3: Hoare triple {39833#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:21,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:21,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:21,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:21,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:21,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume true; {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:21,194 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} {39778#(= ~T3_E~0 ~M_E~0)} #10723#return; {39777#false} is VALID [2022-02-20 19:18:21,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:18:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:21,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {39835#(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; {39776#true} is VALID [2022-02-20 19:18:21,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {39776#true} assume 1 == ~m_pc~0; {39776#true} is VALID [2022-02-20 19:18:21,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {39776#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {39776#true} is VALID [2022-02-20 19:18:21,218 INFO L290 TraceCheckUtils]: 3: Hoare triple {39776#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {39776#true} is VALID [2022-02-20 19:18:21,218 INFO L290 TraceCheckUtils]: 4: Hoare triple {39776#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; {39776#true} is VALID [2022-02-20 19:18:21,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {39776#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {39776#true} is VALID [2022-02-20 19:18:21,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {39776#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; {39776#true} is VALID [2022-02-20 19:18:21,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {39776#true} assume !(1 == ~t1_pc~0); {39776#true} is VALID [2022-02-20 19:18:21,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {39776#true} is_transmit1_triggered_~__retres1~1#1 := 0; {39776#true} is VALID [2022-02-20 19:18:21,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {39776#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {39776#true} is VALID [2022-02-20 19:18:21,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {39776#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; {39776#true} is VALID [2022-02-20 19:18:21,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {39776#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {39776#true} is VALID [2022-02-20 19:18:21,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {39776#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; {39776#true} is VALID [2022-02-20 19:18:21,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {39776#true} assume 1 == ~t2_pc~0; {39776#true} is VALID [2022-02-20 19:18:21,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {39776#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {39776#true} is VALID [2022-02-20 19:18:21,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {39776#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {39776#true} is VALID [2022-02-20 19:18:21,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {39776#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; {39776#true} is VALID [2022-02-20 19:18:21,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {39776#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {39776#true} is VALID [2022-02-20 19:18:21,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {39776#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; {39776#true} is VALID [2022-02-20 19:18:21,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {39776#true} assume 1 == ~t3_pc~0; {39776#true} is VALID [2022-02-20 19:18:21,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {39776#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {39776#true} is VALID [2022-02-20 19:18:21,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {39776#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {39776#true} is VALID [2022-02-20 19:18:21,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {39776#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; {39776#true} is VALID [2022-02-20 19:18:21,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {39776#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {39776#true} is VALID [2022-02-20 19:18:21,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {39776#true} assume true; {39776#true} is VALID [2022-02-20 19:18:21,220 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {39776#true} {39777#false} #10725#return; {39777#false} is VALID [2022-02-20 19:18:21,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:18:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:21,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {39832#(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); {39776#true} is VALID [2022-02-20 19:18:21,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {39776#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {39776#true} is VALID [2022-02-20 19:18:21,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {39776#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {39776#true} is VALID [2022-02-20 19:18:21,230 INFO L290 TraceCheckUtils]: 3: Hoare triple {39776#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {39776#true} is VALID [2022-02-20 19:18:21,230 INFO L290 TraceCheckUtils]: 4: Hoare triple {39776#true} assume 1 == ~E_M~0;~E_M~0 := 2; {39776#true} is VALID [2022-02-20 19:18:21,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {39776#true} assume 1 == ~E_1~0;~E_1~0 := 2; {39776#true} is VALID [2022-02-20 19:18:21,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {39776#true} assume !(1 == ~E_2~0); {39776#true} is VALID [2022-02-20 19:18:21,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {39776#true} assume 1 == ~E_3~0;~E_3~0 := 2; {39776#true} is VALID [2022-02-20 19:18:21,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {39776#true} assume true; {39776#true} is VALID [2022-02-20 19:18:21,230 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {39776#true} {39777#false} #10727#return; {39777#false} is VALID [2022-02-20 19:18:21,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:18:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:21,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {39776#true} havoc ~__retres1~4; {39776#true} is VALID [2022-02-20 19:18:21,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {39776#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {39776#true} is VALID [2022-02-20 19:18:21,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {39776#true} #res := ~__retres1~4; {39776#true} is VALID [2022-02-20 19:18:21,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {39776#true} assume true; {39776#true} is VALID [2022-02-20 19:18:21,235 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {39776#true} {39777#false} #10729#return; {39777#false} is VALID [2022-02-20 19:18:21,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {39776#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; {39778#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:21,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {39778#(= ~T3_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; {39778#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:21,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {39778#(= ~T3_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; {39778#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:21,236 INFO L290 TraceCheckUtils]: 3: Hoare triple {39778#(= ~T3_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; {39778#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:21,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {39778#(= ~T3_E~0 ~M_E~0)} call update_channels(); {39776#true} is VALID [2022-02-20 19:18:21,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {39776#true} assume true; {39776#true} is VALID [2022-02-20 19:18:21,237 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {39776#true} {39778#(= ~T3_E~0 ~M_E~0)} #10721#return; {39778#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:21,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {39778#(= ~T3_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {39778#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:21,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {39778#(= ~T3_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {39778#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:21,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {39778#(= ~T3_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {39778#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:21,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {39778#(= ~T3_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {39778#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:21,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {39778#(= ~T3_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {39778#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:21,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {39778#(= ~T3_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {39778#(= ~T3_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:21,239 INFO L272 TraceCheckUtils]: 13: Hoare triple {39778#(= ~T3_E~0 ~M_E~0)} call fire_delta_events(); {39832#(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:18:21,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {39832#(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); {39833#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:18:21,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {39833#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~T1_E~0); {39833#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:18:21,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {39833#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~T2_E~0); {39833#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:18:21,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {39833#(and (not (= |old(~M_E~0)| 0)) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:21,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:21,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:21,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_2~0); {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:21,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:21,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} assume true; {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:21,242 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {39834#(not (= |old(~T3_E~0)| |old(~M_E~0)|))} {39778#(= ~T3_E~0 ~M_E~0)} #10723#return; {39777#false} is VALID [2022-02-20 19:18:21,242 INFO L272 TraceCheckUtils]: 24: Hoare triple {39777#false} call activate_threads(); {39835#(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:18:21,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {39835#(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; {39776#true} is VALID [2022-02-20 19:18:21,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {39776#true} assume 1 == ~m_pc~0; {39776#true} is VALID [2022-02-20 19:18:21,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {39776#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {39776#true} is VALID [2022-02-20 19:18:21,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {39776#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {39776#true} is VALID [2022-02-20 19:18:21,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {39776#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; {39776#true} is VALID [2022-02-20 19:18:21,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {39776#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {39776#true} is VALID [2022-02-20 19:18:21,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {39776#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; {39776#true} is VALID [2022-02-20 19:18:21,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {39776#true} assume !(1 == ~t1_pc~0); {39776#true} is VALID [2022-02-20 19:18:21,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {39776#true} is_transmit1_triggered_~__retres1~1#1 := 0; {39776#true} is VALID [2022-02-20 19:18:21,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {39776#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {39776#true} is VALID [2022-02-20 19:18:21,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {39776#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; {39776#true} is VALID [2022-02-20 19:18:21,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {39776#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {39776#true} is VALID [2022-02-20 19:18:21,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {39776#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; {39776#true} is VALID [2022-02-20 19:18:21,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {39776#true} assume 1 == ~t2_pc~0; {39776#true} is VALID [2022-02-20 19:18:21,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {39776#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {39776#true} is VALID [2022-02-20 19:18:21,245 INFO L290 TraceCheckUtils]: 40: Hoare triple {39776#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {39776#true} is VALID [2022-02-20 19:18:21,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {39776#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; {39776#true} is VALID [2022-02-20 19:18:21,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {39776#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {39776#true} is VALID [2022-02-20 19:18:21,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {39776#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; {39776#true} is VALID [2022-02-20 19:18:21,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {39776#true} assume 1 == ~t3_pc~0; {39776#true} is VALID [2022-02-20 19:18:21,245 INFO L290 TraceCheckUtils]: 45: Hoare triple {39776#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3#1 := 1; {39776#true} is VALID [2022-02-20 19:18:21,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {39776#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~3#1; {39776#true} is VALID [2022-02-20 19:18:21,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {39776#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; {39776#true} is VALID [2022-02-20 19:18:21,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {39776#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {39776#true} is VALID [2022-02-20 19:18:21,246 INFO L290 TraceCheckUtils]: 49: Hoare triple {39776#true} assume true; {39776#true} is VALID [2022-02-20 19:18:21,246 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {39776#true} {39777#false} #10725#return; {39777#false} is VALID [2022-02-20 19:18:21,246 INFO L272 TraceCheckUtils]: 51: Hoare triple {39777#false} call reset_delta_events(); {39832#(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:18:21,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {39832#(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); {39776#true} is VALID [2022-02-20 19:18:21,246 INFO L290 TraceCheckUtils]: 53: Hoare triple {39776#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {39776#true} is VALID [2022-02-20 19:18:21,246 INFO L290 TraceCheckUtils]: 54: Hoare triple {39776#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {39776#true} is VALID [2022-02-20 19:18:21,246 INFO L290 TraceCheckUtils]: 55: Hoare triple {39776#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {39776#true} is VALID [2022-02-20 19:18:21,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {39776#true} assume 1 == ~E_M~0;~E_M~0 := 2; {39776#true} is VALID [2022-02-20 19:18:21,247 INFO L290 TraceCheckUtils]: 57: Hoare triple {39776#true} assume 1 == ~E_1~0;~E_1~0 := 2; {39776#true} is VALID [2022-02-20 19:18:21,247 INFO L290 TraceCheckUtils]: 58: Hoare triple {39776#true} assume !(1 == ~E_2~0); {39776#true} is VALID [2022-02-20 19:18:21,247 INFO L290 TraceCheckUtils]: 59: Hoare triple {39776#true} assume 1 == ~E_3~0;~E_3~0 := 2; {39776#true} is VALID [2022-02-20 19:18:21,247 INFO L290 TraceCheckUtils]: 60: Hoare triple {39776#true} assume true; {39776#true} is VALID [2022-02-20 19:18:21,247 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {39776#true} {39777#false} #10727#return; {39777#false} is VALID [2022-02-20 19:18:21,247 INFO L290 TraceCheckUtils]: 62: Hoare triple {39777#false} assume !false; {39777#false} is VALID [2022-02-20 19:18:21,247 INFO L290 TraceCheckUtils]: 63: Hoare triple {39777#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; {39777#false} is VALID [2022-02-20 19:18:21,248 INFO L290 TraceCheckUtils]: 64: Hoare triple {39777#false} assume !false; {39777#false} is VALID [2022-02-20 19:18:21,248 INFO L272 TraceCheckUtils]: 65: Hoare triple {39777#false} call eval_#t~ret29#1 := exists_runnable_thread(); {39776#true} is VALID [2022-02-20 19:18:21,248 INFO L290 TraceCheckUtils]: 66: Hoare triple {39776#true} havoc ~__retres1~4; {39776#true} is VALID [2022-02-20 19:18:21,248 INFO L290 TraceCheckUtils]: 67: Hoare triple {39776#true} assume 0 == ~m_st~0;~__retres1~4 := 1; {39776#true} is VALID [2022-02-20 19:18:21,248 INFO L290 TraceCheckUtils]: 68: Hoare triple {39776#true} #res := ~__retres1~4; {39776#true} is VALID [2022-02-20 19:18:21,248 INFO L290 TraceCheckUtils]: 69: Hoare triple {39776#true} assume true; {39776#true} is VALID [2022-02-20 19:18:21,248 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {39776#true} {39777#false} #10729#return; {39777#false} is VALID [2022-02-20 19:18:21,248 INFO L290 TraceCheckUtils]: 71: Hoare triple {39777#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; {39777#false} is VALID [2022-02-20 19:18:21,249 INFO L290 TraceCheckUtils]: 72: Hoare triple {39777#false} assume 0 != eval_~tmp~0#1; {39777#false} is VALID [2022-02-20 19:18:21,249 INFO L290 TraceCheckUtils]: 73: Hoare triple {39777#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; {39777#false} is VALID [2022-02-20 19:18:21,249 INFO L290 TraceCheckUtils]: 74: Hoare triple {39777#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; {39777#false} is VALID [2022-02-20 19:18:21,249 INFO L290 TraceCheckUtils]: 75: Hoare triple {39777#false} assume !(0 == ~m_pc~0); {39777#false} is VALID [2022-02-20 19:18:21,249 INFO L290 TraceCheckUtils]: 76: Hoare triple {39777#false} assume 1 == ~m_pc~0; {39777#false} is VALID [2022-02-20 19:18:21,249 INFO L290 TraceCheckUtils]: 77: Hoare triple {39777#false} assume ~token~0 != 3 + ~local~0; {39777#false} is VALID [2022-02-20 19:18:21,249 INFO L272 TraceCheckUtils]: 78: Hoare triple {39777#false} call error(); {39777#false} is VALID [2022-02-20 19:18:21,249 INFO L290 TraceCheckUtils]: 79: Hoare triple {39777#false} assume !false; {39777#false} is VALID [2022-02-20 19:18:21,250 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:18:21,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:18:21,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589287058] [2022-02-20 19:18:21,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589287058] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:18:21,250 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:18:21,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:18:21,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230490091] [2022-02-20 19:18:21,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:18:21,251 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:18:21,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:18:21,252 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:18:21,292 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:18:21,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:18:21,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:18:21,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:18:21,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:18:21,293 INFO L87 Difference]: Start difference. First operand 2842 states and 5040 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)