./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.02.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.02.cil-2.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 c7c4bef8c60b810569a22d8a73144498437260dfbc0e4b7320d169bed033790e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:17:19,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:17:19,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:17:19,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:17:19,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:17:19,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:17:19,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:17:19,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:17:19,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:17:19,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:17:19,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:17:19,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:17:19,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:17:19,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:17:19,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:17:19,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:17:19,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:17:19,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:17:19,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:17:19,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:17:19,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:17:19,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:17:19,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:17:19,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:17:19,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:17:19,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:17:19,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:17:19,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:17:19,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:17:19,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:17:19,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:17:19,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:17:19,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:17:19,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:17:19,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:17:19,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:17:19,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:17:19,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:17:19,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:17:19,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:17:19,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:17:19,376 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:17:19,394 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:17:19,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:17:19,395 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:17:19,395 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:17:19,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:17:19,396 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:17:19,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:17:19,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:17:19,397 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:17:19,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:17:19,398 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:17:19,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:17:19,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:17:19,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:17:19,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:17:19,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:17:19,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:17:19,400 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:17:19,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:17:19,400 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:17:19,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:17:19,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:17:19,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:17:19,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:17:19,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:17:19,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:17:19,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:17:19,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:17:19,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:17:19,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:17:19,403 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:17:19,403 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:17:19,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:17:19,404 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 -> c7c4bef8c60b810569a22d8a73144498437260dfbc0e4b7320d169bed033790e [2022-02-20 19:17:19,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:17:19,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:17:19,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:17:19,694 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:17:19,694 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:17:19,696 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.02.cil-2.c [2022-02-20 19:17:19,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56d40d885/9f87616a54ce481b85d2da99b9501ef0/FLAG963b1816a [2022-02-20 19:17:20,635 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:17:20,636 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.02.cil-2.c [2022-02-20 19:17:20,695 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56d40d885/9f87616a54ce481b85d2da99b9501ef0/FLAG963b1816a [2022-02-20 19:17:21,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56d40d885/9f87616a54ce481b85d2da99b9501ef0 [2022-02-20 19:17:21,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:17:21,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:17:21,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:17:21,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:17:21,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:17:21,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:17:21" (1/1) ... [2022-02-20 19:17:21,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54486788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:21, skipping insertion in model container [2022-02-20 19:17:21,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:17:21" (1/1) ... [2022-02-20 19:17:21,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:17:21,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:17:23,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.02.cil-2.c[381679,381692] [2022-02-20 19:17:23,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.02.cil-2.c[383339,383352] [2022-02-20 19:17:23,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:17:23,200 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:17:23,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.02.cil-2.c[381679,381692] [2022-02-20 19:17:23,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.02.cil-2.c[383339,383352] [2022-02-20 19:17:24,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:17:24,092 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:17:24,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:24 WrapperNode [2022-02-20 19:17:24,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:17:24,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:17:24,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:17:24,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:17:24,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:24" (1/1) ... [2022-02-20 19:17:24,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:24" (1/1) ... [2022-02-20 19:17:24,596 INFO L137 Inliner]: procedures = 48, calls = 48, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 12624 [2022-02-20 19:17:24,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:17:24,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:17:24,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:17:24,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:17:24,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:24" (1/1) ... [2022-02-20 19:17:24,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:24" (1/1) ... [2022-02-20 19:17:24,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:24" (1/1) ... [2022-02-20 19:17:24,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:24" (1/1) ... [2022-02-20 19:17:24,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:24" (1/1) ... [2022-02-20 19:17:24,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:24" (1/1) ... [2022-02-20 19:17:24,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:24" (1/1) ... [2022-02-20 19:17:25,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:17:25,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:17:25,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:17:25,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:17:25,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:24" (1/1) ... [2022-02-20 19:17:25,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:17:25,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:17:25,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:17:25,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:17:25,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:17:25,217 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-02-20 19:17:25,218 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-02-20 19:17:25,218 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-02-20 19:17:25,218 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-02-20 19:17:25,218 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-02-20 19:17:25,218 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-02-20 19:17:25,218 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:17:25,218 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:17:25,218 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-02-20 19:17:25,218 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-02-20 19:17:25,218 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-02-20 19:17:25,218 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-02-20 19:17:25,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:17:25,219 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-02-20 19:17:25,219 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-02-20 19:17:25,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:17:25,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:17:25,397 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:17:25,398 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:17:31,786 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:17:31,814 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:17:31,814 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 19:17:31,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:17:31 BoogieIcfgContainer [2022-02-20 19:17:31,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:17:31,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:17:31,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:17:31,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:17:31,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:17:21" (1/3) ... [2022-02-20 19:17:31,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d20d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:17:31, skipping insertion in model container [2022-02-20 19:17:31,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:17:24" (2/3) ... [2022-02-20 19:17:31,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d20d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:17:31, skipping insertion in model container [2022-02-20 19:17:31,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:17:31" (3/3) ... [2022-02-20 19:17:31,828 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.02.cil-2.c [2022-02-20 19:17:31,835 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:17:31,836 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:17:31,890 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:17:31,897 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:17:31,897 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:17:31,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 2323 states, 2295 states have (on average 1.857516339869281) internal successors, (4263), 2300 states have internal predecessors, (4263), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 19:17:31,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 19:17:31,972 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:17:31,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:17:31,973 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:17:31,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:17:31,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2062992276, now seen corresponding path program 1 times [2022-02-20 19:17:31,986 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:17:31,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478057859] [2022-02-20 19:17:31,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:17:31,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:17:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:32,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:17:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:32,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {2326#true} assume true; {2326#true} is VALID [2022-02-20 19:17:32,189 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {2326#true} {2328#(= ~M_E~0 2)} #10609#return; {2328#(= ~M_E~0 2)} is VALID [2022-02-20 19:17:32,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:17:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:32,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {2372#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {2373#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:17:32,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {2373#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2373#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:17:32,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {2373#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {2373#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:17:32,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {2373#(= |old(~M_E~0)| 0)} assume !(0 == ~E_M~0); {2373#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:17:32,228 INFO L290 TraceCheckUtils]: 4: Hoare triple {2373#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {2373#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:17:32,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {2373#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {2373#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:17:32,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {2373#(= |old(~M_E~0)| 0)} assume true; {2373#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:17:32,229 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2373#(= |old(~M_E~0)| 0)} {2328#(= ~M_E~0 2)} #10611#return; {2327#false} is VALID [2022-02-20 19:17:32,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:17:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:32,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {2374#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {2326#true} is VALID [2022-02-20 19:17:32,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {2326#true} assume 1 == ~m_pc~0; {2326#true} is VALID [2022-02-20 19:17:32,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {2326#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {2326#true} is VALID [2022-02-20 19:17:32,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {2326#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2326#true} is VALID [2022-02-20 19:17:32,269 INFO L290 TraceCheckUtils]: 4: Hoare triple {2326#true} #t~ret33#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp~1#1 := #t~ret33#1;havoc #t~ret33#1; {2326#true} is VALID [2022-02-20 19:17:32,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {2326#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2326#true} is VALID [2022-02-20 19:17:32,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {2326#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; {2326#true} is VALID [2022-02-20 19:17:32,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {2326#true} assume !(1 == ~t1_pc~0); {2326#true} is VALID [2022-02-20 19:17:32,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {2326#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2326#true} is VALID [2022-02-20 19:17:32,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {2326#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2326#true} is VALID [2022-02-20 19:17:32,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {2326#true} #t~ret34#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___0~0#1 := #t~ret34#1;havoc #t~ret34#1; {2326#true} is VALID [2022-02-20 19:17:32,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {2326#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2326#true} is VALID [2022-02-20 19:17:32,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {2326#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {2326#true} is VALID [2022-02-20 19:17:32,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {2326#true} assume 1 == ~t2_pc~0; {2326#true} is VALID [2022-02-20 19:17:32,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {2326#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {2326#true} is VALID [2022-02-20 19:17:32,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {2326#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {2326#true} is VALID [2022-02-20 19:17:32,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {2326#true} #t~ret35#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___1~0#1 := #t~ret35#1;havoc #t~ret35#1; {2326#true} is VALID [2022-02-20 19:17:32,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {2326#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {2326#true} is VALID [2022-02-20 19:17:32,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {2326#true} assume true; {2326#true} is VALID [2022-02-20 19:17:32,274 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2326#true} {2327#false} #10613#return; {2327#false} is VALID [2022-02-20 19:17:32,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:17:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:32,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {2372#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {2326#true} is VALID [2022-02-20 19:17:32,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {2326#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2326#true} is VALID [2022-02-20 19:17:32,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {2326#true} assume !(1 == ~T2_E~0); {2326#true} is VALID [2022-02-20 19:17:32,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {2326#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2326#true} is VALID [2022-02-20 19:17:32,304 INFO L290 TraceCheckUtils]: 4: Hoare triple {2326#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2326#true} is VALID [2022-02-20 19:17:32,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {2326#true} assume 1 == ~E_2~0;~E_2~0 := 2; {2326#true} is VALID [2022-02-20 19:17:32,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {2326#true} assume true; {2326#true} is VALID [2022-02-20 19:17:32,306 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2326#true} {2327#false} #10615#return; {2327#false} is VALID [2022-02-20 19:17:32,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:17:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:32,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {2326#true} havoc ~__retres1~3; {2326#true} is VALID [2022-02-20 19:17:32,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {2326#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {2326#true} is VALID [2022-02-20 19:17:32,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {2326#true} #res := ~__retres1~3; {2326#true} is VALID [2022-02-20 19:17:32,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {2326#true} assume true; {2326#true} is VALID [2022-02-20 19:17:32,316 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2326#true} {2327#false} #10617#return; {2327#false} is VALID [2022-02-20 19:17:32,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {2326#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {2328#(= ~M_E~0 2)} is VALID [2022-02-20 19:17:32,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {2328#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {2328#(= ~M_E~0 2)} is VALID [2022-02-20 19:17:32,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {2328#(= ~M_E~0 2)} assume !(0 != main_#t~nondet39#1);havoc main_#t~nondet39#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~4#1;havoc main2_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {2328#(= ~M_E~0 2)} is VALID [2022-02-20 19:17:32,321 INFO L290 TraceCheckUtils]: 3: Hoare triple {2328#(= ~M_E~0 2)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret37#1, start_simulation_#t~ret38#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; {2328#(= ~M_E~0 2)} is VALID [2022-02-20 19:17:32,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {2328#(= ~M_E~0 2)} call update_channels(); {2326#true} is VALID [2022-02-20 19:17:32,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {2326#true} assume true; {2326#true} is VALID [2022-02-20 19:17:32,324 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2326#true} {2328#(= ~M_E~0 2)} #10609#return; {2328#(= ~M_E~0 2)} is VALID [2022-02-20 19:17:32,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {2328#(= ~M_E~0 2)} assume { :begin_inline_init_threads } true; {2328#(= ~M_E~0 2)} is VALID [2022-02-20 19:17:32,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {2328#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {2328#(= ~M_E~0 2)} is VALID [2022-02-20 19:17:32,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {2328#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {2328#(= ~M_E~0 2)} is VALID [2022-02-20 19:17:32,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {2328#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {2328#(= ~M_E~0 2)} is VALID [2022-02-20 19:17:32,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {2328#(= ~M_E~0 2)} assume { :end_inline_init_threads } true; {2328#(= ~M_E~0 2)} is VALID [2022-02-20 19:17:32,334 INFO L272 TraceCheckUtils]: 12: Hoare triple {2328#(= ~M_E~0 2)} call fire_delta_events(); {2372#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:17:32,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {2372#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {2373#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:17:32,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {2373#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2373#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:17:32,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {2373#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {2373#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:17:32,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {2373#(= |old(~M_E~0)| 0)} assume !(0 == ~E_M~0); {2373#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:17:32,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {2373#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {2373#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:17:32,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {2373#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {2373#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:17:32,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {2373#(= |old(~M_E~0)| 0)} assume true; {2373#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:17:32,351 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2373#(= |old(~M_E~0)| 0)} {2328#(= ~M_E~0 2)} #10611#return; {2327#false} is VALID [2022-02-20 19:17:32,352 INFO L272 TraceCheckUtils]: 21: Hoare triple {2327#false} call activate_threads(); {2374#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:17:32,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {2374#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {2326#true} is VALID [2022-02-20 19:17:32,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {2326#true} assume 1 == ~m_pc~0; {2326#true} is VALID [2022-02-20 19:17:32,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {2326#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {2326#true} is VALID [2022-02-20 19:17:32,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {2326#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2326#true} is VALID [2022-02-20 19:17:32,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {2326#true} #t~ret33#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp~1#1 := #t~ret33#1;havoc #t~ret33#1; {2326#true} is VALID [2022-02-20 19:17:32,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {2326#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2326#true} is VALID [2022-02-20 19:17:32,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {2326#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; {2326#true} is VALID [2022-02-20 19:17:32,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {2326#true} assume !(1 == ~t1_pc~0); {2326#true} is VALID [2022-02-20 19:17:32,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {2326#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2326#true} is VALID [2022-02-20 19:17:32,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {2326#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2326#true} is VALID [2022-02-20 19:17:32,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {2326#true} #t~ret34#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___0~0#1 := #t~ret34#1;havoc #t~ret34#1; {2326#true} is VALID [2022-02-20 19:17:32,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {2326#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2326#true} is VALID [2022-02-20 19:17:32,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {2326#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {2326#true} is VALID [2022-02-20 19:17:32,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {2326#true} assume 1 == ~t2_pc~0; {2326#true} is VALID [2022-02-20 19:17:32,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {2326#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {2326#true} is VALID [2022-02-20 19:17:32,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {2326#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {2326#true} is VALID [2022-02-20 19:17:32,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {2326#true} #t~ret35#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___1~0#1 := #t~ret35#1;havoc #t~ret35#1; {2326#true} is VALID [2022-02-20 19:17:32,356 INFO L290 TraceCheckUtils]: 39: Hoare triple {2326#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {2326#true} is VALID [2022-02-20 19:17:32,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {2326#true} assume true; {2326#true} is VALID [2022-02-20 19:17:32,357 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2326#true} {2327#false} #10613#return; {2327#false} is VALID [2022-02-20 19:17:32,357 INFO L272 TraceCheckUtils]: 42: Hoare triple {2327#false} call reset_delta_events(); {2372#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:17:32,357 INFO L290 TraceCheckUtils]: 43: Hoare triple {2372#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {2326#true} is VALID [2022-02-20 19:17:32,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {2326#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2326#true} is VALID [2022-02-20 19:17:32,358 INFO L290 TraceCheckUtils]: 45: Hoare triple {2326#true} assume !(1 == ~T2_E~0); {2326#true} is VALID [2022-02-20 19:17:32,358 INFO L290 TraceCheckUtils]: 46: Hoare triple {2326#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2326#true} is VALID [2022-02-20 19:17:32,358 INFO L290 TraceCheckUtils]: 47: Hoare triple {2326#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2326#true} is VALID [2022-02-20 19:17:32,358 INFO L290 TraceCheckUtils]: 48: Hoare triple {2326#true} assume 1 == ~E_2~0;~E_2~0 := 2; {2326#true} is VALID [2022-02-20 19:17:32,358 INFO L290 TraceCheckUtils]: 49: Hoare triple {2326#true} assume true; {2326#true} is VALID [2022-02-20 19:17:32,359 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2326#true} {2327#false} #10615#return; {2327#false} is VALID [2022-02-20 19:17:32,359 INFO L290 TraceCheckUtils]: 51: Hoare triple {2327#false} assume !false; {2327#false} is VALID [2022-02-20 19:17:32,359 INFO L290 TraceCheckUtils]: 52: Hoare triple {2327#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret29#1, eval_#t~nondet30#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet32#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {2327#false} is VALID [2022-02-20 19:17:32,359 INFO L290 TraceCheckUtils]: 53: Hoare triple {2327#false} assume !false; {2327#false} is VALID [2022-02-20 19:17:32,360 INFO L272 TraceCheckUtils]: 54: Hoare triple {2327#false} call eval_#t~ret29#1 := exists_runnable_thread(); {2326#true} is VALID [2022-02-20 19:17:32,360 INFO L290 TraceCheckUtils]: 55: Hoare triple {2326#true} havoc ~__retres1~3; {2326#true} is VALID [2022-02-20 19:17:32,360 INFO L290 TraceCheckUtils]: 56: Hoare triple {2326#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {2326#true} is VALID [2022-02-20 19:17:32,360 INFO L290 TraceCheckUtils]: 57: Hoare triple {2326#true} #res := ~__retres1~3; {2326#true} is VALID [2022-02-20 19:17:32,361 INFO L290 TraceCheckUtils]: 58: Hoare triple {2326#true} assume true; {2326#true} is VALID [2022-02-20 19:17:32,363 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2326#true} {2327#false} #10617#return; {2327#false} is VALID [2022-02-20 19:17:32,363 INFO L290 TraceCheckUtils]: 60: Hoare triple {2327#false} assume -2147483648 <= eval_#t~ret29#1 && eval_#t~ret29#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret29#1;havoc eval_#t~ret29#1; {2327#false} is VALID [2022-02-20 19:17:32,363 INFO L290 TraceCheckUtils]: 61: Hoare triple {2327#false} assume 0 != eval_~tmp~0#1; {2327#false} is VALID [2022-02-20 19:17:32,363 INFO L290 TraceCheckUtils]: 62: Hoare triple {2327#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet30#1 && eval_#t~nondet30#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet30#1;havoc eval_#t~nondet30#1; {2327#false} is VALID [2022-02-20 19:17:32,368 INFO L290 TraceCheckUtils]: 63: Hoare triple {2327#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1, master_#t~nondet28#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet27#1 && master_#t~nondet27#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet27#1;havoc master_#t~nondet27#1; {2327#false} is VALID [2022-02-20 19:17:32,368 INFO L290 TraceCheckUtils]: 64: Hoare triple {2327#false} assume !(0 == ~m_pc~0); {2327#false} is VALID [2022-02-20 19:17:32,368 INFO L290 TraceCheckUtils]: 65: Hoare triple {2327#false} assume 1 == ~m_pc~0; {2327#false} is VALID [2022-02-20 19:17:32,369 INFO L290 TraceCheckUtils]: 66: Hoare triple {2327#false} assume ~token~0 != 2 + ~local~0; {2327#false} is VALID [2022-02-20 19:17:32,369 INFO L272 TraceCheckUtils]: 67: Hoare triple {2327#false} call error(); {2327#false} is VALID [2022-02-20 19:17:32,369 INFO L290 TraceCheckUtils]: 68: Hoare triple {2327#false} assume !false; {2327#false} is VALID [2022-02-20 19:17:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:17:32,371 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:17:32,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478057859] [2022-02-20 19:17:32,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478057859] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:17:32,373 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:17:32,373 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:17:32,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849989932] [2022-02-20 19:17:32,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:17:32,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:17:32,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:17:32,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:17:32,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:17:32,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:17:32,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:17:32,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:17:32,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:17:32,490 INFO L87 Difference]: Start difference. First operand has 2323 states, 2295 states have (on average 1.857516339869281) internal successors, (4263), 2300 states have internal predecessors, (4263), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:17:44,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:17:44,144 INFO L93 Difference]: Finished difference Result 4824 states and 8887 transitions. [2022-02-20 19:17:44,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:17:44,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:17:44,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:17:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:17:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 8887 transitions. [2022-02-20 19:17:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:17:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 8887 transitions. [2022-02-20 19:17:44,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 8887 transitions. [2022-02-20 19:17:50,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8887 edges. 8887 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:17:51,430 INFO L225 Difference]: With dead ends: 4824 [2022-02-20 19:17:51,431 INFO L226 Difference]: Without dead ends: 2441 [2022-02-20 19:17:51,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:17:51,446 INFO L933 BasicCegarLoop]: 4249 mSDtfsCounter, 4444 mSDsluCounter, 12443 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4453 SdHoareTripleChecker+Valid, 16692 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:17:51,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4453 Valid, 16692 Invalid, 644 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [84 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:17:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2022-02-20 19:17:51,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2376. [2022-02-20 19:17:51,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:17:51,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2441 states. Second operand has 2376 states, 2332 states have (on average 1.8340480274442539) internal successors, (4277), 2336 states have internal predecessors, (4277), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-02-20 19:17:51,630 INFO L74 IsIncluded]: Start isIncluded. First operand 2441 states. Second operand has 2376 states, 2332 states have (on average 1.8340480274442539) internal successors, (4277), 2336 states have internal predecessors, (4277), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-02-20 19:17:51,639 INFO L87 Difference]: Start difference. First operand 2441 states. Second operand has 2376 states, 2332 states have (on average 1.8340480274442539) internal successors, (4277), 2336 states have internal predecessors, (4277), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-02-20 19:17:51,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:17:51,897 INFO L93 Difference]: Finished difference Result 2441 states and 4438 transitions. [2022-02-20 19:17:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 4438 transitions. [2022-02-20 19:17:51,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:17:51,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:17:51,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 2376 states, 2332 states have (on average 1.8340480274442539) internal successors, (4277), 2336 states have internal predecessors, (4277), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) Second operand 2441 states. [2022-02-20 19:17:51,930 INFO L87 Difference]: Start difference. First operand has 2376 states, 2332 states have (on average 1.8340480274442539) internal successors, (4277), 2336 states have internal predecessors, (4277), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) Second operand 2441 states. [2022-02-20 19:17:52,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:17:52,186 INFO L93 Difference]: Finished difference Result 2441 states and 4438 transitions. [2022-02-20 19:17:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 4438 transitions. [2022-02-20 19:17:52,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:17:52,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:17:52,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:17:52,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:17:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2332 states have (on average 1.8340480274442539) internal successors, (4277), 2336 states have internal predecessors, (4277), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-02-20 19:17:52,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 4336 transitions. [2022-02-20 19:17:52,484 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 4336 transitions. Word has length 69 [2022-02-20 19:17:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:17:52,485 INFO L470 AbstractCegarLoop]: Abstraction has 2376 states and 4336 transitions. [2022-02-20 19:17:52,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:17:52,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 4336 transitions. [2022-02-20 19:17:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 19:17:52,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:17:52,489 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:17:52,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:17:52,490 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:17:52,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:17:52,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1960277912, now seen corresponding path program 1 times [2022-02-20 19:17:52,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:17:52,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86583420] [2022-02-20 19:17:52,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:17:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:17:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:52,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:17:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:52,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {14738#true} assume true; {14738#true} is VALID [2022-02-20 19:17:52,599 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {14738#true} {14740#(= ~T1_E~0 ~M_E~0)} #10609#return; {14740#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:17:52,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:17:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:52,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {14784#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {14785#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:17:52,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {14785#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:17:52,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:17:52,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:17:52,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:17:52,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:17:52,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:17:52,725 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {14740#(= ~T1_E~0 ~M_E~0)} #10611#return; {14739#false} is VALID [2022-02-20 19:17:52,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:17:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:52,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {14787#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {14738#true} is VALID [2022-02-20 19:17:52,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {14738#true} assume 1 == ~m_pc~0; {14738#true} is VALID [2022-02-20 19:17:52,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {14738#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {14738#true} is VALID [2022-02-20 19:17:52,757 INFO L290 TraceCheckUtils]: 3: Hoare triple {14738#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {14738#true} is VALID [2022-02-20 19:17:52,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {14738#true} #t~ret33#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp~1#1 := #t~ret33#1;havoc #t~ret33#1; {14738#true} is VALID [2022-02-20 19:17:52,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {14738#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {14738#true} is VALID [2022-02-20 19:17:52,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {14738#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; {14738#true} is VALID [2022-02-20 19:17:52,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {14738#true} assume !(1 == ~t1_pc~0); {14738#true} is VALID [2022-02-20 19:17:52,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {14738#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14738#true} is VALID [2022-02-20 19:17:52,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {14738#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {14738#true} is VALID [2022-02-20 19:17:52,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {14738#true} #t~ret34#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___0~0#1 := #t~ret34#1;havoc #t~ret34#1; {14738#true} is VALID [2022-02-20 19:17:52,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {14738#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {14738#true} is VALID [2022-02-20 19:17:52,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {14738#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {14738#true} is VALID [2022-02-20 19:17:52,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {14738#true} assume 1 == ~t2_pc~0; {14738#true} is VALID [2022-02-20 19:17:52,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {14738#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {14738#true} is VALID [2022-02-20 19:17:52,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {14738#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {14738#true} is VALID [2022-02-20 19:17:52,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {14738#true} #t~ret35#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___1~0#1 := #t~ret35#1;havoc #t~ret35#1; {14738#true} is VALID [2022-02-20 19:17:52,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {14738#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {14738#true} is VALID [2022-02-20 19:17:52,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {14738#true} assume true; {14738#true} is VALID [2022-02-20 19:17:52,761 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {14738#true} {14739#false} #10613#return; {14739#false} is VALID [2022-02-20 19:17:52,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:17:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:52,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {14784#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {14738#true} is VALID [2022-02-20 19:17:52,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {14738#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {14738#true} is VALID [2022-02-20 19:17:52,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {14738#true} assume !(1 == ~T2_E~0); {14738#true} is VALID [2022-02-20 19:17:52,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {14738#true} assume 1 == ~E_M~0;~E_M~0 := 2; {14738#true} is VALID [2022-02-20 19:17:52,776 INFO L290 TraceCheckUtils]: 4: Hoare triple {14738#true} assume 1 == ~E_1~0;~E_1~0 := 2; {14738#true} is VALID [2022-02-20 19:17:52,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {14738#true} assume 1 == ~E_2~0;~E_2~0 := 2; {14738#true} is VALID [2022-02-20 19:17:52,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {14738#true} assume true; {14738#true} is VALID [2022-02-20 19:17:52,777 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14738#true} {14739#false} #10615#return; {14739#false} is VALID [2022-02-20 19:17:52,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:17:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:17:52,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {14738#true} havoc ~__retres1~3; {14738#true} is VALID [2022-02-20 19:17:52,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {14738#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {14738#true} is VALID [2022-02-20 19:17:52,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {14738#true} #res := ~__retres1~3; {14738#true} is VALID [2022-02-20 19:17:52,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {14738#true} assume true; {14738#true} is VALID [2022-02-20 19:17:52,786 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14738#true} {14739#false} #10617#return; {14739#false} is VALID [2022-02-20 19:17:52,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {14738#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {14740#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:17:52,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {14740#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {14740#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:17:52,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {14740#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet39#1);havoc main_#t~nondet39#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~4#1;havoc main2_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {14740#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:17:52,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {14740#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret37#1, start_simulation_#t~ret38#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; {14740#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:17:52,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {14740#(= ~T1_E~0 ~M_E~0)} call update_channels(); {14738#true} is VALID [2022-02-20 19:17:52,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {14738#true} assume true; {14738#true} is VALID [2022-02-20 19:17:52,789 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {14738#true} {14740#(= ~T1_E~0 ~M_E~0)} #10609#return; {14740#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:17:52,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {14740#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {14740#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:17:52,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {14740#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {14740#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:17:52,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {14740#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {14740#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:17:52,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {14740#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {14740#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:17:52,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {14740#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {14740#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:17:52,792 INFO L272 TraceCheckUtils]: 12: Hoare triple {14740#(= ~T1_E~0 ~M_E~0)} call fire_delta_events(); {14784#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:17:52,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {14784#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {14785#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:17:52,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {14785#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:17:52,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:17:52,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:17:52,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:17:52,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:17:52,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:17:52,796 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14786#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {14740#(= ~T1_E~0 ~M_E~0)} #10611#return; {14739#false} is VALID [2022-02-20 19:17:52,796 INFO L272 TraceCheckUtils]: 21: Hoare triple {14739#false} call activate_threads(); {14787#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:17:52,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {14787#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {14738#true} is VALID [2022-02-20 19:17:52,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {14738#true} assume 1 == ~m_pc~0; {14738#true} is VALID [2022-02-20 19:17:52,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {14738#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {14738#true} is VALID [2022-02-20 19:17:52,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {14738#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {14738#true} is VALID [2022-02-20 19:17:52,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {14738#true} #t~ret33#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp~1#1 := #t~ret33#1;havoc #t~ret33#1; {14738#true} is VALID [2022-02-20 19:17:52,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {14738#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {14738#true} is VALID [2022-02-20 19:17:52,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {14738#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; {14738#true} is VALID [2022-02-20 19:17:52,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {14738#true} assume !(1 == ~t1_pc~0); {14738#true} is VALID [2022-02-20 19:17:52,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {14738#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14738#true} is VALID [2022-02-20 19:17:52,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {14738#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {14738#true} is VALID [2022-02-20 19:17:52,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {14738#true} #t~ret34#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___0~0#1 := #t~ret34#1;havoc #t~ret34#1; {14738#true} is VALID [2022-02-20 19:17:52,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {14738#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {14738#true} is VALID [2022-02-20 19:17:52,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {14738#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {14738#true} is VALID [2022-02-20 19:17:52,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {14738#true} assume 1 == ~t2_pc~0; {14738#true} is VALID [2022-02-20 19:17:52,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {14738#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {14738#true} is VALID [2022-02-20 19:17:52,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {14738#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {14738#true} is VALID [2022-02-20 19:17:52,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {14738#true} #t~ret35#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___1~0#1 := #t~ret35#1;havoc #t~ret35#1; {14738#true} is VALID [2022-02-20 19:17:52,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {14738#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {14738#true} is VALID [2022-02-20 19:17:52,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {14738#true} assume true; {14738#true} is VALID [2022-02-20 19:17:52,800 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14738#true} {14739#false} #10613#return; {14739#false} is VALID [2022-02-20 19:17:52,800 INFO L272 TraceCheckUtils]: 42: Hoare triple {14739#false} call reset_delta_events(); {14784#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:17:52,801 INFO L290 TraceCheckUtils]: 43: Hoare triple {14784#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {14738#true} is VALID [2022-02-20 19:17:52,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {14738#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {14738#true} is VALID [2022-02-20 19:17:52,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {14738#true} assume !(1 == ~T2_E~0); {14738#true} is VALID [2022-02-20 19:17:52,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {14738#true} assume 1 == ~E_M~0;~E_M~0 := 2; {14738#true} is VALID [2022-02-20 19:17:52,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {14738#true} assume 1 == ~E_1~0;~E_1~0 := 2; {14738#true} is VALID [2022-02-20 19:17:52,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {14738#true} assume 1 == ~E_2~0;~E_2~0 := 2; {14738#true} is VALID [2022-02-20 19:17:52,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {14738#true} assume true; {14738#true} is VALID [2022-02-20 19:17:52,802 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14738#true} {14739#false} #10615#return; {14739#false} is VALID [2022-02-20 19:17:52,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {14739#false} assume !false; {14739#false} is VALID [2022-02-20 19:17:52,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {14739#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret29#1, eval_#t~nondet30#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet32#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {14739#false} is VALID [2022-02-20 19:17:52,803 INFO L290 TraceCheckUtils]: 53: Hoare triple {14739#false} assume !false; {14739#false} is VALID [2022-02-20 19:17:52,803 INFO L272 TraceCheckUtils]: 54: Hoare triple {14739#false} call eval_#t~ret29#1 := exists_runnable_thread(); {14738#true} is VALID [2022-02-20 19:17:52,803 INFO L290 TraceCheckUtils]: 55: Hoare triple {14738#true} havoc ~__retres1~3; {14738#true} is VALID [2022-02-20 19:17:52,803 INFO L290 TraceCheckUtils]: 56: Hoare triple {14738#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {14738#true} is VALID [2022-02-20 19:17:52,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {14738#true} #res := ~__retres1~3; {14738#true} is VALID [2022-02-20 19:17:52,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {14738#true} assume true; {14738#true} is VALID [2022-02-20 19:17:52,804 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14738#true} {14739#false} #10617#return; {14739#false} is VALID [2022-02-20 19:17:52,804 INFO L290 TraceCheckUtils]: 60: Hoare triple {14739#false} assume -2147483648 <= eval_#t~ret29#1 && eval_#t~ret29#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret29#1;havoc eval_#t~ret29#1; {14739#false} is VALID [2022-02-20 19:17:52,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {14739#false} assume 0 != eval_~tmp~0#1; {14739#false} is VALID [2022-02-20 19:17:52,804 INFO L290 TraceCheckUtils]: 62: Hoare triple {14739#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet30#1 && eval_#t~nondet30#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet30#1;havoc eval_#t~nondet30#1; {14739#false} is VALID [2022-02-20 19:17:52,805 INFO L290 TraceCheckUtils]: 63: Hoare triple {14739#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1, master_#t~nondet28#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet27#1 && master_#t~nondet27#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet27#1;havoc master_#t~nondet27#1; {14739#false} is VALID [2022-02-20 19:17:52,805 INFO L290 TraceCheckUtils]: 64: Hoare triple {14739#false} assume !(0 == ~m_pc~0); {14739#false} is VALID [2022-02-20 19:17:52,805 INFO L290 TraceCheckUtils]: 65: Hoare triple {14739#false} assume 1 == ~m_pc~0; {14739#false} is VALID [2022-02-20 19:17:52,805 INFO L290 TraceCheckUtils]: 66: Hoare triple {14739#false} assume ~token~0 != 2 + ~local~0; {14739#false} is VALID [2022-02-20 19:17:52,805 INFO L272 TraceCheckUtils]: 67: Hoare triple {14739#false} call error(); {14739#false} is VALID [2022-02-20 19:17:52,806 INFO L290 TraceCheckUtils]: 68: Hoare triple {14739#false} assume !false; {14739#false} is VALID [2022-02-20 19:17:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:17:52,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:17:52,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86583420] [2022-02-20 19:17:52,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86583420] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:17:52,807 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:17:52,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:17:52,807 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636524947] [2022-02-20 19:17:52,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:17:52,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:17:52,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:17:52,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:17:52,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:17:52,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:17:52,862 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:17:52,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:17:52,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:17:52,863 INFO L87 Difference]: Start difference. First operand 2376 states and 4336 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:18:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:18:05,016 INFO L93 Difference]: Finished difference Result 2838 states and 5030 transitions. [2022-02-20 19:18:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:18:05,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:18:05,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:18:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:18:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4626 transitions. [2022-02-20 19:18:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:18:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4626 transitions. [2022-02-20 19:18:05,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4626 transitions. [2022-02-20 19:18:08,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4626 edges. 4626 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:18:08,657 INFO L225 Difference]: With dead ends: 2838 [2022-02-20 19:18:08,657 INFO L226 Difference]: Without dead ends: 2593 [2022-02-20 19:18:08,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:18:08,659 INFO L933 BasicCegarLoop]: 4270 mSDtfsCounter, 4365 mSDsluCounter, 16510 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4374 SdHoareTripleChecker+Valid, 20780 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:18:08,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4374 Valid, 20780 Invalid, 931 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:18:08,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2022-02-20 19:18:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2490. [2022-02-20 19:18:08,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:18:08,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2593 states. Second operand has 2490 states, 2428 states have (on average 1.82001647446458) internal successors, (4419), 2433 states have internal predecessors, (4419), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:18:08,730 INFO L74 IsIncluded]: Start isIncluded. First operand 2593 states. Second operand has 2490 states, 2428 states have (on average 1.82001647446458) internal successors, (4419), 2433 states have internal predecessors, (4419), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:18:08,738 INFO L87 Difference]: Start difference. First operand 2593 states. Second operand has 2490 states, 2428 states have (on average 1.82001647446458) internal successors, (4419), 2433 states have internal predecessors, (4419), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:18:09,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:18:09,025 INFO L93 Difference]: Finished difference Result 2593 states and 4664 transitions. [2022-02-20 19:18:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 4664 transitions. [2022-02-20 19:18:09,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:18:09,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:18:09,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 2490 states, 2428 states have (on average 1.82001647446458) internal successors, (4419), 2433 states have internal predecessors, (4419), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) Second operand 2593 states. [2022-02-20 19:18:09,043 INFO L87 Difference]: Start difference. First operand has 2490 states, 2428 states have (on average 1.82001647446458) internal successors, (4419), 2433 states have internal predecessors, (4419), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) Second operand 2593 states. [2022-02-20 19:18:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:18:09,328 INFO L93 Difference]: Finished difference Result 2593 states and 4664 transitions. [2022-02-20 19:18:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 4664 transitions. [2022-02-20 19:18:09,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:18:09,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:18:09,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:18:09,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:18:09,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2428 states have (on average 1.82001647446458) internal successors, (4419), 2433 states have internal predecessors, (4419), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:18:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4502 transitions. [2022-02-20 19:18:09,644 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4502 transitions. Word has length 69 [2022-02-20 19:18:09,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:18:09,646 INFO L470 AbstractCegarLoop]: Abstraction has 2490 states and 4502 transitions. [2022-02-20 19:18:09,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:18:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4502 transitions. [2022-02-20 19:18:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 19:18:09,649 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:18:09,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:18:09,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:18:09,650 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:18:09,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:18:09,651 INFO L85 PathProgramCache]: Analyzing trace with hash -573492502, now seen corresponding path program 1 times [2022-02-20 19:18:09,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:18:09,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129128307] [2022-02-20 19:18:09,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:18:09,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:18:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:09,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:18:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:09,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {25691#true} assume true; {25691#true} is VALID [2022-02-20 19:18:09,715 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {25691#true} {25693#(= ~T2_E~0 ~M_E~0)} #10609#return; {25693#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:09,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:18:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:09,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {25737#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {25738#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:18:09,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {25738#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {25738#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:18:09,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {25738#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:09,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:09,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:09,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:09,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:09,758 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {25693#(= ~T2_E~0 ~M_E~0)} #10611#return; {25692#false} is VALID [2022-02-20 19:18:09,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:18:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:09,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {25740#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {25691#true} is VALID [2022-02-20 19:18:09,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {25691#true} assume 1 == ~m_pc~0; {25691#true} is VALID [2022-02-20 19:18:09,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {25691#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {25691#true} is VALID [2022-02-20 19:18:09,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {25691#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {25691#true} is VALID [2022-02-20 19:18:09,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {25691#true} #t~ret33#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp~1#1 := #t~ret33#1;havoc #t~ret33#1; {25691#true} is VALID [2022-02-20 19:18:09,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {25691#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {25691#true} is VALID [2022-02-20 19:18:09,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {25691#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; {25691#true} is VALID [2022-02-20 19:18:09,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {25691#true} assume !(1 == ~t1_pc~0); {25691#true} is VALID [2022-02-20 19:18:09,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {25691#true} is_transmit1_triggered_~__retres1~1#1 := 0; {25691#true} is VALID [2022-02-20 19:18:09,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {25691#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {25691#true} is VALID [2022-02-20 19:18:09,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {25691#true} #t~ret34#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___0~0#1 := #t~ret34#1;havoc #t~ret34#1; {25691#true} is VALID [2022-02-20 19:18:09,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {25691#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {25691#true} is VALID [2022-02-20 19:18:09,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {25691#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {25691#true} is VALID [2022-02-20 19:18:09,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {25691#true} assume 1 == ~t2_pc~0; {25691#true} is VALID [2022-02-20 19:18:09,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {25691#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {25691#true} is VALID [2022-02-20 19:18:09,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {25691#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {25691#true} is VALID [2022-02-20 19:18:09,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {25691#true} #t~ret35#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___1~0#1 := #t~ret35#1;havoc #t~ret35#1; {25691#true} is VALID [2022-02-20 19:18:09,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {25691#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {25691#true} is VALID [2022-02-20 19:18:09,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {25691#true} assume true; {25691#true} is VALID [2022-02-20 19:18:09,798 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {25691#true} {25692#false} #10613#return; {25692#false} is VALID [2022-02-20 19:18:09,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:18:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:09,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {25737#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {25691#true} is VALID [2022-02-20 19:18:09,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {25691#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {25691#true} is VALID [2022-02-20 19:18:09,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {25691#true} assume !(1 == ~T2_E~0); {25691#true} is VALID [2022-02-20 19:18:09,813 INFO L290 TraceCheckUtils]: 3: Hoare triple {25691#true} assume 1 == ~E_M~0;~E_M~0 := 2; {25691#true} is VALID [2022-02-20 19:18:09,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {25691#true} assume 1 == ~E_1~0;~E_1~0 := 2; {25691#true} is VALID [2022-02-20 19:18:09,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {25691#true} assume 1 == ~E_2~0;~E_2~0 := 2; {25691#true} is VALID [2022-02-20 19:18:09,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {25691#true} assume true; {25691#true} is VALID [2022-02-20 19:18:09,814 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25691#true} {25692#false} #10615#return; {25692#false} is VALID [2022-02-20 19:18:09,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:18:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:18:09,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {25691#true} havoc ~__retres1~3; {25691#true} is VALID [2022-02-20 19:18:09,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {25691#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {25691#true} is VALID [2022-02-20 19:18:09,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {25691#true} #res := ~__retres1~3; {25691#true} is VALID [2022-02-20 19:18:09,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {25691#true} assume true; {25691#true} is VALID [2022-02-20 19:18:09,828 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25691#true} {25692#false} #10617#return; {25692#false} is VALID [2022-02-20 19:18:09,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {25691#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~d~0 := 4;~c~0 := 3;~e~0 := 5;~a~0 := 1;~f~0 := 6;~b~0 := 2;~a9~0 := 18;~a27~0 := 1;~a2~0 := 10;~a16~0 := 1;~a15~0 := 1;~a12~0 := 4;~a25~0 := 1;~a20~0 := 5;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {25693#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:09,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {25693#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1;assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {25693#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:09,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {25693#(= ~T2_E~0 ~M_E~0)} assume !(0 != main_#t~nondet39#1);havoc main_#t~nondet39#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~4#1;havoc main2_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; {25693#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:09,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {25693#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret37#1, start_simulation_#t~ret38#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; {25693#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:09,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {25693#(= ~T2_E~0 ~M_E~0)} call update_channels(); {25691#true} is VALID [2022-02-20 19:18:09,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {25691#true} assume true; {25691#true} is VALID [2022-02-20 19:18:09,831 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {25691#true} {25693#(= ~T2_E~0 ~M_E~0)} #10609#return; {25693#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:09,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {25693#(= ~T2_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {25693#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:09,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {25693#(= ~T2_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {25693#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:09,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {25693#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {25693#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:09,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {25693#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {25693#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:09,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {25693#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {25693#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:18:09,833 INFO L272 TraceCheckUtils]: 12: Hoare triple {25693#(= ~T2_E~0 ~M_E~0)} call fire_delta_events(); {25737#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:18:09,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {25737#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(0 == ~M_E~0); {25738#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:18:09,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {25738#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {25738#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:18:09,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {25738#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:09,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:09,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:09,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:09,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:18:09,837 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {25739#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {25693#(= ~T2_E~0 ~M_E~0)} #10611#return; {25692#false} is VALID [2022-02-20 19:18:09,838 INFO L272 TraceCheckUtils]: 21: Hoare triple {25692#false} call activate_threads(); {25740#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} is VALID [2022-02-20 19:18:09,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {25740#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0))} havoc ~tmp~1#1;havoc ~tmp___0~0#1;havoc ~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; {25691#true} is VALID [2022-02-20 19:18:09,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {25691#true} assume 1 == ~m_pc~0; {25691#true} is VALID [2022-02-20 19:18:09,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {25691#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {25691#true} is VALID [2022-02-20 19:18:09,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {25691#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {25691#true} is VALID [2022-02-20 19:18:09,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {25691#true} #t~ret33#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp~1#1 := #t~ret33#1;havoc #t~ret33#1; {25691#true} is VALID [2022-02-20 19:18:09,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {25691#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {25691#true} is VALID [2022-02-20 19:18:09,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {25691#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; {25691#true} is VALID [2022-02-20 19:18:09,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {25691#true} assume !(1 == ~t1_pc~0); {25691#true} is VALID [2022-02-20 19:18:09,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {25691#true} is_transmit1_triggered_~__retres1~1#1 := 0; {25691#true} is VALID [2022-02-20 19:18:09,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {25691#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {25691#true} is VALID [2022-02-20 19:18:09,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {25691#true} #t~ret34#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___0~0#1 := #t~ret34#1;havoc #t~ret34#1; {25691#true} is VALID [2022-02-20 19:18:09,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {25691#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {25691#true} is VALID [2022-02-20 19:18:09,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {25691#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; {25691#true} is VALID [2022-02-20 19:18:09,841 INFO L290 TraceCheckUtils]: 35: Hoare triple {25691#true} assume 1 == ~t2_pc~0; {25691#true} is VALID [2022-02-20 19:18:09,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {25691#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {25691#true} is VALID [2022-02-20 19:18:09,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {25691#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {25691#true} is VALID [2022-02-20 19:18:09,842 INFO L290 TraceCheckUtils]: 38: Hoare triple {25691#true} #t~ret35#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret35#1 && #t~ret35#1 <= 2147483647;~tmp___1~0#1 := #t~ret35#1;havoc #t~ret35#1; {25691#true} is VALID [2022-02-20 19:18:09,842 INFO L290 TraceCheckUtils]: 39: Hoare triple {25691#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {25691#true} is VALID [2022-02-20 19:18:09,843 INFO L290 TraceCheckUtils]: 40: Hoare triple {25691#true} assume true; {25691#true} is VALID [2022-02-20 19:18:09,843 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25691#true} {25692#false} #10613#return; {25692#false} is VALID [2022-02-20 19:18:09,843 INFO L272 TraceCheckUtils]: 42: Hoare triple {25692#false} call reset_delta_events(); {25737#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} is VALID [2022-02-20 19:18:09,843 INFO L290 TraceCheckUtils]: 43: Hoare triple {25737#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))} assume !(1 == ~M_E~0); {25691#true} is VALID [2022-02-20 19:18:09,843 INFO L290 TraceCheckUtils]: 44: Hoare triple {25691#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {25691#true} is VALID [2022-02-20 19:18:09,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {25691#true} assume !(1 == ~T2_E~0); {25691#true} is VALID [2022-02-20 19:18:09,844 INFO L290 TraceCheckUtils]: 46: Hoare triple {25691#true} assume 1 == ~E_M~0;~E_M~0 := 2; {25691#true} is VALID [2022-02-20 19:18:09,844 INFO L290 TraceCheckUtils]: 47: Hoare triple {25691#true} assume 1 == ~E_1~0;~E_1~0 := 2; {25691#true} is VALID [2022-02-20 19:18:09,844 INFO L290 TraceCheckUtils]: 48: Hoare triple {25691#true} assume 1 == ~E_2~0;~E_2~0 := 2; {25691#true} is VALID [2022-02-20 19:18:09,844 INFO L290 TraceCheckUtils]: 49: Hoare triple {25691#true} assume true; {25691#true} is VALID [2022-02-20 19:18:09,844 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25691#true} {25692#false} #10615#return; {25692#false} is VALID [2022-02-20 19:18:09,844 INFO L290 TraceCheckUtils]: 51: Hoare triple {25692#false} assume !false; {25692#false} is VALID [2022-02-20 19:18:09,845 INFO L290 TraceCheckUtils]: 52: Hoare triple {25692#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret29#1, eval_#t~nondet30#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet32#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {25692#false} is VALID [2022-02-20 19:18:09,845 INFO L290 TraceCheckUtils]: 53: Hoare triple {25692#false} assume !false; {25692#false} is VALID [2022-02-20 19:18:09,845 INFO L272 TraceCheckUtils]: 54: Hoare triple {25692#false} call eval_#t~ret29#1 := exists_runnable_thread(); {25691#true} is VALID [2022-02-20 19:18:09,845 INFO L290 TraceCheckUtils]: 55: Hoare triple {25691#true} havoc ~__retres1~3; {25691#true} is VALID [2022-02-20 19:18:09,845 INFO L290 TraceCheckUtils]: 56: Hoare triple {25691#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {25691#true} is VALID [2022-02-20 19:18:09,845 INFO L290 TraceCheckUtils]: 57: Hoare triple {25691#true} #res := ~__retres1~3; {25691#true} is VALID [2022-02-20 19:18:09,846 INFO L290 TraceCheckUtils]: 58: Hoare triple {25691#true} assume true; {25691#true} is VALID [2022-02-20 19:18:09,846 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25691#true} {25692#false} #10617#return; {25692#false} is VALID [2022-02-20 19:18:09,846 INFO L290 TraceCheckUtils]: 60: Hoare triple {25692#false} assume -2147483648 <= eval_#t~ret29#1 && eval_#t~ret29#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret29#1;havoc eval_#t~ret29#1; {25692#false} is VALID [2022-02-20 19:18:09,846 INFO L290 TraceCheckUtils]: 61: Hoare triple {25692#false} assume 0 != eval_~tmp~0#1; {25692#false} is VALID [2022-02-20 19:18:09,846 INFO L290 TraceCheckUtils]: 62: Hoare triple {25692#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet30#1 && eval_#t~nondet30#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet30#1;havoc eval_#t~nondet30#1; {25692#false} is VALID [2022-02-20 19:18:09,846 INFO L290 TraceCheckUtils]: 63: Hoare triple {25692#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1, master_#t~nondet28#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet27#1 && master_#t~nondet27#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet27#1;havoc master_#t~nondet27#1; {25692#false} is VALID [2022-02-20 19:18:09,847 INFO L290 TraceCheckUtils]: 64: Hoare triple {25692#false} assume !(0 == ~m_pc~0); {25692#false} is VALID [2022-02-20 19:18:09,847 INFO L290 TraceCheckUtils]: 65: Hoare triple {25692#false} assume 1 == ~m_pc~0; {25692#false} is VALID [2022-02-20 19:18:09,849 INFO L290 TraceCheckUtils]: 66: Hoare triple {25692#false} assume ~token~0 != 2 + ~local~0; {25692#false} is VALID [2022-02-20 19:18:09,850 INFO L272 TraceCheckUtils]: 67: Hoare triple {25692#false} call error(); {25692#false} is VALID [2022-02-20 19:18:09,850 INFO L290 TraceCheckUtils]: 68: Hoare triple {25692#false} assume !false; {25692#false} is VALID [2022-02-20 19:18:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:18:09,852 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:18:09,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129128307] [2022-02-20 19:18:09,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129128307] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:18:09,853 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:18:09,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:18:09,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342033759] [2022-02-20 19:18:09,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:18:09,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-02-20 19:18:09,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:18:09,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:18:09,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:18:09,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:18:09,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:18:09,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:18:09,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:18:09,898 INFO L87 Difference]: Start difference. First operand 2490 states and 4502 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)