./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+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_label49+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 7e701321e196a1bccf6d27e73a1199a298c61ca16e14855140bb342fbe0d070d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:26:32,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:26:32,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:26:32,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:26:32,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:26:32,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:26:32,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:26:32,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:26:32,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:26:32,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:26:32,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:26:32,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:26:32,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:26:32,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:26:32,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:26:32,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:26:32,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:26:32,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:26:32,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:26:32,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:26:32,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:26:32,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:26:32,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:26:32,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:26:32,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:26:32,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:26:32,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:26:32,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:26:32,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:26:32,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:26:32,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:26:32,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:26:32,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:26:32,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:26:32,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:26:32,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:26:32,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:26:32,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:26:32,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:26:32,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:26:32,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:26:32,390 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:26:32,424 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:26:32,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:26:32,427 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:26:32,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:26:32,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:26:32,429 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:26:32,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:26:32,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:26:32,430 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:26:32,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:26:32,431 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:26:32,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:26:32,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:26:32,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:26:32,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:26:32,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:26:32,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:26:32,432 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:26:32,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:26:32,432 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:26:32,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:26:32,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:26:32,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:26:32,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:26:32,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:26:32,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:26:32,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:26:32,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:26:32,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:26:32,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:26:32,434 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:26:32,435 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:26:32,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:26:32,435 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 -> 7e701321e196a1bccf6d27e73a1199a298c61ca16e14855140bb342fbe0d070d [2022-02-20 19:26:32,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:26:32,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:26:32,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:26:32,736 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:26:32,736 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:26:32,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.02.cil-1.c [2022-02-20 19:26:32,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d252ab70e/2fd1424642eb4672b4211fbadc3f3091/FLAG5ae5746c7 [2022-02-20 19:26:33,709 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:26:33,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.02.cil-1.c [2022-02-20 19:26:33,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d252ab70e/2fd1424642eb4672b4211fbadc3f3091/FLAG5ae5746c7 [2022-02-20 19:26:33,800 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d252ab70e/2fd1424642eb4672b4211fbadc3f3091 [2022-02-20 19:26:33,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:26:33,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:26:33,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:26:33,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:26:33,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:26:33,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:26:33" (1/1) ... [2022-02-20 19:26:33,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d875ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:33, skipping insertion in model container [2022-02-20 19:26:33,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:26:33" (1/1) ... [2022-02-20 19:26:33,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:26:33,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:26:35,601 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_label49+token_ring.02.cil-1.c[380593,380606] [2022-02-20 19:26:35,636 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_label49+token_ring.02.cil-1.c[383339,383352] [2022-02-20 19:26:35,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:26:35,797 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:26:36,650 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_label49+token_ring.02.cil-1.c[380593,380606] [2022-02-20 19:26:36,661 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_label49+token_ring.02.cil-1.c[383339,383352] [2022-02-20 19:26:36,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:26:36,723 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:26:36,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:36 WrapperNode [2022-02-20 19:26:36,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:26:36,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:26:36,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:26:36,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:26:36,730 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:26:36" (1/1) ... [2022-02-20 19:26:36,826 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:26:36" (1/1) ... [2022-02-20 19:26:37,304 INFO L137 Inliner]: procedures = 48, calls = 47, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 12619 [2022-02-20 19:26:37,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:26:37,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:26:37,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:26:37,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:26:37,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:36" (1/1) ... [2022-02-20 19:26:37,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:36" (1/1) ... [2022-02-20 19:26:37,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:36" (1/1) ... [2022-02-20 19:26:37,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:36" (1/1) ... [2022-02-20 19:26:37,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:36" (1/1) ... [2022-02-20 19:26:37,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:36" (1/1) ... [2022-02-20 19:26:37,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:36" (1/1) ... [2022-02-20 19:26:37,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:26:37,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:26:37,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:26:37,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:26:37,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:36" (1/1) ... [2022-02-20 19:26:37,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:26:37,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:26:37,897 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:26:37,944 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:26:37,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:26:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-02-20 19:26:37,991 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-02-20 19:26:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-02-20 19:26:37,991 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-02-20 19:26:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:26:37,992 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:26:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-02-20 19:26:37,992 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-02-20 19:26:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-02-20 19:26:37,992 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-02-20 19:26:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:26:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-02-20 19:26:37,993 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-02-20 19:26:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:26:37,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:26:38,137 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:26:38,138 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:26:44,074 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:26:44,094 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:26:44,094 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 19:26:44,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:26:44 BoogieIcfgContainer [2022-02-20 19:26:44,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:26:44,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:26:44,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:26:44,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:26:44,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:26:33" (1/3) ... [2022-02-20 19:26:44,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b20696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:26:44, skipping insertion in model container [2022-02-20 19:26:44,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:26:36" (2/3) ... [2022-02-20 19:26:44,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b20696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:26:44, skipping insertion in model container [2022-02-20 19:26:44,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:26:44" (3/3) ... [2022-02-20 19:26:44,104 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.02.cil-1.c [2022-02-20 19:26:44,108 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:26:44,108 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:26:44,152 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:26:44,157 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:26:44,157 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:26:44,209 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:26:44,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:26:44,216 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:26:44,217 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:44,217 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:26:44,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:26:44,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1170312139, now seen corresponding path program 1 times [2022-02-20 19:26:44,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:26:44,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489629943] [2022-02-20 19:26:44,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:26:44,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:26:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:44,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:26:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:44,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:26:44,490 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:26:44,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:26:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:44,531 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:26:44,532 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:26:44,533 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:26:44,533 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:26:44,534 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:26:44,534 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:26:44,535 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:26:44,536 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:26:44,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:26:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:44,568 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:26:44,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {2318#true} assume 1 == ~m_pc~0; {2318#true} is VALID [2022-02-20 19:26:44,569 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:26:44,569 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:26:44,569 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:26:44,569 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:26:44,570 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:26:44,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {2318#true} assume !(1 == ~t1_pc~0); {2318#true} is VALID [2022-02-20 19:26:44,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {2318#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2318#true} is VALID [2022-02-20 19:26:44,570 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:26:44,571 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:26:44,571 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:26:44,571 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:26:44,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {2318#true} assume 1 == ~t2_pc~0; {2318#true} is VALID [2022-02-20 19:26:44,572 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:26:44,572 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:26:44,572 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:26:44,573 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:26:44,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:26:44,573 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2318#true} {2319#false} #10584#return; {2319#false} is VALID [2022-02-20 19:26:44,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:26:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:44,599 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:26:44,599 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:26:44,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {2318#true} assume !(1 == ~T2_E~0); {2318#true} is VALID [2022-02-20 19:26:44,600 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:26:44,600 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:26:44,601 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:26:44,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:26:44,601 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2318#true} {2319#false} #10586#return; {2319#false} is VALID [2022-02-20 19:26:44,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:26:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:26:44,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {2318#true} havoc ~__retres1~3; {2318#true} is VALID [2022-02-20 19:26:44,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {2318#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {2318#true} is VALID [2022-02-20 19:26:44,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {2318#true} #res := ~__retres1~3; {2318#true} is VALID [2022-02-20 19:26:44,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:26:44,609 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2318#true} {2319#false} #10588#return; {2319#false} is VALID [2022-02-20 19:26:44,610 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:26:44,611 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:26:44,612 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:26:44,612 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:26:44,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {2320#(= ~M_E~0 2)} call update_channels(); {2318#true} is VALID [2022-02-20 19:26:44,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:26:44,613 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:26:44,614 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:26:44,614 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:26:44,615 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:26:44,616 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:26:44,616 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:26:44,617 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:26:44,618 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:26:44,618 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:26:44,619 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:26:44,619 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:26:44,620 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:26:44,620 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:26:44,621 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:26:44,621 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:26:44,621 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:26:44,622 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:26:44,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {2318#true} assume 1 == ~m_pc~0; {2318#true} is VALID [2022-02-20 19:26:44,622 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:26:44,622 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:26:44,623 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:26:44,623 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:26:44,623 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:26:44,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {2318#true} assume !(1 == ~t1_pc~0); {2318#true} is VALID [2022-02-20 19:26:44,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {2318#true} is_transmit1_triggered_~__retres1~1#1 := 0; {2318#true} is VALID [2022-02-20 19:26:44,624 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:26:44,624 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:26:44,624 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:26:44,625 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:26:44,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {2318#true} assume 1 == ~t2_pc~0; {2318#true} is VALID [2022-02-20 19:26:44,625 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:26:44,625 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:26:44,625 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:26:44,626 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:26:44,626 INFO L290 TraceCheckUtils]: 40: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:26:44,626 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2318#true} {2319#false} #10584#return; {2319#false} is VALID [2022-02-20 19:26:44,626 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:26:44,627 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:26:44,627 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:26:44,627 INFO L290 TraceCheckUtils]: 45: Hoare triple {2318#true} assume !(1 == ~T2_E~0); {2318#true} is VALID [2022-02-20 19:26:44,627 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:26:44,628 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:26:44,628 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:26:44,628 INFO L290 TraceCheckUtils]: 49: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:26:44,628 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2318#true} {2319#false} #10586#return; {2319#false} is VALID [2022-02-20 19:26:44,629 INFO L290 TraceCheckUtils]: 51: Hoare triple {2319#false} assume !false; {2319#false} is VALID [2022-02-20 19:26:44,629 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:26:44,629 INFO L290 TraceCheckUtils]: 53: Hoare triple {2319#false} assume !false; {2319#false} is VALID [2022-02-20 19:26:44,629 INFO L272 TraceCheckUtils]: 54: Hoare triple {2319#false} call eval_#t~ret28#1 := exists_runnable_thread(); {2318#true} is VALID [2022-02-20 19:26:44,629 INFO L290 TraceCheckUtils]: 55: Hoare triple {2318#true} havoc ~__retres1~3; {2318#true} is VALID [2022-02-20 19:26:44,630 INFO L290 TraceCheckUtils]: 56: Hoare triple {2318#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {2318#true} is VALID [2022-02-20 19:26:44,630 INFO L290 TraceCheckUtils]: 57: Hoare triple {2318#true} #res := ~__retres1~3; {2318#true} is VALID [2022-02-20 19:26:44,630 INFO L290 TraceCheckUtils]: 58: Hoare triple {2318#true} assume true; {2318#true} is VALID [2022-02-20 19:26:44,630 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2318#true} {2319#false} #10588#return; {2319#false} is VALID [2022-02-20 19:26:44,631 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:26:44,631 INFO L290 TraceCheckUtils]: 61: Hoare triple {2319#false} assume 0 != eval_~tmp~0#1; {2319#false} is VALID [2022-02-20 19:26:44,631 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:26:44,631 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:26:44,632 INFO L290 TraceCheckUtils]: 64: Hoare triple {2319#false} assume !(0 == ~m_pc~0); {2319#false} is VALID [2022-02-20 19:26:44,632 INFO L290 TraceCheckUtils]: 65: Hoare triple {2319#false} assume 1 == ~m_pc~0; {2319#false} is VALID [2022-02-20 19:26:44,632 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:26:44,632 INFO L290 TraceCheckUtils]: 67: Hoare triple {2319#false} assume !false; {2319#false} is VALID [2022-02-20 19:26:44,633 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:44,634 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:26:44,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489629943] [2022-02-20 19:26:44,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489629943] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:26:44,635 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:26:44,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:26:44,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520138284] [2022-02-20 19:26:44,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:26:44,641 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:26:44,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:26:44,645 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:26:44,714 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:44,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:26:44,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:26:44,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:26:44,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:26:44,745 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:26:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:26:56,663 INFO L93 Difference]: Finished difference Result 4802 states and 8845 transitions. [2022-02-20 19:26:56,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:26:56,664 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:26:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:26:56,666 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:26:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 8845 transitions. [2022-02-20 19:26:56,759 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:26:56,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 8845 transitions. [2022-02-20 19:26:56,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 8845 transitions. [2022-02-20 19:27:03,407 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:27:04,026 INFO L225 Difference]: With dead ends: 4802 [2022-02-20 19:27:04,027 INFO L226 Difference]: Without dead ends: 2427 [2022-02-20 19:27:04,038 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:27:04,045 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.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:27:04,046 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.8s Time] [2022-02-20 19:27:04,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2022-02-20 19:27:04,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 2364. [2022-02-20 19:27:04,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:27:04,200 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:27:04,209 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:27:04,216 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:27:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:04,476 INFO L93 Difference]: Finished difference Result 2427 states and 4414 transitions. [2022-02-20 19:27:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 4414 transitions. [2022-02-20 19:27:04,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:27:04,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:27:04,492 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:27:04,499 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:27:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:04,764 INFO L93 Difference]: Finished difference Result 2427 states and 4414 transitions. [2022-02-20 19:27:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 4414 transitions. [2022-02-20 19:27:04,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:27:04,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:27:04,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:27:04,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:27:04,780 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:27:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 4314 transitions. [2022-02-20 19:27:05,058 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 4314 transitions. Word has length 68 [2022-02-20 19:27:05,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:27:05,058 INFO L470 AbstractCegarLoop]: Abstraction has 2364 states and 4314 transitions. [2022-02-20 19:27:05,059 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:27:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 4314 transitions. [2022-02-20 19:27:05,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:27:05,061 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:27:05,061 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:27:05,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:27:05,061 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:27:05,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:27:05,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1597321137, now seen corresponding path program 1 times [2022-02-20 19:27:05,063 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:27:05,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529301016] [2022-02-20 19:27:05,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:27:05,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:27:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:05,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:27:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:05,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:27:05,127 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:27:05,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:27:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:05,178 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:27:05,185 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:27:05,189 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:27:05,190 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:27:05,190 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:27:05,191 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:27:05,191 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:27:05,192 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:27:05,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:27:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:05,219 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:27:05,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {14657#true} assume 1 == ~m_pc~0; {14657#true} is VALID [2022-02-20 19:27:05,219 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:27:05,219 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:27:05,220 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:27:05,220 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:27:05,220 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:27:05,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {14657#true} assume !(1 == ~t1_pc~0); {14657#true} is VALID [2022-02-20 19:27:05,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {14657#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14657#true} is VALID [2022-02-20 19:27:05,220 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:27:05,221 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:27:05,221 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:27:05,221 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:27:05,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {14657#true} assume 1 == ~t2_pc~0; {14657#true} is VALID [2022-02-20 19:27:05,221 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:27:05,222 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:27:05,222 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:27:05,222 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:27:05,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:27:05,222 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {14657#true} {14658#false} #10584#return; {14658#false} is VALID [2022-02-20 19:27:05,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:27:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:05,235 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:27:05,236 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:27:05,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {14657#true} assume !(1 == ~T2_E~0); {14657#true} is VALID [2022-02-20 19:27:05,236 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:27:05,236 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:27:05,237 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:27:05,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:27:05,243 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14657#true} {14658#false} #10586#return; {14658#false} is VALID [2022-02-20 19:27:05,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:27:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:05,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {14657#true} havoc ~__retres1~3; {14657#true} is VALID [2022-02-20 19:27:05,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {14657#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {14657#true} is VALID [2022-02-20 19:27:05,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {14657#true} #res := ~__retres1~3; {14657#true} is VALID [2022-02-20 19:27:05,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:27:05,260 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14657#true} {14658#false} #10588#return; {14658#false} is VALID [2022-02-20 19:27:05,262 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:27:05,262 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:27:05,262 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:27:05,263 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:27:05,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {14659#(= ~T1_E~0 ~M_E~0)} call update_channels(); {14657#true} is VALID [2022-02-20 19:27:05,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:27:05,264 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:27:05,264 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:27:05,265 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:27:05,266 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:27:05,266 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:27:05,267 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:27:05,269 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:27:05,270 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:27:05,271 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:27:05,271 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:27:05,271 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:27:05,272 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:27:05,272 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:27:05,273 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:27:05,274 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:27:05,275 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:27:05,275 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:27:05,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {14657#true} assume 1 == ~m_pc~0; {14657#true} is VALID [2022-02-20 19:27:05,276 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:27:05,276 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:27:05,276 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:27:05,276 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:27:05,277 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:27:05,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {14657#true} assume !(1 == ~t1_pc~0); {14657#true} is VALID [2022-02-20 19:27:05,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {14657#true} is_transmit1_triggered_~__retres1~1#1 := 0; {14657#true} is VALID [2022-02-20 19:27:05,277 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:27:05,277 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:27:05,278 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:27:05,278 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:27:05,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {14657#true} assume 1 == ~t2_pc~0; {14657#true} is VALID [2022-02-20 19:27:05,278 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:27:05,279 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:27:05,279 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:27:05,279 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:27:05,279 INFO L290 TraceCheckUtils]: 40: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:27:05,279 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14657#true} {14658#false} #10584#return; {14658#false} is VALID [2022-02-20 19:27:05,280 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:27:05,280 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:27:05,280 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:27:05,280 INFO L290 TraceCheckUtils]: 45: Hoare triple {14657#true} assume !(1 == ~T2_E~0); {14657#true} is VALID [2022-02-20 19:27:05,280 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:27:05,281 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:27:05,281 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:27:05,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:27:05,281 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14657#true} {14658#false} #10586#return; {14658#false} is VALID [2022-02-20 19:27:05,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {14658#false} assume !false; {14658#false} is VALID [2022-02-20 19:27:05,281 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:27:05,281 INFO L290 TraceCheckUtils]: 53: Hoare triple {14658#false} assume !false; {14658#false} is VALID [2022-02-20 19:27:05,282 INFO L272 TraceCheckUtils]: 54: Hoare triple {14658#false} call eval_#t~ret28#1 := exists_runnable_thread(); {14657#true} is VALID [2022-02-20 19:27:05,282 INFO L290 TraceCheckUtils]: 55: Hoare triple {14657#true} havoc ~__retres1~3; {14657#true} is VALID [2022-02-20 19:27:05,282 INFO L290 TraceCheckUtils]: 56: Hoare triple {14657#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {14657#true} is VALID [2022-02-20 19:27:05,282 INFO L290 TraceCheckUtils]: 57: Hoare triple {14657#true} #res := ~__retres1~3; {14657#true} is VALID [2022-02-20 19:27:05,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {14657#true} assume true; {14657#true} is VALID [2022-02-20 19:27:05,282 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14657#true} {14658#false} #10588#return; {14658#false} is VALID [2022-02-20 19:27:05,283 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:27:05,283 INFO L290 TraceCheckUtils]: 61: Hoare triple {14658#false} assume 0 != eval_~tmp~0#1; {14658#false} is VALID [2022-02-20 19:27:05,283 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:27:05,283 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:27:05,283 INFO L290 TraceCheckUtils]: 64: Hoare triple {14658#false} assume !(0 == ~m_pc~0); {14658#false} is VALID [2022-02-20 19:27:05,283 INFO L290 TraceCheckUtils]: 65: Hoare triple {14658#false} assume 1 == ~m_pc~0; {14658#false} is VALID [2022-02-20 19:27:05,284 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:27:05,284 INFO L290 TraceCheckUtils]: 67: Hoare triple {14658#false} assume !false; {14658#false} is VALID [2022-02-20 19:27:05,284 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:27:05,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:27:05,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529301016] [2022-02-20 19:27:05,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529301016] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:27:05,285 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:27:05,285 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:27:05,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267574717] [2022-02-20 19:27:05,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:27:05,291 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:27:05,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:27:05,292 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:27:05,339 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:27:05,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:27:05,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:27:05,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:27:05,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:27:05,344 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:27:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:17,579 INFO L93 Difference]: Finished difference Result 2807 states and 4974 transitions. [2022-02-20 19:27:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:27:17,579 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:27:17,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:27:17,580 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:27:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4590 transitions. [2022-02-20 19:27:17,611 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:27:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4590 transitions. [2022-02-20 19:27:17,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 4590 transitions. [2022-02-20 19:27:20,883 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:27:21,111 INFO L225 Difference]: With dead ends: 2807 [2022-02-20 19:27:21,112 INFO L226 Difference]: Without dead ends: 2574 [2022-02-20 19:27:21,113 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:27:21,114 INFO L933 BasicCegarLoop]: 4246 mSDtfsCounter, 4351 mSDsluCounter, 16427 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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:27:21,115 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:27:21,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2022-02-20 19:27:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2473. [2022-02-20 19:27:21,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:27:21,189 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:27:21,199 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:27:21,214 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:27:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:21,510 INFO L93 Difference]: Finished difference Result 2574 states and 4630 transitions. [2022-02-20 19:27:21,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 4630 transitions. [2022-02-20 19:27:21,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:27:21,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:27:21,523 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:27:21,530 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:27:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:27:21,819 INFO L93 Difference]: Finished difference Result 2574 states and 4630 transitions. [2022-02-20 19:27:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 4630 transitions. [2022-02-20 19:27:21,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:27:21,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:27:21,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:27:21,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:27:21,829 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:27:22,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 4470 transitions. [2022-02-20 19:27:22,129 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 4470 transitions. Word has length 68 [2022-02-20 19:27:22,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:27:22,129 INFO L470 AbstractCegarLoop]: Abstraction has 2473 states and 4470 transitions. [2022-02-20 19:27:22,130 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:27:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 4470 transitions. [2022-02-20 19:27:22,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:27:22,131 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:27:22,132 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:27:22,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:27:22,132 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:27:22,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:27:22,133 INFO L85 PathProgramCache]: Analyzing trace with hash -721302131, now seen corresponding path program 1 times [2022-02-20 19:27:22,133 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:27:22,133 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736448889] [2022-02-20 19:27:22,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:27:22,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:27:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:22,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:27:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:22,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:27:22,186 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:27:22,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:27:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:22,229 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:27:22,230 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:27:22,230 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:27:22,231 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:27:22,231 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:27:22,232 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:27:22,232 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:27:22,233 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:27:22,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 19:27:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:22,252 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:27:22,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {25512#true} assume 1 == ~m_pc~0; {25512#true} is VALID [2022-02-20 19:27:22,253 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:27:22,253 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:27:22,253 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:27:22,253 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:27:22,254 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:27:22,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {25512#true} assume !(1 == ~t1_pc~0); {25512#true} is VALID [2022-02-20 19:27:22,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {25512#true} is_transmit1_triggered_~__retres1~1#1 := 0; {25512#true} is VALID [2022-02-20 19:27:22,254 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:27:22,254 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:27:22,255 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:27:22,255 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:27:22,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {25512#true} assume 1 == ~t2_pc~0; {25512#true} is VALID [2022-02-20 19:27:22,255 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:27:22,255 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:27:22,256 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:27:22,256 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:27:22,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:27:22,256 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {25512#true} {25513#false} #10584#return; {25513#false} is VALID [2022-02-20 19:27:22,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 19:27:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:22,267 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:27:22,267 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:27:22,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {25512#true} assume !(1 == ~T2_E~0); {25512#true} is VALID [2022-02-20 19:27:22,268 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:27:22,268 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:27:22,268 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:27:22,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:27:22,269 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25512#true} {25513#false} #10586#return; {25513#false} is VALID [2022-02-20 19:27:22,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 19:27:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:27:22,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {25512#true} havoc ~__retres1~3; {25512#true} is VALID [2022-02-20 19:27:22,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {25512#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {25512#true} is VALID [2022-02-20 19:27:22,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {25512#true} #res := ~__retres1~3; {25512#true} is VALID [2022-02-20 19:27:22,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:27:22,279 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25512#true} {25513#false} #10588#return; {25513#false} is VALID [2022-02-20 19:27:22,280 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:27:22,280 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:27:22,281 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:27:22,281 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:27:22,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {25514#(= ~T2_E~0 ~M_E~0)} call update_channels(); {25512#true} is VALID [2022-02-20 19:27:22,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:27:22,282 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:27:22,282 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:27:22,283 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:27:22,283 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:27:22,284 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:27:22,287 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:27:22,289 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:27:22,289 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:27:22,290 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:27:22,290 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:27:22,291 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:27:22,291 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:27:22,292 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:27:22,292 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:27:22,293 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:27:22,293 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:27:22,293 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:27:22,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {25512#true} assume 1 == ~m_pc~0; {25512#true} is VALID [2022-02-20 19:27:22,294 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:27:22,295 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:27:22,295 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:27:22,295 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:27:22,295 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:27:22,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {25512#true} assume !(1 == ~t1_pc~0); {25512#true} is VALID [2022-02-20 19:27:22,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {25512#true} is_transmit1_triggered_~__retres1~1#1 := 0; {25512#true} is VALID [2022-02-20 19:27:22,296 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:27:22,297 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:27:22,297 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:27:22,297 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:27:22,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {25512#true} assume 1 == ~t2_pc~0; {25512#true} is VALID [2022-02-20 19:27:22,297 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:27:22,298 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:27:22,298 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:27:22,298 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:27:22,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:27:22,298 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25512#true} {25513#false} #10584#return; {25513#false} is VALID [2022-02-20 19:27:22,298 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:27:22,299 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:27:22,299 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:27:22,299 INFO L290 TraceCheckUtils]: 45: Hoare triple {25512#true} assume !(1 == ~T2_E~0); {25512#true} is VALID [2022-02-20 19:27:22,299 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:27:22,299 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:27:22,299 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:27:22,300 INFO L290 TraceCheckUtils]: 49: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:27:22,300 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25512#true} {25513#false} #10586#return; {25513#false} is VALID [2022-02-20 19:27:22,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {25513#false} assume !false; {25513#false} is VALID [2022-02-20 19:27:22,300 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:27:22,300 INFO L290 TraceCheckUtils]: 53: Hoare triple {25513#false} assume !false; {25513#false} is VALID [2022-02-20 19:27:22,301 INFO L272 TraceCheckUtils]: 54: Hoare triple {25513#false} call eval_#t~ret28#1 := exists_runnable_thread(); {25512#true} is VALID [2022-02-20 19:27:22,301 INFO L290 TraceCheckUtils]: 55: Hoare triple {25512#true} havoc ~__retres1~3; {25512#true} is VALID [2022-02-20 19:27:22,301 INFO L290 TraceCheckUtils]: 56: Hoare triple {25512#true} assume 0 == ~m_st~0;~__retres1~3 := 1; {25512#true} is VALID [2022-02-20 19:27:22,301 INFO L290 TraceCheckUtils]: 57: Hoare triple {25512#true} #res := ~__retres1~3; {25512#true} is VALID [2022-02-20 19:27:22,301 INFO L290 TraceCheckUtils]: 58: Hoare triple {25512#true} assume true; {25512#true} is VALID [2022-02-20 19:27:22,301 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25512#true} {25513#false} #10588#return; {25513#false} is VALID [2022-02-20 19:27:22,302 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:27:22,302 INFO L290 TraceCheckUtils]: 61: Hoare triple {25513#false} assume 0 != eval_~tmp~0#1; {25513#false} is VALID [2022-02-20 19:27:22,302 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:27:22,302 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:27:22,302 INFO L290 TraceCheckUtils]: 64: Hoare triple {25513#false} assume !(0 == ~m_pc~0); {25513#false} is VALID [2022-02-20 19:27:22,302 INFO L290 TraceCheckUtils]: 65: Hoare triple {25513#false} assume 1 == ~m_pc~0; {25513#false} is VALID [2022-02-20 19:27:22,303 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:27:22,303 INFO L290 TraceCheckUtils]: 67: Hoare triple {25513#false} assume !false; {25513#false} is VALID [2022-02-20 19:27:22,306 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:27:22,308 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:27:22,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736448889] [2022-02-20 19:27:22,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736448889] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:27:22,308 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:27:22,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:27:22,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892027298] [2022-02-20 19:27:22,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:27:22,310 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:27:22,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:27:22,310 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:27:22,354 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:27:22,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:27:22,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:27:22,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:27:22,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:27:22,356 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)