./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label48+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_label48+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 abf153d7504404447837d5448d411c139d9bf5ab64e9e6700e63ddfa19d4209f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:25:34,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:25:34,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:25:34,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:25:34,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:25:34,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:25:34,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:25:34,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:25:34,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:25:34,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:25:34,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:25:34,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:25:34,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:25:34,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:25:34,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:25:34,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:25:34,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:25:34,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:25:34,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:25:34,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:25:34,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:25:34,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:25:34,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:25:34,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:25:35,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:25:35,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:25:35,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:25:35,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:25:35,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:25:35,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:25:35,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:25:35,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:25:35,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:25:35,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:25:35,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:25:35,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:25:35,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:25:35,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:25:35,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:25:35,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:25:35,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:25:35,014 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:25:35,041 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:25:35,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:25:35,042 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:25:35,042 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:25:35,043 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:25:35,043 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:25:35,043 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:25:35,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:25:35,044 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:25:35,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:25:35,045 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:25:35,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:25:35,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:25:35,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:25:35,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:25:35,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:25:35,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:25:35,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:25:35,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:25:35,046 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:25:35,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:25:35,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:25:35,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:25:35,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:25:35,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:25:35,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:25:35,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:25:35,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:25:35,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:25:35,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:25:35,049 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:25:35,049 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:25:35,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:25:35,049 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 -> abf153d7504404447837d5448d411c139d9bf5ab64e9e6700e63ddfa19d4209f [2022-02-20 19:25:35,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:25:35,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:25:35,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:25:35,282 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:25:35,283 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:25:35,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label48+token_ring.02.cil-1.c [2022-02-20 19:25:35,347 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92cc5b7f/a78fd2df693e4c4182960fd4edb19ea7/FLAG1256c61cc [2022-02-20 19:25:36,243 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:25:36,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.02.cil-1.c [2022-02-20 19:25:36,291 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92cc5b7f/a78fd2df693e4c4182960fd4edb19ea7/FLAG1256c61cc [2022-02-20 19:25:36,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b92cc5b7f/a78fd2df693e4c4182960fd4edb19ea7 [2022-02-20 19:25:36,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:25:36,700 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:25:36,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:25:36,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:25:36,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:25:36,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:25:36" (1/1) ... [2022-02-20 19:25:36,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c94a42e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:36, skipping insertion in model container [2022-02-20 19:25:36,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:25:36" (1/1) ... [2022-02-20 19:25:36,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:25:36,899 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:25:38,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.02.cil-1.c[375709,375722] [2022-02-20 19:25:38,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.02.cil-1.c[383339,383352] [2022-02-20 19:25:38,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:25:38,768 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:25:39,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.02.cil-1.c[375709,375722] [2022-02-20 19:25:39,594 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.02.cil-1.c[383339,383352] [2022-02-20 19:25:39,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:25:39,663 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:25:39,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:39 WrapperNode [2022-02-20 19:25:39,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:25:39,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:25:39,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:25:39,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:25:39,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:39" (1/1) ... [2022-02-20 19:25:39,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:39" (1/1) ... [2022-02-20 19:25:40,315 INFO L137 Inliner]: procedures = 48, calls = 47, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 12619 [2022-02-20 19:25:40,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:25:40,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:25:40,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:25:40,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:25:40,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:39" (1/1) ... [2022-02-20 19:25:40,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:39" (1/1) ... [2022-02-20 19:25:40,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:39" (1/1) ... [2022-02-20 19:25:40,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:39" (1/1) ... [2022-02-20 19:25:40,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:39" (1/1) ... [2022-02-20 19:25:40,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:39" (1/1) ... [2022-02-20 19:25:40,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:39" (1/1) ... [2022-02-20 19:25:40,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:25:40,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:25:40,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:25:40,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:25:40,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:39" (1/1) ... [2022-02-20 19:25:40,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:25:40,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:25:40,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:25:40,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:25:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:25:40,762 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-02-20 19:25:40,762 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-02-20 19:25:40,762 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-02-20 19:25:40,762 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-02-20 19:25:40,762 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:25:40,762 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:25:40,762 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-02-20 19:25:40,763 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-02-20 19:25:40,763 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-02-20 19:25:40,763 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-02-20 19:25:40,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:25:40,763 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-02-20 19:25:40,763 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-02-20 19:25:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:25:40,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:25:40,905 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:25:40,906 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:25:47,138 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:25:47,168 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:25:47,168 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 19:25:47,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:25:47 BoogieIcfgContainer [2022-02-20 19:25:47,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:25:47,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:25:47,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:25:47,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:25:47,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:25:36" (1/3) ... [2022-02-20 19:25:47,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e755c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:25:47, skipping insertion in model container [2022-02-20 19:25:47,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:25:39" (2/3) ... [2022-02-20 19:25:47,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e755c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:25:47, skipping insertion in model container [2022-02-20 19:25:47,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:25:47" (3/3) ... [2022-02-20 19:25:47,180 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label48+token_ring.02.cil-1.c [2022-02-20 19:25:47,188 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:25:47,189 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:25:47,254 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:25:47,263 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:25:47,263 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:25:47,328 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:25:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:25:47,336 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:25:47,337 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:47,338 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:25:47,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:25:47,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1170312139, now seen corresponding path program 1 times [2022-02-20 19:25:47,350 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:25:47,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359817434] [2022-02-20 19:25:47,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:25:47,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:25:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:47,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:25:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:47,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:25:47,553 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:25:47,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:25:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:47,591 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:25:47,592 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:25:47,592 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:25:47,592 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:25:47,593 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:25:47,593 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:25:47,594 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:25:47,595 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:25:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:25:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:47,640 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:25:47,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {2318#true} assume 1 == ~m_pc~0; {2318#true} is VALID [2022-02-20 19:25:47,640 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:25:47,641 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:25:47,641 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:25:47,641 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:25:47,641 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:25:47,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {2318#true} assume !(1 == ~t1_pc~0); {2318#true} is VALID [2022-02-20 19:25:47,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {2318#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2318#true} is VALID [2022-02-20 19:25:47,643 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:25:47,643 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:25:47,644 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:25:47,645 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:25:47,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {2318#true} assume 1 == ~t2_pc~0; {2318#true} is VALID [2022-02-20 19:25:47,645 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:25:47,645 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:25:47,646 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:25:47,646 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:25:47,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:25:47,646 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2318#true} {2319#false} #10584#return; {2319#false} is VALID [2022-02-20 19:25:47,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:25:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:47,677 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:25:47,678 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:25:47,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {2318#true} assume !(1 == ~T2_E~0); {2318#true} is VALID [2022-02-20 19:25:47,678 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:25:47,678 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:25:47,679 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:25:47,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:25:47,679 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2318#true} {2319#false} #10586#return; {2319#false} is VALID [2022-02-20 19:25:47,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:25:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:25:47,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {2318#true} havoc ~__retres1~3; {2318#true} is VALID [2022-02-20 19:25:47,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {2318#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {2318#true} is VALID [2022-02-20 19:25:47,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {2318#true} #res := ~__retres1~3; {2318#true} is VALID [2022-02-20 19:25:47,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:25:47,689 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2318#true} {2319#false} #10588#return; {2319#false} is VALID [2022-02-20 19:25:47,693 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:25:47,695 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:25:47,696 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:25:47,697 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:25:47,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {2320#(= ~M_E~0 2)} call update_channels(); {2318#true} is VALID [2022-02-20 19:25:47,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:25:47,700 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:25:47,701 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:25:47,702 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:25:47,702 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:25:47,704 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:25:47,705 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:25:47,706 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:25:47,708 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:25:47,709 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:25:47,709 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:25:47,710 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:25:47,711 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:25:47,712 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:25:47,712 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:25:47,713 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:25:47,714 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:25:47,715 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:25:47,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {2318#true} assume 1 == ~m_pc~0; {2318#true} is VALID [2022-02-20 19:25:47,715 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:25:47,715 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:25:47,716 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:25:47,716 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:25:47,716 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:25:47,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {2318#true} assume !(1 == ~t1_pc~0); {2318#true} is VALID [2022-02-20 19:25:47,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {2318#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2318#true} is VALID [2022-02-20 19:25:47,717 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:25:47,718 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:25:47,718 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:25:47,718 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:25:47,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {2318#true} assume 1 == ~t2_pc~0; {2318#true} is VALID [2022-02-20 19:25:47,719 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:25:47,719 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:25:47,719 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:25:47,719 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:25:47,720 INFO L290 TraceCheckUtils]: 40: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:25:47,720 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2318#true} {2319#false} #10584#return; {2319#false} is VALID [2022-02-20 19:25:47,720 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:25:47,720 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:25:47,721 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:25:47,721 INFO L290 TraceCheckUtils]: 45: Hoare triple {2318#true} assume !(1 == ~T2_E~0); {2318#true} is VALID [2022-02-20 19:25:47,721 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:25:47,721 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:25:47,721 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:25:47,722 INFO L290 TraceCheckUtils]: 49: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:25:47,722 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2318#true} {2319#false} #10586#return; {2319#false} is VALID [2022-02-20 19:25:47,722 INFO L290 TraceCheckUtils]: 51: Hoare triple {2319#false} assume !false; {2319#false} is VALID [2022-02-20 19:25:47,722 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:25:47,723 INFO L290 TraceCheckUtils]: 53: Hoare triple {2319#false} assume !false; {2319#false} is VALID [2022-02-20 19:25:47,723 INFO L272 TraceCheckUtils]: 54: Hoare triple {2319#false} call eval_#t~ret28#1 := exists_runnable_thread(); {2318#true} is VALID [2022-02-20 19:25:47,723 INFO L290 TraceCheckUtils]: 55: Hoare triple {2318#true} havoc ~__retres1~3; {2318#true} is VALID [2022-02-20 19:25:47,723 INFO L290 TraceCheckUtils]: 56: Hoare triple {2318#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {2318#true} is VALID [2022-02-20 19:25:47,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {2318#true} #res := ~__retres1~3; {2318#true} is VALID [2022-02-20 19:25:47,724 INFO L290 TraceCheckUtils]: 58: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:25:47,726 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2318#true} {2319#false} #10588#return; {2319#false} is VALID [2022-02-20 19:25:47,726 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:25:47,727 INFO L290 TraceCheckUtils]: 61: Hoare triple {2319#false} assume 0 != eval_~tmp~0#1; {2319#false} is VALID [2022-02-20 19:25:47,727 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:25:47,727 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:25:47,727 INFO L290 TraceCheckUtils]: 64: Hoare triple {2319#false} assume !(0 == ~m_pc~0); {2319#false} is VALID [2022-02-20 19:25:47,732 INFO L290 TraceCheckUtils]: 65: Hoare triple {2319#false} assume 1 == ~m_pc~0; {2319#false} is VALID [2022-02-20 19:25:47,732 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:25:47,733 INFO L290 TraceCheckUtils]: 67: Hoare triple {2319#false} assume !false; {2319#false} is VALID [2022-02-20 19:25:47,733 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:47,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:25:47,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359817434] [2022-02-20 19:25:47,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359817434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:25:47,736 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:25:47,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:25:47,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109320134] [2022-02-20 19:25:47,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:25:47,742 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:47,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:25:47,747 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:25:47,815 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:47,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:25:47,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:25:47,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:25:47,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:25:47,848 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:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:25:59,479 INFO L93 Difference]: Finished difference Result 4802 states and 8845 transitions. [2022-02-20 19:25:59,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:25:59,480 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:59,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:25:59,481 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:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 8845 transitions. [2022-02-20 19:25:59,573 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:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 8845 transitions. [2022-02-20 19:25:59,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 8845 transitions. [2022-02-20 19:26:06,161 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:26:06,825 INFO L225 Difference]: With dead ends: 4802 [2022-02-20 19:26:06,826 INFO L226 Difference]: Without dead ends: 2427 [2022-02-20 19:26:06,836 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:26:06,842 INFO L933 BasicCegarLoop]: 4248 mSDtfsCounter, 4428 mSDsluCounter, 12428 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:26:06,843 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.7s Time] [2022-02-20 19:26:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2022-02-20 19:26:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 2364. [2022-02-20 19:26:06,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:26:07,007 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:26:07,016 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:26:07,023 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:26:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:26:07,284 INFO L93 Difference]: Finished difference Result 2427 states and 4414 transitions. [2022-02-20 19:26:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 4414 transitions. [2022-02-20 19:26:07,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:26:07,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:26:07,304 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:26:07,311 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:26:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:26:07,573 INFO L93 Difference]: Finished difference Result 2427 states and 4414 transitions. [2022-02-20 19:26:07,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 4414 transitions. [2022-02-20 19:26:07,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:26:07,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:26:07,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:26:07,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:26:07,588 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:26:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 4314 transitions. [2022-02-20 19:26:07,865 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 4314 transitions. Word has length 68 [2022-02-20 19:26:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:26:07,865 INFO L470 AbstractCegarLoop]: Abstraction has 2364 states and 4314 transitions. [2022-02-20 19:26:07,866 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:26:07,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 4314 transitions. [2022-02-20 19:26:07,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:26:07,868 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:26:07,868 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:26:07,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:26:07,868 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:26:07,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:26:07,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1597321137, now seen corresponding path program 1 times [2022-02-20 19:26:07,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:26:07,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217143264] [2022-02-20 19:26:07,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:26:07,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:26:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:07,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:26:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:07,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:26:07,962 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:26:07,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:26:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:08,010 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:26:08,012 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:26:08,013 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:26:08,021 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:26:08,025 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:26:08,029 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:26:08,029 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:26:08,030 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:26:08,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:26:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:08,058 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:26:08,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {14657#true} assume 1 == ~m_pc~0; {14657#true} is VALID [2022-02-20 19:26:08,058 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:26:08,059 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:26:08,059 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:26:08,059 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:26:08,059 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:26:08,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {14657#true} assume !(1 == ~t1_pc~0); {14657#true} is VALID [2022-02-20 19:26:08,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {14657#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14657#true} is VALID [2022-02-20 19:26:08,060 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:26:08,060 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:26:08,060 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:26:08,060 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:26:08,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {14657#true} assume 1 == ~t2_pc~0; {14657#true} is VALID [2022-02-20 19:26:08,061 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:26:08,061 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:26:08,061 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:26:08,061 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:26:08,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:26:08,062 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {14657#true} {14658#false} #10584#return; {14658#false} is VALID [2022-02-20 19:26:08,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:26:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:08,068 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:26:08,069 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:26:08,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {14657#true} assume !(1 == ~T2_E~0); {14657#true} is VALID [2022-02-20 19:26:08,069 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:26:08,069 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:26:08,069 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:26:08,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:26:08,070 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14657#true} {14658#false} #10586#return; {14658#false} is VALID [2022-02-20 19:26:08,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:26:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:08,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {14657#true} havoc ~__retres1~3; {14657#true} is VALID [2022-02-20 19:26:08,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {14657#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {14657#true} is VALID [2022-02-20 19:26:08,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {14657#true} #res := ~__retres1~3; {14657#true} is VALID [2022-02-20 19:26:08,075 INFO L290 TraceCheckUtils]: 3: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:26:08,075 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14657#true} {14658#false} #10588#return; {14658#false} is VALID [2022-02-20 19:26:08,076 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:26:08,076 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:26:08,077 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:26:08,077 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:26:08,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} call update_channels(); {14657#true} is VALID [2022-02-20 19:26:08,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:26:08,078 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:26:08,079 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:26:08,079 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:26:08,079 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:26:08,080 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:26:08,080 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:26:08,081 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:26:08,081 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:26:08,082 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:26:08,082 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:26:08,083 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:26:08,083 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:26:08,084 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:26:08,084 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:26:08,084 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:26:08,085 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:26:08,085 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:26:08,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {14657#true} assume 1 == ~m_pc~0; {14657#true} is VALID [2022-02-20 19:26:08,085 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:26:08,085 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:26:08,086 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:26:08,086 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:26:08,086 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:26:08,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {14657#true} assume !(1 == ~t1_pc~0); {14657#true} is VALID [2022-02-20 19:26:08,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {14657#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14657#true} is VALID [2022-02-20 19:26:08,087 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:26:08,087 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:26:08,087 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:26:08,087 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:26:08,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {14657#true} assume 1 == ~t2_pc~0; {14657#true} is VALID [2022-02-20 19:26:08,088 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:26:08,088 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:26:08,088 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:26:08,088 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:26:08,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:26:08,089 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14657#true} {14658#false} #10584#return; {14658#false} is VALID [2022-02-20 19:26:08,089 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:26:08,089 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:26:08,089 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:26:08,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {14657#true} assume !(1 == ~T2_E~0); {14657#true} is VALID [2022-02-20 19:26:08,090 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:26:08,090 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:26:08,090 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:26:08,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:26:08,090 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14657#true} {14658#false} #10586#return; {14658#false} is VALID [2022-02-20 19:26:08,090 INFO L290 TraceCheckUtils]: 51: Hoare triple {14658#false} assume !false; {14658#false} is VALID [2022-02-20 19:26:08,091 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:26:08,091 INFO L290 TraceCheckUtils]: 53: Hoare triple {14658#false} assume !false; {14658#false} is VALID [2022-02-20 19:26:08,091 INFO L272 TraceCheckUtils]: 54: Hoare triple {14658#false} call eval_#t~ret28#1 := exists_runnable_thread(); {14657#true} is VALID [2022-02-20 19:26:08,091 INFO L290 TraceCheckUtils]: 55: Hoare triple {14657#true} havoc ~__retres1~3; {14657#true} is VALID [2022-02-20 19:26:08,091 INFO L290 TraceCheckUtils]: 56: Hoare triple {14657#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {14657#true} is VALID [2022-02-20 19:26:08,092 INFO L290 TraceCheckUtils]: 57: Hoare triple {14657#true} #res := ~__retres1~3; {14657#true} is VALID [2022-02-20 19:26:08,092 INFO L290 TraceCheckUtils]: 58: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:26:08,092 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14657#true} {14658#false} #10588#return; {14658#false} is VALID [2022-02-20 19:26:08,092 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:26:08,092 INFO L290 TraceCheckUtils]: 61: Hoare triple {14658#false} assume 0 != eval_~tmp~0#1; {14658#false} is VALID [2022-02-20 19:26:08,093 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:26:08,093 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:26:08,093 INFO L290 TraceCheckUtils]: 64: Hoare triple {14658#false} assume !(0 == ~m_pc~0); {14658#false} is VALID [2022-02-20 19:26:08,093 INFO L290 TraceCheckUtils]: 65: Hoare triple {14658#false} assume 1 == ~m_pc~0; {14658#false} is VALID [2022-02-20 19:26:08,093 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:26:08,094 INFO L290 TraceCheckUtils]: 67: Hoare triple {14658#false} assume !false; {14658#false} is VALID [2022-02-20 19:26:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:26:08,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:26:08,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217143264] [2022-02-20 19:26:08,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217143264] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:26:08,095 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:26:08,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:26:08,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034250355] [2022-02-20 19:26:08,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:26:08,097 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:26:08,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:26:08,098 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:26:08,141 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:26:08,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:26:08,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:26:08,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:26:08,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:26:08,143 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:26:20,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:26:20,204 INFO L93 Difference]: Finished difference Result 2807 states and 4974 transitions. [2022-02-20 19:26:20,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:26:20,205 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:26:20,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:26:20,206 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:26:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4590 transitions. [2022-02-20 19:26:20,324 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:26:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4590 transitions. [2022-02-20 19:26:20,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4590 transitions. [2022-02-20 19:26:23,599 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:26:23,855 INFO L225 Difference]: With dead ends: 2807 [2022-02-20 19:26:23,855 INFO L226 Difference]: Without dead ends: 2574 [2022-02-20 19:26:23,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:26:23,857 INFO L933 BasicCegarLoop]: 4246 mSDtfsCounter, 4351 mSDsluCounter, 16427 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:26:23,858 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.9s Time] [2022-02-20 19:26:23,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2022-02-20 19:26:23,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2473. [2022-02-20 19:26:23,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:26:23,925 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:26:23,933 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:26:23,940 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:26:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:26:24,231 INFO L93 Difference]: Finished difference Result 2574 states and 4630 transitions. [2022-02-20 19:26:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 4630 transitions. [2022-02-20 19:26:24,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:26:24,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:26:24,245 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:26:24,253 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:26:24,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:26:24,552 INFO L93 Difference]: Finished difference Result 2574 states and 4630 transitions. [2022-02-20 19:26:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 4630 transitions. [2022-02-20 19:26:24,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:26:24,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:26:24,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:26:24,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:26:24,567 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:26:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 4470 transitions. [2022-02-20 19:26:24,862 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 4470 transitions. Word has length 68 [2022-02-20 19:26:24,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:26:24,864 INFO L470 AbstractCegarLoop]: Abstraction has 2473 states and 4470 transitions. [2022-02-20 19:26:24,867 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:26:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 4470 transitions. [2022-02-20 19:26:24,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:26:24,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:26:24,870 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:26:24,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:26:24,870 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:26:24,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:26:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash -721302131, now seen corresponding path program 1 times [2022-02-20 19:26:24,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:26:24,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277554087] [2022-02-20 19:26:24,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:26:24,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:26:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:24,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:26:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:24,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:26:24,941 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:26:24,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:26:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:24,970 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:26:24,971 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:26:24,971 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:26:24,972 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:26:24,972 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:26:24,972 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:26:24,973 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:26:24,973 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:26:24,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:26:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:24,991 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:26:24,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {25512#true} assume 1 == ~m_pc~0; {25512#true} is VALID [2022-02-20 19:26:24,992 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:26:24,992 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:26:24,992 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:26:24,993 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:26:24,993 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:26:24,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {25512#true} assume !(1 == ~t1_pc~0); {25512#true} is VALID [2022-02-20 19:26:24,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {25512#true} is_transmit1_triggered_~__retres1~1#1 := 0; {25512#true} is VALID [2022-02-20 19:26:24,993 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:26:24,994 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:26:24,994 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:26:24,994 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:26:24,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {25512#true} assume 1 == ~t2_pc~0; {25512#true} is VALID [2022-02-20 19:26:24,994 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:26:24,995 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:26:24,995 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:26:24,995 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:26:24,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:26:24,995 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {25512#true} {25513#false} #10584#return; {25513#false} is VALID [2022-02-20 19:26:24,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:26:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:25,012 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:26:25,012 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:26:25,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {25512#true} assume !(1 == ~T2_E~0); {25512#true} is VALID [2022-02-20 19:26:25,012 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:26:25,013 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:26:25,013 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:26:25,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:26:25,013 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25512#true} {25513#false} #10586#return; {25513#false} is VALID [2022-02-20 19:26:25,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:26:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:25,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {25512#true} havoc ~__retres1~3; {25512#true} is VALID [2022-02-20 19:26:25,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {25512#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {25512#true} is VALID [2022-02-20 19:26:25,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {25512#true} #res := ~__retres1~3; {25512#true} is VALID [2022-02-20 19:26:25,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:26:25,025 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25512#true} {25513#false} #10588#return; {25513#false} is VALID [2022-02-20 19:26:25,028 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:26:25,028 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:26:25,028 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:26:25,029 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:26:25,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} call update_channels(); {25512#true} is VALID [2022-02-20 19:26:25,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:26:25,030 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:26:25,030 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:26:25,031 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:26:25,031 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:26:25,031 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:26:25,032 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:26:25,033 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:26:25,034 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:26:25,034 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:26:25,035 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:26:25,035 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:26:25,036 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:26:25,036 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:26:25,037 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:26:25,039 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:26:25,039 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:26:25,040 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:26:25,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {25512#true} assume 1 == ~m_pc~0; {25512#true} is VALID [2022-02-20 19:26:25,040 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:26:25,040 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:26:25,040 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:26:25,041 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:26:25,041 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:26:25,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {25512#true} assume !(1 == ~t1_pc~0); {25512#true} is VALID [2022-02-20 19:26:25,041 INFO L290 TraceCheckUtils]: 30: Hoare triple {25512#true} is_transmit1_triggered_~__retres1~1#1 := 0; {25512#true} is VALID [2022-02-20 19:26:25,042 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:26:25,042 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:26:25,042 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:26:25,042 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:26:25,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {25512#true} assume 1 == ~t2_pc~0; {25512#true} is VALID [2022-02-20 19:26:25,042 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:26:25,043 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:26:25,043 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:26:25,044 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:26:25,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:26:25,044 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25512#true} {25513#false} #10584#return; {25513#false} is VALID [2022-02-20 19:26:25,045 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:26:25,045 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:26:25,045 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:26:25,045 INFO L290 TraceCheckUtils]: 45: Hoare triple {25512#true} assume !(1 == ~T2_E~0); {25512#true} is VALID [2022-02-20 19:26:25,045 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:26:25,046 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:26:25,046 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:26:25,046 INFO L290 TraceCheckUtils]: 49: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:26:25,046 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25512#true} {25513#false} #10586#return; {25513#false} is VALID [2022-02-20 19:26:25,046 INFO L290 TraceCheckUtils]: 51: Hoare triple {25513#false} assume !false; {25513#false} is VALID [2022-02-20 19:26:25,047 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:26:25,047 INFO L290 TraceCheckUtils]: 53: Hoare triple {25513#false} assume !false; {25513#false} is VALID [2022-02-20 19:26:25,047 INFO L272 TraceCheckUtils]: 54: Hoare triple {25513#false} call eval_#t~ret28#1 := exists_runnable_thread(); {25512#true} is VALID [2022-02-20 19:26:25,047 INFO L290 TraceCheckUtils]: 55: Hoare triple {25512#true} havoc ~__retres1~3; {25512#true} is VALID [2022-02-20 19:26:25,047 INFO L290 TraceCheckUtils]: 56: Hoare triple {25512#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {25512#true} is VALID [2022-02-20 19:26:25,047 INFO L290 TraceCheckUtils]: 57: Hoare triple {25512#true} #res := ~__retres1~3; {25512#true} is VALID [2022-02-20 19:26:25,048 INFO L290 TraceCheckUtils]: 58: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:26:25,048 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25512#true} {25513#false} #10588#return; {25513#false} is VALID [2022-02-20 19:26:25,048 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:26:25,048 INFO L290 TraceCheckUtils]: 61: Hoare triple {25513#false} assume 0 != eval_~tmp~0#1; {25513#false} is VALID [2022-02-20 19:26:25,049 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:26:25,049 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:26:25,049 INFO L290 TraceCheckUtils]: 64: Hoare triple {25513#false} assume !(0 == ~m_pc~0); {25513#false} is VALID [2022-02-20 19:26:25,049 INFO L290 TraceCheckUtils]: 65: Hoare triple {25513#false} assume 1 == ~m_pc~0; {25513#false} is VALID [2022-02-20 19:26:25,049 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:26:25,054 INFO L290 TraceCheckUtils]: 67: Hoare triple {25513#false} assume !false; {25513#false} is VALID [2022-02-20 19:26:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:26:25,055 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:26:25,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277554087] [2022-02-20 19:26:25,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277554087] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:26:25,056 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:26:25,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:26:25,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933273653] [2022-02-20 19:26:25,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:26:25,057 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:26:25,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:26:25,057 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:26:25,098 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:26:25,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:26:25,098 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:26:25,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:26:25,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:26:25,099 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)