java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:21:20,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:21:20,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:21:20,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:21:20,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:21:20,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:21:20,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:21:20,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:21:20,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:21:20,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:21:20,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:21:20,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:21:20,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:21:20,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:21:20,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:21:20,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:21:20,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:21:20,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:21:20,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:21:20,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:21:20,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:21:20,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:21:20,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:21:20,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:21:20,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:21:20,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:21:20,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:21:20,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:21:20,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:21:20,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:21:20,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:21:20,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:21:20,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:21:20,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:21:20,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:21:20,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:21:20,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:21:20,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:21:20,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:21:20,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:21:20,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:21:20,564 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 03:21:20,579 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:21:20,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:21:20,580 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:21:20,580 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:21:20,581 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:21:20,581 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:21:20,581 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:21:20,581 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:21:20,581 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:21:20,582 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:21:20,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:21:20,583 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:21:20,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:21:20,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:21:20,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:21:20,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:21:20,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:21:20,584 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:21:20,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:21:20,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:21:20,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:21:20,585 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:21:20,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:21:20,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:21:20,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:21:20,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:21:20,586 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:21:20,586 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:21:20,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:21:20,586 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:21:20,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:21:20,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:21:20,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:21:20,636 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:21:20,637 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:21:20,638 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2019-09-10 03:21:20,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/172765881/4044c02647b4446ab77fc8cfc3c1347d/FLAGa5f4f4779 [2019-09-10 03:21:21,197 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:21:21,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2019-09-10 03:21:21,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/172765881/4044c02647b4446ab77fc8cfc3c1347d/FLAGa5f4f4779 [2019-09-10 03:21:21,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/172765881/4044c02647b4446ab77fc8cfc3c1347d [2019-09-10 03:21:21,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:21:21,546 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:21:21,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:21:21,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:21:21,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:21:21,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:21:21" (1/1) ... [2019-09-10 03:21:21,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c934e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:21:21, skipping insertion in model container [2019-09-10 03:21:21,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:21:21" (1/1) ... [2019-09-10 03:21:21,562 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:21:21,608 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:21:21,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:21:21,824 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:21:21,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:21:21,985 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:21:21,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:21:21 WrapperNode [2019-09-10 03:21:21,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:21:21,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:21:21,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:21:21,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:21:21,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:21:21" (1/1) ... [2019-09-10 03:21:21,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:21:21" (1/1) ... [2019-09-10 03:21:22,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:21:21" (1/1) ... [2019-09-10 03:21:22,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:21:21" (1/1) ... [2019-09-10 03:21:22,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:21:21" (1/1) ... [2019-09-10 03:21:22,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:21:21" (1/1) ... [2019-09-10 03:21:22,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:21:21" (1/1) ... [2019-09-10 03:21:22,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:21:22,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:21:22,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:21:22,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:21:22,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:21:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:21:22,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:21:22,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:21:22,081 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:21:22,081 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-10 03:21:22,081 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-10 03:21:22,081 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-10 03:21:22,081 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-10 03:21:22,081 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:21:22,082 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:21:22,082 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:21:22,082 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:21:22,082 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:21:22,082 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:21:22,083 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:21:22,083 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-10 03:21:22,083 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-10 03:21:22,083 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-10 03:21:22,083 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:21:22,084 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:21:22,084 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:21:22,084 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:21:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:21:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:21:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-10 03:21:22,085 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-10 03:21:22,085 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-10 03:21:22,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:21:22,085 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-10 03:21:22,085 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-10 03:21:22,085 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:21:22,086 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:21:22,086 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:21:22,086 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:21:22,086 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:21:22,086 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:21:22,086 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:21:22,086 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-10 03:21:22,087 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-10 03:21:22,087 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:21:22,087 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:21:22,087 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:21:22,087 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:21:22,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:21:22,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:21:22,614 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:21:22,615 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 03:21:22,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:21:22 BoogieIcfgContainer [2019-09-10 03:21:22,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:21:22,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:21:22,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:21:22,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:21:22,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:21:21" (1/3) ... [2019-09-10 03:21:22,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e662d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:21:22, skipping insertion in model container [2019-09-10 03:21:22,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:21:21" (2/3) ... [2019-09-10 03:21:22,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e662d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:21:22, skipping insertion in model container [2019-09-10 03:21:22,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:21:22" (3/3) ... [2019-09-10 03:21:22,625 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2019-09-10 03:21:22,635 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:21:22,647 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:21:22,661 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:21:22,688 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:21:22,688 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:21:22,688 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:21:22,689 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:21:22,689 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:21:22,689 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:21:22,689 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:21:22,689 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:21:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-09-10 03:21:22,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:21:22,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:22,724 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:22,727 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:22,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:22,732 INFO L82 PathProgramCache]: Analyzing trace with hash -540085109, now seen corresponding path program 1 times [2019-09-10 03:21:22,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:22,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:22,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:22,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:22,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:23,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:21:23,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:21:23,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:21:23,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:23,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:21:23,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:21:23,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:21:23,079 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2019-09-10 03:21:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:23,624 INFO L93 Difference]: Finished difference Result 180 states and 244 transitions. [2019-09-10 03:21:23,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:21:23,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 03:21:23,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:23,654 INFO L225 Difference]: With dead ends: 180 [2019-09-10 03:21:23,654 INFO L226 Difference]: Without dead ends: 168 [2019-09-10 03:21:23,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:21:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-10 03:21:23,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 142. [2019-09-10 03:21:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-10 03:21:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 188 transitions. [2019-09-10 03:21:23,768 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 188 transitions. Word has length 78 [2019-09-10 03:21:23,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:23,769 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 188 transitions. [2019-09-10 03:21:23,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:21:23,770 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 188 transitions. [2019-09-10 03:21:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:21:23,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:23,781 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:23,781 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:23,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:23,783 INFO L82 PathProgramCache]: Analyzing trace with hash 720832141, now seen corresponding path program 1 times [2019-09-10 03:21:23,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:23,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:23,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:23,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:23,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:21:23,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:21:23,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:21:23,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:23,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:21:23,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:21:23,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:21:23,979 INFO L87 Difference]: Start difference. First operand 142 states and 188 transitions. Second operand 5 states. [2019-09-10 03:21:24,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:24,393 INFO L93 Difference]: Finished difference Result 168 states and 231 transitions. [2019-09-10 03:21:24,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:21:24,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 03:21:24,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:24,396 INFO L225 Difference]: With dead ends: 168 [2019-09-10 03:21:24,396 INFO L226 Difference]: Without dead ends: 168 [2019-09-10 03:21:24,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:21:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-10 03:21:24,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 142. [2019-09-10 03:21:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-10 03:21:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 187 transitions. [2019-09-10 03:21:24,414 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 187 transitions. Word has length 78 [2019-09-10 03:21:24,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:24,415 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 187 transitions. [2019-09-10 03:21:24,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:21:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 187 transitions. [2019-09-10 03:21:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:21:24,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:24,418 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:24,418 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:24,419 INFO L82 PathProgramCache]: Analyzing trace with hash 761506891, now seen corresponding path program 1 times [2019-09-10 03:21:24,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:24,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:24,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:24,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:24,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:21:24,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:21:24,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:21:24,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:24,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:21:24,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:21:24,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:21:24,559 INFO L87 Difference]: Start difference. First operand 142 states and 187 transitions. Second operand 5 states. [2019-09-10 03:21:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:24,925 INFO L93 Difference]: Finished difference Result 176 states and 243 transitions. [2019-09-10 03:21:24,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:21:24,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 03:21:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:24,930 INFO L225 Difference]: With dead ends: 176 [2019-09-10 03:21:24,930 INFO L226 Difference]: Without dead ends: 176 [2019-09-10 03:21:24,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:21:24,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-10 03:21:24,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 142. [2019-09-10 03:21:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-10 03:21:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 186 transitions. [2019-09-10 03:21:24,944 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 186 transitions. Word has length 78 [2019-09-10 03:21:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:24,945 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 186 transitions. [2019-09-10 03:21:24,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:21:24,945 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 186 transitions. [2019-09-10 03:21:24,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:21:24,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:24,947 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:24,947 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:24,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:24,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1637525897, now seen corresponding path program 1 times [2019-09-10 03:21:24,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:24,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:24,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:24,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:24,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:21:25,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:21:25,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:21:25,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:25,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:21:25,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:21:25,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:21:25,012 INFO L87 Difference]: Start difference. First operand 142 states and 186 transitions. Second operand 6 states. [2019-09-10 03:21:25,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:25,049 INFO L93 Difference]: Finished difference Result 152 states and 201 transitions. [2019-09-10 03:21:25,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:21:25,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-10 03:21:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:25,053 INFO L225 Difference]: With dead ends: 152 [2019-09-10 03:21:25,053 INFO L226 Difference]: Without dead ends: 152 [2019-09-10 03:21:25,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:21:25,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-10 03:21:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2019-09-10 03:21:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-10 03:21:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 191 transitions. [2019-09-10 03:21:25,088 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 191 transitions. Word has length 78 [2019-09-10 03:21:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:25,089 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 191 transitions. [2019-09-10 03:21:25,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:21:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 191 transitions. [2019-09-10 03:21:25,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:21:25,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:25,097 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:25,098 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:25,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:25,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2061172619, now seen corresponding path program 1 times [2019-09-10 03:21:25,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:25,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:25,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:25,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:25,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:21:25,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:21:25,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:21:25,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:25,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:21:25,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:21:25,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:21:25,180 INFO L87 Difference]: Start difference. First operand 147 states and 191 transitions. Second operand 4 states. [2019-09-10 03:21:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:25,356 INFO L93 Difference]: Finished difference Result 267 states and 344 transitions. [2019-09-10 03:21:25,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:21:25,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-10 03:21:25,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:25,361 INFO L225 Difference]: With dead ends: 267 [2019-09-10 03:21:25,361 INFO L226 Difference]: Without dead ends: 267 [2019-09-10 03:21:25,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:21:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-10 03:21:25,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2019-09-10 03:21:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-10 03:21:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 339 transitions. [2019-09-10 03:21:25,387 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 339 transitions. Word has length 78 [2019-09-10 03:21:25,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:25,391 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 339 transitions. [2019-09-10 03:21:25,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:21:25,391 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 339 transitions. [2019-09-10 03:21:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:21:25,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:25,394 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:25,394 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:25,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:25,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1710474006, now seen corresponding path program 1 times [2019-09-10 03:21:25,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:25,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:25,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:25,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:25,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:21:25,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:21:25,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:21:25,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:25,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:21:25,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:21:25,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:21:25,507 INFO L87 Difference]: Start difference. First operand 261 states and 339 transitions. Second operand 6 states. [2019-09-10 03:21:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:25,546 INFO L93 Difference]: Finished difference Result 268 states and 347 transitions. [2019-09-10 03:21:25,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:21:25,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-10 03:21:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:25,549 INFO L225 Difference]: With dead ends: 268 [2019-09-10 03:21:25,549 INFO L226 Difference]: Without dead ends: 268 [2019-09-10 03:21:25,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:21:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-10 03:21:25,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-09-10 03:21:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-10 03:21:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 343 transitions. [2019-09-10 03:21:25,563 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 343 transitions. Word has length 78 [2019-09-10 03:21:25,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:25,563 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 343 transitions. [2019-09-10 03:21:25,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:21:25,564 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 343 transitions. [2019-09-10 03:21:25,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:21:25,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:25,565 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:25,565 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:25,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:25,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1435714392, now seen corresponding path program 1 times [2019-09-10 03:21:25,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:25,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:25,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:25,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:25,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:21:25,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:21:25,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:21:25,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:25,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:21:25,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:21:25,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:21:25,727 INFO L87 Difference]: Start difference. First operand 266 states and 343 transitions. Second operand 5 states. [2019-09-10 03:21:26,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:26,134 INFO L93 Difference]: Finished difference Result 368 states and 474 transitions. [2019-09-10 03:21:26,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:21:26,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 03:21:26,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:26,138 INFO L225 Difference]: With dead ends: 368 [2019-09-10 03:21:26,138 INFO L226 Difference]: Without dead ends: 368 [2019-09-10 03:21:26,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:21:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-10 03:21:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 326. [2019-09-10 03:21:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-10 03:21:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 407 transitions. [2019-09-10 03:21:26,156 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 407 transitions. Word has length 78 [2019-09-10 03:21:26,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:26,157 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 407 transitions. [2019-09-10 03:21:26,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:21:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 407 transitions. [2019-09-10 03:21:26,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:21:26,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:26,158 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:26,158 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:26,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:26,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1945187482, now seen corresponding path program 1 times [2019-09-10 03:21:26,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:26,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:26,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:26,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:26,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:21:26,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:21:26,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:21:26,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:26,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:21:26,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:21:26,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:21:26,217 INFO L87 Difference]: Start difference. First operand 326 states and 407 transitions. Second operand 5 states. [2019-09-10 03:21:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:26,539 INFO L93 Difference]: Finished difference Result 326 states and 403 transitions. [2019-09-10 03:21:26,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:21:26,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 03:21:26,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:26,542 INFO L225 Difference]: With dead ends: 326 [2019-09-10 03:21:26,542 INFO L226 Difference]: Without dead ends: 326 [2019-09-10 03:21:26,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:21:26,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-10 03:21:26,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2019-09-10 03:21:26,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-10 03:21:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 403 transitions. [2019-09-10 03:21:26,555 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 403 transitions. Word has length 78 [2019-09-10 03:21:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:26,555 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 403 transitions. [2019-09-10 03:21:26,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:21:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 403 transitions. [2019-09-10 03:21:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:21:26,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:26,557 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:26,557 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:26,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:26,557 INFO L82 PathProgramCache]: Analyzing trace with hash -21959448, now seen corresponding path program 1 times [2019-09-10 03:21:26,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:26,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:26,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:26,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:26,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:21:26,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:21:26,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:21:26,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:26,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:21:26,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:21:26,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:21:26,608 INFO L87 Difference]: Start difference. First operand 326 states and 403 transitions. Second operand 5 states. [2019-09-10 03:21:27,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:27,041 INFO L93 Difference]: Finished difference Result 477 states and 607 transitions. [2019-09-10 03:21:27,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:21:27,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 03:21:27,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:27,045 INFO L225 Difference]: With dead ends: 477 [2019-09-10 03:21:27,045 INFO L226 Difference]: Without dead ends: 477 [2019-09-10 03:21:27,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:21:27,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-10 03:21:27,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 397. [2019-09-10 03:21:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-10 03:21:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 486 transitions. [2019-09-10 03:21:27,064 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 486 transitions. Word has length 78 [2019-09-10 03:21:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:27,065 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 486 transitions. [2019-09-10 03:21:27,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:21:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 486 transitions. [2019-09-10 03:21:27,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:21:27,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:27,066 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:27,067 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:27,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:27,067 INFO L82 PathProgramCache]: Analyzing trace with hash 40080166, now seen corresponding path program 1 times [2019-09-10 03:21:27,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:27,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:27,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:27,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:27,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:21:27,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:21:27,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:21:27,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:27,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:21:27,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:21:27,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:21:27,134 INFO L87 Difference]: Start difference. First operand 397 states and 486 transitions. Second operand 5 states. [2019-09-10 03:21:27,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:27,517 INFO L93 Difference]: Finished difference Result 493 states and 627 transitions. [2019-09-10 03:21:27,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:21:27,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 03:21:27,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:27,521 INFO L225 Difference]: With dead ends: 493 [2019-09-10 03:21:27,521 INFO L226 Difference]: Without dead ends: 493 [2019-09-10 03:21:27,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:21:27,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-10 03:21:27,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 428. [2019-09-10 03:21:27,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-10 03:21:27,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 509 transitions. [2019-09-10 03:21:27,540 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 509 transitions. Word has length 78 [2019-09-10 03:21:27,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:27,541 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 509 transitions. [2019-09-10 03:21:27,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:21:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 509 transitions. [2019-09-10 03:21:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:21:27,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:27,542 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:27,543 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:27,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:27,543 INFO L82 PathProgramCache]: Analyzing trace with hash 180628776, now seen corresponding path program 1 times [2019-09-10 03:21:27,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:27,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:27,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:27,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:27,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:21:27,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:21:27,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:21:27,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:27,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:21:27,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:21:27,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:21:27,588 INFO L87 Difference]: Start difference. First operand 428 states and 509 transitions. Second operand 3 states. [2019-09-10 03:21:27,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:27,609 INFO L93 Difference]: Finished difference Result 783 states and 932 transitions. [2019-09-10 03:21:27,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:21:27,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 03:21:27,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:27,615 INFO L225 Difference]: With dead ends: 783 [2019-09-10 03:21:27,615 INFO L226 Difference]: Without dead ends: 783 [2019-09-10 03:21:27,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:21:27,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-09-10 03:21:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 779. [2019-09-10 03:21:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2019-09-10 03:21:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 927 transitions. [2019-09-10 03:21:27,645 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 927 transitions. Word has length 78 [2019-09-10 03:21:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:27,645 INFO L475 AbstractCegarLoop]: Abstraction has 779 states and 927 transitions. [2019-09-10 03:21:27,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:21:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 927 transitions. [2019-09-10 03:21:27,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 03:21:27,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:27,648 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:27,649 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:27,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:27,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1319133239, now seen corresponding path program 1 times [2019-09-10 03:21:27,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:27,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:27,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:27,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:27,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:27,697 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 03:21:27,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:21:27,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:21:27,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:27,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:21:27,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:21:27,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:21:27,699 INFO L87 Difference]: Start difference. First operand 779 states and 927 transitions. Second operand 4 states. [2019-09-10 03:21:27,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:27,849 INFO L93 Difference]: Finished difference Result 1405 states and 1648 transitions. [2019-09-10 03:21:27,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:21:27,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-10 03:21:27,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:27,856 INFO L225 Difference]: With dead ends: 1405 [2019-09-10 03:21:27,856 INFO L226 Difference]: Without dead ends: 1098 [2019-09-10 03:21:27,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:21:27,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-09-10 03:21:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1090. [2019-09-10 03:21:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-09-10 03:21:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1269 transitions. [2019-09-10 03:21:27,903 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1269 transitions. Word has length 123 [2019-09-10 03:21:27,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:27,904 INFO L475 AbstractCegarLoop]: Abstraction has 1090 states and 1269 transitions. [2019-09-10 03:21:27,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:21:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1269 transitions. [2019-09-10 03:21:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 03:21:27,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:27,911 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:27,911 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:27,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1820108252, now seen corresponding path program 1 times [2019-09-10 03:21:27,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:27,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:27,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:27,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:27,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 29 proven. 26 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-09-10 03:21:28,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:21:28,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:21:28,033 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 259 with the following transitions: [2019-09-10 03:21:28,035 INFO L207 CegarAbsIntRunner]: [1], [4], [6], [9], [20], [22], [24], [26], [30], [31], [33], [36], [38], [41], [44], [46], [48], [49], [52], [61], [62], [63], [66], [69], [71], [73], [75], [77], [78], [83], [89], [93], [95], [101], [103], [106], [112], [116], [117], [122], [125], [128], [130], [133], [144], [146], [148], [152], [190], [193], [194], [195], [204], [207], [210], [212], [216], [219], [222], [229], [232], [243], [244], [246], [249], [253], [254], [255], [260], [266], [270], [272], [278], [280], [281], [295], [297], [299], [301], [306], [314], [317], [322], [327], [330], [333], [337], [339], [341], [342], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [385], [386], [387], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401], [402], [403], [404], [405], [406], [407], [408], [409], [410], [411], [412], [413], [414], [415], [416], [417], [418], [419], [420], [427], [428], [429], [430], [431] [2019-09-10 03:21:28,105 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:21:28,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:21:28,591 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:21:28,594 INFO L272 AbstractInterpreter]: Visited 114 different actions 543 times. Merged at 36 different actions 144 times. Never widened. Performed 2108 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2108 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 17 fixpoints after 5 different actions. Largest state had 30 variables. [2019-09-10 03:21:28,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:28,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:21:28,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:21:28,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:21:28,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:28,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:21:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:28,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 944 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 03:21:28,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:21:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-10 03:21:28,893 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:21:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-09-10 03:21:29,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:21:29,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 12 [2019-09-10 03:21:29,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:29,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:21:29,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:21:29,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:21:29,227 INFO L87 Difference]: Start difference. First operand 1090 states and 1269 transitions. Second operand 6 states. [2019-09-10 03:21:29,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:29,281 INFO L93 Difference]: Finished difference Result 956 states and 1097 transitions. [2019-09-10 03:21:29,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:21:29,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-09-10 03:21:29,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:29,286 INFO L225 Difference]: With dead ends: 956 [2019-09-10 03:21:29,287 INFO L226 Difference]: Without dead ends: 956 [2019-09-10 03:21:29,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 512 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-09-10 03:21:29,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2019-09-10 03:21:29,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 922. [2019-09-10 03:21:29,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2019-09-10 03:21:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1048 transitions. [2019-09-10 03:21:29,321 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1048 transitions. Word has length 258 [2019-09-10 03:21:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:29,322 INFO L475 AbstractCegarLoop]: Abstraction has 922 states and 1048 transitions. [2019-09-10 03:21:29,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:21:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1048 transitions. [2019-09-10 03:21:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 03:21:29,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:29,326 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:29,326 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:29,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:29,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1006491229, now seen corresponding path program 1 times [2019-09-10 03:21:29,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:29,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:29,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:29,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:29,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-10 03:21:29,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:21:29,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:21:29,420 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 179 with the following transitions: [2019-09-10 03:21:29,422 INFO L207 CegarAbsIntRunner]: [1], [4], [6], [9], [20], [22], [24], [26], [30], [31], [33], [36], [38], [41], [46], [48], [49], [52], [54], [57], [61], [62], [63], [66], [71], [73], [75], [77], [78], [83], [89], [95], [101], [103], [106], [112], [116], [117], [122], [125], [128], [130], [133], [144], [146], [148], [152], [190], [193], [194], [195], [204], [207], [210], [216], [219], [225], [229], [232], [255], [260], [266], [272], [278], [280], [281], [295], [297], [327], [330], [333], [337], [339], [341], [342], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [385], [386], [387], [391], [392], [393], [394], [395], [396], [399], [400], [401], [402], [403], [404], [405], [406], [407], [408], [409], [429], [430], [431] [2019-09-10 03:21:29,434 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:21:29,434 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:21:29,477 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:21:29,477 INFO L272 AbstractInterpreter]: Visited 100 different actions 131 times. Merged at 2 different actions 2 times. Never widened. Performed 412 root evaluator evaluations with a maximum evaluation depth of 4. Performed 412 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2019-09-10 03:21:29,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:29,478 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:21:29,633 INFO L227 lantSequenceWeakener]: Weakened 143 states. On average, predicates are now at 75.29% of their original sizes. [2019-09-10 03:21:29,634 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:21:31,140 INFO L420 sIntCurrentIteration]: We unified 177 AI predicates to 177 [2019-09-10 03:21:31,140 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:21:31,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:21:31,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [58] imperfect sequences [4] total 60 [2019-09-10 03:21:31,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:31,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-10 03:21:31,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-10 03:21:31,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=2976, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 03:21:31,144 INFO L87 Difference]: Start difference. First operand 922 states and 1048 transitions. Second operand 58 states. [2019-09-10 03:21:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:41,511 INFO L93 Difference]: Finished difference Result 764 states and 855 transitions. [2019-09-10 03:21:41,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 03:21:41,511 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 178 [2019-09-10 03:21:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:41,515 INFO L225 Difference]: With dead ends: 764 [2019-09-10 03:21:41,515 INFO L226 Difference]: Without dead ends: 764 [2019-09-10 03:21:41,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2338 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=902, Invalid=7108, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 03:21:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-09-10 03:21:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 752. [2019-09-10 03:21:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-09-10 03:21:41,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 841 transitions. [2019-09-10 03:21:41,538 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 841 transitions. Word has length 178 [2019-09-10 03:21:41,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:41,538 INFO L475 AbstractCegarLoop]: Abstraction has 752 states and 841 transitions. [2019-09-10 03:21:41,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-10 03:21:41,539 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 841 transitions. [2019-09-10 03:21:41,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-10 03:21:41,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:41,542 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:41,543 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:41,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:41,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2053123678, now seen corresponding path program 1 times [2019-09-10 03:21:41,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:41,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:41,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:41,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:41,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 03:21:41,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:21:41,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:21:41,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:41,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:21:41,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:21:41,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:21:41,830 INFO L87 Difference]: Start difference. First operand 752 states and 841 transitions. Second operand 6 states. [2019-09-10 03:21:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:42,988 INFO L93 Difference]: Finished difference Result 1588 states and 1878 transitions. [2019-09-10 03:21:42,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:21:42,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-09-10 03:21:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:42,999 INFO L225 Difference]: With dead ends: 1588 [2019-09-10 03:21:42,999 INFO L226 Difference]: Without dead ends: 1588 [2019-09-10 03:21:43,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:21:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2019-09-10 03:21:43,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1452. [2019-09-10 03:21:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2019-09-10 03:21:43,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1674 transitions. [2019-09-10 03:21:43,077 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1674 transitions. Word has length 178 [2019-09-10 03:21:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:43,079 INFO L475 AbstractCegarLoop]: Abstraction has 1452 states and 1674 transitions. [2019-09-10 03:21:43,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:21:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1674 transitions. [2019-09-10 03:21:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 03:21:43,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:43,087 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:43,087 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:43,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:43,088 INFO L82 PathProgramCache]: Analyzing trace with hash 5197958, now seen corresponding path program 1 times [2019-09-10 03:21:43,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:43,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:43,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:43,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:43,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-10 03:21:43,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:21:43,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:21:43,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:43,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:21:43,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:21:43,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:21:43,205 INFO L87 Difference]: Start difference. First operand 1452 states and 1674 transitions. Second operand 3 states. [2019-09-10 03:21:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:43,239 INFO L93 Difference]: Finished difference Result 1459 states and 1684 transitions. [2019-09-10 03:21:43,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:21:43,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-10 03:21:43,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:43,251 INFO L225 Difference]: With dead ends: 1459 [2019-09-10 03:21:43,251 INFO L226 Difference]: Without dead ends: 1459 [2019-09-10 03:21:43,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:21:43,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2019-09-10 03:21:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1459. [2019-09-10 03:21:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-09-10 03:21:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 1684 transitions. [2019-09-10 03:21:43,313 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 1684 transitions. Word has length 182 [2019-09-10 03:21:43,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:43,316 INFO L475 AbstractCegarLoop]: Abstraction has 1459 states and 1684 transitions. [2019-09-10 03:21:43,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:21:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1684 transitions. [2019-09-10 03:21:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 03:21:43,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:43,323 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:21:43,324 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:43,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:43,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1390323253, now seen corresponding path program 1 times [2019-09-10 03:21:43,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:43,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:43,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:43,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:43,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:21:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:21:43,537 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 03:21:43,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:21:43 BoogieIcfgContainer [2019-09-10 03:21:43,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:21:43,777 INFO L168 Benchmark]: Toolchain (without parser) took 22227.94 ms. Allocated memory was 135.8 MB in the beginning and 500.7 MB in the end (delta: 364.9 MB). Free memory was 91.6 MB in the beginning and 206.0 MB in the end (delta: -114.3 MB). Peak memory consumption was 250.6 MB. Max. memory is 7.1 GB. [2019-09-10 03:21:43,779 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 135.8 MB. Free memory was 110.2 MB in the beginning and 110.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:21:43,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.68 ms. Allocated memory was 135.8 MB in the beginning and 201.9 MB in the end (delta: 66.1 MB). Free memory was 91.4 MB in the beginning and 178.1 MB in the end (delta: -86.6 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2019-09-10 03:21:43,789 INFO L168 Benchmark]: Boogie Preprocessor took 44.00 ms. Allocated memory is still 201.9 MB. Free memory was 178.1 MB in the beginning and 175.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:21:43,790 INFO L168 Benchmark]: RCFGBuilder took 586.34 ms. Allocated memory is still 201.9 MB. Free memory was 175.9 MB in the beginning and 144.2 MB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2019-09-10 03:21:43,792 INFO L168 Benchmark]: TraceAbstraction took 21154.92 ms. Allocated memory was 201.9 MB in the beginning and 500.7 MB in the end (delta: 298.8 MB). Free memory was 144.2 MB in the beginning and 206.0 MB in the end (delta: -61.8 MB). Peak memory consumption was 237.1 MB. Max. memory is 7.1 GB. [2019-09-10 03:21:43,808 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 135.8 MB. Free memory was 110.2 MB in the beginning and 110.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 438.68 ms. Allocated memory was 135.8 MB in the beginning and 201.9 MB in the end (delta: 66.1 MB). Free memory was 91.4 MB in the beginning and 178.1 MB in the end (delta: -86.6 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.00 ms. Allocated memory is still 201.9 MB. Free memory was 178.1 MB in the beginning and 175.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 586.34 ms. Allocated memory is still 201.9 MB. Free memory was 175.9 MB in the beginning and 144.2 MB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21154.92 ms. Allocated memory was 201.9 MB in the beginning and 500.7 MB in the end (delta: 298.8 MB). Free memory was 144.2 MB in the beginning and 206.0 MB in the end (delta: -61.8 MB). Peak memory consumption was 237.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; VAL [\old(E_1)=7, \old(E_M)=12, \old(local)=3, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=11, \old(m_st)=10, \old(T1_E)=4, \old(t1_i)=13, \old(t1_pc)=8, \old(t1_st)=5, \old(token)=9, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L475] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L479] CALL init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L390] m_i = 1 [L391] t1_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L479] RET init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L480] CALL start_simulation() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L423] FCALL update_channels() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] CALL init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L172] COND TRUE m_i == 1 [L173] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L177] COND TRUE t1_i == 1 [L178] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] RET init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L261] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L266] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L426] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L426] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L289] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L294] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L430] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] kernel_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL eval() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L208] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L90] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L242] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L45] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L51] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L343] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L51] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] m_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L228] RET master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L93] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L109] token += 1 [L110] E_M = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L343] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L126] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L127] COND TRUE E_M == 1 [L128] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L101] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L242] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L37] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L59] COND FALSE !(token != local + 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L64] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L65] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L70] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L71] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L72] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L73] CALL error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L10] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 151 locations, 1 error locations. UNSAFE Result, 21.0s OverallTime, 17 OverallIterations, 6 TraceHistogramMax, 15.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3407 SDtfs, 4130 SDslu, 7717 SDs, 0 SdLazy, 4876 SolverSat, 1351 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 860 GetRequests, 696 SyntacticMatches, 9 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2387 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1459occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9842425193555137 AbsIntWeakeningRatio, 0.5423728813559322 AbsIntAvgWeakeningVarsNumRemoved, 12.858757062146893 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 480 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2218 NumberOfCodeBlocks, 2218 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2275 ConstructedInterpolants, 0 QuantifiedInterpolants, 467342 SizeOfPredicates, 2 NumberOfNonLiveVariables, 944 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 1092/1135 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...