/usr/bin/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 23:24:55,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 23:24:55,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 23:24:55,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 23:24:55,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 23:24:55,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 23:24:55,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 23:24:55,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 23:24:55,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 23:24:55,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 23:24:55,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 23:24:55,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 23:24:55,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 23:24:55,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 23:24:55,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 23:24:55,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 23:24:55,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 23:24:55,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 23:24:55,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 23:24:55,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 23:24:55,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 23:24:55,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 23:24:55,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 23:24:55,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 23:24:55,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 23:24:55,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 23:24:55,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 23:24:55,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 23:24:55,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 23:24:55,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 23:24:55,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 23:24:55,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 23:24:55,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 23:24:55,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 23:24:55,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 23:24:55,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 23:24:55,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 23:24:55,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 23:24:55,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 23:24:55,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 23:24:55,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 23:24:55,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 23:24:55,485 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 23:24:55,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 23:24:55,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 23:24:55,488 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 23:24:55,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 23:24:55,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 23:24:55,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 23:24:55,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 23:24:55,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 23:24:55,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 23:24:55,491 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 23:24:55,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 23:24:55,491 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 23:24:55,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 23:24:55,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 23:24:55,492 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 23:24:55,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 23:24:55,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 23:24:55,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:24:55,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 23:24:55,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 23:24:55,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 23:24:55,494 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 23:24:55,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 23:24:56,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 23:24:56,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 23:24:56,027 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 23:24:56,027 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 23:24:56,028 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-09-04 23:24:56,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b5f60267b/f1a020e7c10b4dd79de7c3ae136f3608/FLAG7625c1e07 [2020-09-04 23:24:56,745 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 23:24:56,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-09-04 23:24:56,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b5f60267b/f1a020e7c10b4dd79de7c3ae136f3608/FLAG7625c1e07 [2020-09-04 23:24:57,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b5f60267b/f1a020e7c10b4dd79de7c3ae136f3608 [2020-09-04 23:24:57,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 23:24:57,061 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 23:24:57,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 23:24:57,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 23:24:57,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 23:24:57,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:24:57" (1/1) ... [2020-09-04 23:24:57,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@177f3252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:57, skipping insertion in model container [2020-09-04 23:24:57,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:24:57" (1/1) ... [2020-09-04 23:24:57,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 23:24:57,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 23:24:57,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:24:57,419 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 23:24:57,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:24:57,617 INFO L208 MainTranslator]: Completed translation [2020-09-04 23:24:57,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:57 WrapperNode [2020-09-04 23:24:57,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 23:24:57,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 23:24:57,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 23:24:57,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 23:24:57,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:57" (1/1) ... [2020-09-04 23:24:57,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:57" (1/1) ... [2020-09-04 23:24:57,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:57" (1/1) ... [2020-09-04 23:24:57,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:57" (1/1) ... [2020-09-04 23:24:57,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:57" (1/1) ... [2020-09-04 23:24:57,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:57" (1/1) ... [2020-09-04 23:24:57,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:57" (1/1) ... [2020-09-04 23:24:57,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 23:24:57,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 23:24:57,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 23:24:57,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 23:24:57,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:57" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 23:24:57,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 23:24:57,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 23:24:57,764 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-09-04 23:24:57,765 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-09-04 23:24:57,765 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-09-04 23:24:57,765 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-09-04 23:24:57,765 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-09-04 23:24:57,766 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-09-04 23:24:57,766 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-09-04 23:24:57,766 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-09-04 23:24:57,766 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-09-04 23:24:57,766 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-09-04 23:24:57,767 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-09-04 23:24:57,767 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-09-04 23:24:57,767 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-09-04 23:24:57,767 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-09-04 23:24:57,768 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-09-04 23:24:57,768 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-09-04 23:24:57,768 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-09-04 23:24:57,768 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-09-04 23:24:57,769 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-09-04 23:24:57,769 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-09-04 23:24:57,769 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 23:24:57,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 23:24:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-09-04 23:24:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-09-04 23:24:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-09-04 23:24:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-09-04 23:24:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-09-04 23:24:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 23:24:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-09-04 23:24:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-09-04 23:24:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-09-04 23:24:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-09-04 23:24:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-09-04 23:24:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-09-04 23:24:57,772 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-09-04 23:24:57,772 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-09-04 23:24:57,772 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-09-04 23:24:57,772 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-09-04 23:24:57,772 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-09-04 23:24:57,772 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-09-04 23:24:57,773 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-09-04 23:24:57,773 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-09-04 23:24:57,773 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-09-04 23:24:57,773 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 23:24:57,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 23:24:57,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 23:24:58,474 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 23:24:58,474 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-09-04 23:24:58,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:24:58 BoogieIcfgContainer [2020-09-04 23:24:58,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 23:24:58,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 23:24:58,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 23:24:58,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 23:24:58,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 11:24:57" (1/3) ... [2020-09-04 23:24:58,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f472e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:24:58, skipping insertion in model container [2020-09-04 23:24:58,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:57" (2/3) ... [2020-09-04 23:24:58,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f472e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:24:58, skipping insertion in model container [2020-09-04 23:24:58,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:24:58" (3/3) ... [2020-09-04 23:24:58,497 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-09-04 23:24:58,511 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 23:24:58,524 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 23:24:58,550 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 23:24:58,584 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 23:24:58,585 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 23:24:58,585 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 23:24:58,585 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 23:24:58,585 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 23:24:58,586 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 23:24:58,586 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 23:24:58,586 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 23:24:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2020-09-04 23:24:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-09-04 23:24:58,644 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:58,646 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:24:58,647 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:58,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:58,658 INFO L82 PathProgramCache]: Analyzing trace with hash 356343399, now seen corresponding path program 1 times [2020-09-04 23:24:58,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:58,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1072672671] [2020-09-04 23:24:58,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:24:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:24:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:24:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:24:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:24:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:24:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:24:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:24:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:24:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:24:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:24:59,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1072672671] [2020-09-04 23:24:59,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:24:59,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:24:59,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700370851] [2020-09-04 23:24:59,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:24:59,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:59,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:24:59,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:24:59,532 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 7 states. [2020-09-04 23:25:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:02,657 INFO L93 Difference]: Finished difference Result 1032 states and 1419 transitions. [2020-09-04 23:25:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 23:25:02,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 134 [2020-09-04 23:25:02,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:02,718 INFO L225 Difference]: With dead ends: 1032 [2020-09-04 23:25:02,719 INFO L226 Difference]: Without dead ends: 774 [2020-09-04 23:25:02,735 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2020-09-04 23:25:02,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2020-09-04 23:25:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 562. [2020-09-04 23:25:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-09-04 23:25:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 711 transitions. [2020-09-04 23:25:03,021 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 711 transitions. Word has length 134 [2020-09-04 23:25:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:03,025 INFO L479 AbstractCegarLoop]: Abstraction has 562 states and 711 transitions. [2020-09-04 23:25:03,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:25:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 711 transitions. [2020-09-04 23:25:03,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-09-04 23:25:03,047 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:03,048 INFO L422 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:03,049 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 23:25:03,049 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:03,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:03,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1876371016, now seen corresponding path program 1 times [2020-09-04 23:25:03,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:03,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [27896824] [2020-09-04 23:25:03,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:25:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:25:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:25:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:25:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:25:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:25:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:25:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:25:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-09-04 23:25:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:25:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-09-04 23:25:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-04 23:25:03,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [27896824] [2020-09-04 23:25:03,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:03,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 23:25:03,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254629492] [2020-09-04 23:25:03,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:25:03,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:03,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:25:03,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:25:03,633 INFO L87 Difference]: Start difference. First operand 562 states and 711 transitions. Second operand 9 states. [2020-09-04 23:25:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:08,387 INFO L93 Difference]: Finished difference Result 2088 states and 2801 transitions. [2020-09-04 23:25:08,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 23:25:08,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 213 [2020-09-04 23:25:08,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:08,403 INFO L225 Difference]: With dead ends: 2088 [2020-09-04 23:25:08,403 INFO L226 Difference]: Without dead ends: 1575 [2020-09-04 23:25:08,409 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2020-09-04 23:25:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2020-09-04 23:25:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1143. [2020-09-04 23:25:08,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1143 states. [2020-09-04 23:25:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1495 transitions. [2020-09-04 23:25:08,619 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1495 transitions. Word has length 213 [2020-09-04 23:25:08,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:08,621 INFO L479 AbstractCegarLoop]: Abstraction has 1143 states and 1495 transitions. [2020-09-04 23:25:08,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:25:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1495 transitions. [2020-09-04 23:25:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2020-09-04 23:25:08,634 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:08,635 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:08,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 23:25:08,635 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:08,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:08,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1783560722, now seen corresponding path program 1 times [2020-09-04 23:25:08,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:08,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [671920728] [2020-09-04 23:25:08,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:25:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:25:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:25:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:25:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:25:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:25:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:25:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:25:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-09-04 23:25:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:25:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2020-09-04 23:25:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:08,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2020-09-04 23:25:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:25:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2020-09-04 23:25:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 23:25:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2020-09-04 23:25:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-09-04 23:25:09,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [671920728] [2020-09-04 23:25:09,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:09,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 23:25:09,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306015614] [2020-09-04 23:25:09,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:25:09,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:09,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:25:09,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:25:09,316 INFO L87 Difference]: Start difference. First operand 1143 states and 1495 transitions. Second operand 10 states. [2020-09-04 23:25:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:12,117 INFO L93 Difference]: Finished difference Result 2749 states and 3637 transitions. [2020-09-04 23:25:12,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 23:25:12,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 351 [2020-09-04 23:25:12,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:12,133 INFO L225 Difference]: With dead ends: 2749 [2020-09-04 23:25:12,133 INFO L226 Difference]: Without dead ends: 1653 [2020-09-04 23:25:12,142 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2020-09-04 23:25:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2020-09-04 23:25:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1131. [2020-09-04 23:25:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2020-09-04 23:25:12,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1476 transitions. [2020-09-04 23:25:12,330 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1476 transitions. Word has length 351 [2020-09-04 23:25:12,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:12,331 INFO L479 AbstractCegarLoop]: Abstraction has 1131 states and 1476 transitions. [2020-09-04 23:25:12,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:25:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1476 transitions. [2020-09-04 23:25:12,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2020-09-04 23:25:12,340 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:12,341 INFO L422 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:12,341 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 23:25:12,342 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:12,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:12,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1786251854, now seen corresponding path program 1 times [2020-09-04 23:25:12,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:12,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [477859561] [2020-09-04 23:25:12,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:25:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:25:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:25:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:25:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:25:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:25:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:25:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:25:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-09-04 23:25:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 23:25:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2020-09-04 23:25:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 23:25:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:12,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2020-09-04 23:25:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 37 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2020-09-04 23:25:13,068 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [477859561] [2020-09-04 23:25:13,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:13,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 23:25:13,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773802711] [2020-09-04 23:25:13,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:25:13,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:13,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:25:13,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:25:13,072 INFO L87 Difference]: Start difference. First operand 1131 states and 1476 transitions. Second operand 12 states. [2020-09-04 23:25:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:16,581 INFO L93 Difference]: Finished difference Result 2759 states and 3707 transitions. [2020-09-04 23:25:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 23:25:16,582 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 275 [2020-09-04 23:25:16,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:16,594 INFO L225 Difference]: With dead ends: 2759 [2020-09-04 23:25:16,595 INFO L226 Difference]: Without dead ends: 1334 [2020-09-04 23:25:16,605 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=224, Invalid=532, Unknown=0, NotChecked=0, Total=756 [2020-09-04 23:25:16,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2020-09-04 23:25:16,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 924. [2020-09-04 23:25:16,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2020-09-04 23:25:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1166 transitions. [2020-09-04 23:25:16,817 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1166 transitions. Word has length 275 [2020-09-04 23:25:16,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:16,818 INFO L479 AbstractCegarLoop]: Abstraction has 924 states and 1166 transitions. [2020-09-04 23:25:16,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:25:16,818 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1166 transitions. [2020-09-04 23:25:16,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2020-09-04 23:25:16,824 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:16,825 INFO L422 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:16,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 23:25:16,825 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:16,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:16,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1759472638, now seen corresponding path program 2 times [2020-09-04 23:25:16,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:16,827 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1839790771] [2020-09-04 23:25:16,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:16,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:16,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:25:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:16,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:25:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:16,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:25:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:25:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:25:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:25:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:25:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:25:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-09-04 23:25:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:25:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-09-04 23:25:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 23:25:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2020-09-04 23:25:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2020-09-04 23:25:17,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1839790771] [2020-09-04 23:25:17,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:17,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 23:25:17,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567312923] [2020-09-04 23:25:17,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:25:17,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:17,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:25:17,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:25:17,429 INFO L87 Difference]: Start difference. First operand 924 states and 1166 transitions. Second operand 10 states. [2020-09-04 23:25:22,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:22,355 INFO L93 Difference]: Finished difference Result 3431 states and 4638 transitions. [2020-09-04 23:25:22,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 23:25:22,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 274 [2020-09-04 23:25:22,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:22,377 INFO L225 Difference]: With dead ends: 3431 [2020-09-04 23:25:22,377 INFO L226 Difference]: Without dead ends: 2554 [2020-09-04 23:25:22,386 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2020-09-04 23:25:22,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2020-09-04 23:25:22,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 1811. [2020-09-04 23:25:22,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2020-09-04 23:25:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2279 transitions. [2020-09-04 23:25:22,754 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2279 transitions. Word has length 274 [2020-09-04 23:25:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:22,755 INFO L479 AbstractCegarLoop]: Abstraction has 1811 states and 2279 transitions. [2020-09-04 23:25:22,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:25:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2279 transitions. [2020-09-04 23:25:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2020-09-04 23:25:22,766 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:22,766 INFO L422 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:22,767 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 23:25:22,767 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:22,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:22,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1933431879, now seen corresponding path program 1 times [2020-09-04 23:25:22,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:22,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2120199041] [2020-09-04 23:25:22,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:25:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:25:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:25:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:25:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:25:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:25:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:25:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:25:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-09-04 23:25:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:25:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2020-09-04 23:25:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 23:25:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2020-09-04 23:25:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2020-09-04 23:25:23,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2120199041] [2020-09-04 23:25:23,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:23,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 23:25:23,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976299139] [2020-09-04 23:25:23,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:25:23,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:23,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:25:23,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:25:23,384 INFO L87 Difference]: Start difference. First operand 1811 states and 2279 transitions. Second operand 10 states. [2020-09-04 23:25:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:28,320 INFO L93 Difference]: Finished difference Result 6312 states and 8446 transitions. [2020-09-04 23:25:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 23:25:28,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 274 [2020-09-04 23:25:28,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:28,354 INFO L225 Difference]: With dead ends: 6312 [2020-09-04 23:25:28,354 INFO L226 Difference]: Without dead ends: 4548 [2020-09-04 23:25:28,375 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2020-09-04 23:25:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4548 states. [2020-09-04 23:25:29,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4548 to 3449. [2020-09-04 23:25:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3449 states. [2020-09-04 23:25:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4307 transitions. [2020-09-04 23:25:29,221 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4307 transitions. Word has length 274 [2020-09-04 23:25:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:29,222 INFO L479 AbstractCegarLoop]: Abstraction has 3449 states and 4307 transitions. [2020-09-04 23:25:29,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:25:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4307 transitions. [2020-09-04 23:25:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2020-09-04 23:25:29,236 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:29,236 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:29,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 23:25:29,237 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:29,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:29,238 INFO L82 PathProgramCache]: Analyzing trace with hash 980135473, now seen corresponding path program 1 times [2020-09-04 23:25:29,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:29,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1341058768] [2020-09-04 23:25:29,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:25:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:25:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:25:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:25:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:25:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:25:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:25:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-04 23:25:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:25:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-09-04 23:25:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-09-04 23:25:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-09-04 23:25:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:25:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2020-09-04 23:25:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2020-09-04 23:25:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-09-04 23:25:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2020-09-04 23:25:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2020-09-04 23:25:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:25:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2020-09-04 23:25:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 23:25:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2020-09-04 23:25:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 28 proven. 20 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2020-09-04 23:25:29,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1341058768] [2020-09-04 23:25:29,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:29,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 23:25:29,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785871342] [2020-09-04 23:25:29,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:25:29,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:29,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:25:29,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:25:29,809 INFO L87 Difference]: Start difference. First operand 3449 states and 4307 transitions. Second operand 10 states. [2020-09-04 23:25:29,965 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-09-04 23:25:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:34,479 INFO L93 Difference]: Finished difference Result 8271 states and 10720 transitions. [2020-09-04 23:25:34,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 23:25:34,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 418 [2020-09-04 23:25:34,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:34,528 INFO L225 Difference]: With dead ends: 8271 [2020-09-04 23:25:34,529 INFO L226 Difference]: Without dead ends: 4870 [2020-09-04 23:25:34,562 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=294, Invalid=762, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 23:25:34,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2020-09-04 23:25:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 3453. [2020-09-04 23:25:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3453 states. [2020-09-04 23:25:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3453 states to 3453 states and 4283 transitions. [2020-09-04 23:25:35,860 INFO L78 Accepts]: Start accepts. Automaton has 3453 states and 4283 transitions. Word has length 418 [2020-09-04 23:25:35,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:35,861 INFO L479 AbstractCegarLoop]: Abstraction has 3453 states and 4283 transitions. [2020-09-04 23:25:35,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:25:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 3453 states and 4283 transitions. [2020-09-04 23:25:35,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2020-09-04 23:25:35,878 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:35,879 INFO L422 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:35,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 23:25:35,879 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:35,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:35,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1319590809, now seen corresponding path program 1 times [2020-09-04 23:25:35,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:35,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1631086722] [2020-09-04 23:25:35,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:25:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:25:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:25:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:25:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:25:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:25:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:25:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:25:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-09-04 23:25:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:25:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-09-04 23:25:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 23:25:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2020-09-04 23:25:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 23:25:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2020-09-04 23:25:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 39 proven. 8 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2020-09-04 23:25:36,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1631086722] [2020-09-04 23:25:36,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:36,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 23:25:36,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031953130] [2020-09-04 23:25:36,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 23:25:36,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:36,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 23:25:36,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-04 23:25:36,487 INFO L87 Difference]: Start difference. First operand 3453 states and 4283 transitions. Second operand 11 states. [2020-09-04 23:25:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:44,515 INFO L93 Difference]: Finished difference Result 13187 states and 18026 transitions. [2020-09-04 23:25:44,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-09-04 23:25:44,516 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 304 [2020-09-04 23:25:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:44,593 INFO L225 Difference]: With dead ends: 13187 [2020-09-04 23:25:44,593 INFO L226 Difference]: Without dead ends: 9782 [2020-09-04 23:25:44,631 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=338, Invalid=1144, Unknown=0, NotChecked=0, Total=1482 [2020-09-04 23:25:44,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9782 states. [2020-09-04 23:25:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9782 to 7023. [2020-09-04 23:25:46,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7023 states. [2020-09-04 23:25:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 8851 transitions. [2020-09-04 23:25:46,041 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 8851 transitions. Word has length 304 [2020-09-04 23:25:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:46,042 INFO L479 AbstractCegarLoop]: Abstraction has 7023 states and 8851 transitions. [2020-09-04 23:25:46,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 23:25:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 8851 transitions. [2020-09-04 23:25:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2020-09-04 23:25:46,065 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:46,065 INFO L422 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:46,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 23:25:46,066 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:46,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:46,067 INFO L82 PathProgramCache]: Analyzing trace with hash 759375311, now seen corresponding path program 1 times [2020-09-04 23:25:46,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:46,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1735464409] [2020-09-04 23:25:46,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:25:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:25:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:25:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:25:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:25:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:25:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:25:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:25:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-09-04 23:25:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:25:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2020-09-04 23:25:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 23:25:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2020-09-04 23:25:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 23:25:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2020-09-04 23:25:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2020-09-04 23:25:46,442 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1735464409] [2020-09-04 23:25:46,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:46,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 23:25:46,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447497403] [2020-09-04 23:25:46,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:25:46,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:46,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:25:46,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:25:46,448 INFO L87 Difference]: Start difference. First operand 7023 states and 8851 transitions. Second operand 10 states. [2020-09-04 23:25:50,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:50,309 INFO L93 Difference]: Finished difference Result 14183 states and 18206 transitions. [2020-09-04 23:25:50,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 23:25:50,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 305 [2020-09-04 23:25:50,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:50,355 INFO L225 Difference]: With dead ends: 14183 [2020-09-04 23:25:50,355 INFO L226 Difference]: Without dead ends: 7206 [2020-09-04 23:25:50,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2020-09-04 23:25:50,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7206 states. [2020-09-04 23:25:51,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7206 to 5295. [2020-09-04 23:25:51,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5295 states. [2020-09-04 23:25:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5295 states to 5295 states and 6650 transitions. [2020-09-04 23:25:51,265 INFO L78 Accepts]: Start accepts. Automaton has 5295 states and 6650 transitions. Word has length 305 [2020-09-04 23:25:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:51,265 INFO L479 AbstractCegarLoop]: Abstraction has 5295 states and 6650 transitions. [2020-09-04 23:25:51,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:25:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 5295 states and 6650 transitions. [2020-09-04 23:25:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2020-09-04 23:25:51,280 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:51,281 INFO L422 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:51,281 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 23:25:51,281 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:51,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:51,282 INFO L82 PathProgramCache]: Analyzing trace with hash 551470748, now seen corresponding path program 1 times [2020-09-04 23:25:51,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:51,283 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [246643353] [2020-09-04 23:25:51,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:25:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:25:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:25:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:25:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:25:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:25:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:25:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:25:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-09-04 23:25:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2020-09-04 23:25:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2020-09-04 23:25:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2020-09-04 23:25:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:25:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 23:25:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 23:25:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2020-09-04 23:25:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-09-04 23:25:51,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [246643353] [2020-09-04 23:25:51,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:51,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 23:25:51,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417020787] [2020-09-04 23:25:51,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 23:25:51,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:51,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 23:25:51,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-09-04 23:25:51,847 INFO L87 Difference]: Start difference. First operand 5295 states and 6650 transitions. Second operand 14 states. [2020-09-04 23:26:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:26:01,007 INFO L93 Difference]: Finished difference Result 14043 states and 18694 transitions. [2020-09-04 23:26:01,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-09-04 23:26:01,007 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 310 [2020-09-04 23:26:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:26:01,075 INFO L225 Difference]: With dead ends: 14043 [2020-09-04 23:26:01,075 INFO L226 Difference]: Without dead ends: 8795 [2020-09-04 23:26:01,111 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=919, Invalid=2863, Unknown=0, NotChecked=0, Total=3782 [2020-09-04 23:26:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8795 states. [2020-09-04 23:26:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8795 to 6474. [2020-09-04 23:26:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6474 states. [2020-09-04 23:26:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6474 states to 6474 states and 7995 transitions. [2020-09-04 23:26:02,174 INFO L78 Accepts]: Start accepts. Automaton has 6474 states and 7995 transitions. Word has length 310 [2020-09-04 23:26:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:26:02,175 INFO L479 AbstractCegarLoop]: Abstraction has 6474 states and 7995 transitions. [2020-09-04 23:26:02,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 23:26:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6474 states and 7995 transitions. [2020-09-04 23:26:02,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2020-09-04 23:26:02,188 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:26:02,189 INFO L422 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:26:02,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 23:26:02,189 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:26:02,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:26:02,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1101833629, now seen corresponding path program 1 times [2020-09-04 23:26:02,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:26:02,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [137226363] [2020-09-04 23:26:02,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:26:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:26:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:26:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:26:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:26:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:26:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:26:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:26:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:26:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:26:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-09-04 23:26:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:26:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:26:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:26:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-09-04 23:26:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-09-04 23:26:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2020-09-04 23:26:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:26:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 23:26:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:26:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2020-09-04 23:26:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-09-04 23:26:02,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [137226363] [2020-09-04 23:26:02,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:26:02,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 23:26:02,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567596864] [2020-09-04 23:26:02,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:26:02,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:26:02,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:26:02,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:26:02,630 INFO L87 Difference]: Start difference. First operand 6474 states and 7995 transitions. Second operand 9 states. [2020-09-04 23:26:09,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:26:09,257 INFO L93 Difference]: Finished difference Result 21783 states and 28598 transitions. [2020-09-04 23:26:09,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 23:26:09,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 314 [2020-09-04 23:26:09,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:26:09,352 INFO L225 Difference]: With dead ends: 21783 [2020-09-04 23:26:09,353 INFO L226 Difference]: Without dead ends: 15358 [2020-09-04 23:26:09,401 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2020-09-04 23:26:09,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15358 states. [2020-09-04 23:26:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15358 to 12334. [2020-09-04 23:26:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12334 states. [2020-09-04 23:26:12,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12334 states to 12334 states and 15601 transitions. [2020-09-04 23:26:12,457 INFO L78 Accepts]: Start accepts. Automaton has 12334 states and 15601 transitions. Word has length 314 [2020-09-04 23:26:12,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:26:12,458 INFO L479 AbstractCegarLoop]: Abstraction has 12334 states and 15601 transitions. [2020-09-04 23:26:12,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:26:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 12334 states and 15601 transitions. [2020-09-04 23:26:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2020-09-04 23:26:12,482 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:26:12,483 INFO L422 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, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:26:12,483 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 23:26:12,483 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:26:12,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:26:12,484 INFO L82 PathProgramCache]: Analyzing trace with hash 489071275, now seen corresponding path program 1 times [2020-09-04 23:26:12,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:26:12,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [838458310] [2020-09-04 23:26:12,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:26:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:26:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:26:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:26:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:26:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:26:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:26:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:26:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:26:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:26:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 23:26:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-09-04 23:26:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2020-09-04 23:26:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:26:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:26:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:26:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2020-09-04 23:26:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:26:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 23:26:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:26:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2020-09-04 23:26:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 53 proven. 11 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2020-09-04 23:26:12,997 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [838458310] [2020-09-04 23:26:12,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:26:12,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 23:26:12,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033735097] [2020-09-04 23:26:13,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:26:13,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:26:13,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:26:13,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:26:13,001 INFO L87 Difference]: Start difference. First operand 12334 states and 15601 transitions. Second operand 12 states. [2020-09-04 23:26:19,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:26:19,335 INFO L93 Difference]: Finished difference Result 25338 states and 33694 transitions. [2020-09-04 23:26:19,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 23:26:19,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 320 [2020-09-04 23:26:19,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:26:19,429 INFO L225 Difference]: With dead ends: 25338 [2020-09-04 23:26:19,430 INFO L226 Difference]: Without dead ends: 15813 [2020-09-04 23:26:19,480 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2020-09-04 23:26:19,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15813 states. [2020-09-04 23:26:21,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15813 to 12552. [2020-09-04 23:26:21,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12552 states. [2020-09-04 23:26:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12552 states to 12552 states and 15503 transitions. [2020-09-04 23:26:21,772 INFO L78 Accepts]: Start accepts. Automaton has 12552 states and 15503 transitions. Word has length 320 [2020-09-04 23:26:21,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:26:21,773 INFO L479 AbstractCegarLoop]: Abstraction has 12552 states and 15503 transitions. [2020-09-04 23:26:21,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:26:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 12552 states and 15503 transitions. [2020-09-04 23:26:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2020-09-04 23:26:21,798 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:26:21,798 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:26:21,799 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 23:26:21,799 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:26:21,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:26:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash -640418564, now seen corresponding path program 1 times [2020-09-04 23:26:21,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:26:21,800 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1920519233] [2020-09-04 23:26:21,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:26:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:21,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:21,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:26:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:21,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:26:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:21,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:26:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:21,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:26:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:21,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:26:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:21,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:21,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:26:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:21,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:26:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:21,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:26:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-04 23:26:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:26:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 23:26:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 23:26:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-09-04 23:26:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2020-09-04 23:26:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-09-04 23:26:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:26:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:26:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2020-09-04 23:26:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2020-09-04 23:26:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2020-09-04 23:26:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:26:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2020-09-04 23:26:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2020-09-04 23:26:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:26:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:26:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:26:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2020-09-04 23:26:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:26:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 23:26:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:26:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2020-09-04 23:26:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 65 proven. 12 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2020-09-04 23:26:22,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1920519233] [2020-09-04 23:26:22,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:26:22,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 23:26:22,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20825263] [2020-09-04 23:26:22,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 23:26:22,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:26:22,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 23:26:22,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-09-04 23:26:22,379 INFO L87 Difference]: Start difference. First operand 12552 states and 15503 transitions. Second operand 13 states. [2020-09-04 23:26:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:26:27,486 INFO L93 Difference]: Finished difference Result 22036 states and 27227 transitions. [2020-09-04 23:26:27,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 23:26:27,487 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 434 [2020-09-04 23:26:27,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:26:27,545 INFO L225 Difference]: With dead ends: 22036 [2020-09-04 23:26:27,545 INFO L226 Difference]: Without dead ends: 9540 [2020-09-04 23:26:27,586 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=285, Invalid=837, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 23:26:27,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9540 states. [2020-09-04 23:26:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9540 to 7356. [2020-09-04 23:26:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2020-09-04 23:26:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 8637 transitions. [2020-09-04 23:26:28,884 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 8637 transitions. Word has length 434 [2020-09-04 23:26:28,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:26:28,885 INFO L479 AbstractCegarLoop]: Abstraction has 7356 states and 8637 transitions. [2020-09-04 23:26:28,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 23:26:28,885 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 8637 transitions. [2020-09-04 23:26:28,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2020-09-04 23:26:28,896 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:26:28,897 INFO L422 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:26:28,897 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 23:26:28,897 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:26:28,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:26:28,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1643690248, now seen corresponding path program 1 times [2020-09-04 23:26:28,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:26:28,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1261730684] [2020-09-04 23:26:28,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:26:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:26:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:26:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:26:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:26:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:26:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:26:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:26:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:26:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:26:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-09-04 23:26:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-09-04 23:26:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2020-09-04 23:26:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:26:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:26:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:26:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2020-09-04 23:26:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:26:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 23:26:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:26:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2020-09-04 23:26:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 53 proven. 11 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2020-09-04 23:26:29,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1261730684] [2020-09-04 23:26:29,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:26:29,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 23:26:29,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148369224] [2020-09-04 23:26:29,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:26:29,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:26:29,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:26:29,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:26:29,374 INFO L87 Difference]: Start difference. First operand 7356 states and 8637 transitions. Second operand 10 states. [2020-09-04 23:26:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:26:34,486 INFO L93 Difference]: Finished difference Result 17304 states and 21196 transitions. [2020-09-04 23:26:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 23:26:34,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 320 [2020-09-04 23:26:34,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:26:34,553 INFO L225 Difference]: With dead ends: 17304 [2020-09-04 23:26:34,553 INFO L226 Difference]: Without dead ends: 10244 [2020-09-04 23:26:34,587 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=705, Unknown=0, NotChecked=0, Total=930 [2020-09-04 23:26:34,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10244 states. [2020-09-04 23:26:37,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10244 to 8429. [2020-09-04 23:26:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8429 states. [2020-09-04 23:26:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8429 states to 8429 states and 9776 transitions. [2020-09-04 23:26:37,093 INFO L78 Accepts]: Start accepts. Automaton has 8429 states and 9776 transitions. Word has length 320 [2020-09-04 23:26:37,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:26:37,094 INFO L479 AbstractCegarLoop]: Abstraction has 8429 states and 9776 transitions. [2020-09-04 23:26:37,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:26:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 8429 states and 9776 transitions. [2020-09-04 23:26:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2020-09-04 23:26:37,108 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:26:37,108 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:26:37,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 23:26:37,109 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:26:37,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:26:37,109 INFO L82 PathProgramCache]: Analyzing trace with hash 347748049, now seen corresponding path program 1 times [2020-09-04 23:26:37,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:26:37,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1114467149] [2020-09-04 23:26:37,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:26:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:26:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:26:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:26:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:26:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:26:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:26:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:26:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:26:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-04 23:26:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:26:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 23:26:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:26:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:26:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:26:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-09-04 23:26:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 23:26:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2020-09-04 23:26:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2020-09-04 23:26:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-09-04 23:26:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 23:26:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 23:26:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2020-09-04 23:26:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2020-09-04 23:26:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2020-09-04 23:26:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:26:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2020-09-04 23:26:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 31 proven. 11 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2020-09-04 23:26:37,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1114467149] [2020-09-04 23:26:37,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:26:37,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 23:26:37,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31879819] [2020-09-04 23:26:37,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:26:37,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:26:37,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:26:37,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:26:37,638 INFO L87 Difference]: Start difference. First operand 8429 states and 9776 transitions. Second operand 12 states. [2020-09-04 23:26:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:26:41,261 INFO L93 Difference]: Finished difference Result 12976 states and 15067 transitions. [2020-09-04 23:26:41,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 23:26:41,262 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 345 [2020-09-04 23:26:41,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:26:41,287 INFO L225 Difference]: With dead ends: 12976 [2020-09-04 23:26:41,288 INFO L226 Difference]: Without dead ends: 3861 [2020-09-04 23:26:41,307 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=539, Unknown=0, NotChecked=0, Total=756 [2020-09-04 23:26:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2020-09-04 23:26:42,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3226. [2020-09-04 23:26:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3226 states. [2020-09-04 23:26:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 3637 transitions. [2020-09-04 23:26:42,090 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 3637 transitions. Word has length 345 [2020-09-04 23:26:42,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:26:42,091 INFO L479 AbstractCegarLoop]: Abstraction has 3226 states and 3637 transitions. [2020-09-04 23:26:42,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:26:42,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 3637 transitions. [2020-09-04 23:26:42,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2020-09-04 23:26:42,097 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:26:42,097 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:26:42,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 23:26:42,097 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:26:42,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:26:42,098 INFO L82 PathProgramCache]: Analyzing trace with hash 581444211, now seen corresponding path program 1 times [2020-09-04 23:26:42,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:26:42,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [752407369] [2020-09-04 23:26:42,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:26:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:26:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:26:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:26:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:26:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:26:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:26:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:26:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:26:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:26:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-09-04 23:26:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-09-04 23:26:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-09-04 23:26:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 23:26:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:26:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:26:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:26:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2020-09-04 23:26:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:26:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:26:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:26:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2020-09-04 23:26:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:26:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 23:26:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 23:26:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2020-09-04 23:26:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 55 proven. 1 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2020-09-04 23:26:42,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [752407369] [2020-09-04 23:26:42,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:26:42,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 23:26:42,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285211879] [2020-09-04 23:26:42,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 23:26:42,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:26:42,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 23:26:42,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-09-04 23:26:42,956 INFO L87 Difference]: Start difference. First operand 3226 states and 3637 transitions. Second operand 14 states. [2020-09-04 23:26:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:26:56,621 INFO L93 Difference]: Finished difference Result 12133 states and 14158 transitions. [2020-09-04 23:26:56,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-09-04 23:26:56,623 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 388 [2020-09-04 23:26:56,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:26:56,673 INFO L225 Difference]: With dead ends: 12133 [2020-09-04 23:26:56,674 INFO L226 Difference]: Without dead ends: 9957 [2020-09-04 23:26:56,692 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=666, Invalid=3366, Unknown=0, NotChecked=0, Total=4032 [2020-09-04 23:26:56,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9957 states. [2020-09-04 23:26:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9957 to 8181. [2020-09-04 23:26:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8181 states. [2020-09-04 23:26:58,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8181 states to 8181 states and 9436 transitions. [2020-09-04 23:26:58,276 INFO L78 Accepts]: Start accepts. Automaton has 8181 states and 9436 transitions. Word has length 388 [2020-09-04 23:26:58,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:26:58,277 INFO L479 AbstractCegarLoop]: Abstraction has 8181 states and 9436 transitions. [2020-09-04 23:26:58,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 23:26:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 8181 states and 9436 transitions. [2020-09-04 23:26:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2020-09-04 23:26:58,284 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:26:58,284 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:26:58,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 23:26:58,284 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:26:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:26:58,285 INFO L82 PathProgramCache]: Analyzing trace with hash -961418405, now seen corresponding path program 1 times [2020-09-04 23:26:58,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:26:58,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1547006547] [2020-09-04 23:26:58,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:26:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:26:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:26:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:26:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:26:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:26:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:26:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:26:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:26:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:26:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-09-04 23:26:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-09-04 23:26:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-09-04 23:26:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 23:26:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:26:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:26:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:26:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2020-09-04 23:26:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:26:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:26:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:26:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2020-09-04 23:26:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:26:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:26:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:26:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 23:26:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 23:26:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2020-09-04 23:26:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:26:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2020-09-04 23:26:58,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1547006547] [2020-09-04 23:26:58,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:26:58,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 23:26:58,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862481788] [2020-09-04 23:26:58,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:26:58,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:26:58,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:26:58,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:26:58,742 INFO L87 Difference]: Start difference. First operand 8181 states and 9436 transitions. Second operand 10 states. [2020-09-04 23:27:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:27:03,247 INFO L93 Difference]: Finished difference Result 15448 states and 18109 transitions. [2020-09-04 23:27:03,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 23:27:03,248 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 392 [2020-09-04 23:27:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:27:03,280 INFO L225 Difference]: With dead ends: 15448 [2020-09-04 23:27:03,281 INFO L226 Difference]: Without dead ends: 9781 [2020-09-04 23:27:03,302 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2020-09-04 23:27:03,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9781 states. [2020-09-04 23:27:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9781 to 8230. [2020-09-04 23:27:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8230 states. [2020-09-04 23:27:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8230 states to 8230 states and 9504 transitions. [2020-09-04 23:27:04,754 INFO L78 Accepts]: Start accepts. Automaton has 8230 states and 9504 transitions. Word has length 392 [2020-09-04 23:27:04,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:27:04,754 INFO L479 AbstractCegarLoop]: Abstraction has 8230 states and 9504 transitions. [2020-09-04 23:27:04,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:27:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 8230 states and 9504 transitions. [2020-09-04 23:27:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2020-09-04 23:27:04,762 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:27:04,762 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:27:04,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 23:27:04,763 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:27:04,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:27:04,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1547268291, now seen corresponding path program 1 times [2020-09-04 23:27:04,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:27:04,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1072488541] [2020-09-04 23:27:04,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:27:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:04,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:27:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:04,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 23:27:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:04,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-09-04 23:27:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:04,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:27:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:04,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:27:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:04,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:27:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:04,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:27:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:04,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:27:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:04,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:27:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:04,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 23:27:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:04,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:27:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:04,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-09-04 23:27:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-09-04 23:27:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-09-04 23:27:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-09-04 23:27:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:27:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:27:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:27:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:27:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:27:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2020-09-04 23:27:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:27:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:27:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:27:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:27:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:27:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2020-09-04 23:27:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:27:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:27:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:27:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 23:27:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 23:27:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2020-09-04 23:27:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:27:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2020-09-04 23:27:05,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1072488541] [2020-09-04 23:27:05,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:27:05,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 23:27:05,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747061720] [2020-09-04 23:27:05,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:27:05,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:27:05,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:27:05,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:27:05,200 INFO L87 Difference]: Start difference. First operand 8230 states and 9504 transitions. Second operand 10 states. [2020-09-04 23:27:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:27:09,831 INFO L93 Difference]: Finished difference Result 15552 states and 18270 transitions. [2020-09-04 23:27:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 23:27:09,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 393 [2020-09-04 23:27:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:27:09,871 INFO L225 Difference]: With dead ends: 15552 [2020-09-04 23:27:09,872 INFO L226 Difference]: Without dead ends: 9836 [2020-09-04 23:27:09,897 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2020-09-04 23:27:09,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9836 states. [2020-09-04 23:27:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9836 to 8236. [2020-09-04 23:27:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8236 states. [2020-09-04 23:27:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8236 states to 8236 states and 9510 transitions. [2020-09-04 23:27:12,230 INFO L78 Accepts]: Start accepts. Automaton has 8236 states and 9510 transitions. Word has length 393 [2020-09-04 23:27:12,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:27:12,230 INFO L479 AbstractCegarLoop]: Abstraction has 8236 states and 9510 transitions. [2020-09-04 23:27:12,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:27:12,231 INFO L276 IsEmpty]: Start isEmpty. Operand 8236 states and 9510 transitions. [2020-09-04 23:27:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2020-09-04 23:27:12,238 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:27:12,238 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:27:12,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 23:27:12,239 INFO L427 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:27:12,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:27:12,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1490009989, now seen corresponding path program 1 times [2020-09-04 23:27:12,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:27:12,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1080269930] [2020-09-04 23:27:12,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:27:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 23:27:12,293 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 23:27:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 23:27:12,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 23:27:12,539 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 23:27:12,539 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 23:27:12,541 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 23:27:12,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 11:27:12 BoogieIcfgContainer [2020-09-04 23:27:12,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 23:27:12,862 INFO L168 Benchmark]: Toolchain (without parser) took 135800.49 ms. Allocated memory was 146.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.6 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 770.1 MB. Max. memory is 7.1 GB. [2020-09-04 23:27:12,862 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 146.3 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 23:27:12,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 557.15 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 180.0 MB in the end (delta: -78.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2020-09-04 23:27:12,864 INFO L168 Benchmark]: Boogie Preprocessor took 61.59 ms. Allocated memory is still 203.9 MB. Free memory was 180.0 MB in the beginning and 177.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-09-04 23:27:12,864 INFO L168 Benchmark]: RCFGBuilder took 802.50 ms. Allocated memory is still 203.9 MB. Free memory was 177.1 MB in the beginning and 130.9 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2020-09-04 23:27:12,865 INFO L168 Benchmark]: TraceAbstraction took 134372.31 ms. Allocated memory was 203.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 130.9 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 741.7 MB. Max. memory is 7.1 GB. [2020-09-04 23:27:12,868 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 146.3 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 557.15 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 180.0 MB in the end (delta: -78.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.59 ms. Allocated memory is still 203.9 MB. Free memory was 180.0 MB in the beginning and 177.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 802.50 ms. Allocated memory is still 203.9 MB. Free memory was 177.1 MB in the beginning and 130.9 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 134372.31 ms. Allocated memory was 203.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 130.9 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 741.7 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; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=21, E_2=8, E_M=16, local=20, M_E=18, m_i=9, m_pc=0, m_st=14, T1_E=6, t1_i=19, t1_pc=12, t1_st=7, T2_E=17, t2_i=10, t2_pc=11, t2_st=13, token=22] [L15] int t1_pc = 0; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=21, E_2=8, E_M=16, local=20, M_E=18, m_i=9, m_pc=0, m_st=14, T1_E=6, t1_i=19, t1_pc=0, t1_st=7, T2_E=17, t2_i=10, t2_pc=11, t2_st=13, token=22] [L16] int t2_pc = 0; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=21, E_2=8, E_M=16, local=20, M_E=18, m_i=9, m_pc=0, m_st=14, T1_E=6, t1_i=19, t1_pc=0, t1_st=7, T2_E=17, t2_i=10, t2_pc=0, t2_st=13, token=22] [L17] int m_st ; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=21, E_2=8, E_M=16, local=20, M_E=18, m_i=9, m_pc=0, m_st=0, T1_E=6, t1_i=19, t1_pc=0, t1_st=7, T2_E=17, t2_i=10, t2_pc=0, t2_st=13, token=22] [L18] int t1_st ; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=21, E_2=8, E_M=16, local=20, M_E=18, m_i=9, m_pc=0, m_st=0, T1_E=6, t1_i=19, t1_pc=0, t1_st=0, T2_E=17, t2_i=10, t2_pc=0, t2_st=13, token=22] [L19] int t2_st ; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=21, E_2=8, E_M=16, local=20, M_E=18, m_i=9, m_pc=0, m_st=0, T1_E=6, t1_i=19, t1_pc=0, t1_st=0, T2_E=17, t2_i=10, t2_pc=0, t2_st=0, token=22] [L20] int m_i ; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=21, E_2=8, E_M=16, local=20, M_E=18, m_i=0, m_pc=0, m_st=0, T1_E=6, t1_i=19, t1_pc=0, t1_st=0, T2_E=17, t2_i=10, t2_pc=0, t2_st=0, token=22] [L21] int t1_i ; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=21, E_2=8, E_M=16, local=20, M_E=18, m_i=0, m_pc=0, m_st=0, T1_E=6, t1_i=0, t1_pc=0, t1_st=0, T2_E=17, t2_i=10, t2_pc=0, t2_st=0, token=22] [L22] int t2_i ; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=21, E_2=8, E_M=16, local=20, M_E=18, m_i=0, m_pc=0, m_st=0, T1_E=6, t1_i=0, t1_pc=0, t1_st=0, T2_E=17, t2_i=0, t2_pc=0, t2_st=0, token=22] [L23] int M_E = 2; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=21, E_2=8, E_M=16, local=20, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=6, t1_i=0, t1_pc=0, t1_st=0, T2_E=17, t2_i=0, t2_pc=0, t2_st=0, token=22] [L24] int T1_E = 2; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=21, E_2=8, E_M=16, local=20, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=17, t2_i=0, t2_pc=0, t2_st=0, token=22] [L25] int T2_E = 2; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=21, E_2=8, E_M=16, local=20, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=22] [L26] int E_M = 2; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=21, E_2=8, E_M=2, local=20, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=22] [L27] int E_1 = 2; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=2, E_2=8, E_M=2, local=20, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=22] [L28] int E_2 = 2; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=2, E_2=2, E_M=2, local=20, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=22] [L33] int token ; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=2, E_2=2, E_M=2, local=20, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L35] int local ; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=2, E_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L600] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L604] CALL init_model() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L514] m_i = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L515] t1_i = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L516] t2_i = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L604] RET init_model() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L605] CALL start_simulation() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L541] int kernel_st ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L542] int tmp ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L543] int tmp___0 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L547] kernel_st = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L548] FCALL update_channels() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] CALL init_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L233] COND TRUE m_i == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L234] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L238] COND TRUE t1_i == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L239] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L243] COND TRUE t2_i == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L244] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] RET init_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L346] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L351] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L356] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L361] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L366] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L371] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L551] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L419] int tmp ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L420] int tmp___0 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L168] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L187] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L433] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L206] COND FALSE !(t2_pc == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_transmit2_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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L441] tmp___1 = is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_transmit2_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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L551] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L552] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L384] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L389] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L394] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L399] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L404] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L409] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L552] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L555] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] kernel_st = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] CALL eval() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L279] int tmp ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L256] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L274] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L293] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L294] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L295] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L296] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L307] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L308] int tmp_ndt_2; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L309] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L310] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L312] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L313] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L96] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L107] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L109] t1_pc = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L110] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L313] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L321] COND TRUE t2_st == 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L322] int tmp_ndt_3; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L323] tmp_ndt_3 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L324] COND TRUE \read(tmp_ndt_3) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L326] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L327] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L132] COND TRUE t2_pc == 0 VAL [\old(E_1)=2, \old(E_2)=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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L143] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L145] t2_pc = 1 VAL [\old(E_1)=2, \old(E_2)=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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=0] [L146] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L327] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L256] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L274] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L286] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L286] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L293] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L294] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L295] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L296] COND TRUE \read(tmp_ndt_1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L298] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L299] CALL master() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L38] int tmp_var = __VERIFIER_nondet_int(); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L40] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L51] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L54] token = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __VERIFIER_nondet_int()=-1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L55] local = token VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L56] E_1 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L57] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L419] int tmp ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L420] int tmp___0 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L168] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_master_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L425] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_master_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=-1] [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=-1] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L188] COND TRUE E_1 == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L189] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=1, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit1_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=-1] [L433] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit1_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=-1] [L435] COND TRUE \read(tmp___0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=-1] [L436] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=-1] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L207] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit2_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=-1] [L441] tmp___1 = is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit2_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=-1] [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=-1] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L57] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L58] E_1 = 2 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L59] m_pc = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L60] m_st = 2 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L299] RET master() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=-1] [L307] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=-1] [L308] int tmp_ndt_2; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_3=1, token=-1] [L309] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=-1] [L310] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=-1] [L312] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=-1] [L313] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L96] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L99] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L115] token += 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L116] E_2 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L117] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L419] int tmp ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L420] int tmp___0 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L168] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L169] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, __retres1=0, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, \result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_master_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L425] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_master_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L188] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, __retres1=0, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, \result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_transmit1_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L433] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_transmit1_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=0] [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=0] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L207] COND TRUE E_2 == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L208] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, __retres1=1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, \result=1, __retres1=1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_transmit2_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=0] [L441] tmp___1 = is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_transmit2_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, tmp___1=1, token=0] [L443] COND TRUE \read(tmp___1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, tmp___1=1, token=0] [L444] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=0] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L117] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L118] E_2 = 2 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L107] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L109] t1_pc = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L110] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L313] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L321] COND TRUE t2_st == 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L322] int tmp_ndt_3; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L323] tmp_ndt_3 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L324] COND TRUE \read(tmp_ndt_3) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L326] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L327] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=0] [L132] COND FALSE !(t2_pc == 0) VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=0] [L135] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=0] [L151] token += 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L152] E_M = 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L153] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L419] int tmp ; VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L420] int tmp___0 ; VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L168] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L169] COND TRUE E_M == 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_master_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L425] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_master_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=1] [L427] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=1] [L428] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=1] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L188] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_transmit1_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=1] [L433] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_transmit1_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=1] [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=1] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L207] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_transmit2_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=1] [L441] tmp___1 = is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_transmit2_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=1] [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=1] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L153] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L154] E_M = 2 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L143] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L145] t2_pc = 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L146] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L327] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L256] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L274] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L286] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L286] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L293] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L294] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L295] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L296] COND TRUE \read(tmp_ndt_1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L298] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L299] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L38] int tmp_var = __VERIFIER_nondet_int(); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, __VERIFIER_nondet_int()=5, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L40] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L43] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L65] COND FALSE !(token != local + 2) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L70] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L71] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L76] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L77] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L78] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L79] CALL error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L10] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 284 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 133.9s, OverallIterations: 19, TraceHistogramMax: 6, AutomataDifference: 100.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6233 SDtfs, 32770 SDslu, 2327 SDs, 0 SdLazy, 37239 SolverSat, 8797 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1747 GetRequests, 1191 SyntacticMatches, 1 SemanticMatches, 555 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5002 ImplicationChecksByTransitivity, 17.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12552occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 27672 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 6157 NumberOfCodeBlocks, 6157 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5746 ConstructedInterpolants, 0 QuantifiedInterpolants, 3827325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 3820/3920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...