./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.02.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.02.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e29588631802f33e276df8c8a4376435a271a426c8b5d54fd1eb814b142c7499 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:24:40,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:24:40,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:24:40,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:24:40,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:24:40,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:24:40,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:24:40,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:24:40,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:24:40,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:24:40,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:24:40,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:24:40,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:24:40,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:24:40,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:24:40,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:24:40,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:24:40,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:24:40,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:24:40,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:24:40,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:24:40,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:24:40,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:24:40,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:24:40,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:24:40,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:24:40,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:24:40,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:24:40,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:24:40,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:24:40,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:24:40,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:24:40,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:24:40,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:24:40,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:24:40,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:24:40,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:24:40,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:24:40,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:24:40,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:24:40,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:24:40,366 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:24:40,384 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:24:40,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:24:40,388 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:24:40,388 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:24:40,389 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:24:40,389 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:24:40,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:24:40,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:24:40,393 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:24:40,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:24:40,394 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:24:40,394 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:24:40,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:24:40,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:24:40,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:24:40,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:24:40,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:24:40,396 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:24:40,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:24:40,396 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:24:40,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:24:40,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:24:40,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:24:40,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:24:40,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:24:40,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:24:40,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:24:40,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:24:40,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:24:40,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:24:40,402 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:24:40,402 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:24:40,403 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:24:40,403 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 -> e29588631802f33e276df8c8a4376435a271a426c8b5d54fd1eb814b142c7499 [2022-02-20 19:24:40,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:24:40,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:24:40,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:24:40,620 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:24:40,621 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:24:40,622 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label47+token_ring.02.cil-1.c [2022-02-20 19:24:40,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f827b02/ad74bc7402364c2fbac1625eb911a046/FLAGc1bf2dd0b [2022-02-20 19:24:41,360 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:24:41,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.02.cil-1.c [2022-02-20 19:24:41,400 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f827b02/ad74bc7402364c2fbac1625eb911a046/FLAGc1bf2dd0b [2022-02-20 19:24:41,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f827b02/ad74bc7402364c2fbac1625eb911a046 [2022-02-20 19:24:41,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:24:41,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:24:41,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:24:41,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:24:41,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:24:41,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:24:41" (1/1) ... [2022-02-20 19:24:41,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af26b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:24:41, skipping insertion in model container [2022-02-20 19:24:41,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:24:41" (1/1) ... [2022-02-20 19:24:41,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:24:41,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:24:43,059 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_label47+token_ring.02.cil-1.c[377612,377625] [2022-02-20 19:24:43,079 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_label47+token_ring.02.cil-1.c[383339,383352] [2022-02-20 19:24:43,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:24:43,183 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:24:43,782 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_label47+token_ring.02.cil-1.c[377612,377625] [2022-02-20 19:24:43,790 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_label47+token_ring.02.cil-1.c[383339,383352] [2022-02-20 19:24:43,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:24:43,845 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:24:43,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:24:43 WrapperNode [2022-02-20 19:24:43,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:24:43,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:24:43,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:24:43,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:24:43,851 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:24:43" (1/1) ... [2022-02-20 19:24:43,929 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:24:43" (1/1) ... [2022-02-20 19:24:44,325 INFO L137 Inliner]: procedures = 48, calls = 47, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 12619 [2022-02-20 19:24:44,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:24:44,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:24:44,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:24:44,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:24:44,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:24:43" (1/1) ... [2022-02-20 19:24:44,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:24:43" (1/1) ... [2022-02-20 19:24:44,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:24:43" (1/1) ... [2022-02-20 19:24:44,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:24:43" (1/1) ... [2022-02-20 19:24:44,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:24:43" (1/1) ... [2022-02-20 19:24:44,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:24:43" (1/1) ... [2022-02-20 19:24:44,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:24:43" (1/1) ... [2022-02-20 19:24:44,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:24:44,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:24:44,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:24:44,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:24:44,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:24:43" (1/1) ... [2022-02-20 19:24:44,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:24:44,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:24:44,630 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:24:44,707 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:24:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:24:44,723 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-02-20 19:24:44,723 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-02-20 19:24:44,723 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-02-20 19:24:44,723 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-02-20 19:24:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:24:44,724 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:24:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-02-20 19:24:44,724 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-02-20 19:24:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-02-20 19:24:44,724 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-02-20 19:24:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:24:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-02-20 19:24:44,724 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-02-20 19:24:44,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:24:44,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:24:44,794 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:24:44,795 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:24:49,476 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:24:49,495 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:24:49,496 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 19:24:49,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:24:49 BoogieIcfgContainer [2022-02-20 19:24:49,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:24:49,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:24:49,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:24:49,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:24:49,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:24:41" (1/3) ... [2022-02-20 19:24:49,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b851bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:24:49, skipping insertion in model container [2022-02-20 19:24:49,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:24:43" (2/3) ... [2022-02-20 19:24:49,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b851bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:24:49, skipping insertion in model container [2022-02-20 19:24:49,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:24:49" (3/3) ... [2022-02-20 19:24:49,504 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.02.cil-1.c [2022-02-20 19:24:49,507 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:24:49,507 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:24:49,543 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:24:49,547 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:24:49,547 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:24:49,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 2315 states, 2290 states have (on average 1.8572052401746726) internal successors, (4253), 2293 states have internal predecessors, (4253), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 19:24:49,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:24:49,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:24:49,602 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] [2022-02-20 19:24:49,602 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:24:49,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:24:49,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1170312139, now seen corresponding path program 1 times [2022-02-20 19:24:49,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:24:49,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576492728] [2022-02-20 19:24:49,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:24:49,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:24:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:24:49,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:24:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:24:49,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:24:49,883 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {2318#true} {2320#(= ~M_E~0 2)} #10580#return; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:24:49,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:24:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:24:49,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {2364#(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; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:24:49,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:24:49,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:24:49,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume !(0 == ~E_M~0); {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:24:49,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:24:49,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:24:49,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume true; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:24:49,943 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2365#(= |old(~M_E~0)| 0)} {2320#(= ~M_E~0 2)} #10582#return; {2319#false} is VALID [2022-02-20 19:24:49,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:24:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:24:49,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {2366#(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; {2318#true} is VALID [2022-02-20 19:24:49,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {2318#true} assume 1 == ~m_pc~0; {2318#true} is VALID [2022-02-20 19:24:49,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {2318#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {2318#true} is VALID [2022-02-20 19:24:49,977 INFO L290 TraceCheckUtils]: 3: Hoare triple {2318#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2318#true} is VALID [2022-02-20 19:24:49,977 INFO L290 TraceCheckUtils]: 4: Hoare triple {2318#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {2318#true} is VALID [2022-02-20 19:24:49,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {2318#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2318#true} is VALID [2022-02-20 19:24:49,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {2318#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; {2318#true} is VALID [2022-02-20 19:24:49,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {2318#true} assume !(1 == ~t1_pc~0); {2318#true} is VALID [2022-02-20 19:24:49,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {2318#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2318#true} is VALID [2022-02-20 19:24:49,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {2318#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2318#true} is VALID [2022-02-20 19:24:49,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {2318#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {2318#true} is VALID [2022-02-20 19:24:49,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {2318#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2318#true} is VALID [2022-02-20 19:24:49,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {2318#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; {2318#true} is VALID [2022-02-20 19:24:49,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {2318#true} assume 1 == ~t2_pc~0; {2318#true} is VALID [2022-02-20 19:24:49,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {2318#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {2318#true} is VALID [2022-02-20 19:24:49,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {2318#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {2318#true} is VALID [2022-02-20 19:24:49,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {2318#true} #t~ret34#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___1~0#1 := #t~ret34#1;havoc #t~ret34#1; {2318#true} is VALID [2022-02-20 19:24:49,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {2318#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {2318#true} is VALID [2022-02-20 19:24:49,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:24:49,982 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2318#true} {2319#false} #10584#return; {2319#false} is VALID [2022-02-20 19:24:49,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:24:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:24:50,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {2364#(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; {2318#true} is VALID [2022-02-20 19:24:50,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {2318#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2318#true} is VALID [2022-02-20 19:24:50,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {2318#true} assume !(1 == ~T2_E~0); {2318#true} is VALID [2022-02-20 19:24:50,001 INFO L290 TraceCheckUtils]: 3: Hoare triple {2318#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2318#true} is VALID [2022-02-20 19:24:50,001 INFO L290 TraceCheckUtils]: 4: Hoare triple {2318#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2318#true} is VALID [2022-02-20 19:24:50,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {2318#true} assume 1 == ~E_2~0;~E_2~0 := 2; {2318#true} is VALID [2022-02-20 19:24:50,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:24:50,002 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2318#true} {2319#false} #10586#return; {2319#false} is VALID [2022-02-20 19:24:50,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:24:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:24:50,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {2318#true} havoc ~__retres1~3; {2318#true} is VALID [2022-02-20 19:24:50,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {2318#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {2318#true} is VALID [2022-02-20 19:24:50,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {2318#true} #res := ~__retres1~3; {2318#true} is VALID [2022-02-20 19:24:50,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:24:50,016 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2318#true} {2319#false} #10588#return; {2319#false} is VALID [2022-02-20 19:24:50,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {2318#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; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:24:50,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {2320#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:24:50,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {2320#(= ~M_E~0 2)} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#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; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:24:50,019 INFO L290 TraceCheckUtils]: 3: Hoare triple {2320#(= ~M_E~0 2)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret36#1, start_simulation_#t~ret37#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; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:24:50,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {2320#(= ~M_E~0 2)} call update_channels(); {2318#true} is VALID [2022-02-20 19:24:50,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:24:50,023 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2318#true} {2320#(= ~M_E~0 2)} #10580#return; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:24:50,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {2320#(= ~M_E~0 2)} assume { :begin_inline_init_threads } true; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:24:50,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {2320#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:24:50,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {2320#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:24:50,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {2320#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:24:50,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {2320#(= ~M_E~0 2)} assume { :end_inline_init_threads } true; {2320#(= ~M_E~0 2)} is VALID [2022-02-20 19:24:50,027 INFO L272 TraceCheckUtils]: 12: Hoare triple {2320#(= ~M_E~0 2)} call fire_delta_events(); {2364#(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:24:50,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {2364#(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; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:24:50,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:24:50,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:24:50,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume !(0 == ~E_M~0); {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:24:50,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:24:50,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:24:50,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {2365#(= |old(~M_E~0)| 0)} assume true; {2365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:24:50,032 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2365#(= |old(~M_E~0)| 0)} {2320#(= ~M_E~0 2)} #10582#return; {2319#false} is VALID [2022-02-20 19:24:50,032 INFO L272 TraceCheckUtils]: 21: Hoare triple {2319#false} call activate_threads(); {2366#(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:24:50,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {2366#(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; {2318#true} is VALID [2022-02-20 19:24:50,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {2318#true} assume 1 == ~m_pc~0; {2318#true} is VALID [2022-02-20 19:24:50,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {2318#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {2318#true} is VALID [2022-02-20 19:24:50,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {2318#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {2318#true} is VALID [2022-02-20 19:24:50,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {2318#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {2318#true} is VALID [2022-02-20 19:24:50,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {2318#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {2318#true} is VALID [2022-02-20 19:24:50,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {2318#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; {2318#true} is VALID [2022-02-20 19:24:50,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {2318#true} assume !(1 == ~t1_pc~0); {2318#true} is VALID [2022-02-20 19:24:50,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {2318#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2318#true} is VALID [2022-02-20 19:24:50,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {2318#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {2318#true} is VALID [2022-02-20 19:24:50,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {2318#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {2318#true} is VALID [2022-02-20 19:24:50,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {2318#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {2318#true} is VALID [2022-02-20 19:24:50,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {2318#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; {2318#true} is VALID [2022-02-20 19:24:50,037 INFO L290 TraceCheckUtils]: 35: Hoare triple {2318#true} assume 1 == ~t2_pc~0; {2318#true} is VALID [2022-02-20 19:24:50,037 INFO L290 TraceCheckUtils]: 36: Hoare triple {2318#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {2318#true} is VALID [2022-02-20 19:24:50,037 INFO L290 TraceCheckUtils]: 37: Hoare triple {2318#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {2318#true} is VALID [2022-02-20 19:24:50,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {2318#true} #t~ret34#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___1~0#1 := #t~ret34#1;havoc #t~ret34#1; {2318#true} is VALID [2022-02-20 19:24:50,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {2318#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {2318#true} is VALID [2022-02-20 19:24:50,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:24:50,038 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2318#true} {2319#false} #10584#return; {2319#false} is VALID [2022-02-20 19:24:50,038 INFO L272 TraceCheckUtils]: 42: Hoare triple {2319#false} call reset_delta_events(); {2364#(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:24:50,039 INFO L290 TraceCheckUtils]: 43: Hoare triple {2364#(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; {2318#true} is VALID [2022-02-20 19:24:50,039 INFO L290 TraceCheckUtils]: 44: Hoare triple {2318#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2318#true} is VALID [2022-02-20 19:24:50,039 INFO L290 TraceCheckUtils]: 45: Hoare triple {2318#true} assume !(1 == ~T2_E~0); {2318#true} is VALID [2022-02-20 19:24:50,039 INFO L290 TraceCheckUtils]: 46: Hoare triple {2318#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2318#true} is VALID [2022-02-20 19:24:50,039 INFO L290 TraceCheckUtils]: 47: Hoare triple {2318#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2318#true} is VALID [2022-02-20 19:24:50,039 INFO L290 TraceCheckUtils]: 48: Hoare triple {2318#true} assume 1 == ~E_2~0;~E_2~0 := 2; {2318#true} is VALID [2022-02-20 19:24:50,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:24:50,040 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2318#true} {2319#false} #10586#return; {2319#false} is VALID [2022-02-20 19:24:50,040 INFO L290 TraceCheckUtils]: 51: Hoare triple {2319#false} assume !false; {2319#false} is VALID [2022-02-20 19:24:50,040 INFO L290 TraceCheckUtils]: 52: Hoare triple {2319#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {2319#false} is VALID [2022-02-20 19:24:50,040 INFO L290 TraceCheckUtils]: 53: Hoare triple {2319#false} assume !false; {2319#false} is VALID [2022-02-20 19:24:50,041 INFO L272 TraceCheckUtils]: 54: Hoare triple {2319#false} call eval_#t~ret28#1 := exists_runnable_thread(); {2318#true} is VALID [2022-02-20 19:24:50,041 INFO L290 TraceCheckUtils]: 55: Hoare triple {2318#true} havoc ~__retres1~3; {2318#true} is VALID [2022-02-20 19:24:50,041 INFO L290 TraceCheckUtils]: 56: Hoare triple {2318#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {2318#true} is VALID [2022-02-20 19:24:50,041 INFO L290 TraceCheckUtils]: 57: Hoare triple {2318#true} #res := ~__retres1~3; {2318#true} is VALID [2022-02-20 19:24:50,041 INFO L290 TraceCheckUtils]: 58: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:24:50,043 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2318#true} {2319#false} #10588#return; {2319#false} is VALID [2022-02-20 19:24:50,043 INFO L290 TraceCheckUtils]: 60: Hoare triple {2319#false} assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; {2319#false} is VALID [2022-02-20 19:24:50,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {2319#false} assume 0 != eval_~tmp~0#1; {2319#false} is VALID [2022-02-20 19:24:50,044 INFO L290 TraceCheckUtils]: 62: Hoare triple {2319#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; {2319#false} is VALID [2022-02-20 19:24:50,044 INFO L290 TraceCheckUtils]: 63: Hoare triple {2319#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {2319#false} is VALID [2022-02-20 19:24:50,044 INFO L290 TraceCheckUtils]: 64: Hoare triple {2319#false} assume !(0 == ~m_pc~0); {2319#false} is VALID [2022-02-20 19:24:50,047 INFO L290 TraceCheckUtils]: 65: Hoare triple {2319#false} assume 1 == ~m_pc~0; {2319#false} is VALID [2022-02-20 19:24:50,048 INFO L290 TraceCheckUtils]: 66: Hoare triple {2319#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error } true; {2319#false} is VALID [2022-02-20 19:24:50,048 INFO L290 TraceCheckUtils]: 67: Hoare triple {2319#false} assume !false; {2319#false} is VALID [2022-02-20 19:24:50,049 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:24:50,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:24:50,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576492728] [2022-02-20 19:24:50,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576492728] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:24:50,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:24:50,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:24:50,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429377360] [2022-02-20 19:24:50,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:24:50,057 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:24:50,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:24:50,060 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:24:50,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:24:50,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:24:50,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:24:50,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:24:50,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:24:50,129 INFO L87 Difference]: Start difference. First operand has 2315 states, 2290 states have (on average 1.8572052401746726) internal successors, (4253), 2293 states have internal predecessors, (4253), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:00,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:25:00,349 INFO L93 Difference]: Finished difference Result 4802 states and 8845 transitions. [2022-02-20 19:25:00,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:25:00,349 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:25:00,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:25:00,351 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 8845 transitions. [2022-02-20 19:25:00,433 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:00,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 8845 transitions. [2022-02-20 19:25:00,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 8845 transitions. [2022-02-20 19:25:06,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8845 edges. 8845 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:25:06,482 INFO L225 Difference]: With dead ends: 4802 [2022-02-20 19:25:06,482 INFO L226 Difference]: Without dead ends: 2427 [2022-02-20 19:25:06,491 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:25:06,497 INFO L933 BasicCegarLoop]: 4248 mSDtfsCounter, 4428 mSDsluCounter, 12428 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4437 SdHoareTripleChecker+Valid, 16676 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:25:06,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4437 Valid, 16676 Invalid, 642 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [76 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:25:06,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2022-02-20 19:25:06,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 2364. [2022-02-20 19:25:06,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:25:06,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2427 states. Second operand has 2364 states, 2322 states have (on average 1.8333333333333333) internal successors, (4257), 2325 states have internal predecessors, (4257), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-02-20 19:25:06,626 INFO L74 IsIncluded]: Start isIncluded. First operand 2427 states. Second operand has 2364 states, 2322 states have (on average 1.8333333333333333) internal successors, (4257), 2325 states have internal predecessors, (4257), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-02-20 19:25:06,631 INFO L87 Difference]: Start difference. First operand 2427 states. Second operand has 2364 states, 2322 states have (on average 1.8333333333333333) internal successors, (4257), 2325 states have internal predecessors, (4257), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-02-20 19:25:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:25:06,793 INFO L93 Difference]: Finished difference Result 2427 states and 4414 transitions. [2022-02-20 19:25:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 4414 transitions. [2022-02-20 19:25:06,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:25:06,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:25:06,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 2364 states, 2322 states have (on average 1.8333333333333333) internal successors, (4257), 2325 states have internal predecessors, (4257), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) Second operand 2427 states. [2022-02-20 19:25:06,811 INFO L87 Difference]: Start difference. First operand has 2364 states, 2322 states have (on average 1.8333333333333333) internal successors, (4257), 2325 states have internal predecessors, (4257), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) Second operand 2427 states. [2022-02-20 19:25:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:25:06,972 INFO L93 Difference]: Finished difference Result 2427 states and 4414 transitions. [2022-02-20 19:25:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 4414 transitions. [2022-02-20 19:25:06,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:25:06,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:25:06,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:25:06,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:25:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 2322 states have (on average 1.8333333333333333) internal successors, (4257), 2325 states have internal predecessors, (4257), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2022-02-20 19:25:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 4314 transitions. [2022-02-20 19:25:07,150 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 4314 transitions. Word has length 68 [2022-02-20 19:25:07,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:25:07,151 INFO L470 AbstractCegarLoop]: Abstraction has 2364 states and 4314 transitions. [2022-02-20 19:25:07,152 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:07,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 4314 transitions. [2022-02-20 19:25:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:25:07,154 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:25:07,155 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] [2022-02-20 19:25:07,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:25:07,155 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:25:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:25:07,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1597321137, now seen corresponding path program 1 times [2022-02-20 19:25:07,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:25:07,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848861560] [2022-02-20 19:25:07,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:25:07,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:25:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:07,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:25:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:07,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:25:07,225 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {14657#true} {14659#(= ~T1_E~0 ~M_E~0)} #10580#return; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:07,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:25:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:07,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {14703#(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); {14704#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:25:07,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {14704#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:07,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:07,271 INFO L290 TraceCheckUtils]: 3: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:07,273 INFO L290 TraceCheckUtils]: 4: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:07,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:07,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:07,276 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {14659#(= ~T1_E~0 ~M_E~0)} #10582#return; {14658#false} is VALID [2022-02-20 19:25:07,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:25:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:07,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {14706#(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; {14657#true} is VALID [2022-02-20 19:25:07,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {14657#true} assume 1 == ~m_pc~0; {14657#true} is VALID [2022-02-20 19:25:07,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {14657#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {14657#true} is VALID [2022-02-20 19:25:07,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {14657#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {14657#true} is VALID [2022-02-20 19:25:07,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {14657#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {14657#true} is VALID [2022-02-20 19:25:07,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {14657#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {14657#true} is VALID [2022-02-20 19:25:07,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {14657#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; {14657#true} is VALID [2022-02-20 19:25:07,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {14657#true} assume !(1 == ~t1_pc~0); {14657#true} is VALID [2022-02-20 19:25:07,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {14657#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14657#true} is VALID [2022-02-20 19:25:07,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {14657#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {14657#true} is VALID [2022-02-20 19:25:07,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {14657#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {14657#true} is VALID [2022-02-20 19:25:07,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {14657#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {14657#true} is VALID [2022-02-20 19:25:07,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {14657#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; {14657#true} is VALID [2022-02-20 19:25:07,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {14657#true} assume 1 == ~t2_pc~0; {14657#true} is VALID [2022-02-20 19:25:07,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {14657#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {14657#true} is VALID [2022-02-20 19:25:07,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {14657#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {14657#true} is VALID [2022-02-20 19:25:07,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {14657#true} #t~ret34#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___1~0#1 := #t~ret34#1;havoc #t~ret34#1; {14657#true} is VALID [2022-02-20 19:25:07,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {14657#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {14657#true} is VALID [2022-02-20 19:25:07,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:25:07,295 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {14657#true} {14658#false} #10584#return; {14658#false} is VALID [2022-02-20 19:25:07,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:25:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:07,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {14703#(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); {14657#true} is VALID [2022-02-20 19:25:07,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {14657#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {14657#true} is VALID [2022-02-20 19:25:07,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {14657#true} assume !(1 == ~T2_E~0); {14657#true} is VALID [2022-02-20 19:25:07,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {14657#true} assume 1 == ~E_M~0;~E_M~0 := 2; {14657#true} is VALID [2022-02-20 19:25:07,300 INFO L290 TraceCheckUtils]: 4: Hoare triple {14657#true} assume 1 == ~E_1~0;~E_1~0 := 2; {14657#true} is VALID [2022-02-20 19:25:07,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {14657#true} assume 1 == ~E_2~0;~E_2~0 := 2; {14657#true} is VALID [2022-02-20 19:25:07,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:25:07,301 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14657#true} {14658#false} #10586#return; {14658#false} is VALID [2022-02-20 19:25:07,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:25:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:07,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {14657#true} havoc ~__retres1~3; {14657#true} is VALID [2022-02-20 19:25:07,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {14657#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {14657#true} is VALID [2022-02-20 19:25:07,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {14657#true} #res := ~__retres1~3; {14657#true} is VALID [2022-02-20 19:25:07,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:25:07,304 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14657#true} {14658#false} #10588#return; {14658#false} is VALID [2022-02-20 19:25:07,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {14657#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; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:07,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:07,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#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; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:07,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret36#1, start_simulation_#t~ret37#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; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:07,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} call update_channels(); {14657#true} is VALID [2022-02-20 19:25:07,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:25:07,307 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {14657#true} {14659#(= ~T1_E~0 ~M_E~0)} #10580#return; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:07,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:07,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:07,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:07,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:07,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {14659#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:07,314 INFO L272 TraceCheckUtils]: 12: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} call fire_delta_events(); {14703#(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:25:07,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {14703#(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); {14704#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:25:07,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {14704#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:07,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:07,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:07,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:07,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:07,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:07,317 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14705#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {14659#(= ~T1_E~0 ~M_E~0)} #10582#return; {14658#false} is VALID [2022-02-20 19:25:07,317 INFO L272 TraceCheckUtils]: 21: Hoare triple {14658#false} call activate_threads(); {14706#(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:25:07,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {14706#(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; {14657#true} is VALID [2022-02-20 19:25:07,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {14657#true} assume 1 == ~m_pc~0; {14657#true} is VALID [2022-02-20 19:25:07,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {14657#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {14657#true} is VALID [2022-02-20 19:25:07,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {14657#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {14657#true} is VALID [2022-02-20 19:25:07,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {14657#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {14657#true} is VALID [2022-02-20 19:25:07,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {14657#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {14657#true} is VALID [2022-02-20 19:25:07,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {14657#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; {14657#true} is VALID [2022-02-20 19:25:07,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {14657#true} assume !(1 == ~t1_pc~0); {14657#true} is VALID [2022-02-20 19:25:07,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {14657#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14657#true} is VALID [2022-02-20 19:25:07,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {14657#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {14657#true} is VALID [2022-02-20 19:25:07,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {14657#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {14657#true} is VALID [2022-02-20 19:25:07,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {14657#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {14657#true} is VALID [2022-02-20 19:25:07,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {14657#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; {14657#true} is VALID [2022-02-20 19:25:07,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {14657#true} assume 1 == ~t2_pc~0; {14657#true} is VALID [2022-02-20 19:25:07,320 INFO L290 TraceCheckUtils]: 36: Hoare triple {14657#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {14657#true} is VALID [2022-02-20 19:25:07,320 INFO L290 TraceCheckUtils]: 37: Hoare triple {14657#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {14657#true} is VALID [2022-02-20 19:25:07,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {14657#true} #t~ret34#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___1~0#1 := #t~ret34#1;havoc #t~ret34#1; {14657#true} is VALID [2022-02-20 19:25:07,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {14657#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {14657#true} is VALID [2022-02-20 19:25:07,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:25:07,320 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14657#true} {14658#false} #10584#return; {14658#false} is VALID [2022-02-20 19:25:07,321 INFO L272 TraceCheckUtils]: 42: Hoare triple {14658#false} call reset_delta_events(); {14703#(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:25:07,321 INFO L290 TraceCheckUtils]: 43: Hoare triple {14703#(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); {14657#true} is VALID [2022-02-20 19:25:07,321 INFO L290 TraceCheckUtils]: 44: Hoare triple {14657#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {14657#true} is VALID [2022-02-20 19:25:07,321 INFO L290 TraceCheckUtils]: 45: Hoare triple {14657#true} assume !(1 == ~T2_E~0); {14657#true} is VALID [2022-02-20 19:25:07,321 INFO L290 TraceCheckUtils]: 46: Hoare triple {14657#true} assume 1 == ~E_M~0;~E_M~0 := 2; {14657#true} is VALID [2022-02-20 19:25:07,321 INFO L290 TraceCheckUtils]: 47: Hoare triple {14657#true} assume 1 == ~E_1~0;~E_1~0 := 2; {14657#true} is VALID [2022-02-20 19:25:07,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {14657#true} assume 1 == ~E_2~0;~E_2~0 := 2; {14657#true} is VALID [2022-02-20 19:25:07,322 INFO L290 TraceCheckUtils]: 49: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:25:07,322 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14657#true} {14658#false} #10586#return; {14658#false} is VALID [2022-02-20 19:25:07,325 INFO L290 TraceCheckUtils]: 51: Hoare triple {14658#false} assume !false; {14658#false} is VALID [2022-02-20 19:25:07,325 INFO L290 TraceCheckUtils]: 52: Hoare triple {14658#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {14658#false} is VALID [2022-02-20 19:25:07,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {14658#false} assume !false; {14658#false} is VALID [2022-02-20 19:25:07,325 INFO L272 TraceCheckUtils]: 54: Hoare triple {14658#false} call eval_#t~ret28#1 := exists_runnable_thread(); {14657#true} is VALID [2022-02-20 19:25:07,326 INFO L290 TraceCheckUtils]: 55: Hoare triple {14657#true} havoc ~__retres1~3; {14657#true} is VALID [2022-02-20 19:25:07,326 INFO L290 TraceCheckUtils]: 56: Hoare triple {14657#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {14657#true} is VALID [2022-02-20 19:25:07,326 INFO L290 TraceCheckUtils]: 57: Hoare triple {14657#true} #res := ~__retres1~3; {14657#true} is VALID [2022-02-20 19:25:07,326 INFO L290 TraceCheckUtils]: 58: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:25:07,326 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14657#true} {14658#false} #10588#return; {14658#false} is VALID [2022-02-20 19:25:07,326 INFO L290 TraceCheckUtils]: 60: Hoare triple {14658#false} assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; {14658#false} is VALID [2022-02-20 19:25:07,327 INFO L290 TraceCheckUtils]: 61: Hoare triple {14658#false} assume 0 != eval_~tmp~0#1; {14658#false} is VALID [2022-02-20 19:25:07,327 INFO L290 TraceCheckUtils]: 62: Hoare triple {14658#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; {14658#false} is VALID [2022-02-20 19:25:07,327 INFO L290 TraceCheckUtils]: 63: Hoare triple {14658#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {14658#false} is VALID [2022-02-20 19:25:07,327 INFO L290 TraceCheckUtils]: 64: Hoare triple {14658#false} assume !(0 == ~m_pc~0); {14658#false} is VALID [2022-02-20 19:25:07,327 INFO L290 TraceCheckUtils]: 65: Hoare triple {14658#false} assume 1 == ~m_pc~0; {14658#false} is VALID [2022-02-20 19:25:07,327 INFO L290 TraceCheckUtils]: 66: Hoare triple {14658#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error } true; {14658#false} is VALID [2022-02-20 19:25:07,327 INFO L290 TraceCheckUtils]: 67: Hoare triple {14658#false} assume !false; {14658#false} is VALID [2022-02-20 19:25:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:25:07,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:25:07,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848861560] [2022-02-20 19:25:07,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848861560] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:25:07,329 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:25:07,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:25:07,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668752289] [2022-02-20 19:25:07,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:25:07,332 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:25:07,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:25:07,334 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:07,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:25:07,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:25:07,367 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:25:07,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:25:07,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:25:07,369 INFO L87 Difference]: Start difference. First operand 2364 states and 4314 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:25:17,998 INFO L93 Difference]: Finished difference Result 2807 states and 4974 transitions. [2022-02-20 19:25:17,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:25:17,999 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:25:17,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:25:17,999 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4590 transitions. [2022-02-20 19:25:18,020 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4590 transitions. [2022-02-20 19:25:18,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4590 transitions. [2022-02-20 19:25:20,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4590 edges. 4590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:25:21,155 INFO L225 Difference]: With dead ends: 2807 [2022-02-20 19:25:21,155 INFO L226 Difference]: Without dead ends: 2574 [2022-02-20 19:25:21,156 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:25:21,157 INFO L933 BasicCegarLoop]: 4246 mSDtfsCounter, 4351 mSDsluCounter, 16427 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4360 SdHoareTripleChecker+Valid, 20673 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:25:21,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4360 Valid, 20673 Invalid, 914 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:25:21,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2022-02-20 19:25:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2473. [2022-02-20 19:25:21,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:25:21,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2574 states. Second operand has 2473 states, 2413 states have (on average 1.8188976377952757) internal successors, (4389), 2417 states have internal predecessors, (4389), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:25:21,211 INFO L74 IsIncluded]: Start isIncluded. First operand 2574 states. Second operand has 2473 states, 2413 states have (on average 1.8188976377952757) internal successors, (4389), 2417 states have internal predecessors, (4389), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:25:21,217 INFO L87 Difference]: Start difference. First operand 2574 states. Second operand has 2473 states, 2413 states have (on average 1.8188976377952757) internal successors, (4389), 2417 states have internal predecessors, (4389), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:25:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:25:21,386 INFO L93 Difference]: Finished difference Result 2574 states and 4630 transitions. [2022-02-20 19:25:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 4630 transitions. [2022-02-20 19:25:21,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:25:21,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:25:21,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 2473 states, 2413 states have (on average 1.8188976377952757) internal successors, (4389), 2417 states have internal predecessors, (4389), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) Second operand 2574 states. [2022-02-20 19:25:21,403 INFO L87 Difference]: Start difference. First operand has 2473 states, 2413 states have (on average 1.8188976377952757) internal successors, (4389), 2417 states have internal predecessors, (4389), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) Second operand 2574 states. [2022-02-20 19:25:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:25:21,576 INFO L93 Difference]: Finished difference Result 2574 states and 4630 transitions. [2022-02-20 19:25:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 4630 transitions. [2022-02-20 19:25:21,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:25:21,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:25:21,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:25:21,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:25:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2413 states have (on average 1.8188976377952757) internal successors, (4389), 2417 states have internal predecessors, (4389), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2022-02-20 19:25:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 4470 transitions. [2022-02-20 19:25:21,762 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 4470 transitions. Word has length 68 [2022-02-20 19:25:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:25:21,762 INFO L470 AbstractCegarLoop]: Abstraction has 2473 states and 4470 transitions. [2022-02-20 19:25:21,762 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 4470 transitions. [2022-02-20 19:25:21,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:25:21,763 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:25:21,764 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] [2022-02-20 19:25:21,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:25:21,764 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:25:21,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:25:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash -721302131, now seen corresponding path program 1 times [2022-02-20 19:25:21,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:25:21,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250971195] [2022-02-20 19:25:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:25:21,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:25:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:21,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:25:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:21,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:25:21,792 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {25512#true} {25514#(= ~T2_E~0 ~M_E~0)} #10580#return; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:21,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:25:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:21,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {25558#(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); {25559#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:25:21,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {25559#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {25559#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:25:21,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {25559#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:21,834 INFO L290 TraceCheckUtils]: 3: Hoare triple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:21,835 INFO L290 TraceCheckUtils]: 4: Hoare triple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:21,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:21,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:21,836 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {25514#(= ~T2_E~0 ~M_E~0)} #10582#return; {25513#false} is VALID [2022-02-20 19:25:21,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:25:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:21,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {25561#(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; {25512#true} is VALID [2022-02-20 19:25:21,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {25512#true} assume 1 == ~m_pc~0; {25512#true} is VALID [2022-02-20 19:25:21,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {25512#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {25512#true} is VALID [2022-02-20 19:25:21,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {25512#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {25512#true} is VALID [2022-02-20 19:25:21,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {25512#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {25512#true} is VALID [2022-02-20 19:25:21,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {25512#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {25512#true} is VALID [2022-02-20 19:25:21,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {25512#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; {25512#true} is VALID [2022-02-20 19:25:21,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {25512#true} assume !(1 == ~t1_pc~0); {25512#true} is VALID [2022-02-20 19:25:21,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {25512#true} is_transmit1_triggered_~__retres1~1#1 := 0; {25512#true} is VALID [2022-02-20 19:25:21,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {25512#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {25512#true} is VALID [2022-02-20 19:25:21,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {25512#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {25512#true} is VALID [2022-02-20 19:25:21,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {25512#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {25512#true} is VALID [2022-02-20 19:25:21,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {25512#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; {25512#true} is VALID [2022-02-20 19:25:21,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {25512#true} assume 1 == ~t2_pc~0; {25512#true} is VALID [2022-02-20 19:25:21,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {25512#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {25512#true} is VALID [2022-02-20 19:25:21,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {25512#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {25512#true} is VALID [2022-02-20 19:25:21,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {25512#true} #t~ret34#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___1~0#1 := #t~ret34#1;havoc #t~ret34#1; {25512#true} is VALID [2022-02-20 19:25:21,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {25512#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {25512#true} is VALID [2022-02-20 19:25:21,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:25:21,855 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {25512#true} {25513#false} #10584#return; {25513#false} is VALID [2022-02-20 19:25:21,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:25:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:21,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {25558#(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); {25512#true} is VALID [2022-02-20 19:25:21,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {25512#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {25512#true} is VALID [2022-02-20 19:25:21,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {25512#true} assume !(1 == ~T2_E~0); {25512#true} is VALID [2022-02-20 19:25:21,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {25512#true} assume 1 == ~E_M~0;~E_M~0 := 2; {25512#true} is VALID [2022-02-20 19:25:21,860 INFO L290 TraceCheckUtils]: 4: Hoare triple {25512#true} assume 1 == ~E_1~0;~E_1~0 := 2; {25512#true} is VALID [2022-02-20 19:25:21,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {25512#true} assume 1 == ~E_2~0;~E_2~0 := 2; {25512#true} is VALID [2022-02-20 19:25:21,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:25:21,860 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25512#true} {25513#false} #10586#return; {25513#false} is VALID [2022-02-20 19:25:21,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:25:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:21,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {25512#true} havoc ~__retres1~3; {25512#true} is VALID [2022-02-20 19:25:21,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {25512#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {25512#true} is VALID [2022-02-20 19:25:21,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {25512#true} #res := ~__retres1~3; {25512#true} is VALID [2022-02-20 19:25:21,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:25:21,864 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25512#true} {25513#false} #10588#return; {25513#false} is VALID [2022-02-20 19:25:21,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {25512#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; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:21,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:21,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#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; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:21,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret36#1, start_simulation_#t~ret37#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; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:21,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} call update_channels(); {25512#true} is VALID [2022-02-20 19:25:21,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:25:21,869 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {25512#true} {25514#(= ~T2_E~0 ~M_E~0)} #10580#return; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:21,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:21,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:21,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:21,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:21,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} assume { :end_inline_init_threads } true; {25514#(= ~T2_E~0 ~M_E~0)} is VALID [2022-02-20 19:25:21,871 INFO L272 TraceCheckUtils]: 12: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} call fire_delta_events(); {25558#(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:25:21,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {25558#(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); {25559#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:25:21,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {25559#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {25559#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:25:21,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {25559#(and (= |old(~T2_E~0)| ~T2_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:21,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:21,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:21,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:21,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} assume true; {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:21,875 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {25560#(not (= |old(~T2_E~0)| |old(~M_E~0)|))} {25514#(= ~T2_E~0 ~M_E~0)} #10582#return; {25513#false} is VALID [2022-02-20 19:25:21,875 INFO L272 TraceCheckUtils]: 21: Hoare triple {25513#false} call activate_threads(); {25561#(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:25:21,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {25561#(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; {25512#true} is VALID [2022-02-20 19:25:21,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {25512#true} assume 1 == ~m_pc~0; {25512#true} is VALID [2022-02-20 19:25:21,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {25512#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {25512#true} is VALID [2022-02-20 19:25:21,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {25512#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {25512#true} is VALID [2022-02-20 19:25:21,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {25512#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {25512#true} is VALID [2022-02-20 19:25:21,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {25512#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {25512#true} is VALID [2022-02-20 19:25:21,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {25512#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; {25512#true} is VALID [2022-02-20 19:25:21,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {25512#true} assume !(1 == ~t1_pc~0); {25512#true} is VALID [2022-02-20 19:25:21,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {25512#true} is_transmit1_triggered_~__retres1~1#1 := 0; {25512#true} is VALID [2022-02-20 19:25:21,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {25512#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {25512#true} is VALID [2022-02-20 19:25:21,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {25512#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {25512#true} is VALID [2022-02-20 19:25:21,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {25512#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {25512#true} is VALID [2022-02-20 19:25:21,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {25512#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; {25512#true} is VALID [2022-02-20 19:25:21,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {25512#true} assume 1 == ~t2_pc~0; {25512#true} is VALID [2022-02-20 19:25:21,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {25512#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {25512#true} is VALID [2022-02-20 19:25:21,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {25512#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {25512#true} is VALID [2022-02-20 19:25:21,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {25512#true} #t~ret34#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___1~0#1 := #t~ret34#1;havoc #t~ret34#1; {25512#true} is VALID [2022-02-20 19:25:21,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {25512#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {25512#true} is VALID [2022-02-20 19:25:21,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:25:21,880 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25512#true} {25513#false} #10584#return; {25513#false} is VALID [2022-02-20 19:25:21,880 INFO L272 TraceCheckUtils]: 42: Hoare triple {25513#false} call reset_delta_events(); {25558#(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:25:21,880 INFO L290 TraceCheckUtils]: 43: Hoare triple {25558#(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); {25512#true} is VALID [2022-02-20 19:25:21,880 INFO L290 TraceCheckUtils]: 44: Hoare triple {25512#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {25512#true} is VALID [2022-02-20 19:25:21,880 INFO L290 TraceCheckUtils]: 45: Hoare triple {25512#true} assume !(1 == ~T2_E~0); {25512#true} is VALID [2022-02-20 19:25:21,880 INFO L290 TraceCheckUtils]: 46: Hoare triple {25512#true} assume 1 == ~E_M~0;~E_M~0 := 2; {25512#true} is VALID [2022-02-20 19:25:21,880 INFO L290 TraceCheckUtils]: 47: Hoare triple {25512#true} assume 1 == ~E_1~0;~E_1~0 := 2; {25512#true} is VALID [2022-02-20 19:25:21,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {25512#true} assume 1 == ~E_2~0;~E_2~0 := 2; {25512#true} is VALID [2022-02-20 19:25:21,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:25:21,881 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25512#true} {25513#false} #10586#return; {25513#false} is VALID [2022-02-20 19:25:21,881 INFO L290 TraceCheckUtils]: 51: Hoare triple {25513#false} assume !false; {25513#false} is VALID [2022-02-20 19:25:21,881 INFO L290 TraceCheckUtils]: 52: Hoare triple {25513#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {25513#false} is VALID [2022-02-20 19:25:21,881 INFO L290 TraceCheckUtils]: 53: Hoare triple {25513#false} assume !false; {25513#false} is VALID [2022-02-20 19:25:21,881 INFO L272 TraceCheckUtils]: 54: Hoare triple {25513#false} call eval_#t~ret28#1 := exists_runnable_thread(); {25512#true} is VALID [2022-02-20 19:25:21,881 INFO L290 TraceCheckUtils]: 55: Hoare triple {25512#true} havoc ~__retres1~3; {25512#true} is VALID [2022-02-20 19:25:21,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {25512#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {25512#true} is VALID [2022-02-20 19:25:21,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {25512#true} #res := ~__retres1~3; {25512#true} is VALID [2022-02-20 19:25:21,882 INFO L290 TraceCheckUtils]: 58: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:25:21,882 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25512#true} {25513#false} #10588#return; {25513#false} is VALID [2022-02-20 19:25:21,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {25513#false} assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; {25513#false} is VALID [2022-02-20 19:25:21,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {25513#false} assume 0 != eval_~tmp~0#1; {25513#false} is VALID [2022-02-20 19:25:21,882 INFO L290 TraceCheckUtils]: 62: Hoare triple {25513#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; {25513#false} is VALID [2022-02-20 19:25:21,882 INFO L290 TraceCheckUtils]: 63: Hoare triple {25513#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {25513#false} is VALID [2022-02-20 19:25:21,883 INFO L290 TraceCheckUtils]: 64: Hoare triple {25513#false} assume !(0 == ~m_pc~0); {25513#false} is VALID [2022-02-20 19:25:21,883 INFO L290 TraceCheckUtils]: 65: Hoare triple {25513#false} assume 1 == ~m_pc~0; {25513#false} is VALID [2022-02-20 19:25:21,883 INFO L290 TraceCheckUtils]: 66: Hoare triple {25513#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error } true; {25513#false} is VALID [2022-02-20 19:25:21,883 INFO L290 TraceCheckUtils]: 67: Hoare triple {25513#false} assume !false; {25513#false} is VALID [2022-02-20 19:25:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:25:21,887 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:25:21,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250971195] [2022-02-20 19:25:21,887 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250971195] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:25:21,888 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:25:21,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:25:21,888 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306167551] [2022-02-20 19:25:21,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:25:21,889 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:25:21,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:25:21,890 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:21,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:25:21,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:25:21,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:25:21,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:25:21,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:25:21,930 INFO L87 Difference]: Start difference. First operand 2473 states and 4470 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:25:32,131 INFO L93 Difference]: Finished difference Result 3193 states and 5538 transitions. [2022-02-20 19:25:32,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:25:32,131 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:25:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:25:32,131 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4595 transitions. [2022-02-20 19:25:32,149 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4595 transitions. [2022-02-20 19:25:32,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4595 transitions. [2022-02-20 19:25:35,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4595 edges. 4595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:25:35,310 INFO L225 Difference]: With dead ends: 3193 [2022-02-20 19:25:35,311 INFO L226 Difference]: Without dead ends: 2851 [2022-02-20 19:25:35,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:25:35,312 INFO L933 BasicCegarLoop]: 4169 mSDtfsCounter, 4383 mSDsluCounter, 16249 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4392 SdHoareTripleChecker+Valid, 20418 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:25:35,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4392 Valid, 20418 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:25:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2022-02-20 19:25:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2692. [2022-02-20 19:25:35,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:25:35,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2851 states. Second operand has 2692 states, 2596 states have (on average 1.7927580893682589) internal successors, (4654), 2602 states have internal predecessors, (4654), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:25:35,365 INFO L74 IsIncluded]: Start isIncluded. First operand 2851 states. Second operand has 2692 states, 2596 states have (on average 1.7927580893682589) internal successors, (4654), 2602 states have internal predecessors, (4654), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:25:35,370 INFO L87 Difference]: Start difference. First operand 2851 states. Second operand has 2692 states, 2596 states have (on average 1.7927580893682589) internal successors, (4654), 2602 states have internal predecessors, (4654), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:25:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:25:35,578 INFO L93 Difference]: Finished difference Result 2851 states and 5035 transitions. [2022-02-20 19:25:35,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 5035 transitions. [2022-02-20 19:25:35,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:25:35,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:25:35,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 2692 states, 2596 states have (on average 1.7927580893682589) internal successors, (4654), 2602 states have internal predecessors, (4654), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) Second operand 2851 states. [2022-02-20 19:25:35,596 INFO L87 Difference]: Start difference. First operand has 2692 states, 2596 states have (on average 1.7927580893682589) internal successors, (4654), 2602 states have internal predecessors, (4654), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) Second operand 2851 states. [2022-02-20 19:25:35,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:25:35,799 INFO L93 Difference]: Finished difference Result 2851 states and 5035 transitions. [2022-02-20 19:25:35,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 5035 transitions. [2022-02-20 19:25:35,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:25:35,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:25:35,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:25:35,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:25:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 2596 states have (on average 1.7927580893682589) internal successors, (4654), 2602 states have internal predecessors, (4654), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:25:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 4787 transitions. [2022-02-20 19:25:36,011 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 4787 transitions. Word has length 68 [2022-02-20 19:25:36,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:25:36,011 INFO L470 AbstractCegarLoop]: Abstraction has 2692 states and 4787 transitions. [2022-02-20 19:25:36,011 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:36,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 4787 transitions. [2022-02-20 19:25:36,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:25:36,013 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:25:36,013 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] [2022-02-20 19:25:36,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:25:36,014 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:25:36,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:25:36,014 INFO L85 PathProgramCache]: Analyzing trace with hash -277401457, now seen corresponding path program 1 times [2022-02-20 19:25:36,014 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:25:36,014 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626544208] [2022-02-20 19:25:36,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:25:36,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:25:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:36,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:25:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:36,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {37719#true} assume true; {37719#true} is VALID [2022-02-20 19:25:36,064 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {37719#true} {37721#(= ~E_1~0 ~M_E~0)} #10580#return; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:25:36,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:25:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:36,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {37765#(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); {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:25:36,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:25:36,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:25:36,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:25:36,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:36,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:36,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:36,097 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {37721#(= ~E_1~0 ~M_E~0)} #10582#return; {37720#false} is VALID [2022-02-20 19:25:36,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:25:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:36,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {37768#(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; {37719#true} is VALID [2022-02-20 19:25:36,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {37719#true} assume 1 == ~m_pc~0; {37719#true} is VALID [2022-02-20 19:25:36,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {37719#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {37719#true} is VALID [2022-02-20 19:25:36,115 INFO L290 TraceCheckUtils]: 3: Hoare triple {37719#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {37719#true} is VALID [2022-02-20 19:25:36,115 INFO L290 TraceCheckUtils]: 4: Hoare triple {37719#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {37719#true} is VALID [2022-02-20 19:25:36,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {37719#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {37719#true} is VALID [2022-02-20 19:25:36,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {37719#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; {37719#true} is VALID [2022-02-20 19:25:36,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {37719#true} assume !(1 == ~t1_pc~0); {37719#true} is VALID [2022-02-20 19:25:36,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {37719#true} is_transmit1_triggered_~__retres1~1#1 := 0; {37719#true} is VALID [2022-02-20 19:25:36,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {37719#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {37719#true} is VALID [2022-02-20 19:25:36,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {37719#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {37719#true} is VALID [2022-02-20 19:25:36,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {37719#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {37719#true} is VALID [2022-02-20 19:25:36,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {37719#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; {37719#true} is VALID [2022-02-20 19:25:36,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {37719#true} assume 1 == ~t2_pc~0; {37719#true} is VALID [2022-02-20 19:25:36,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {37719#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {37719#true} is VALID [2022-02-20 19:25:36,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {37719#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {37719#true} is VALID [2022-02-20 19:25:36,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {37719#true} #t~ret34#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___1~0#1 := #t~ret34#1;havoc #t~ret34#1; {37719#true} is VALID [2022-02-20 19:25:36,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {37719#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {37719#true} is VALID [2022-02-20 19:25:36,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {37719#true} assume true; {37719#true} is VALID [2022-02-20 19:25:36,117 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {37719#true} {37720#false} #10584#return; {37720#false} is VALID [2022-02-20 19:25:36,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:25:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:36,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {37765#(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); {37719#true} is VALID [2022-02-20 19:25:36,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {37719#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {37719#true} is VALID [2022-02-20 19:25:36,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {37719#true} assume !(1 == ~T2_E~0); {37719#true} is VALID [2022-02-20 19:25:36,126 INFO L290 TraceCheckUtils]: 3: Hoare triple {37719#true} assume 1 == ~E_M~0;~E_M~0 := 2; {37719#true} is VALID [2022-02-20 19:25:36,126 INFO L290 TraceCheckUtils]: 4: Hoare triple {37719#true} assume 1 == ~E_1~0;~E_1~0 := 2; {37719#true} is VALID [2022-02-20 19:25:36,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {37719#true} assume 1 == ~E_2~0;~E_2~0 := 2; {37719#true} is VALID [2022-02-20 19:25:36,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {37719#true} assume true; {37719#true} is VALID [2022-02-20 19:25:36,127 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {37719#true} {37720#false} #10586#return; {37720#false} is VALID [2022-02-20 19:25:36,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:25:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:36,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {37719#true} havoc ~__retres1~3; {37719#true} is VALID [2022-02-20 19:25:36,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {37719#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {37719#true} is VALID [2022-02-20 19:25:36,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {37719#true} #res := ~__retres1~3; {37719#true} is VALID [2022-02-20 19:25:36,138 INFO L290 TraceCheckUtils]: 3: Hoare triple {37719#true} assume true; {37719#true} is VALID [2022-02-20 19:25:36,139 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37719#true} {37720#false} #10588#return; {37720#false} is VALID [2022-02-20 19:25:36,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {37719#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; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:25:36,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:25:36,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#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; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:25:36,141 INFO L290 TraceCheckUtils]: 3: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret36#1, start_simulation_#t~ret37#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; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:25:36,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} call update_channels(); {37719#true} is VALID [2022-02-20 19:25:36,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {37719#true} assume true; {37719#true} is VALID [2022-02-20 19:25:36,144 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {37719#true} {37721#(= ~E_1~0 ~M_E~0)} #10580#return; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:25:36,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} assume { :begin_inline_init_threads } true; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:25:36,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:25:36,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:25:36,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:25:36,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_threads } true; {37721#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:25:36,148 INFO L272 TraceCheckUtils]: 12: Hoare triple {37721#(= ~E_1~0 ~M_E~0)} call fire_delta_events(); {37765#(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:25:36,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {37765#(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); {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:25:36,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:25:36,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T2_E~0); {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:25:36,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:25:36,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {37766#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:36,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:36,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:25:36,151 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37767#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {37721#(= ~E_1~0 ~M_E~0)} #10582#return; {37720#false} is VALID [2022-02-20 19:25:36,151 INFO L272 TraceCheckUtils]: 21: Hoare triple {37720#false} call activate_threads(); {37768#(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:25:36,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {37768#(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; {37719#true} is VALID [2022-02-20 19:25:36,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {37719#true} assume 1 == ~m_pc~0; {37719#true} is VALID [2022-02-20 19:25:36,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {37719#true} assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; {37719#true} is VALID [2022-02-20 19:25:36,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {37719#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; {37719#true} is VALID [2022-02-20 19:25:36,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {37719#true} #t~ret32#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret32#1 && #t~ret32#1 <= 2147483647;~tmp~1#1 := #t~ret32#1;havoc #t~ret32#1; {37719#true} is VALID [2022-02-20 19:25:36,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {37719#true} assume 0 != ~tmp~1#1;~m_st~0 := 0; {37719#true} is VALID [2022-02-20 19:25:36,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {37719#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; {37719#true} is VALID [2022-02-20 19:25:36,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {37719#true} assume !(1 == ~t1_pc~0); {37719#true} is VALID [2022-02-20 19:25:36,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {37719#true} is_transmit1_triggered_~__retres1~1#1 := 0; {37719#true} is VALID [2022-02-20 19:25:36,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {37719#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; {37719#true} is VALID [2022-02-20 19:25:36,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {37719#true} #t~ret33#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647;~tmp___0~0#1 := #t~ret33#1;havoc #t~ret33#1; {37719#true} is VALID [2022-02-20 19:25:36,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {37719#true} assume 0 != ~tmp___0~0#1;~t1_st~0 := 0; {37719#true} is VALID [2022-02-20 19:25:36,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {37719#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; {37719#true} is VALID [2022-02-20 19:25:36,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {37719#true} assume 1 == ~t2_pc~0; {37719#true} is VALID [2022-02-20 19:25:36,153 INFO L290 TraceCheckUtils]: 36: Hoare triple {37719#true} assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; {37719#true} is VALID [2022-02-20 19:25:36,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {37719#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; {37719#true} is VALID [2022-02-20 19:25:36,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {37719#true} #t~ret34#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret34#1 && #t~ret34#1 <= 2147483647;~tmp___1~0#1 := #t~ret34#1;havoc #t~ret34#1; {37719#true} is VALID [2022-02-20 19:25:36,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {37719#true} assume 0 != ~tmp___1~0#1;~t2_st~0 := 0; {37719#true} is VALID [2022-02-20 19:25:36,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {37719#true} assume true; {37719#true} is VALID [2022-02-20 19:25:36,154 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37719#true} {37720#false} #10584#return; {37720#false} is VALID [2022-02-20 19:25:36,154 INFO L272 TraceCheckUtils]: 42: Hoare triple {37720#false} call reset_delta_events(); {37765#(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:25:36,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {37765#(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); {37719#true} is VALID [2022-02-20 19:25:36,154 INFO L290 TraceCheckUtils]: 44: Hoare triple {37719#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {37719#true} is VALID [2022-02-20 19:25:36,154 INFO L290 TraceCheckUtils]: 45: Hoare triple {37719#true} assume !(1 == ~T2_E~0); {37719#true} is VALID [2022-02-20 19:25:36,156 INFO L290 TraceCheckUtils]: 46: Hoare triple {37719#true} assume 1 == ~E_M~0;~E_M~0 := 2; {37719#true} is VALID [2022-02-20 19:25:36,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {37719#true} assume 1 == ~E_1~0;~E_1~0 := 2; {37719#true} is VALID [2022-02-20 19:25:36,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {37719#true} assume 1 == ~E_2~0;~E_2~0 := 2; {37719#true} is VALID [2022-02-20 19:25:36,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {37719#true} assume true; {37719#true} is VALID [2022-02-20 19:25:36,156 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {37719#true} {37720#false} #10586#return; {37720#false} is VALID [2022-02-20 19:25:36,156 INFO L290 TraceCheckUtils]: 51: Hoare triple {37720#false} assume !false; {37720#false} is VALID [2022-02-20 19:25:36,156 INFO L290 TraceCheckUtils]: 52: Hoare triple {37720#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret28#1, eval_#t~nondet29#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet30#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet31#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; {37720#false} is VALID [2022-02-20 19:25:36,156 INFO L290 TraceCheckUtils]: 53: Hoare triple {37720#false} assume !false; {37720#false} is VALID [2022-02-20 19:25:36,157 INFO L272 TraceCheckUtils]: 54: Hoare triple {37720#false} call eval_#t~ret28#1 := exists_runnable_thread(); {37719#true} is VALID [2022-02-20 19:25:36,157 INFO L290 TraceCheckUtils]: 55: Hoare triple {37719#true} havoc ~__retres1~3; {37719#true} is VALID [2022-02-20 19:25:36,157 INFO L290 TraceCheckUtils]: 56: Hoare triple {37719#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {37719#true} is VALID [2022-02-20 19:25:36,158 INFO L290 TraceCheckUtils]: 57: Hoare triple {37719#true} #res := ~__retres1~3; {37719#true} is VALID [2022-02-20 19:25:36,158 INFO L290 TraceCheckUtils]: 58: Hoare triple {37719#true} assume true; {37719#true} is VALID [2022-02-20 19:25:36,158 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {37719#true} {37720#false} #10588#return; {37720#false} is VALID [2022-02-20 19:25:36,158 INFO L290 TraceCheckUtils]: 60: Hoare triple {37720#false} assume -2147483648 <= eval_#t~ret28#1 && eval_#t~ret28#1 <= 2147483647;eval_~tmp~0#1 := eval_#t~ret28#1;havoc eval_#t~ret28#1; {37720#false} is VALID [2022-02-20 19:25:36,158 INFO L290 TraceCheckUtils]: 61: Hoare triple {37720#false} assume 0 != eval_~tmp~0#1; {37720#false} is VALID [2022-02-20 19:25:36,158 INFO L290 TraceCheckUtils]: 62: Hoare triple {37720#false} assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;assume -2147483648 <= eval_#t~nondet29#1 && eval_#t~nondet29#1 <= 2147483647;eval_~tmp_ndt_1~0#1 := eval_#t~nondet29#1;havoc eval_#t~nondet29#1; {37720#false} is VALID [2022-02-20 19:25:36,158 INFO L290 TraceCheckUtils]: 63: Hoare triple {37720#false} assume 0 != eval_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet27#1; {37720#false} is VALID [2022-02-20 19:25:36,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {37720#false} assume !(0 == ~m_pc~0); {37720#false} is VALID [2022-02-20 19:25:36,158 INFO L290 TraceCheckUtils]: 65: Hoare triple {37720#false} assume 1 == ~m_pc~0; {37720#false} is VALID [2022-02-20 19:25:36,159 INFO L290 TraceCheckUtils]: 66: Hoare triple {37720#false} assume ~token~0 != 2 + ~local~0;assume { :begin_inline_error } true; {37720#false} is VALID [2022-02-20 19:25:36,159 INFO L290 TraceCheckUtils]: 67: Hoare triple {37720#false} assume !false; {37720#false} is VALID [2022-02-20 19:25:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:25:36,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:25:36,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626544208] [2022-02-20 19:25:36,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626544208] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:25:36,160 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:25:36,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:25:36,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338233299] [2022-02-20 19:25:36,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:25:36,161 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-02-20 19:25:36,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:25:36,162 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:25:36,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:25:36,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:25:36,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:25:36,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:25:36,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:25:36,203 INFO L87 Difference]: Start difference. First operand 2692 states and 4787 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)