java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:10:08,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:10:08,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:10:08,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:10:08,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:10:08,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:10:08,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:10:08,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:10:08,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:10:08,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:10:08,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:10:08,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:10:08,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:10:08,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:10:08,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:10:08,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:10:08,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:10:08,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:10:08,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:10:08,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:10:08,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:10:08,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:10:08,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:10:08,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:10:08,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:10:08,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:10:08,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:10:08,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:10:08,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:10:08,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:10:08,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:10:08,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:10:08,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:10:08,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:10:08,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:10:08,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:10:08,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:10:08,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:10:08,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:10:08,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:10:08,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:10:08,256 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:10:08,276 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:10:08,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:10:08,277 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:10:08,278 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:10:08,278 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:10:08,278 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:10:08,279 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:10:08,279 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:10:08,279 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:10:08,279 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:10:08,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:10:08,281 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:10:08,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:10:08,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:10:08,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:10:08,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:10:08,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:10:08,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:10:08,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:10:08,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:10:08,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:10:08,284 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:10:08,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:10:08,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:10:08,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:10:08,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:10:08,285 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:10:08,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:10:08,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:10:08,286 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:10:08,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:10:08,351 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:10:08,354 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:10:08,355 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:10:08,356 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:10:08,356 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2019-09-16 17:10:08,423 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bdaeb621/dea809c8979940e8889028f51d6aebda/FLAG369fd737b [2019-09-16 17:10:08,907 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:10:08,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2019-09-16 17:10:08,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bdaeb621/dea809c8979940e8889028f51d6aebda/FLAG369fd737b [2019-09-16 17:10:09,260 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bdaeb621/dea809c8979940e8889028f51d6aebda [2019-09-16 17:10:09,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:10:09,270 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:10:09,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:10:09,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:10:09,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:10:09,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:10:09" (1/1) ... [2019-09-16 17:10:09,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78cb2f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:09, skipping insertion in model container [2019-09-16 17:10:09,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:10:09" (1/1) ... [2019-09-16 17:10:09,286 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:10:09,323 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:10:09,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:10:09,638 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:10:09,686 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:10:09,707 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:10:09,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:09 WrapperNode [2019-09-16 17:10:09,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:10:09,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:10:09,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:10:09,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:10:09,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:09" (1/1) ... [2019-09-16 17:10:09,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:09" (1/1) ... [2019-09-16 17:10:09,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:09" (1/1) ... [2019-09-16 17:10:09,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:09" (1/1) ... [2019-09-16 17:10:09,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:09" (1/1) ... [2019-09-16 17:10:09,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:09" (1/1) ... [2019-09-16 17:10:09,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:09" (1/1) ... [2019-09-16 17:10:09,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:10:09,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:10:09,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:10:09,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:10:09,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:10:09,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:10:09,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:10:09,810 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-16 17:10:09,810 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-16 17:10:09,811 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-16 17:10:09,811 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-16 17:10:09,811 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-16 17:10:09,811 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-16 17:10:09,811 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-16 17:10:09,811 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-16 17:10:09,812 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-16 17:10:09,812 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-16 17:10:09,812 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-16 17:10:09,812 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-16 17:10:09,812 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-16 17:10:09,812 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-16 17:10:09,813 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-16 17:10:09,813 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-16 17:10:09,813 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-16 17:10:09,813 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-16 17:10:09,813 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-16 17:10:09,813 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-16 17:10:09,814 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:10:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:10:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-16 17:10:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-16 17:10:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-16 17:10:09,814 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-16 17:10:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-16 17:10:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:10:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-16 17:10:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-16 17:10:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-16 17:10:09,815 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-16 17:10:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-16 17:10:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-16 17:10:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-16 17:10:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-16 17:10:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-16 17:10:09,816 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-16 17:10:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-16 17:10:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-16 17:10:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-16 17:10:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-16 17:10:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-16 17:10:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:10:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:10:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:10:10,378 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:10:10,378 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-16 17:10:10,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:10:10 BoogieIcfgContainer [2019-09-16 17:10:10,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:10:10,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:10:10,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:10:10,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:10:10,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:10:09" (1/3) ... [2019-09-16 17:10:10,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15302c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:10:10, skipping insertion in model container [2019-09-16 17:10:10,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:09" (2/3) ... [2019-09-16 17:10:10,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15302c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:10:10, skipping insertion in model container [2019-09-16 17:10:10,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:10:10" (3/3) ... [2019-09-16 17:10:10,387 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2019-09-16 17:10:10,397 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:10:10,404 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:10:10,421 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:10:10,447 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:10:10,447 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:10:10,447 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:10:10,447 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:10:10,448 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:10:10,448 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:10:10,448 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:10:10,448 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:10:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2019-09-16 17:10:10,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-16 17:10:10,483 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:10,484 INFO L407 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] [2019-09-16 17:10:10,486 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:10,492 INFO L82 PathProgramCache]: Analyzing trace with hash -67309704, now seen corresponding path program 1 times [2019-09-16 17:10:10,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:10,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:10,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:10,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:10,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:10,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:10,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:10,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:10,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:10,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:10,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:10,927 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 5 states. [2019-09-16 17:10:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:11,668 INFO L93 Difference]: Finished difference Result 214 states and 299 transitions. [2019-09-16 17:10:11,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:11,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-16 17:10:11,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:11,697 INFO L225 Difference]: With dead ends: 214 [2019-09-16 17:10:11,697 INFO L226 Difference]: Without dead ends: 202 [2019-09-16 17:10:11,704 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:11,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-16 17:10:11,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 172. [2019-09-16 17:10:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:10:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 234 transitions. [2019-09-16 17:10:11,808 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 234 transitions. Word has length 92 [2019-09-16 17:10:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:11,809 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 234 transitions. [2019-09-16 17:10:11,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 234 transitions. [2019-09-16 17:10:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-16 17:10:11,824 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:11,825 INFO L407 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] [2019-09-16 17:10:11,825 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:11,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:11,825 INFO L82 PathProgramCache]: Analyzing trace with hash -559935878, now seen corresponding path program 1 times [2019-09-16 17:10:11,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:11,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:11,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:11,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:11,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:12,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:12,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:12,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:12,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:12,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:12,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:12,023 INFO L87 Difference]: Start difference. First operand 172 states and 234 transitions. Second operand 5 states. [2019-09-16 17:10:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:12,482 INFO L93 Difference]: Finished difference Result 200 states and 281 transitions. [2019-09-16 17:10:12,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:12,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-16 17:10:12,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:12,485 INFO L225 Difference]: With dead ends: 200 [2019-09-16 17:10:12,490 INFO L226 Difference]: Without dead ends: 200 [2019-09-16 17:10:12,490 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:12,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-16 17:10:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 172. [2019-09-16 17:10:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:10:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 233 transitions. [2019-09-16 17:10:12,512 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 233 transitions. Word has length 92 [2019-09-16 17:10:12,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:12,513 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 233 transitions. [2019-09-16 17:10:12,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 233 transitions. [2019-09-16 17:10:12,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-16 17:10:12,518 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:12,518 INFO L407 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] [2019-09-16 17:10:12,518 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:12,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:12,519 INFO L82 PathProgramCache]: Analyzing trace with hash 394004280, now seen corresponding path program 1 times [2019-09-16 17:10:12,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:12,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:12,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:12,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:12,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:12,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:12,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:12,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:12,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:12,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:12,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:12,633 INFO L87 Difference]: Start difference. First operand 172 states and 233 transitions. Second operand 5 states. [2019-09-16 17:10:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:13,038 INFO L93 Difference]: Finished difference Result 217 states and 308 transitions. [2019-09-16 17:10:13,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:13,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-16 17:10:13,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:13,042 INFO L225 Difference]: With dead ends: 217 [2019-09-16 17:10:13,042 INFO L226 Difference]: Without dead ends: 217 [2019-09-16 17:10:13,042 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-16 17:10:13,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 172. [2019-09-16 17:10:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:10:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 232 transitions. [2019-09-16 17:10:13,067 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 232 transitions. Word has length 92 [2019-09-16 17:10:13,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:13,068 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 232 transitions. [2019-09-16 17:10:13,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:13,068 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 232 transitions. [2019-09-16 17:10:13,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-16 17:10:13,071 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:13,071 INFO L407 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] [2019-09-16 17:10:13,071 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:13,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:13,072 INFO L82 PathProgramCache]: Analyzing trace with hash -822149446, now seen corresponding path program 1 times [2019-09-16 17:10:13,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:13,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:13,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:13,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:13,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:13,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:13,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:13,180 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:13,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:13,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:13,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:13,182 INFO L87 Difference]: Start difference. First operand 172 states and 232 transitions. Second operand 5 states. [2019-09-16 17:10:13,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:13,560 INFO L93 Difference]: Finished difference Result 211 states and 298 transitions. [2019-09-16 17:10:13,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:13,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-16 17:10:13,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:13,563 INFO L225 Difference]: With dead ends: 211 [2019-09-16 17:10:13,564 INFO L226 Difference]: Without dead ends: 211 [2019-09-16 17:10:13,564 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:13,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-16 17:10:13,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 172. [2019-09-16 17:10:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:10:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 231 transitions. [2019-09-16 17:10:13,576 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 231 transitions. Word has length 92 [2019-09-16 17:10:13,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:13,576 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 231 transitions. [2019-09-16 17:10:13,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 231 transitions. [2019-09-16 17:10:13,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-16 17:10:13,578 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:13,578 INFO L407 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] [2019-09-16 17:10:13,578 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:13,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:13,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1554116872, now seen corresponding path program 1 times [2019-09-16 17:10:13,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:13,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:13,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:13,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:13,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:13,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:13,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:13,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:13,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:13,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:13,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:13,637 INFO L87 Difference]: Start difference. First operand 172 states and 231 transitions. Second operand 5 states. [2019-09-16 17:10:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:14,007 INFO L93 Difference]: Finished difference Result 213 states and 298 transitions. [2019-09-16 17:10:14,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:14,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-16 17:10:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:14,010 INFO L225 Difference]: With dead ends: 213 [2019-09-16 17:10:14,010 INFO L226 Difference]: Without dead ends: 213 [2019-09-16 17:10:14,010 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-16 17:10:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 172. [2019-09-16 17:10:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 17:10:14,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 230 transitions. [2019-09-16 17:10:14,020 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 230 transitions. Word has length 92 [2019-09-16 17:10:14,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:14,021 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 230 transitions. [2019-09-16 17:10:14,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 230 transitions. [2019-09-16 17:10:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-16 17:10:14,022 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:14,023 INFO L407 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] [2019-09-16 17:10:14,023 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:14,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:14,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1054670586, now seen corresponding path program 1 times [2019-09-16 17:10:14,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:14,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:14,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:14,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:14,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:14,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:14,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:10:14,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:14,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:10:14,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:10:14,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:10:14,077 INFO L87 Difference]: Start difference. First operand 172 states and 230 transitions. Second operand 4 states. [2019-09-16 17:10:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:14,297 INFO L93 Difference]: Finished difference Result 309 states and 409 transitions. [2019-09-16 17:10:14,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:10:14,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-16 17:10:14,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:14,301 INFO L225 Difference]: With dead ends: 309 [2019-09-16 17:10:14,301 INFO L226 Difference]: Without dead ends: 309 [2019-09-16 17:10:14,301 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:10:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-16 17:10:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2019-09-16 17:10:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-16 17:10:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 408 transitions. [2019-09-16 17:10:14,315 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 408 transitions. Word has length 92 [2019-09-16 17:10:14,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:14,315 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 408 transitions. [2019-09-16 17:10:14,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:10:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 408 transitions. [2019-09-16 17:10:14,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-16 17:10:14,318 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:14,318 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:14,318 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:14,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:14,319 INFO L82 PathProgramCache]: Analyzing trace with hash -922442114, now seen corresponding path program 1 times [2019-09-16 17:10:14,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:14,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:14,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:14,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:14,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-16 17:10:14,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:10:14,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:10:14,404 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-09-16 17:10:14,406 INFO L207 CegarAbsIntRunner]: [58], [63], [77], [80], [83], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [140], [142], [144], [145], [184], [185], [187], [192], [195], [198], [203], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [248], [256], [260], [266], [272], [278], [282], [285], [291], [297], [301], [302], [305], [307], [310], [321], [323], [325], [329], [367], [370], [371], [372], [381], [384], [387], [393], [396], [415], [428], [434], [435], [449], [451], [484], [485], [490], [491], [492], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [506], [510], [511], [512], [513], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2019-09-16 17:10:14,448 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:10:14,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:10:14,634 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:10:14,636 INFO L272 AbstractInterpreter]: Visited 50 different actions 50 times. Never merged. Never widened. Performed 215 root evaluator evaluations with a maximum evaluation depth of 4. Performed 215 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 40 variables. [2019-09-16 17:10:14,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:14,640 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:10:14,761 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 65.93% of their original sizes. [2019-09-16 17:10:14,761 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:10:14,954 INFO L420 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2019-09-16 17:10:14,956 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:10:14,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:10:14,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2019-09-16 17:10:14,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:14,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-16 17:10:14,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-16 17:10:14,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-09-16 17:10:14,959 INFO L87 Difference]: Start difference. First operand 308 states and 408 transitions. Second operand 15 states. [2019-09-16 17:10:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:17,550 INFO L93 Difference]: Finished difference Result 411 states and 524 transitions. [2019-09-16 17:10:17,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-16 17:10:17,550 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2019-09-16 17:10:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:17,553 INFO L225 Difference]: With dead ends: 411 [2019-09-16 17:10:17,554 INFO L226 Difference]: Without dead ends: 411 [2019-09-16 17:10:17,554 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-09-16 17:10:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-09-16 17:10:17,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 403. [2019-09-16 17:10:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-16 17:10:17,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 515 transitions. [2019-09-16 17:10:17,571 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 515 transitions. Word has length 147 [2019-09-16 17:10:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:17,572 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 515 transitions. [2019-09-16 17:10:17,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-16 17:10:17,572 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 515 transitions. [2019-09-16 17:10:17,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-16 17:10:17,574 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:17,575 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:17,575 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:17,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:17,575 INFO L82 PathProgramCache]: Analyzing trace with hash -388165441, now seen corresponding path program 1 times [2019-09-16 17:10:17,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:17,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:17,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:17,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:17,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-16 17:10:17,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:17,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:10:17,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:17,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:10:17,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:10:17,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:17,657 INFO L87 Difference]: Start difference. First operand 403 states and 515 transitions. Second operand 6 states. [2019-09-16 17:10:17,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:17,690 INFO L93 Difference]: Finished difference Result 423 states and 543 transitions. [2019-09-16 17:10:17,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:10:17,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-09-16 17:10:17,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:17,696 INFO L225 Difference]: With dead ends: 423 [2019-09-16 17:10:17,696 INFO L226 Difference]: Without dead ends: 423 [2019-09-16 17:10:17,697 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:10:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-09-16 17:10:17,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 413. [2019-09-16 17:10:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-09-16 17:10:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 525 transitions. [2019-09-16 17:10:17,722 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 525 transitions. Word has length 147 [2019-09-16 17:10:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:17,722 INFO L475 AbstractCegarLoop]: Abstraction has 413 states and 525 transitions. [2019-09-16 17:10:17,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:10:17,723 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 525 transitions. [2019-09-16 17:10:17,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-16 17:10:17,727 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:17,727 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:17,727 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:17,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:17,728 INFO L82 PathProgramCache]: Analyzing trace with hash 271366081, now seen corresponding path program 1 times [2019-09-16 17:10:17,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:17,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:17,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:17,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:17,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-16 17:10:17,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:10:17,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:10:17,804 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-09-16 17:10:17,806 INFO L207 CegarAbsIntRunner]: [58], [63], [77], [80], [83], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [140], [142], [144], [145], [184], [185], [187], [192], [195], [200], [203], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [302], [305], [307], [310], [321], [323], [325], [329], [367], [370], [371], [372], [381], [384], [387], [393], [396], [415], [428], [434], [435], [449], [451], [484], [485], [490], [491], [492], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [506], [510], [511], [512], [513], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2019-09-16 17:10:17,816 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:10:17,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:10:17,867 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:10:17,867 INFO L272 AbstractInterpreter]: Visited 101 different actions 131 times. Never merged. Never widened. Performed 463 root evaluator evaluations with a maximum evaluation depth of 4. Performed 463 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 40 variables. [2019-09-16 17:10:17,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:17,868 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:10:18,020 INFO L227 lantSequenceWeakener]: Weakened 139 states. On average, predicates are now at 74.09% of their original sizes. [2019-09-16 17:10:18,020 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:10:19,204 INFO L420 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2019-09-16 17:10:19,204 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:10:19,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:10:19,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [4] total 56 [2019-09-16 17:10:19,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:19,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-16 17:10:19,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-16 17:10:19,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2585, Unknown=0, NotChecked=0, Total=2862 [2019-09-16 17:10:19,207 INFO L87 Difference]: Start difference. First operand 413 states and 525 transitions. Second operand 54 states. [2019-09-16 17:10:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:42,775 INFO L93 Difference]: Finished difference Result 722 states and 897 transitions. [2019-09-16 17:10:42,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-16 17:10:42,775 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 147 [2019-09-16 17:10:42,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:42,782 INFO L225 Difference]: With dead ends: 722 [2019-09-16 17:10:42,782 INFO L226 Difference]: Without dead ends: 722 [2019-09-16 17:10:42,789 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4492 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1331, Invalid=13189, Unknown=0, NotChecked=0, Total=14520 [2019-09-16 17:10:42,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-09-16 17:10:42,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 704. [2019-09-16 17:10:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-09-16 17:10:42,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 879 transitions. [2019-09-16 17:10:42,828 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 879 transitions. Word has length 147 [2019-09-16 17:10:42,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:42,830 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 879 transitions. [2019-09-16 17:10:42,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-16 17:10:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 879 transitions. [2019-09-16 17:10:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-16 17:10:42,836 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:42,837 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:42,837 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:42,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:42,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1454290887, now seen corresponding path program 1 times [2019-09-16 17:10:42,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:42,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:42,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:42,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:42,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:42,958 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-16 17:10:42,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:42,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:42,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:42,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:42,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:42,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:42,961 INFO L87 Difference]: Start difference. First operand 704 states and 879 transitions. Second operand 5 states. [2019-09-16 17:10:43,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:43,616 INFO L93 Difference]: Finished difference Result 1011 states and 1280 transitions. [2019-09-16 17:10:43,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 17:10:43,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-09-16 17:10:43,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:43,623 INFO L225 Difference]: With dead ends: 1011 [2019-09-16 17:10:43,624 INFO L226 Difference]: Without dead ends: 1011 [2019-09-16 17:10:43,624 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:10:43,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-09-16 17:10:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 975. [2019-09-16 17:10:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2019-09-16 17:10:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1227 transitions. [2019-09-16 17:10:43,663 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1227 transitions. Word has length 154 [2019-09-16 17:10:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:43,664 INFO L475 AbstractCegarLoop]: Abstraction has 975 states and 1227 transitions. [2019-09-16 17:10:43,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1227 transitions. [2019-09-16 17:10:43,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-16 17:10:43,671 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:43,672 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-16 17:10:43,672 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:43,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:43,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1376863560, now seen corresponding path program 1 times [2019-09-16 17:10:43,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:43,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:43,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:43,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:43,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-16 17:10:43,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:10:43,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:10:43,787 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2019-09-16 17:10:43,789 INFO L207 CegarAbsIntRunner]: [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [302], [305], [307], [310], [321], [323], [325], [329], [367], [370], [371], [372], [381], [384], [387], [393], [396], [406], [412], [419], [422], [434], [435], [449], [451], [484], [485], [488], [489], [490], [491], [492], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [506], [510], [511], [512], [513], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2019-09-16 17:10:43,799 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:10:43,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:10:43,837 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:10:43,838 INFO L272 AbstractInterpreter]: Visited 108 different actions 140 times. Never merged. Never widened. Performed 520 root evaluator evaluations with a maximum evaluation depth of 4. Performed 520 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 42 variables. [2019-09-16 17:10:43,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:43,838 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:10:43,921 INFO L227 lantSequenceWeakener]: Weakened 145 states. On average, predicates are now at 73.51% of their original sizes. [2019-09-16 17:10:43,921 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:10:45,327 INFO L420 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2019-09-16 17:10:45,327 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:10:45,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:10:45,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [5] total 59 [2019-09-16 17:10:45,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:45,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-16 17:10:45,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-16 17:10:45,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2810, Unknown=0, NotChecked=0, Total=3080 [2019-09-16 17:10:45,330 INFO L87 Difference]: Start difference. First operand 975 states and 1227 transitions. Second operand 56 states. [2019-09-16 17:11:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:06,196 INFO L93 Difference]: Finished difference Result 1047 states and 1320 transitions. [2019-09-16 17:11:06,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-16 17:11:06,196 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 192 [2019-09-16 17:11:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:06,202 INFO L225 Difference]: With dead ends: 1047 [2019-09-16 17:11:06,202 INFO L226 Difference]: Without dead ends: 1047 [2019-09-16 17:11:06,206 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3973 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1141, Invalid=12199, Unknown=0, NotChecked=0, Total=13340 [2019-09-16 17:11:06,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-09-16 17:11:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 985. [2019-09-16 17:11:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-09-16 17:11:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1243 transitions. [2019-09-16 17:11:06,236 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1243 transitions. Word has length 192 [2019-09-16 17:11:06,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:06,237 INFO L475 AbstractCegarLoop]: Abstraction has 985 states and 1243 transitions. [2019-09-16 17:11:06,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-16 17:11:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1243 transitions. [2019-09-16 17:11:06,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-16 17:11:06,240 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:06,241 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:11:06,241 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:06,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2136524974, now seen corresponding path program 1 times [2019-09-16 17:11:06,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:06,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:06,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:06,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:06,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-16 17:11:06,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:11:06,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:11:06,325 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2019-09-16 17:11:06,325 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [302], [305], [307], [310], [321], [323], [325], [329], [367], [370], [371], [372], [381], [384], [387], [393], [396], [406], [409], [419], [422], [434], [435], [449], [451], [484], [485], [488], [489], [490], [491], [492], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [506], [510], [511], [512], [513], [514], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2019-09-16 17:11:06,328 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:11:06,329 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:11:06,362 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:11:06,363 INFO L272 AbstractInterpreter]: Visited 114 different actions 146 times. Never merged. Never widened. Performed 562 root evaluator evaluations with a maximum evaluation depth of 4. Performed 562 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 42 variables. [2019-09-16 17:11:06,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:06,363 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:11:06,447 INFO L227 lantSequenceWeakener]: Weakened 151 states. On average, predicates are now at 73.8% of their original sizes. [2019-09-16 17:11:06,447 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:11:07,744 INFO L420 sIntCurrentIteration]: We unified 197 AI predicates to 197 [2019-09-16 17:11:07,745 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:11:07,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:11:07,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [58] imperfect sequences [5] total 61 [2019-09-16 17:11:07,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:07,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-16 17:11:07,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-16 17:11:07,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=3030, Unknown=0, NotChecked=0, Total=3306 [2019-09-16 17:11:07,748 INFO L87 Difference]: Start difference. First operand 985 states and 1243 transitions. Second operand 58 states. [2019-09-16 17:11:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:25,226 INFO L93 Difference]: Finished difference Result 1349 states and 1719 transitions. [2019-09-16 17:11:25,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-16 17:11:25,227 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 198 [2019-09-16 17:11:25,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:25,235 INFO L225 Difference]: With dead ends: 1349 [2019-09-16 17:11:25,235 INFO L226 Difference]: Without dead ends: 1349 [2019-09-16 17:11:25,239 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4034 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1137, Invalid=12435, Unknown=0, NotChecked=0, Total=13572 [2019-09-16 17:11:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2019-09-16 17:11:25,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1271. [2019-09-16 17:11:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-09-16 17:11:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1617 transitions. [2019-09-16 17:11:25,276 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1617 transitions. Word has length 198 [2019-09-16 17:11:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:25,277 INFO L475 AbstractCegarLoop]: Abstraction has 1271 states and 1617 transitions. [2019-09-16 17:11:25,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-16 17:11:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1617 transitions. [2019-09-16 17:11:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-16 17:11:25,281 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:25,282 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:11:25,282 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:25,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash -713802865, now seen corresponding path program 1 times [2019-09-16 17:11:25,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:25,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:25,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:25,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:25,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-16 17:11:25,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:11:25,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:11:25,373 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2019-09-16 17:11:25,373 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [302], [305], [307], [310], [321], [323], [325], [329], [367], [370], [371], [372], [381], [384], [387], [393], [396], [399], [406], [409], [415], [419], [422], [428], [434], [435], [449], [451], [484], [485], [488], [489], [490], [491], [492], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [506], [510], [511], [512], [513], [514], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2019-09-16 17:11:25,375 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:11:25,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:11:25,442 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:11:25,444 INFO L272 AbstractInterpreter]: Visited 117 different actions 163 times. Merged at 6 different actions 6 times. Never widened. Performed 661 root evaluator evaluations with a maximum evaluation depth of 4. Performed 661 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 42 variables. [2019-09-16 17:11:25,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:25,444 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:11:25,625 INFO L227 lantSequenceWeakener]: Weakened 163 states. On average, predicates are now at 74.25% of their original sizes. [2019-09-16 17:11:25,626 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:11:26,985 INFO L420 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2019-09-16 17:11:26,985 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:11:26,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:11:26,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [62] imperfect sequences [4] total 64 [2019-09-16 17:11:26,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:26,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-16 17:11:26,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-16 17:11:26,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=3423, Unknown=0, NotChecked=0, Total=3782 [2019-09-16 17:11:26,989 INFO L87 Difference]: Start difference. First operand 1271 states and 1617 transitions. Second operand 62 states. [2019-09-16 17:12:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:05,331 INFO L93 Difference]: Finished difference Result 2870 states and 3700 transitions. [2019-09-16 17:12:05,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-16 17:12:05,331 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 211 [2019-09-16 17:12:05,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:05,345 INFO L225 Difference]: With dead ends: 2870 [2019-09-16 17:12:05,345 INFO L226 Difference]: Without dead ends: 2870 [2019-09-16 17:12:05,349 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5997 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1689, Invalid=17217, Unknown=0, NotChecked=0, Total=18906 [2019-09-16 17:12:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2019-09-16 17:12:05,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2614. [2019-09-16 17:12:05,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2614 states. [2019-09-16 17:12:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 3357 transitions. [2019-09-16 17:12:05,431 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 3357 transitions. Word has length 211 [2019-09-16 17:12:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:05,431 INFO L475 AbstractCegarLoop]: Abstraction has 2614 states and 3357 transitions. [2019-09-16 17:12:05,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-16 17:12:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 3357 transitions. [2019-09-16 17:12:05,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-16 17:12:05,436 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:05,437 INFO L407 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, 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] [2019-09-16 17:12:05,437 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:05,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:05,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1877537107, now seen corresponding path program 1 times [2019-09-16 17:12:05,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:05,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:05,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:05,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:05,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-16 17:12:05,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:05,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:12:05,516 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2019-09-16 17:12:05,516 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [216], [219], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [302], [305], [307], [310], [321], [323], [325], [329], [367], [370], [371], [372], [381], [384], [387], [393], [396], [402], [406], [412], [415], [419], [422], [434], [435], [449], [451], [484], [485], [488], [489], [490], [491], [492], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [506], [510], [511], [512], [513], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2019-09-16 17:12:05,518 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:12:05,518 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:12:05,577 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:12:05,578 INFO L272 AbstractInterpreter]: Visited 126 different actions 297 times. Merged at 25 different actions 31 times. Never widened. Performed 1164 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1164 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 42 variables. [2019-09-16 17:12:05,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:05,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:12:05,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:05,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:12:05,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:05,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:12:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:05,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-16 17:12:05,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:12:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-16 17:12:05,927 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:12:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 17:12:06,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-16 17:12:06,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2019-09-16 17:12:06,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:06,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:12:06,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:12:06,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:12:06,103 INFO L87 Difference]: Start difference. First operand 2614 states and 3357 transitions. Second operand 3 states. [2019-09-16 17:12:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:06,136 INFO L93 Difference]: Finished difference Result 3089 states and 4061 transitions. [2019-09-16 17:12:06,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:12:06,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-16 17:12:06,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:06,151 INFO L225 Difference]: With dead ends: 3089 [2019-09-16 17:12:06,152 INFO L226 Difference]: Without dead ends: 3089 [2019-09-16 17:12:06,153 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:12:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2019-09-16 17:12:06,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 3085. [2019-09-16 17:12:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3085 states. [2019-09-16 17:12:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 3085 states and 4058 transitions. [2019-09-16 17:12:06,261 INFO L78 Accepts]: Start accepts. Automaton has 3085 states and 4058 transitions. Word has length 212 [2019-09-16 17:12:06,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:06,263 INFO L475 AbstractCegarLoop]: Abstraction has 3085 states and 4058 transitions. [2019-09-16 17:12:06,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:12:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3085 states and 4058 transitions. [2019-09-16 17:12:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-16 17:12:06,270 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:06,271 INFO L407 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, 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] [2019-09-16 17:12:06,272 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:06,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:06,272 INFO L82 PathProgramCache]: Analyzing trace with hash 524487151, now seen corresponding path program 1 times [2019-09-16 17:12:06,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:06,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:06,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:06,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:06,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-16 17:12:06,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:06,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:12:06,364 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2019-09-16 17:12:06,365 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [206], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [302], [305], [307], [310], [321], [323], [325], [329], [367], [370], [371], [372], [381], [384], [387], [393], [396], [399], [406], [412], [415], [419], [422], [434], [435], [449], [451], [484], [485], [488], [489], [490], [491], [492], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [506], [510], [511], [512], [513], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2019-09-16 17:12:06,366 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:12:06,367 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:12:06,434 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:12:06,434 INFO L272 AbstractInterpreter]: Visited 121 different actions 293 times. Merged at 13 different actions 25 times. Never widened. Performed 1759 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1759 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2019-09-16 17:12:06,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:06,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:12:06,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:06,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:12:06,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:06,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:12:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:06,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-16 17:12:06,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:12:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-16 17:12:06,679 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:12:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-16 17:12:06,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-16 17:12:06,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 8 [2019-09-16 17:12:06,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:06,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:12:06,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:12:06,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:12:06,941 INFO L87 Difference]: Start difference. First operand 3085 states and 4058 transitions. Second operand 4 states. [2019-09-16 17:12:07,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:07,208 INFO L93 Difference]: Finished difference Result 3559 states and 4798 transitions. [2019-09-16 17:12:07,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:12:07,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-09-16 17:12:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:07,227 INFO L225 Difference]: With dead ends: 3559 [2019-09-16 17:12:07,227 INFO L226 Difference]: Without dead ends: 3559 [2019-09-16 17:12:07,227 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 411 SyntacticMatches, 11 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:12:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2019-09-16 17:12:07,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 3472. [2019-09-16 17:12:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3472 states. [2019-09-16 17:12:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 4597 transitions. [2019-09-16 17:12:07,337 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 4597 transitions. Word has length 212 [2019-09-16 17:12:07,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:07,337 INFO L475 AbstractCegarLoop]: Abstraction has 3472 states and 4597 transitions. [2019-09-16 17:12:07,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:12:07,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4597 transitions. [2019-09-16 17:12:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-16 17:12:07,345 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:07,345 INFO L407 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, 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] [2019-09-16 17:12:07,346 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:07,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1588206978, now seen corresponding path program 1 times [2019-09-16 17:12:07,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:07,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:07,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:07,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:07,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-09-16 17:12:07,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:07,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:12:07,477 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 270 with the following transitions: [2019-09-16 17:12:07,477 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [47], [49], [57], [58], [63], [77], [80], [83], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [302], [305], [307], [310], [321], [323], [325], [329], [367], [370], [371], [372], [381], [384], [387], [393], [396], [399], [406], [409], [412], [419], [422], [428], [434], [435], [449], [451], [484], [485], [486], [487], [490], [491], [492], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [506], [510], [511], [512], [513], [514], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2019-09-16 17:12:07,479 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:12:07,479 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:12:07,567 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:12:07,567 INFO L272 AbstractInterpreter]: Visited 122 different actions 327 times. Merged at 15 different actions 38 times. Never widened. Performed 2211 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2211 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 5 different actions. Largest state had 42 variables. [2019-09-16 17:12:07,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:07,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:12:07,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:07,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:12:07,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:07,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:12:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:07,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 17:12:07,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:12:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-16 17:12:07,879 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:12:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 60 proven. 9 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-09-16 17:12:08,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-16 17:12:08,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 8 [2019-09-16 17:12:08,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:08,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:12:08,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:12:08,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:12:08,096 INFO L87 Difference]: Start difference. First operand 3472 states and 4597 transitions. Second operand 3 states. [2019-09-16 17:12:08,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:08,136 INFO L93 Difference]: Finished difference Result 3929 states and 5278 transitions. [2019-09-16 17:12:08,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:12:08,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-09-16 17:12:08,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:08,155 INFO L225 Difference]: With dead ends: 3929 [2019-09-16 17:12:08,155 INFO L226 Difference]: Without dead ends: 3929 [2019-09-16 17:12:08,155 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:12:08,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3929 states. [2019-09-16 17:12:08,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3929 to 3919. [2019-09-16 17:12:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3919 states. [2019-09-16 17:12:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 5269 transitions. [2019-09-16 17:12:08,267 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 5269 transitions. Word has length 269 [2019-09-16 17:12:08,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:08,268 INFO L475 AbstractCegarLoop]: Abstraction has 3919 states and 5269 transitions. [2019-09-16 17:12:08,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:12:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 5269 transitions. [2019-09-16 17:12:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-16 17:12:08,276 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:08,276 INFO L407 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, 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] [2019-09-16 17:12:08,277 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:08,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:08,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1704201577, now seen corresponding path program 1 times [2019-09-16 17:12:08,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:08,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:08,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:08,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:08,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-16 17:12:08,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:08,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:12:08,396 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2019-09-16 17:12:08,396 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [47], [49], [57], [58], [63], [77], [80], [83], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [216], [219], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [302], [305], [307], [310], [321], [323], [325], [329], [367], [370], [371], [372], [381], [384], [387], [393], [396], [402], [406], [409], [412], [419], [422], [428], [434], [435], [449], [451], [484], [485], [486], [487], [490], [491], [492], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [506], [510], [511], [512], [513], [514], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2019-09-16 17:12:08,398 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:12:08,398 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:12:08,444 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:12:08,444 INFO L272 AbstractInterpreter]: Visited 119 different actions 196 times. Merged at 15 different actions 22 times. Never widened. Performed 842 root evaluator evaluations with a maximum evaluation depth of 4. Performed 842 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 42 variables. [2019-09-16 17:12:08,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:08,445 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:12:08,545 INFO L227 lantSequenceWeakener]: Weakened 165 states. On average, predicates are now at 73.51% of their original sizes. [2019-09-16 17:12:08,545 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:12:10,602 INFO L420 sIntCurrentIteration]: We unified 211 AI predicates to 211 [2019-09-16 17:12:10,602 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:12:10,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:12:10,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [6] total 73 [2019-09-16 17:12:10,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:10,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-16 17:12:10,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-16 17:12:10,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=4322, Unknown=0, NotChecked=0, Total=4692 [2019-09-16 17:12:10,605 INFO L87 Difference]: Start difference. First operand 3919 states and 5269 transitions. Second operand 69 states. [2019-09-16 17:12:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:38,433 INFO L93 Difference]: Finished difference Result 2985 states and 4039 transitions. [2019-09-16 17:12:38,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-16 17:12:38,434 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 212 [2019-09-16 17:12:38,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:38,447 INFO L225 Difference]: With dead ends: 2985 [2019-09-16 17:12:38,447 INFO L226 Difference]: Without dead ends: 2985 [2019-09-16 17:12:38,449 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5788 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1537, Invalid=16553, Unknown=0, NotChecked=0, Total=18090 [2019-09-16 17:12:38,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2019-09-16 17:12:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2918. [2019-09-16 17:12:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2918 states. [2019-09-16 17:12:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 3930 transitions. [2019-09-16 17:12:38,522 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 3930 transitions. Word has length 212 [2019-09-16 17:12:38,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:38,522 INFO L475 AbstractCegarLoop]: Abstraction has 2918 states and 3930 transitions. [2019-09-16 17:12:38,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-16 17:12:38,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 3930 transitions. [2019-09-16 17:12:38,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-16 17:12:38,529 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:38,529 INFO L407 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, 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] [2019-09-16 17:12:38,530 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:38,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:38,530 INFO L82 PathProgramCache]: Analyzing trace with hash 590772685, now seen corresponding path program 1 times [2019-09-16 17:12:38,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:38,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:38,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:38,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:38,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-16 17:12:38,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:12:38,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:12:38,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:38,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:12:38,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:12:38,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:12:38,614 INFO L87 Difference]: Start difference. First operand 2918 states and 3930 transitions. Second operand 4 states. [2019-09-16 17:12:38,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:38,768 INFO L93 Difference]: Finished difference Result 3044 states and 4026 transitions. [2019-09-16 17:12:38,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:12:38,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-09-16 17:12:38,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:38,786 INFO L225 Difference]: With dead ends: 3044 [2019-09-16 17:12:38,787 INFO L226 Difference]: Without dead ends: 3044 [2019-09-16 17:12:38,787 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:12:38,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2019-09-16 17:12:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3042. [2019-09-16 17:12:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3042 states. [2019-09-16 17:12:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 4022 transitions. [2019-09-16 17:12:38,868 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 4022 transitions. Word has length 212 [2019-09-16 17:12:38,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:38,868 INFO L475 AbstractCegarLoop]: Abstraction has 3042 states and 4022 transitions. [2019-09-16 17:12:38,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:12:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 4022 transitions. [2019-09-16 17:12:38,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-16 17:12:38,877 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:38,877 INFO L407 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, 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] [2019-09-16 17:12:38,878 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:38,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:38,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1034352459, now seen corresponding path program 1 times [2019-09-16 17:12:38,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:38,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:38,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:38,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:38,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:12:38,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:12:38,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:12:38,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:38,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:12:38,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:12:38,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:12:38,986 INFO L87 Difference]: Start difference. First operand 3042 states and 4022 transitions. Second operand 6 states. [2019-09-16 17:12:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:39,015 INFO L93 Difference]: Finished difference Result 2458 states and 3120 transitions. [2019-09-16 17:12:39,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:12:39,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2019-09-16 17:12:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:39,037 INFO L225 Difference]: With dead ends: 2458 [2019-09-16 17:12:39,037 INFO L226 Difference]: Without dead ends: 2458 [2019-09-16 17:12:39,038 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:12:39,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2458 states. [2019-09-16 17:12:39,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2458 to 2448. [2019-09-16 17:12:39,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2448 states. [2019-09-16 17:12:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 3105 transitions. [2019-09-16 17:12:39,091 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 3105 transitions. Word has length 213 [2019-09-16 17:12:39,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:39,092 INFO L475 AbstractCegarLoop]: Abstraction has 2448 states and 3105 transitions. [2019-09-16 17:12:39,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:12:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 3105 transitions. [2019-09-16 17:12:39,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-16 17:12:39,098 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:39,098 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:12:39,098 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:39,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:39,098 INFO L82 PathProgramCache]: Analyzing trace with hash -668065581, now seen corresponding path program 1 times [2019-09-16 17:12:39,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:39,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:39,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-16 17:12:39,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:39,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:12:39,181 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2019-09-16 17:12:39,182 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [206], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [302], [305], [307], [310], [321], [323], [325], [329], [367], [370], [371], [372], [381], [384], [387], [393], [396], [399], [406], [412], [415], [419], [422], [434], [435], [449], [451], [484], [485], [488], [489], [490], [491], [492], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [506], [510], [511], [512], [513], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2019-09-16 17:12:39,184 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:12:39,184 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:12:39,369 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:12:39,370 INFO L272 AbstractInterpreter]: Visited 127 different actions 995 times. Merged at 41 different actions 248 times. Widened at 1 different actions 1 times. Performed 4071 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4071 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 24 fixpoints after 8 different actions. Largest state had 42 variables. [2019-09-16 17:12:39,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:39,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:12:39,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:39,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:12:39,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:39,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:12:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:39,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-16 17:12:39,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:12:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-16 17:12:39,651 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:12:39,882 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 37 proven. 20 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-16 17:12:39,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-16 17:12:39,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 9 [2019-09-16 17:12:39,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:39,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:12:39,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:12:39,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:12:39,890 INFO L87 Difference]: Start difference. First operand 2448 states and 3105 transitions. Second operand 4 states. [2019-09-16 17:12:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:40,296 INFO L93 Difference]: Finished difference Result 4529 states and 6397 transitions. [2019-09-16 17:12:40,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:12:40,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-09-16 17:12:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:40,315 INFO L225 Difference]: With dead ends: 4529 [2019-09-16 17:12:40,315 INFO L226 Difference]: Without dead ends: 4529 [2019-09-16 17:12:40,315 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-16 17:12:40,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2019-09-16 17:12:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 4156. [2019-09-16 17:12:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4156 states. [2019-09-16 17:12:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4156 states to 4156 states and 5634 transitions. [2019-09-16 17:12:40,425 INFO L78 Accepts]: Start accepts. Automaton has 4156 states and 5634 transitions. Word has length 214 [2019-09-16 17:12:40,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:40,426 INFO L475 AbstractCegarLoop]: Abstraction has 4156 states and 5634 transitions. [2019-09-16 17:12:40,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:12:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 4156 states and 5634 transitions. [2019-09-16 17:12:40,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-16 17:12:40,434 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:40,434 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:12:40,434 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:40,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:40,435 INFO L82 PathProgramCache]: Analyzing trace with hash 592829452, now seen corresponding path program 1 times [2019-09-16 17:12:40,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:40,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:40,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:40,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:40,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-16 17:12:40,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:40,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:12:40,521 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2019-09-16 17:12:40,522 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [206], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [302], [305], [307], [310], [321], [323], [325], [329], [367], [370], [371], [372], [381], [384], [387], [393], [396], [399], [406], [412], [419], [422], [434], [435], [449], [451], [484], [485], [488], [489], [490], [491], [492], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [506], [510], [511], [512], [513], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2019-09-16 17:12:40,523 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:12:40,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:12:40,655 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:12:40,655 INFO L272 AbstractInterpreter]: Visited 126 different actions 681 times. Merged at 41 different actions 155 times. Never widened. Performed 2586 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2586 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 15 fixpoints after 5 different actions. Largest state had 42 variables. [2019-09-16 17:12:40,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:40,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:12:40,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:40,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:12:40,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:40,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:12:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:40,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-16 17:12:40,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:12:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-16 17:12:40,888 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:12:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-16 17:12:41,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-16 17:12:41,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 6 [2019-09-16 17:12:41,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:41,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:12:41,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:12:41,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:12:41,100 INFO L87 Difference]: Start difference. First operand 4156 states and 5634 transitions. Second operand 6 states. [2019-09-16 17:12:41,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:41,134 INFO L93 Difference]: Finished difference Result 3951 states and 5186 transitions. [2019-09-16 17:12:41,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:12:41,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2019-09-16 17:12:41,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:41,148 INFO L225 Difference]: With dead ends: 3951 [2019-09-16 17:12:41,149 INFO L226 Difference]: Without dead ends: 3951 [2019-09-16 17:12:41,149 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:12:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2019-09-16 17:12:41,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2019-09-16 17:12:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3951 states. [2019-09-16 17:12:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 5186 transitions. [2019-09-16 17:12:41,235 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 5186 transitions. Word has length 215 [2019-09-16 17:12:41,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:41,236 INFO L475 AbstractCegarLoop]: Abstraction has 3951 states and 5186 transitions. [2019-09-16 17:12:41,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:12:41,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 5186 transitions. [2019-09-16 17:12:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-16 17:12:41,247 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:41,247 INFO L407 BasicCegarLoop]: trace histogram [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, 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] [2019-09-16 17:12:41,248 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:41,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1247047327, now seen corresponding path program 1 times [2019-09-16 17:12:41,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:41,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:41,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:41,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:41,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 52 proven. 15 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-16 17:12:41,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:41,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:12:41,376 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 259 with the following transitions: [2019-09-16 17:12:41,376 INFO L207 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [138], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [198], [200], [203], [208], [210], [211], [214], [228], [229], [230], [233], [236], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [302], [305], [307], [310], [321], [323], [325], [329], [367], [370], [371], [372], [381], [384], [387], [393], [396], [399], [406], [409], [419], [422], [425], [434], [435], [449], [451], [484], [485], [486], [487], [488], [489], [490], [491], [492], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [506], [510], [511], [512], [513], [514], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2019-09-16 17:12:41,378 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:12:41,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:12:41,501 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:12:41,502 INFO L272 AbstractInterpreter]: Visited 129 different actions 503 times. Merged at 37 different actions 102 times. Never widened. Performed 2594 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2594 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 5 different actions. Largest state had 42 variables. [2019-09-16 17:12:41,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:41,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:12:41,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:41,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:12:41,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:41,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:12:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:41,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 17:12:41,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:12:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-16 17:12:41,934 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:12:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 39 proven. 29 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-09-16 17:12:42,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-16 17:12:42,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 4] total 9 [2019-09-16 17:12:42,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:42,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:12:42,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:12:42,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:12:42,244 INFO L87 Difference]: Start difference. First operand 3951 states and 5186 transitions. Second operand 3 states. [2019-09-16 17:12:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:42,272 INFO L93 Difference]: Finished difference Result 3955 states and 5140 transitions. [2019-09-16 17:12:42,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:12:42,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-09-16 17:12:42,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:42,295 INFO L225 Difference]: With dead ends: 3955 [2019-09-16 17:12:42,295 INFO L226 Difference]: Without dead ends: 3955 [2019-09-16 17:12:42,295 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:12:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2019-09-16 17:12:42,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3949. [2019-09-16 17:12:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3949 states. [2019-09-16 17:12:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 5132 transitions. [2019-09-16 17:12:42,381 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 5132 transitions. Word has length 258 [2019-09-16 17:12:42,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:42,382 INFO L475 AbstractCegarLoop]: Abstraction has 3949 states and 5132 transitions. [2019-09-16 17:12:42,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:12:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 5132 transitions. [2019-09-16 17:12:42,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-16 17:12:42,390 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:42,391 INFO L407 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:12:42,391 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:42,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:42,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1799334812, now seen corresponding path program 1 times [2019-09-16 17:12:42,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:42,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:42,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:42,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:42,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-16 17:12:42,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:42,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:12:42,499 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2019-09-16 17:12:42,500 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [138], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [206], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [302], [305], [307], [310], [321], [323], [325], [329], [367], [370], [371], [372], [381], [384], [387], [393], [396], [399], [406], [409], [412], [419], [422], [434], [435], [449], [451], [484], [485], [486], [487], [488], [489], [490], [491], [492], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [506], [510], [511], [512], [513], [514], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2019-09-16 17:12:42,502 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:12:42,502 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:12:42,669 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:12:42,670 INFO L272 AbstractInterpreter]: Visited 131 different actions 779 times. Merged at 42 different actions 173 times. Widened at 1 different actions 1 times. Performed 4234 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4234 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 19 fixpoints after 8 different actions. Largest state had 42 variables. [2019-09-16 17:12:42,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:42,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:12:42,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:42,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:12:42,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:42,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:12:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:42,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 17:12:42,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:12:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-16 17:12:42,981 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:12:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 42 proven. 13 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-09-16 17:12:43,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-16 17:12:43,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 7 [2019-09-16 17:12:43,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:43,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:12:43,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:12:43,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:12:43,190 INFO L87 Difference]: Start difference. First operand 3949 states and 5132 transitions. Second operand 3 states. [2019-09-16 17:12:43,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:43,217 INFO L93 Difference]: Finished difference Result 3986 states and 5053 transitions. [2019-09-16 17:12:43,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:12:43,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-09-16 17:12:43,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:43,229 INFO L225 Difference]: With dead ends: 3986 [2019-09-16 17:12:43,229 INFO L226 Difference]: Without dead ends: 3986 [2019-09-16 17:12:43,229 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:12:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2019-09-16 17:12:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3966. [2019-09-16 17:12:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3966 states. [2019-09-16 17:12:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 5012 transitions. [2019-09-16 17:12:43,310 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 5012 transitions. Word has length 259 [2019-09-16 17:12:43,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:43,311 INFO L475 AbstractCegarLoop]: Abstraction has 3966 states and 5012 transitions. [2019-09-16 17:12:43,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:12:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 5012 transitions. [2019-09-16 17:12:43,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-16 17:12:43,320 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:43,320 INFO L407 BasicCegarLoop]: trace histogram [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, 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] [2019-09-16 17:12:43,321 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:43,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:43,321 INFO L82 PathProgramCache]: Analyzing trace with hash -720084953, now seen corresponding path program 1 times [2019-09-16 17:12:43,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:43,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:43,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:43,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:43,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:12:43,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:43,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:12:43,480 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2019-09-16 17:12:43,480 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [138], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [198], [200], [203], [206], [208], [210], [211], [214], [228], [229], [230], [233], [236], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [302], [305], [307], [310], [321], [323], [325], [329], [367], [370], [371], [372], [381], [384], [387], [393], [396], [399], [406], [409], [412], [419], [422], [434], [435], [449], [451], [484], [485], [486], [487], [488], [489], [490], [491], [492], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [506], [510], [511], [512], [513], [514], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2019-09-16 17:12:43,482 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:12:43,482 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:12:43,670 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:12:43,670 INFO L272 AbstractInterpreter]: Visited 133 different actions 1117 times. Merged at 42 different actions 258 times. Widened at 1 different actions 1 times. Performed 4497 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4497 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 25 fixpoints after 6 different actions. Largest state had 42 variables. [2019-09-16 17:12:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:43,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:12:43,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:43,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:12:43,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:43,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:12:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:43,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-16 17:12:43,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:12:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-16 17:12:43,969 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:12:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-16 17:12:44,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-16 17:12:44,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2019-09-16 17:12:44,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:44,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:12:44,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:12:44,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:12:44,178 INFO L87 Difference]: Start difference. First operand 3966 states and 5012 transitions. Second operand 3 states. [2019-09-16 17:12:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:44,196 INFO L93 Difference]: Finished difference Result 3866 states and 4776 transitions. [2019-09-16 17:12:44,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:12:44,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-09-16 17:12:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:44,209 INFO L225 Difference]: With dead ends: 3866 [2019-09-16 17:12:44,209 INFO L226 Difference]: Without dead ends: 3866 [2019-09-16 17:12:44,209 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 512 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:12:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3866 states. [2019-09-16 17:12:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3866 to 3866. [2019-09-16 17:12:44,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3866 states. [2019-09-16 17:12:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3866 states to 3866 states and 4776 transitions. [2019-09-16 17:12:44,281 INFO L78 Accepts]: Start accepts. Automaton has 3866 states and 4776 transitions. Word has length 259 [2019-09-16 17:12:44,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:44,282 INFO L475 AbstractCegarLoop]: Abstraction has 3866 states and 4776 transitions. [2019-09-16 17:12:44,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:12:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3866 states and 4776 transitions. [2019-09-16 17:12:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-16 17:12:44,290 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:44,290 INFO L407 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:12:44,290 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:44,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:44,291 INFO L82 PathProgramCache]: Analyzing trace with hash 944664032, now seen corresponding path program 1 times [2019-09-16 17:12:44,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:44,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:44,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-09-16 17:12:44,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:44,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:12:44,389 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 262 with the following transitions: [2019-09-16 17:12:44,389 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [138], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [206], [208], [210], [211], [214], [228], [229], [230], [233], [238], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [302], [305], [307], [310], [321], [323], [325], [329], [367], [370], [371], [372], [381], [384], [387], [393], [396], [399], [406], [409], [412], [419], [422], [434], [435], [449], [451], [484], [485], [486], [487], [488], [489], [490], [491], [492], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [506], [510], [511], [512], [513], [514], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2019-09-16 17:12:44,390 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:12:44,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:12:44,568 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:12:44,568 INFO L272 AbstractInterpreter]: Visited 132 different actions 903 times. Merged at 42 different actions 203 times. Widened at 1 different actions 1 times. Performed 4291 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4291 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 21 fixpoints after 6 different actions. Largest state had 42 variables. [2019-09-16 17:12:44,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:44,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:12:44,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:44,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:12:44,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:44,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:12:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:44,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 1074 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-16 17:12:44,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:12:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 129 proven. 62 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-16 17:12:44,907 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:12:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-09-16 17:12:45,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-16 17:12:45,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-16 17:12:45,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:45,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:12:45,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:12:45,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:12:45,179 INFO L87 Difference]: Start difference. First operand 3866 states and 4776 transitions. Second operand 5 states. [2019-09-16 17:12:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:45,675 INFO L93 Difference]: Finished difference Result 4148 states and 5171 transitions. [2019-09-16 17:12:45,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:12:45,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2019-09-16 17:12:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:45,687 INFO L225 Difference]: With dead ends: 4148 [2019-09-16 17:12:45,687 INFO L226 Difference]: Without dead ends: 4148 [2019-09-16 17:12:45,687 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 515 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:12:45,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4148 states. [2019-09-16 17:12:45,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4148 to 4137. [2019-09-16 17:12:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4137 states. [2019-09-16 17:12:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 5144 transitions. [2019-09-16 17:12:45,766 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 5144 transitions. Word has length 261 [2019-09-16 17:12:45,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:45,767 INFO L475 AbstractCegarLoop]: Abstraction has 4137 states and 5144 transitions. [2019-09-16 17:12:45,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:12:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 5144 transitions. [2019-09-16 17:12:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-16 17:12:45,778 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:45,778 INFO L407 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:12:45,779 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:45,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:45,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1952077569, now seen corresponding path program 1 times [2019-09-16 17:12:45,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:45,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:45,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:45,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:45,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-09-16 17:12:45,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:45,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:12:45,895 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2019-09-16 17:12:45,895 INFO L207 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [138], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [206], [208], [210], [211], [214], [216], [219], [228], [229], [230], [233], [238], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [302], [305], [307], [310], [321], [323], [325], [329], [367], [370], [371], [372], [381], [384], [387], [393], [396], [402], [406], [409], [419], [422], [434], [435], [449], [451], [484], [485], [486], [487], [488], [489], [490], [491], [492], [496], [497], [498], [499], [500], [501], [502], [503], [504], [505], [506], [510], [511], [512], [513], [514], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2019-09-16 17:12:45,897 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:12:45,898 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:12:46,351 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:12:46,351 INFO L272 AbstractInterpreter]: Visited 144 different actions 2302 times. Merged at 52 different actions 677 times. Widened at 1 different actions 1 times. Performed 9168 root evaluator evaluations with a maximum evaluation depth of 4. Performed 9168 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 77 fixpoints after 15 different actions. Largest state had 42 variables. [2019-09-16 17:12:46,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:46,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:12:46,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:46,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:12:46,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:46,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:12:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:46,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-16 17:12:46,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:12:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-16 17:12:46,692 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:12:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-09-16 17:12:46,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-16 17:12:46,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 10 [2019-09-16 17:12:46,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:46,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:12:46,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:12:46,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-16 17:12:46,961 INFO L87 Difference]: Start difference. First operand 4137 states and 5144 transitions. Second operand 4 states. [2019-09-16 17:12:47,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:47,334 INFO L93 Difference]: Finished difference Result 1882 states and 2149 transitions. [2019-09-16 17:12:47,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:12:47,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-09-16 17:12:47,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:47,338 INFO L225 Difference]: With dead ends: 1882 [2019-09-16 17:12:47,338 INFO L226 Difference]: Without dead ends: 923 [2019-09-16 17:12:47,339 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 529 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-09-16 17:12:47,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-09-16 17:12:47,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 912. [2019-09-16 17:12:47,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-09-16 17:12:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1035 transitions. [2019-09-16 17:12:47,366 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1035 transitions. Word has length 266 [2019-09-16 17:12:47,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:47,366 INFO L475 AbstractCegarLoop]: Abstraction has 912 states and 1035 transitions. [2019-09-16 17:12:47,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:12:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1035 transitions. [2019-09-16 17:12:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-16 17:12:47,371 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:47,376 INFO L407 BasicCegarLoop]: trace histogram [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, 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] [2019-09-16 17:12:47,376 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:47,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:47,377 INFO L82 PathProgramCache]: Analyzing trace with hash -373872983, now seen corresponding path program 1 times [2019-09-16 17:12:47,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:47,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:47,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:47,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:47,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-09-16 17:12:47,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:12:47,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-16 17:12:47,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:47,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 17:12:47,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 17:12:47,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:12:47,688 INFO L87 Difference]: Start difference. First operand 912 states and 1035 transitions. Second operand 7 states. [2019-09-16 17:12:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:48,944 INFO L93 Difference]: Finished difference Result 913 states and 1037 transitions. [2019-09-16 17:12:48,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 17:12:48,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 267 [2019-09-16 17:12:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:48,951 INFO L225 Difference]: With dead ends: 913 [2019-09-16 17:12:48,951 INFO L226 Difference]: Without dead ends: 913 [2019-09-16 17:12:48,951 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-16 17:12:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-09-16 17:12:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 911. [2019-09-16 17:12:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2019-09-16 17:12:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1033 transitions. [2019-09-16 17:12:48,966 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1033 transitions. Word has length 267 [2019-09-16 17:12:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:48,966 INFO L475 AbstractCegarLoop]: Abstraction has 911 states and 1033 transitions. [2019-09-16 17:12:48,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 17:12:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1033 transitions. [2019-09-16 17:12:48,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-16 17:12:48,969 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:48,969 INFO L407 BasicCegarLoop]: trace histogram [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, 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] [2019-09-16 17:12:48,969 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:48,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:48,970 INFO L82 PathProgramCache]: Analyzing trace with hash -271251823, now seen corresponding path program 1 times [2019-09-16 17:12:48,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:48,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:48,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:48,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:48,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-09-16 17:12:49,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:12:49,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:12:49,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:49,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:12:49,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:12:49,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:12:49,066 INFO L87 Difference]: Start difference. First operand 911 states and 1033 transitions. Second operand 3 states. [2019-09-16 17:12:49,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:49,083 INFO L93 Difference]: Finished difference Result 918 states and 1043 transitions. [2019-09-16 17:12:49,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:12:49,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2019-09-16 17:12:49,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:49,086 INFO L225 Difference]: With dead ends: 918 [2019-09-16 17:12:49,086 INFO L226 Difference]: Without dead ends: 918 [2019-09-16 17:12:49,086 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:12:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-09-16 17:12:49,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2019-09-16 17:12:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-09-16 17:12:49,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1043 transitions. [2019-09-16 17:12:49,101 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1043 transitions. Word has length 271 [2019-09-16 17:12:49,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:49,101 INFO L475 AbstractCegarLoop]: Abstraction has 918 states and 1043 transitions. [2019-09-16 17:12:49,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:12:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1043 transitions. [2019-09-16 17:12:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-16 17:12:49,104 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:49,104 INFO L407 BasicCegarLoop]: trace histogram [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, 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] [2019-09-16 17:12:49,105 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:49,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:49,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1410375831, now seen corresponding path program 1 times [2019-09-16 17:12:49,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:49,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:49,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:49,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:49,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-16 17:12:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-16 17:12:49,250 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-16 17:12:49,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:12:49 BoogieIcfgContainer [2019-09-16 17:12:49,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:12:49,444 INFO L168 Benchmark]: Toolchain (without parser) took 160173.87 ms. Allocated memory was 137.9 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 83.6 MB in the beginning and 800.4 MB in the end (delta: -716.8 MB). Peak memory consumption was 290.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:12:49,445 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 102.7 MB in the beginning and 102.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:12:49,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.74 ms. Allocated memory was 137.9 MB in the beginning and 198.2 MB in the end (delta: 60.3 MB). Free memory was 83.4 MB in the beginning and 173.1 MB in the end (delta: -89.7 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:12:49,446 INFO L168 Benchmark]: Boogie Preprocessor took 47.06 ms. Allocated memory is still 198.2 MB. Free memory was 173.1 MB in the beginning and 170.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:12:49,447 INFO L168 Benchmark]: RCFGBuilder took 624.51 ms. Allocated memory is still 198.2 MB. Free memory was 170.6 MB in the beginning and 132.4 MB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:12:49,448 INFO L168 Benchmark]: TraceAbstraction took 159061.07 ms. Allocated memory was 198.2 MB in the beginning and 1.1 GB in the end (delta: 947.4 MB). Free memory was 132.4 MB in the beginning and 800.4 MB in the end (delta: -667.9 MB). Peak memory consumption was 279.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:12:49,451 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 102.7 MB in the beginning and 102.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 436.74 ms. Allocated memory was 137.9 MB in the beginning and 198.2 MB in the end (delta: 60.3 MB). Free memory was 83.4 MB in the beginning and 173.1 MB in the end (delta: -89.7 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.06 ms. Allocated memory is still 198.2 MB. Free memory was 173.1 MB in the beginning and 170.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 624.51 ms. Allocated memory is still 198.2 MB. Free memory was 170.6 MB in the beginning and 132.4 MB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 159061.07 ms. Allocated memory was 198.2 MB in the beginning and 1.1 GB in the end (delta: 947.4 MB). Free memory was 132.4 MB in the beginning and 800.4 MB in the end (delta: -667.9 MB). Peak memory consumption was 279.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int t2_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int t2_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int T2_E = 2; [L26] int E_M = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; [L33] int token ; [L35] int local ; VAL [\old(E_1)=18, \old(E_2)=5, \old(E_M)=13, \old(local)=17, \old(M_E)=14, \old(m_i)=7, \old(m_pc)=11, \old(m_st)=12, \old(T1_E)=3, \old(t1_i)=16, \old(t1_pc)=8, \old(t1_st)=4, \old(T2_E)=15, \old(t2_i)=6, \old(t2_pc)=9, \old(t2_st)=10, \old(token)=19, 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 [L515] t1_i = 1 [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 ; [L542] int tmp ; [L543] int tmp___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 [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 [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 [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 ; [L420] int tmp___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() [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() [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() [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 [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() [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 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [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 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [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 [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 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [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 [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 [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() [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 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_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=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(); [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() [L55] local = token [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 ; [L420] int tmp___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)=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() [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 [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() [L435] COND TRUE \read(tmp___0) [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() [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 [L59] m_pc = 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 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [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 [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 ; [L420] int tmp___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() [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() [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 [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() [L443] COND TRUE \read(tmp___1) [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 [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 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [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 [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 ; [L420] int tmp___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)=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 [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() [L427] COND TRUE \read(tmp) [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() [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() [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 [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 [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() [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 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_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(); [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, 181 locations, 1 error locations. UNSAFE Result, 159.0s OverallTime, 29 OverallIterations, 4 TraceHistogramMax, 137.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8488 SDtfs, 12085 SDslu, 45316 SDs, 0 SdLazy, 32109 SolverSat, 4075 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6449 GetRequests, 5673 SyntacticMatches, 24 SemanticMatches, 752 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24405 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4156occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 16 AbstIntIterations, 6 AbstIntStrong, 0.9894171941417196 AbsIntWeakeningRatio, 0.5894641235240691 AbsIntAvgWeakeningVarsNumRemoved, 17.366030881017256 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 1255 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 8045 NumberOfCodeBlocks, 8045 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 10150 ConstructedInterpolants, 0 QuantifiedInterpolants, 3225000 SizeOfPredicates, 9 NumberOfNonLiveVariables, 10218 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 48 InterpolantComputations, 22 PerfectInterpolantSequences, 6815/7293 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...