./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label48+token_ring.01.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_label48+token_ring.01.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 6941c7d3ef4d558b74ee046fd360886b73543cf91a81ce942b4cc5fbf2c1713a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:25:29,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:25:29,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:25:30,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:25:30,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:25:30,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:25:30,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:25:30,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:25:30,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:25:30,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:25:30,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:25:30,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:25:30,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:25:30,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:25:30,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:25:30,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:25:30,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:25:30,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:25:30,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:25:30,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:25:30,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:25:30,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:25:30,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:25:30,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:25:30,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:25:30,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:25:30,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:25:30,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:25:30,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:25:30,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:25:30,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:25:30,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:25:30,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:25:30,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:25:30,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:25:30,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:25:30,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:25:30,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:25:30,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:25:30,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:25:30,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:25:30,048 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:25:30,067 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:25:30,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:25:30,067 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:25:30,067 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:25:30,068 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:25:30,068 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:25:30,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:25:30,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:25:30,068 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:25:30,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:25:30,069 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:25:30,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:25:30,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:25:30,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:25:30,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:25:30,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:25:30,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:25:30,070 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:25:30,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:25:30,070 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:25:30,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:25:30,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:25:30,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:25:30,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:25:30,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:25:30,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:25:30,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:25:30,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:25:30,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:25:30,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:25:30,071 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:25:30,072 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:25:30,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:25:30,072 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 -> 6941c7d3ef4d558b74ee046fd360886b73543cf91a81ce942b4cc5fbf2c1713a [2022-02-20 19:25:30,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:25:30,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:25:30,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:25:30,281 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:25:30,281 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:25:30,282 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label48+token_ring.01.cil-1.c [2022-02-20 19:25:30,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eaab5a2a/fe6be2a52b0049d1969f1ff4bb5038cf/FLAG12004840e [2022-02-20 19:25:30,991 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:25:30,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.01.cil-1.c [2022-02-20 19:25:31,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eaab5a2a/fe6be2a52b0049d1969f1ff4bb5038cf/FLAG12004840e [2022-02-20 19:25:31,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eaab5a2a/fe6be2a52b0049d1969f1ff4bb5038cf [2022-02-20 19:25:31,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:25:31,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:25:31,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:25:31,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:25:31,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:25:31,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:25:31" (1/1) ... [2022-02-20 19:25:31,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4956225c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:31, skipping insertion in model container [2022-02-20 19:25:31,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:25:31" (1/1) ... [2022-02-20 19:25:31,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:25:31,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:25:32,463 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_label48+token_ring.01.cil-1.c[375709,375722] [2022-02-20 19:25:32,493 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_label48+token_ring.01.cil-1.c[383339,383352] [2022-02-20 19:25:32,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:25:32,604 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:25:33,214 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_label48+token_ring.01.cil-1.c[375709,375722] [2022-02-20 19:25:33,222 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_label48+token_ring.01.cil-1.c[383339,383352] [2022-02-20 19:25:33,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:25:33,285 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:25:33,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:33 WrapperNode [2022-02-20 19:25:33,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:25:33,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:25:33,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:25:33,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:25:33,291 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:25:33" (1/1) ... [2022-02-20 19:25:33,357 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:25:33" (1/1) ... [2022-02-20 19:25:33,805 INFO L137 Inliner]: procedures = 46, calls = 44, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 12561 [2022-02-20 19:25:33,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:25:33,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:25:33,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:25:33,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:25:33,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:33" (1/1) ... [2022-02-20 19:25:33,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:33" (1/1) ... [2022-02-20 19:25:33,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:33" (1/1) ... [2022-02-20 19:25:33,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:33" (1/1) ... [2022-02-20 19:25:34,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:33" (1/1) ... [2022-02-20 19:25:34,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:33" (1/1) ... [2022-02-20 19:25:34,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:33" (1/1) ... [2022-02-20 19:25:34,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:25:34,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:25:34,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:25:34,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:25:34,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:33" (1/1) ... [2022-02-20 19:25:34,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:25:34,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:25:34,151 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:25:34,153 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:25:34,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:25:34,176 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-02-20 19:25:34,176 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-02-20 19:25:34,176 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-02-20 19:25:34,177 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-02-20 19:25:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:25:34,177 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:25:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-02-20 19:25:34,177 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-02-20 19:25:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-02-20 19:25:34,177 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-02-20 19:25:34,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:25:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-02-20 19:25:34,178 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-02-20 19:25:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:25:34,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:25:34,265 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:25:34,266 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:25:39,228 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:25:39,249 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:25:39,249 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 19:25:39,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:25:39 BoogieIcfgContainer [2022-02-20 19:25:39,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:25:39,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:25:39,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:25:39,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:25:39,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:25:31" (1/3) ... [2022-02-20 19:25:39,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e84b5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:25:39, skipping insertion in model container [2022-02-20 19:25:39,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:33" (2/3) ... [2022-02-20 19:25:39,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e84b5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:25:39, skipping insertion in model container [2022-02-20 19:25:39,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:25:39" (3/3) ... [2022-02-20 19:25:39,259 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label48+token_ring.01.cil-1.c [2022-02-20 19:25:39,263 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:25:39,263 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:25:39,310 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:25:39,316 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:25:39,316 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:25:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 2290 states, 2266 states have (on average 1.8587819947043247) internal successors, (4212), 2269 states have internal predecessors, (4212), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 19:25:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:25:39,365 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:25:39,365 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] [2022-02-20 19:25:39,366 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:25:39,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:25:39,369 INFO L85 PathProgramCache]: Analyzing trace with hash -36301034, now seen corresponding path program 1 times [2022-02-20 19:25:39,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:25:39,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611684568] [2022-02-20 19:25:39,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:25:39,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:25:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:39,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:25:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:39,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {2293#true} assume true; {2293#true} is VALID [2022-02-20 19:25:39,555 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {2293#true} {2295#(= ~M_E~0 2)} #10468#return; {2295#(= ~M_E~0 2)} is VALID [2022-02-20 19:25:39,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:25:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:39,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {2329#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {2330#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:25:39,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {2330#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2330#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:25:39,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {2330#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {2330#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:25:39,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {2330#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {2330#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:25:39,586 INFO L290 TraceCheckUtils]: 4: Hoare triple {2330#(= |old(~M_E~0)| 0)} assume true; {2330#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:25:39,586 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2330#(= |old(~M_E~0)| 0)} {2295#(= ~M_E~0 2)} #10470#return; {2294#false} is VALID [2022-02-20 19:25:39,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:25:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:39,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {2331#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~1#1;havoc ~tmp___0~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; {2293#true} is VALID [2022-02-20 19:25:39,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {2293#true} assume 1 == ~m_pc~0; {2293#true} is VALID [2022-02-20 19:25:39,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {2293#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {2293#true} is VALID [2022-02-20 19:25:39,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {2293#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2293#true} is VALID [2022-02-20 19:25:39,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {2293#true} #t~ret31#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp~1#1 := #t~ret31#1;havoc #t~ret31#1; {2293#true} is VALID [2022-02-20 19:25:39,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {2293#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2293#true} is VALID [2022-02-20 19:25:39,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {2293#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; {2293#true} is VALID [2022-02-20 19:25:39,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {2293#true} assume !(1 == ~t1_pc~0); {2293#true} is VALID [2022-02-20 19:25:39,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {2293#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2293#true} is VALID [2022-02-20 19:25:39,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {2293#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2293#true} is VALID [2022-02-20 19:25:39,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {2293#true} #t~ret32#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___0~0#1 := #t~ret32#1;havoc #t~ret32#1; {2293#true} is VALID [2022-02-20 19:25:39,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {2293#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2293#true} is VALID [2022-02-20 19:25:39,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {2293#true} assume true; {2293#true} is VALID [2022-02-20 19:25:39,618 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2293#true} {2294#false} #10472#return; {2294#false} is VALID [2022-02-20 19:25:39,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:25:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:39,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {2329#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {2293#true} is VALID [2022-02-20 19:25:39,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {2293#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2293#true} is VALID [2022-02-20 19:25:39,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {2293#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2293#true} is VALID [2022-02-20 19:25:39,634 INFO L290 TraceCheckUtils]: 3: Hoare triple {2293#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2293#true} is VALID [2022-02-20 19:25:39,634 INFO L290 TraceCheckUtils]: 4: Hoare triple {2293#true} assume true; {2293#true} is VALID [2022-02-20 19:25:39,635 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2293#true} {2294#false} #10474#return; {2294#false} is VALID [2022-02-20 19:25:39,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:25:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:39,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {2293#true} havoc ~__retres1~2; {2293#true} is VALID [2022-02-20 19:25:39,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {2293#true} assume 0 == ~m_st~0;~__retres1~2 := 1; {2293#true} is VALID [2022-02-20 19:25:39,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {2293#true} #res := ~__retres1~2; {2293#true} is VALID [2022-02-20 19:25:39,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {2293#true} assume true; {2293#true} is VALID [2022-02-20 19:25:39,640 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2293#true} {2294#false} #10476#return; {2294#false} is VALID [2022-02-20 19:25:39,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {2293#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {2295#(= ~M_E~0 2)} is VALID [2022-02-20 19:25:39,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {2295#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {2295#(= ~M_E~0 2)} is VALID [2022-02-20 19:25:39,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {2295#(= ~M_E~0 2)} assume !(0 != main_#t~nondet36#1);havoc main_#t~nondet36#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~3#1;havoc main2_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; {2295#(= ~M_E~0 2)} is VALID [2022-02-20 19:25:39,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {2295#(= ~M_E~0 2)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret34#1, start_simulation_#t~ret35#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; {2295#(= ~M_E~0 2)} is VALID [2022-02-20 19:25:39,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {2295#(= ~M_E~0 2)} call update_channels(); {2293#true} is VALID [2022-02-20 19:25:39,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {2293#true} assume true; {2293#true} is VALID [2022-02-20 19:25:39,643 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2293#true} {2295#(= ~M_E~0 2)} #10468#return; {2295#(= ~M_E~0 2)} is VALID [2022-02-20 19:25:39,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {2295#(= ~M_E~0 2)} assume { :begin_inline_init_threads } true; {2295#(= ~M_E~0 2)} is VALID [2022-02-20 19:25:39,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {2295#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {2295#(= ~M_E~0 2)} is VALID [2022-02-20 19:25:39,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {2295#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {2295#(= ~M_E~0 2)} is VALID [2022-02-20 19:25:39,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {2295#(= ~M_E~0 2)} assume { :end_inline_init_threads } true; {2295#(= ~M_E~0 2)} is VALID [2022-02-20 19:25:39,646 INFO L272 TraceCheckUtils]: 11: Hoare triple {2295#(= ~M_E~0 2)} call fire_delta_events(); {2329#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:25:39,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {2329#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {2330#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:25:39,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {2330#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2330#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:25:39,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {2330#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {2330#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:25:39,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {2330#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {2330#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:25:39,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {2330#(= |old(~M_E~0)| 0)} assume true; {2330#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:25:39,648 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2330#(= |old(~M_E~0)| 0)} {2295#(= ~M_E~0 2)} #10470#return; {2294#false} is VALID [2022-02-20 19:25:39,648 INFO L272 TraceCheckUtils]: 18: Hoare triple {2294#false} call activate_threads(); {2331#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:25:39,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {2331#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~1#1;havoc ~tmp___0~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; {2293#true} is VALID [2022-02-20 19:25:39,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {2293#true} assume 1 == ~m_pc~0; {2293#true} is VALID [2022-02-20 19:25:39,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {2293#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {2293#true} is VALID [2022-02-20 19:25:39,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {2293#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2293#true} is VALID [2022-02-20 19:25:39,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {2293#true} #t~ret31#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp~1#1 := #t~ret31#1;havoc #t~ret31#1; {2293#true} is VALID [2022-02-20 19:25:39,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {2293#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2293#true} is VALID [2022-02-20 19:25:39,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {2293#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; {2293#true} is VALID [2022-02-20 19:25:39,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {2293#true} assume !(1 == ~t1_pc~0); {2293#true} is VALID [2022-02-20 19:25:39,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {2293#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2293#true} is VALID [2022-02-20 19:25:39,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {2293#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2293#true} is VALID [2022-02-20 19:25:39,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {2293#true} #t~ret32#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___0~0#1 := #t~ret32#1;havoc #t~ret32#1; {2293#true} is VALID [2022-02-20 19:25:39,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {2293#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2293#true} is VALID [2022-02-20 19:25:39,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {2293#true} assume true; {2293#true} is VALID [2022-02-20 19:25:39,651 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2293#true} {2294#false} #10472#return; {2294#false} is VALID [2022-02-20 19:25:39,651 INFO L272 TraceCheckUtils]: 33: Hoare triple {2294#false} call reset_delta_events(); {2329#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:25:39,651 INFO L290 TraceCheckUtils]: 34: Hoare triple {2329#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {2293#true} is VALID [2022-02-20 19:25:39,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {2293#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2293#true} is VALID [2022-02-20 19:25:39,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {2293#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2293#true} is VALID [2022-02-20 19:25:39,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {2293#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2293#true} is VALID [2022-02-20 19:25:39,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {2293#true} assume true; {2293#true} is VALID [2022-02-20 19:25:39,652 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2293#true} {2294#false} #10474#return; {2294#false} is VALID [2022-02-20 19:25:39,653 INFO L290 TraceCheckUtils]: 40: Hoare triple {2294#false} assume !false; {2294#false} is VALID [2022-02-20 19:25:39,653 INFO L290 TraceCheckUtils]: 41: Hoare triple {2294#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {2294#false} is VALID [2022-02-20 19:25:39,653 INFO L290 TraceCheckUtils]: 42: Hoare triple {2294#false} assume !false; {2294#false} is VALID [2022-02-20 19:25:39,653 INFO L272 TraceCheckUtils]: 43: Hoare triple {2294#false} call eval_#t~ret28#1 := exists_runnable_thread(); {2293#true} is VALID [2022-02-20 19:25:39,653 INFO L290 TraceCheckUtils]: 44: Hoare triple {2293#true} havoc ~__retres1~2; {2293#true} is VALID [2022-02-20 19:25:39,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {2293#true} assume 0 == ~m_st~0;~__retres1~2 := 1; {2293#true} is VALID [2022-02-20 19:25:39,654 INFO L290 TraceCheckUtils]: 46: Hoare triple {2293#true} #res := ~__retres1~2; {2293#true} is VALID [2022-02-20 19:25:39,654 INFO L290 TraceCheckUtils]: 47: Hoare triple {2293#true} assume true; {2293#true} is VALID [2022-02-20 19:25:39,654 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2293#true} {2294#false} #10476#return; {2294#false} is VALID [2022-02-20 19:25:39,654 INFO L290 TraceCheckUtils]: 49: Hoare triple {2294#false} assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; {2294#false} is VALID [2022-02-20 19:25:39,655 INFO L290 TraceCheckUtils]: 50: Hoare triple {2294#false} assume 0 != eval_~tmp~0#1; {2294#false} is VALID [2022-02-20 19:25:39,655 INFO L290 TraceCheckUtils]: 51: Hoare triple {2294#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; {2294#false} is VALID [2022-02-20 19:25:39,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {2294#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {2294#false} is VALID [2022-02-20 19:25:39,655 INFO L290 TraceCheckUtils]: 53: Hoare triple {2294#false} assume !(0 == ~m_pc~0); {2294#false} is VALID [2022-02-20 19:25:39,656 INFO L290 TraceCheckUtils]: 54: Hoare triple {2294#false} assume 1 == ~m_pc~0; {2294#false} is VALID [2022-02-20 19:25:39,656 INFO L290 TraceCheckUtils]: 55: Hoare triple {2294#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error } true; {2294#false} is VALID [2022-02-20 19:25:39,656 INFO L290 TraceCheckUtils]: 56: Hoare triple {2294#false} assume !false; {2294#false} is VALID [2022-02-20 19:25:39,656 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:25:39,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:25:39,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611684568] [2022-02-20 19:25:39,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611684568] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:25:39,658 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:25:39,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:25:39,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912476721] [2022-02-20 19:25:39,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:25:39,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:25:39,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:25:39,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:39,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:25:39,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:25:39,706 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:25:39,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:25:39,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:25:39,727 INFO L87 Difference]: Start difference. First operand has 2290 states, 2266 states have (on average 1.8587819947043247) internal successors, (4212), 2269 states have internal predecessors, (4212), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:25:49,454 INFO L93 Difference]: Finished difference Result 4705 states and 8678 transitions. [2022-02-20 19:25:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:25:49,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:25:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:25:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 8678 transitions. [2022-02-20 19:25:49,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 8678 transitions. [2022-02-20 19:25:49,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 8678 transitions. [2022-02-20 19:25:55,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8678 edges. 8678 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:25:55,487 INFO L225 Difference]: With dead ends: 4705 [2022-02-20 19:25:55,487 INFO L226 Difference]: Without dead ends: 2354 [2022-02-20 19:25:55,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:25:55,495 INFO L933 BasicCegarLoop]: 4187 mSDtfsCounter, 4313 mSDsluCounter, 12342 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4321 SdHoareTripleChecker+Valid, 16529 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:25:55,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4321 Valid, 16529 Invalid, 482 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [72 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:25:55,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2022-02-20 19:25:55,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2313. [2022-02-20 19:25:55,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:25:55,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2354 states. Second operand has 2313 states, 2273 states have (on average 1.8376594808622966) internal successors, (4177), 2276 states have internal predecessors, (4177), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-02-20 19:25:55,582 INFO L74 IsIncluded]: Start isIncluded. First operand 2354 states. Second operand has 2313 states, 2273 states have (on average 1.8376594808622966) internal successors, (4177), 2276 states have internal predecessors, (4177), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-02-20 19:25:55,586 INFO L87 Difference]: Start difference. First operand 2354 states. Second operand has 2313 states, 2273 states have (on average 1.8376594808622966) internal successors, (4177), 2276 states have internal predecessors, (4177), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-02-20 19:25:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:25:55,749 INFO L93 Difference]: Finished difference Result 2354 states and 4292 transitions. [2022-02-20 19:25:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 4292 transitions. [2022-02-20 19:25:55,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:25:55,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:25:55,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2273 states have (on average 1.8376594808622966) internal successors, (4177), 2276 states have internal predecessors, (4177), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) Second operand 2354 states. [2022-02-20 19:25:55,764 INFO L87 Difference]: Start difference. First operand has 2313 states, 2273 states have (on average 1.8376594808622966) internal successors, (4177), 2276 states have internal predecessors, (4177), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) Second operand 2354 states. [2022-02-20 19:25:55,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:25:55,920 INFO L93 Difference]: Finished difference Result 2354 states and 4292 transitions. [2022-02-20 19:25:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 4292 transitions. [2022-02-20 19:25:55,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:25:55,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:25:55,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:25:55,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:25:55,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2273 states have (on average 1.8376594808622966) internal successors, (4177), 2276 states have internal predecessors, (4177), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-02-20 19:25:56,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 4230 transitions. [2022-02-20 19:25:56,094 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 4230 transitions. Word has length 57 [2022-02-20 19:25:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:25:56,094 INFO L470 AbstractCegarLoop]: Abstraction has 2313 states and 4230 transitions. [2022-02-20 19:25:56,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 4230 transitions. [2022-02-20 19:25:56,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:25:56,097 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:25:56,097 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] [2022-02-20 19:25:56,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:25:56,098 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:25:56,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:25:56,100 INFO L85 PathProgramCache]: Analyzing trace with hash -948253030, now seen corresponding path program 1 times [2022-02-20 19:25:56,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:25:56,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869774475] [2022-02-20 19:25:56,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:25:56,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:25:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:56,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:25:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:56,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {14294#true} assume true; {14294#true} is VALID [2022-02-20 19:25:56,184 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {14294#true} {14296#(= ~T1_E~0 ~M_E~0)} #10468#return; {14296#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:25:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:56,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {14330#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {14331#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:25:56,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {14331#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {14332#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:56,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {14332#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {14332#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:56,220 INFO L290 TraceCheckUtils]: 3: Hoare triple {14332#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {14332#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:56,220 INFO L290 TraceCheckUtils]: 4: Hoare triple {14332#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {14332#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:56,221 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14332#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {14296#(= ~T1_E~0 ~M_E~0)} #10470#return; {14295#false} is VALID [2022-02-20 19:25:56,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:25:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:56,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {14333#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~1#1;havoc ~tmp___0~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; {14294#true} is VALID [2022-02-20 19:25:56,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {14294#true} assume 1 == ~m_pc~0; {14294#true} is VALID [2022-02-20 19:25:56,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {14294#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {14294#true} is VALID [2022-02-20 19:25:56,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {14294#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {14294#true} is VALID [2022-02-20 19:25:56,253 INFO L290 TraceCheckUtils]: 4: Hoare triple {14294#true} #t~ret31#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp~1#1 := #t~ret31#1;havoc #t~ret31#1; {14294#true} is VALID [2022-02-20 19:25:56,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {14294#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {14294#true} is VALID [2022-02-20 19:25:56,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {14294#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; {14294#true} is VALID [2022-02-20 19:25:56,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {14294#true} assume !(1 == ~t1_pc~0); {14294#true} is VALID [2022-02-20 19:25:56,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {14294#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14294#true} is VALID [2022-02-20 19:25:56,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {14294#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {14294#true} is VALID [2022-02-20 19:25:56,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {14294#true} #t~ret32#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___0~0#1 := #t~ret32#1;havoc #t~ret32#1; {14294#true} is VALID [2022-02-20 19:25:56,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {14294#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {14294#true} is VALID [2022-02-20 19:25:56,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {14294#true} assume true; {14294#true} is VALID [2022-02-20 19:25:56,257 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {14294#true} {14295#false} #10472#return; {14295#false} is VALID [2022-02-20 19:25:56,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:25:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:56,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {14330#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {14294#true} is VALID [2022-02-20 19:25:56,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {14294#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {14294#true} is VALID [2022-02-20 19:25:56,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {14294#true} assume 1 == ~E_M~0;~E_M~0 := 2; {14294#true} is VALID [2022-02-20 19:25:56,267 INFO L290 TraceCheckUtils]: 3: Hoare triple {14294#true} assume 1 == ~E_1~0;~E_1~0 := 2; {14294#true} is VALID [2022-02-20 19:25:56,267 INFO L290 TraceCheckUtils]: 4: Hoare triple {14294#true} assume true; {14294#true} is VALID [2022-02-20 19:25:56,267 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14294#true} {14295#false} #10474#return; {14295#false} is VALID [2022-02-20 19:25:56,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:25:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:56,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {14294#true} havoc ~__retres1~2; {14294#true} is VALID [2022-02-20 19:25:56,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {14294#true} assume 0 == ~m_st~0;~__retres1~2 := 1; {14294#true} is VALID [2022-02-20 19:25:56,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {14294#true} #res := ~__retres1~2; {14294#true} is VALID [2022-02-20 19:25:56,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {14294#true} assume true; {14294#true} is VALID [2022-02-20 19:25:56,274 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14294#true} {14295#false} #10476#return; {14295#false} is VALID [2022-02-20 19:25:56,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {14294#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {14296#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:56,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {14296#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {14296#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:56,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {14296#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet36#1);havoc main_#t~nondet36#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~3#1;havoc main2_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; {14296#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:56,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {14296#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret34#1, start_simulation_#t~ret35#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; {14296#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:56,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {14296#(= ~T1_E~0 ~M_E~0)} call update_channels(); {14294#true} is VALID [2022-02-20 19:25:56,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {14294#true} assume true; {14294#true} is VALID [2022-02-20 19:25:56,288 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {14294#true} {14296#(= ~T1_E~0 ~M_E~0)} #10468#return; {14296#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:56,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {14296#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {14296#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:56,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {14296#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {14296#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:56,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {14296#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {14296#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:56,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {14296#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {14296#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:56,290 INFO L272 TraceCheckUtils]: 11: Hoare triple {14296#(= ~T1_E~0 ~M_E~0)} call fire_delta_events(); {14330#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:25:56,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {14330#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {14331#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:25:56,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {14331#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {14332#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:56,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {14332#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {14332#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:56,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {14332#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {14332#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:56,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {14332#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {14332#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:56,293 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14332#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {14296#(= ~T1_E~0 ~M_E~0)} #10470#return; {14295#false} is VALID [2022-02-20 19:25:56,293 INFO L272 TraceCheckUtils]: 18: Hoare triple {14295#false} call activate_threads(); {14333#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:25:56,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {14333#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~1#1;havoc ~tmp___0~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; {14294#true} is VALID [2022-02-20 19:25:56,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {14294#true} assume 1 == ~m_pc~0; {14294#true} is VALID [2022-02-20 19:25:56,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {14294#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {14294#true} is VALID [2022-02-20 19:25:56,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {14294#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {14294#true} is VALID [2022-02-20 19:25:56,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {14294#true} #t~ret31#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp~1#1 := #t~ret31#1;havoc #t~ret31#1; {14294#true} is VALID [2022-02-20 19:25:56,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {14294#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {14294#true} is VALID [2022-02-20 19:25:56,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {14294#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; {14294#true} is VALID [2022-02-20 19:25:56,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {14294#true} assume !(1 == ~t1_pc~0); {14294#true} is VALID [2022-02-20 19:25:56,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {14294#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14294#true} is VALID [2022-02-20 19:25:56,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {14294#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {14294#true} is VALID [2022-02-20 19:25:56,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {14294#true} #t~ret32#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___0~0#1 := #t~ret32#1;havoc #t~ret32#1; {14294#true} is VALID [2022-02-20 19:25:56,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {14294#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {14294#true} is VALID [2022-02-20 19:25:56,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {14294#true} assume true; {14294#true} is VALID [2022-02-20 19:25:56,295 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14294#true} {14295#false} #10472#return; {14295#false} is VALID [2022-02-20 19:25:56,295 INFO L272 TraceCheckUtils]: 33: Hoare triple {14295#false} call reset_delta_events(); {14330#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:25:56,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {14330#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {14294#true} is VALID [2022-02-20 19:25:56,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {14294#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {14294#true} is VALID [2022-02-20 19:25:56,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {14294#true} assume 1 == ~E_M~0;~E_M~0 := 2; {14294#true} is VALID [2022-02-20 19:25:56,296 INFO L290 TraceCheckUtils]: 37: Hoare triple {14294#true} assume 1 == ~E_1~0;~E_1~0 := 2; {14294#true} is VALID [2022-02-20 19:25:56,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {14294#true} assume true; {14294#true} is VALID [2022-02-20 19:25:56,296 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14294#true} {14295#false} #10474#return; {14295#false} is VALID [2022-02-20 19:25:56,297 INFO L290 TraceCheckUtils]: 40: Hoare triple {14295#false} assume !false; {14295#false} is VALID [2022-02-20 19:25:56,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {14295#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {14295#false} is VALID [2022-02-20 19:25:56,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {14295#false} assume !false; {14295#false} is VALID [2022-02-20 19:25:56,297 INFO L272 TraceCheckUtils]: 43: Hoare triple {14295#false} call eval_#t~ret28#1 := exists_runnable_thread(); {14294#true} is VALID [2022-02-20 19:25:56,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {14294#true} havoc ~__retres1~2; {14294#true} is VALID [2022-02-20 19:25:56,297 INFO L290 TraceCheckUtils]: 45: Hoare triple {14294#true} assume 0 == ~m_st~0;~__retres1~2 := 1; {14294#true} is VALID [2022-02-20 19:25:56,297 INFO L290 TraceCheckUtils]: 46: Hoare triple {14294#true} #res := ~__retres1~2; {14294#true} is VALID [2022-02-20 19:25:56,298 INFO L290 TraceCheckUtils]: 47: Hoare triple {14294#true} assume true; {14294#true} is VALID [2022-02-20 19:25:56,298 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {14294#true} {14295#false} #10476#return; {14295#false} is VALID [2022-02-20 19:25:56,298 INFO L290 TraceCheckUtils]: 49: Hoare triple {14295#false} assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; {14295#false} is VALID [2022-02-20 19:25:56,298 INFO L290 TraceCheckUtils]: 50: Hoare triple {14295#false} assume 0 != eval_~tmp~0#1; {14295#false} is VALID [2022-02-20 19:25:56,298 INFO L290 TraceCheckUtils]: 51: Hoare triple {14295#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; {14295#false} is VALID [2022-02-20 19:25:56,298 INFO L290 TraceCheckUtils]: 52: Hoare triple {14295#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {14295#false} is VALID [2022-02-20 19:25:56,299 INFO L290 TraceCheckUtils]: 53: Hoare triple {14295#false} assume !(0 == ~m_pc~0); {14295#false} is VALID [2022-02-20 19:25:56,299 INFO L290 TraceCheckUtils]: 54: Hoare triple {14295#false} assume 1 == ~m_pc~0; {14295#false} is VALID [2022-02-20 19:25:56,299 INFO L290 TraceCheckUtils]: 55: Hoare triple {14295#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error } true; {14295#false} is VALID [2022-02-20 19:25:56,299 INFO L290 TraceCheckUtils]: 56: Hoare triple {14295#false} assume !false; {14295#false} is VALID [2022-02-20 19:25:56,300 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:25:56,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:25:56,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869774475] [2022-02-20 19:25:56,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869774475] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:25:56,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:25:56,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:25:56,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382754858] [2022-02-20 19:25:56,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:25:56,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:25:56,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:25:56,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:56,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:25:56,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:25:56,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:25:56,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:25:56,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:25:56,337 INFO L87 Difference]: Start difference. First operand 2313 states and 4230 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:26:06,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:26:06,758 INFO L93 Difference]: Finished difference Result 2645 states and 4704 transitions. [2022-02-20 19:26:06,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:26:06,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:26:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:26:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:26:06,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4425 transitions. [2022-02-20 19:26:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:26:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4425 transitions. [2022-02-20 19:26:06,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4425 transitions. [2022-02-20 19:26:09,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4425 edges. 4425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:26:09,844 INFO L225 Difference]: With dead ends: 2645 [2022-02-20 19:26:09,844 INFO L226 Difference]: Without dead ends: 2462 [2022-02-20 19:26:09,845 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:26:09,846 INFO L933 BasicCegarLoop]: 4176 mSDtfsCounter, 4231 mSDsluCounter, 16299 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4239 SdHoareTripleChecker+Valid, 20475 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:26:09,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4239 Valid, 20475 Invalid, 689 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:26:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2022-02-20 19:26:09,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2398. [2022-02-20 19:26:09,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:26:09,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2462 states. Second operand has 2398 states, 2341 states have (on average 1.8248611704399829) internal successors, (4272), 2345 states have internal predecessors, (4272), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-02-20 19:26:09,917 INFO L74 IsIncluded]: Start isIncluded. First operand 2462 states. Second operand has 2398 states, 2341 states have (on average 1.8248611704399829) internal successors, (4272), 2345 states have internal predecessors, (4272), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-02-20 19:26:09,926 INFO L87 Difference]: Start difference. First operand 2462 states. Second operand has 2398 states, 2341 states have (on average 1.8248611704399829) internal successors, (4272), 2345 states have internal predecessors, (4272), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-02-20 19:26:10,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:26:10,093 INFO L93 Difference]: Finished difference Result 2462 states and 4442 transitions. [2022-02-20 19:26:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 4442 transitions. [2022-02-20 19:26:10,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:26:10,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:26:10,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 2398 states, 2341 states have (on average 1.8248611704399829) internal successors, (4272), 2345 states have internal predecessors, (4272), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) Second operand 2462 states. [2022-02-20 19:26:10,107 INFO L87 Difference]: Start difference. First operand has 2398 states, 2341 states have (on average 1.8248611704399829) internal successors, (4272), 2345 states have internal predecessors, (4272), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) Second operand 2462 states. [2022-02-20 19:26:10,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:26:10,267 INFO L93 Difference]: Finished difference Result 2462 states and 4442 transitions. [2022-02-20 19:26:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 4442 transitions. [2022-02-20 19:26:10,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:26:10,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:26:10,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:26:10,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:26:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2341 states have (on average 1.8248611704399829) internal successors, (4272), 2345 states have internal predecessors, (4272), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-02-20 19:26:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 4347 transitions. [2022-02-20 19:26:10,447 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 4347 transitions. Word has length 57 [2022-02-20 19:26:10,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:26:10,447 INFO L470 AbstractCegarLoop]: Abstraction has 2398 states and 4347 transitions. [2022-02-20 19:26:10,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:26:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 4347 transitions. [2022-02-20 19:26:10,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:26:10,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:26:10,453 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] [2022-02-20 19:26:10,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:26:10,453 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:26:10,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:26:10,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1297326424, now seen corresponding path program 1 times [2022-02-20 19:26:10,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:26:10,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535537719] [2022-02-20 19:26:10,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:26:10,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:26:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:10,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:26:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:10,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {24624#true} assume true; {24624#true} is VALID [2022-02-20 19:26:10,500 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {24624#true} {24626#(= ~E_M~0 ~M_E~0)} #10468#return; {24626#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:26:10,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:26:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:10,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {24660#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {24661#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:26:10,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {24661#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {24661#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:26:10,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {24661#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_M~0;~E_M~0 := 1; {24662#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:10,529 INFO L290 TraceCheckUtils]: 3: Hoare triple {24662#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {24662#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:10,529 INFO L290 TraceCheckUtils]: 4: Hoare triple {24662#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume true; {24662#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:10,530 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {24662#(not (= |old(~E_M~0)| |old(~M_E~0)|))} {24626#(= ~E_M~0 ~M_E~0)} #10470#return; {24625#false} is VALID [2022-02-20 19:26:10,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:26:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:10,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {24663#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~1#1;havoc ~tmp___0~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; {24624#true} is VALID [2022-02-20 19:26:10,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {24624#true} assume 1 == ~m_pc~0; {24624#true} is VALID [2022-02-20 19:26:10,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {24624#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {24624#true} is VALID [2022-02-20 19:26:10,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {24624#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {24624#true} is VALID [2022-02-20 19:26:10,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {24624#true} #t~ret31#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp~1#1 := #t~ret31#1;havoc #t~ret31#1; {24624#true} is VALID [2022-02-20 19:26:10,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {24624#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {24624#true} is VALID [2022-02-20 19:26:10,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {24624#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; {24624#true} is VALID [2022-02-20 19:26:10,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {24624#true} assume !(1 == ~t1_pc~0); {24624#true} is VALID [2022-02-20 19:26:10,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {24624#true} is_transmit1_triggered_~__retres1~1#1 := 0; {24624#true} is VALID [2022-02-20 19:26:10,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {24624#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {24624#true} is VALID [2022-02-20 19:26:10,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {24624#true} #t~ret32#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___0~0#1 := #t~ret32#1;havoc #t~ret32#1; {24624#true} is VALID [2022-02-20 19:26:10,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {24624#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {24624#true} is VALID [2022-02-20 19:26:10,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {24624#true} assume true; {24624#true} is VALID [2022-02-20 19:26:10,559 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {24624#true} {24625#false} #10472#return; {24625#false} is VALID [2022-02-20 19:26:10,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:26:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:10,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {24660#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {24624#true} is VALID [2022-02-20 19:26:10,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {24624#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {24624#true} is VALID [2022-02-20 19:26:10,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {24624#true} assume 1 == ~E_M~0;~E_M~0 := 2; {24624#true} is VALID [2022-02-20 19:26:10,566 INFO L290 TraceCheckUtils]: 3: Hoare triple {24624#true} assume 1 == ~E_1~0;~E_1~0 := 2; {24624#true} is VALID [2022-02-20 19:26:10,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {24624#true} assume true; {24624#true} is VALID [2022-02-20 19:26:10,566 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {24624#true} {24625#false} #10474#return; {24625#false} is VALID [2022-02-20 19:26:10,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:26:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:10,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {24624#true} havoc ~__retres1~2; {24624#true} is VALID [2022-02-20 19:26:10,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {24624#true} assume 0 == ~m_st~0;~__retres1~2 := 1; {24624#true} is VALID [2022-02-20 19:26:10,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {24624#true} #res := ~__retres1~2; {24624#true} is VALID [2022-02-20 19:26:10,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {24624#true} assume true; {24624#true} is VALID [2022-02-20 19:26:10,572 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {24624#true} {24625#false} #10476#return; {24625#false} is VALID [2022-02-20 19:26:10,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {24624#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {24626#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:26:10,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {24626#(= ~E_M~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {24626#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:26:10,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {24626#(= ~E_M~0 ~M_E~0)} assume !(0 != main_#t~nondet36#1);havoc main_#t~nondet36#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~3#1;havoc main2_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; {24626#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:26:10,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {24626#(= ~E_M~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret34#1, start_simulation_#t~ret35#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; {24626#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:26:10,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {24626#(= ~E_M~0 ~M_E~0)} call update_channels(); {24624#true} is VALID [2022-02-20 19:26:10,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {24624#true} assume true; {24624#true} is VALID [2022-02-20 19:26:10,574 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {24624#true} {24626#(= ~E_M~0 ~M_E~0)} #10468#return; {24626#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:26:10,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {24626#(= ~E_M~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {24626#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:26:10,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {24626#(= ~E_M~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {24626#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:26:10,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {24626#(= ~E_M~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {24626#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:26:10,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {24626#(= ~E_M~0 ~M_E~0)} assume { :end_inline_init_threads } true; {24626#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:26:10,576 INFO L272 TraceCheckUtils]: 11: Hoare triple {24626#(= ~E_M~0 ~M_E~0)} call fire_delta_events(); {24660#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:26:10,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {24660#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {24661#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:26:10,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {24661#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {24661#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:26:10,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {24661#(and (= ~E_M~0 |old(~E_M~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_M~0;~E_M~0 := 1; {24662#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:10,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {24662#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {24662#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:10,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {24662#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume true; {24662#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:10,578 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24662#(not (= |old(~E_M~0)| |old(~M_E~0)|))} {24626#(= ~E_M~0 ~M_E~0)} #10470#return; {24625#false} is VALID [2022-02-20 19:26:10,578 INFO L272 TraceCheckUtils]: 18: Hoare triple {24625#false} call activate_threads(); {24663#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:26:10,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {24663#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~1#1;havoc ~tmp___0~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; {24624#true} is VALID [2022-02-20 19:26:10,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {24624#true} assume 1 == ~m_pc~0; {24624#true} is VALID [2022-02-20 19:26:10,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {24624#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {24624#true} is VALID [2022-02-20 19:26:10,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {24624#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {24624#true} is VALID [2022-02-20 19:26:10,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {24624#true} #t~ret31#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp~1#1 := #t~ret31#1;havoc #t~ret31#1; {24624#true} is VALID [2022-02-20 19:26:10,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {24624#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {24624#true} is VALID [2022-02-20 19:26:10,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {24624#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; {24624#true} is VALID [2022-02-20 19:26:10,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {24624#true} assume !(1 == ~t1_pc~0); {24624#true} is VALID [2022-02-20 19:26:10,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {24624#true} is_transmit1_triggered_~__retres1~1#1 := 0; {24624#true} is VALID [2022-02-20 19:26:10,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {24624#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {24624#true} is VALID [2022-02-20 19:26:10,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {24624#true} #t~ret32#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___0~0#1 := #t~ret32#1;havoc #t~ret32#1; {24624#true} is VALID [2022-02-20 19:26:10,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {24624#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {24624#true} is VALID [2022-02-20 19:26:10,581 INFO L290 TraceCheckUtils]: 31: Hoare triple {24624#true} assume true; {24624#true} is VALID [2022-02-20 19:26:10,581 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {24624#true} {24625#false} #10472#return; {24625#false} is VALID [2022-02-20 19:26:10,581 INFO L272 TraceCheckUtils]: 33: Hoare triple {24625#false} call reset_delta_events(); {24660#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:26:10,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {24660#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {24624#true} is VALID [2022-02-20 19:26:10,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {24624#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {24624#true} is VALID [2022-02-20 19:26:10,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {24624#true} assume 1 == ~E_M~0;~E_M~0 := 2; {24624#true} is VALID [2022-02-20 19:26:10,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {24624#true} assume 1 == ~E_1~0;~E_1~0 := 2; {24624#true} is VALID [2022-02-20 19:26:10,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {24624#true} assume true; {24624#true} is VALID [2022-02-20 19:26:10,586 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {24624#true} {24625#false} #10474#return; {24625#false} is VALID [2022-02-20 19:26:10,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {24625#false} assume !false; {24625#false} is VALID [2022-02-20 19:26:10,586 INFO L290 TraceCheckUtils]: 41: Hoare triple {24625#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {24625#false} is VALID [2022-02-20 19:26:10,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {24625#false} assume !false; {24625#false} is VALID [2022-02-20 19:26:10,587 INFO L272 TraceCheckUtils]: 43: Hoare triple {24625#false} call eval_#t~ret28#1 := exists_runnable_thread(); {24624#true} is VALID [2022-02-20 19:26:10,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {24624#true} havoc ~__retres1~2; {24624#true} is VALID [2022-02-20 19:26:10,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {24624#true} assume 0 == ~m_st~0;~__retres1~2 := 1; {24624#true} is VALID [2022-02-20 19:26:10,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {24624#true} #res := ~__retres1~2; {24624#true} is VALID [2022-02-20 19:26:10,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {24624#true} assume true; {24624#true} is VALID [2022-02-20 19:26:10,587 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24624#true} {24625#false} #10476#return; {24625#false} is VALID [2022-02-20 19:26:10,587 INFO L290 TraceCheckUtils]: 49: Hoare triple {24625#false} assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; {24625#false} is VALID [2022-02-20 19:26:10,588 INFO L290 TraceCheckUtils]: 50: Hoare triple {24625#false} assume 0 != eval_~tmp~0#1; {24625#false} is VALID [2022-02-20 19:26:10,588 INFO L290 TraceCheckUtils]: 51: Hoare triple {24625#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; {24625#false} is VALID [2022-02-20 19:26:10,588 INFO L290 TraceCheckUtils]: 52: Hoare triple {24625#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {24625#false} is VALID [2022-02-20 19:26:10,588 INFO L290 TraceCheckUtils]: 53: Hoare triple {24625#false} assume !(0 == ~m_pc~0); {24625#false} is VALID [2022-02-20 19:26:10,588 INFO L290 TraceCheckUtils]: 54: Hoare triple {24625#false} assume 1 == ~m_pc~0; {24625#false} is VALID [2022-02-20 19:26:10,588 INFO L290 TraceCheckUtils]: 55: Hoare triple {24625#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error } true; {24625#false} is VALID [2022-02-20 19:26:10,588 INFO L290 TraceCheckUtils]: 56: Hoare triple {24625#false} assume !false; {24625#false} is VALID [2022-02-20 19:26:10,589 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:26:10,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:26:10,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535537719] [2022-02-20 19:26:10,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535537719] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:26:10,589 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:26:10,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:26:10,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379470820] [2022-02-20 19:26:10,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:26:10,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:26:10,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:26:10,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:26:10,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:26:10,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:26:10,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:26:10,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:26:10,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:26:10,623 INFO L87 Difference]: Start difference. First operand 2398 states and 4347 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:26:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:26:20,641 INFO L93 Difference]: Finished difference Result 2981 states and 5171 transitions. [2022-02-20 19:26:20,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:26:20,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:26:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:26:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:26:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 4462 transitions. [2022-02-20 19:26:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:26:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 4462 transitions. [2022-02-20 19:26:20,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 4462 transitions. [2022-02-20 19:26:23,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4462 edges. 4462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:26:23,758 INFO L225 Difference]: With dead ends: 2981 [2022-02-20 19:26:23,758 INFO L226 Difference]: Without dead ends: 2713 [2022-02-20 19:26:23,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:26:23,760 INFO L933 BasicCegarLoop]: 4166 mSDtfsCounter, 4285 mSDsluCounter, 16291 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4295 SdHoareTripleChecker+Valid, 20457 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:26:23,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4295 Valid, 20457 Invalid, 692 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:26:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2022-02-20 19:26:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2563. [2022-02-20 19:26:23,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:26:23,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2713 states. Second operand has 2563 states, 2474 states have (on average 1.8023443815683104) internal successors, (4459), 2480 states have internal predecessors, (4459), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 19:26:23,807 INFO L74 IsIncluded]: Start isIncluded. First operand 2713 states. Second operand has 2563 states, 2474 states have (on average 1.8023443815683104) internal successors, (4459), 2480 states have internal predecessors, (4459), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 19:26:23,809 INFO L87 Difference]: Start difference. First operand 2713 states. Second operand has 2563 states, 2474 states have (on average 1.8023443815683104) internal successors, (4459), 2480 states have internal predecessors, (4459), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 19:26:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:26:24,013 INFO L93 Difference]: Finished difference Result 2713 states and 4789 transitions. [2022-02-20 19:26:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 4789 transitions. [2022-02-20 19:26:24,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:26:24,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:26:24,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 2563 states, 2474 states have (on average 1.8023443815683104) internal successors, (4459), 2480 states have internal predecessors, (4459), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) Second operand 2713 states. [2022-02-20 19:26:24,029 INFO L87 Difference]: Start difference. First operand has 2563 states, 2474 states have (on average 1.8023443815683104) internal successors, (4459), 2480 states have internal predecessors, (4459), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) Second operand 2713 states. [2022-02-20 19:26:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:26:24,239 INFO L93 Difference]: Finished difference Result 2713 states and 4789 transitions. [2022-02-20 19:26:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 4789 transitions. [2022-02-20 19:26:24,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:26:24,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:26:24,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:26:24,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:26:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2563 states, 2474 states have (on average 1.8023443815683104) internal successors, (4459), 2480 states have internal predecessors, (4459), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 19:26:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 4578 transitions. [2022-02-20 19:26:24,435 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 4578 transitions. Word has length 57 [2022-02-20 19:26:24,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:26:24,436 INFO L470 AbstractCegarLoop]: Abstraction has 2563 states and 4578 transitions. [2022-02-20 19:26:24,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:26:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 4578 transitions. [2022-02-20 19:26:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:26:24,438 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:26:24,438 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] [2022-02-20 19:26:24,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:26:24,438 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:26:24,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:26:24,439 INFO L85 PathProgramCache]: Analyzing trace with hash 399933146, now seen corresponding path program 1 times [2022-02-20 19:26:24,439 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:26:24,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223520902] [2022-02-20 19:26:24,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:26:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:26:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:24,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:26:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:24,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {36126#true} assume true; {36126#true} is VALID [2022-02-20 19:26:24,473 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {36126#true} {36128#(= ~E_1~0 ~M_E~0)} #10468#return; {36128#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:26:24,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:26:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:24,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {36162#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {36163#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:26:24,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {36163#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {36163#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:26:24,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {36163#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {36163#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:26:24,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {36163#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {36164#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:24,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {36164#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {36164#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:24,496 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {36164#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {36128#(= ~E_1~0 ~M_E~0)} #10470#return; {36127#false} is VALID [2022-02-20 19:26:24,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:26:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:24,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {36165#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~1#1;havoc ~tmp___0~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; {36126#true} is VALID [2022-02-20 19:26:24,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {36126#true} assume 1 == ~m_pc~0; {36126#true} is VALID [2022-02-20 19:26:24,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {36126#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {36126#true} is VALID [2022-02-20 19:26:24,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {36126#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {36126#true} is VALID [2022-02-20 19:26:24,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {36126#true} #t~ret31#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp~1#1 := #t~ret31#1;havoc #t~ret31#1; {36126#true} is VALID [2022-02-20 19:26:24,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {36126#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {36126#true} is VALID [2022-02-20 19:26:24,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {36126#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; {36126#true} is VALID [2022-02-20 19:26:24,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {36126#true} assume !(1 == ~t1_pc~0); {36126#true} is VALID [2022-02-20 19:26:24,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {36126#true} is_transmit1_triggered_~__retres1~1#1 := 0; {36126#true} is VALID [2022-02-20 19:26:24,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {36126#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {36126#true} is VALID [2022-02-20 19:26:24,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {36126#true} #t~ret32#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___0~0#1 := #t~ret32#1;havoc #t~ret32#1; {36126#true} is VALID [2022-02-20 19:26:24,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {36126#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {36126#true} is VALID [2022-02-20 19:26:24,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {36126#true} assume true; {36126#true} is VALID [2022-02-20 19:26:24,530 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {36126#true} {36127#false} #10472#return; {36127#false} is VALID [2022-02-20 19:26:24,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:26:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:24,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {36162#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {36126#true} is VALID [2022-02-20 19:26:24,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {36126#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {36126#true} is VALID [2022-02-20 19:26:24,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {36126#true} assume 1 == ~E_M~0;~E_M~0 := 2; {36126#true} is VALID [2022-02-20 19:26:24,536 INFO L290 TraceCheckUtils]: 3: Hoare triple {36126#true} assume 1 == ~E_1~0;~E_1~0 := 2; {36126#true} is VALID [2022-02-20 19:26:24,536 INFO L290 TraceCheckUtils]: 4: Hoare triple {36126#true} assume true; {36126#true} is VALID [2022-02-20 19:26:24,536 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {36126#true} {36127#false} #10474#return; {36127#false} is VALID [2022-02-20 19:26:24,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:26:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:24,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {36126#true} havoc ~__retres1~2; {36126#true} is VALID [2022-02-20 19:26:24,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {36126#true} assume 0 == ~m_st~0;~__retres1~2 := 1; {36126#true} is VALID [2022-02-20 19:26:24,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {36126#true} #res := ~__retres1~2; {36126#true} is VALID [2022-02-20 19:26:24,540 INFO L290 TraceCheckUtils]: 3: Hoare triple {36126#true} assume true; {36126#true} is VALID [2022-02-20 19:26:24,540 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {36126#true} {36127#false} #10476#return; {36127#false} is VALID [2022-02-20 19:26:24,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {36126#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {36128#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:26:24,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {36128#(= ~E_1~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {36128#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:26:24,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {36128#(= ~E_1~0 ~M_E~0)} assume !(0 != main_#t~nondet36#1);havoc main_#t~nondet36#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~3#1;havoc main2_~__retres1~3#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1; {36128#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:26:24,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {36128#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret34#1, start_simulation_#t~ret35#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; {36128#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:26:24,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {36128#(= ~E_1~0 ~M_E~0)} call update_channels(); {36126#true} is VALID [2022-02-20 19:26:24,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {36126#true} assume true; {36126#true} is VALID [2022-02-20 19:26:24,544 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {36126#true} {36128#(= ~E_1~0 ~M_E~0)} #10468#return; {36128#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:26:24,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {36128#(= ~E_1~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {36128#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:26:24,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {36128#(= ~E_1~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {36128#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:26:24,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {36128#(= ~E_1~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {36128#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:26:24,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {36128#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_threads } true; {36128#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:26:24,545 INFO L272 TraceCheckUtils]: 11: Hoare triple {36128#(= ~E_1~0 ~M_E~0)} call fire_delta_events(); {36162#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:26:24,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {36162#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {36163#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:26:24,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {36163#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {36163#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:26:24,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {36163#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {36163#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:26:24,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {36163#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {36164#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:24,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {36164#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {36164#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:26:24,547 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {36164#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {36128#(= ~E_1~0 ~M_E~0)} #10470#return; {36127#false} is VALID [2022-02-20 19:26:24,547 INFO L272 TraceCheckUtils]: 18: Hoare triple {36127#false} call activate_threads(); {36165#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:26:24,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {36165#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~1#1;havoc ~tmp___0~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; {36126#true} is VALID [2022-02-20 19:26:24,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {36126#true} assume 1 == ~m_pc~0; {36126#true} is VALID [2022-02-20 19:26:24,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {36126#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {36126#true} is VALID [2022-02-20 19:26:24,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {36126#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {36126#true} is VALID [2022-02-20 19:26:24,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {36126#true} #t~ret31#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp~1#1 := #t~ret31#1;havoc #t~ret31#1; {36126#true} is VALID [2022-02-20 19:26:24,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {36126#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {36126#true} is VALID [2022-02-20 19:26:24,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {36126#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; {36126#true} is VALID [2022-02-20 19:26:24,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {36126#true} assume !(1 == ~t1_pc~0); {36126#true} is VALID [2022-02-20 19:26:24,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {36126#true} is_transmit1_triggered_~__retres1~1#1 := 0; {36126#true} is VALID [2022-02-20 19:26:24,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {36126#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {36126#true} is VALID [2022-02-20 19:26:24,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {36126#true} #t~ret32#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp___0~0#1 := #t~ret32#1;havoc #t~ret32#1; {36126#true} is VALID [2022-02-20 19:26:24,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {36126#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {36126#true} is VALID [2022-02-20 19:26:24,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {36126#true} assume true; {36126#true} is VALID [2022-02-20 19:26:24,553 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {36126#true} {36127#false} #10472#return; {36127#false} is VALID [2022-02-20 19:26:24,554 INFO L272 TraceCheckUtils]: 33: Hoare triple {36127#false} call reset_delta_events(); {36162#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:26:24,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {36162#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {36126#true} is VALID [2022-02-20 19:26:24,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {36126#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {36126#true} is VALID [2022-02-20 19:26:24,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {36126#true} assume 1 == ~E_M~0;~E_M~0 := 2; {36126#true} is VALID [2022-02-20 19:26:24,554 INFO L290 TraceCheckUtils]: 37: Hoare triple {36126#true} assume 1 == ~E_1~0;~E_1~0 := 2; {36126#true} is VALID [2022-02-20 19:26:24,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {36126#true} assume true; {36126#true} is VALID [2022-02-20 19:26:24,554 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {36126#true} {36127#false} #10474#return; {36127#false} is VALID [2022-02-20 19:26:24,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {36127#false} assume !false; {36127#false} is VALID [2022-02-20 19:26:24,555 INFO L290 TraceCheckUtils]: 41: Hoare triple {36127#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {36127#false} is VALID [2022-02-20 19:26:24,555 INFO L290 TraceCheckUtils]: 42: Hoare triple {36127#false} assume !false; {36127#false} is VALID [2022-02-20 19:26:24,555 INFO L272 TraceCheckUtils]: 43: Hoare triple {36127#false} call eval_#t~ret28#1 := exists_runnable_thread(); {36126#true} is VALID [2022-02-20 19:26:24,555 INFO L290 TraceCheckUtils]: 44: Hoare triple {36126#true} havoc ~__retres1~2; {36126#true} is VALID [2022-02-20 19:26:24,555 INFO L290 TraceCheckUtils]: 45: Hoare triple {36126#true} assume 0 == ~m_st~0;~__retres1~2 := 1; {36126#true} is VALID [2022-02-20 19:26:24,555 INFO L290 TraceCheckUtils]: 46: Hoare triple {36126#true} #res := ~__retres1~2; {36126#true} is VALID [2022-02-20 19:26:24,556 INFO L290 TraceCheckUtils]: 47: Hoare triple {36126#true} assume true; {36126#true} is VALID [2022-02-20 19:26:24,556 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {36126#true} {36127#false} #10476#return; {36127#false} is VALID [2022-02-20 19:26:24,556 INFO L290 TraceCheckUtils]: 49: Hoare triple {36127#false} assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; {36127#false} is VALID [2022-02-20 19:26:24,556 INFO L290 TraceCheckUtils]: 50: Hoare triple {36127#false} assume 0 != eval_~tmp~0#1; {36127#false} is VALID [2022-02-20 19:26:24,556 INFO L290 TraceCheckUtils]: 51: Hoare triple {36127#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; {36127#false} is VALID [2022-02-20 19:26:24,556 INFO L290 TraceCheckUtils]: 52: Hoare triple {36127#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {36127#false} is VALID [2022-02-20 19:26:24,556 INFO L290 TraceCheckUtils]: 53: Hoare triple {36127#false} assume !(0 == ~m_pc~0); {36127#false} is VALID [2022-02-20 19:26:24,557 INFO L290 TraceCheckUtils]: 54: Hoare triple {36127#false} assume 1 == ~m_pc~0; {36127#false} is VALID [2022-02-20 19:26:24,557 INFO L290 TraceCheckUtils]: 55: Hoare triple {36127#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error } true; {36127#false} is VALID [2022-02-20 19:26:24,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {36127#false} assume !false; {36127#false} is VALID [2022-02-20 19:26:24,557 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:26:24,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:26:24,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223520902] [2022-02-20 19:26:24,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223520902] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:26:24,558 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:26:24,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:26:24,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297125468] [2022-02-20 19:26:24,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:26:24,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:26:24,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:26:24,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:26:24,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:26:24,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:26:24,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:26:24,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:26:24,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:26:24,587 INFO L87 Difference]: Start difference. First operand 2563 states and 4578 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)