/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_VARIABLES --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 2 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 17:22:09,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 17:22:09,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 17:22:09,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 17:22:09,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 17:22:09,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 17:22:09,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 17:22:09,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 17:22:09,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 17:22:09,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 17:22:09,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 17:22:09,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 17:22:09,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 17:22:09,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 17:22:09,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 17:22:09,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 17:22:09,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 17:22:09,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 17:22:09,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 17:22:09,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 17:22:09,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 17:22:09,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 17:22:09,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 17:22:09,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 17:22:09,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 17:22:09,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 17:22:09,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 17:22:09,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 17:22:09,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 17:22:09,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 17:22:09,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 17:22:09,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 17:22:09,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 17:22:09,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 17:22:09,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 17:22:09,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 17:22:09,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 17:22:09,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 17:22:09,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 17:22:09,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 17:22:09,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 17:22:09,404 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-21 17:22:09,430 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 17:22:09,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 17:22:09,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 17:22:09,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 17:22:09,432 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 17:22:09,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 17:22:09,433 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 17:22:09,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 17:22:09,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 17:22:09,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 17:22:09,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 17:22:09,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 17:22:09,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 17:22:09,435 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 17:22:09,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 17:22:09,435 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 17:22:09,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 17:22:09,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 17:22:09,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 17:22:09,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 17:22:09,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 17:22:09,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 17:22:09,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 17:22:09,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 17:22:09,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 17:22:09,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 17:22:09,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:09,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 17:22:09,438 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 17:22:09,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_VARIABLES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 2 [2020-07-21 17:22:09,697 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 17:22:09,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 17:22:09,713 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 17:22:09,715 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 17:22:09,715 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 17:22:09,716 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-07-21 17:22:09,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4632a9747/2f12d69418304815aa81b3aa796d7d6b/FLAG71298e0d4 [2020-07-21 17:22:10,243 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 17:22:10,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-07-21 17:22:10,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4632a9747/2f12d69418304815aa81b3aa796d7d6b/FLAG71298e0d4 [2020-07-21 17:22:10,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4632a9747/2f12d69418304815aa81b3aa796d7d6b [2020-07-21 17:22:10,603 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 17:22:10,607 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 17:22:10,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 17:22:10,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 17:22:10,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 17:22:10,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:22:10" (1/1) ... [2020-07-21 17:22:10,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b386b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:22:10, skipping insertion in model container [2020-07-21 17:22:10,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:22:10" (1/1) ... [2020-07-21 17:22:10,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 17:22:10,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 17:22:10,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 17:22:10,954 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 17:22:11,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 17:22:11,044 INFO L208 MainTranslator]: Completed translation [2020-07-21 17:22:11,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:22:11 WrapperNode [2020-07-21 17:22:11,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 17:22:11,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 17:22:11,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 17:22:11,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 17:22:11,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:22:11" (1/1) ... [2020-07-21 17:22:11,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:22:11" (1/1) ... [2020-07-21 17:22:11,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:22:11" (1/1) ... [2020-07-21 17:22:11,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:22:11" (1/1) ... [2020-07-21 17:22:11,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:22:11" (1/1) ... [2020-07-21 17:22:11,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:22:11" (1/1) ... [2020-07-21 17:22:11,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:22:11" (1/1) ... [2020-07-21 17:22:11,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 17:22:11,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 17:22:11,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 17:22:11,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 17:22:11,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:22:11" (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 [2020-07-21 17:22:11,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 17:22:11,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 17:22:11,247 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-21 17:22:11,247 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-21 17:22:11,247 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-21 17:22:11,248 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-07-21 17:22:11,248 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-21 17:22:11,248 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-21 17:22:11,248 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-07-21 17:22:11,248 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-21 17:22:11,248 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-21 17:22:11,249 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-21 17:22:11,249 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-21 17:22:11,249 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-21 17:22:11,249 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-21 17:22:11,249 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-21 17:22:11,249 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-21 17:22:11,250 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-21 17:22:11,250 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-21 17:22:11,250 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-21 17:22:11,250 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-21 17:22:11,250 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-21 17:22:11,250 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 17:22:11,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 17:22:11,251 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-21 17:22:11,251 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-21 17:22:11,251 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-21 17:22:11,251 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-07-21 17:22:11,251 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-21 17:22:11,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 17:22:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-21 17:22:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-21 17:22:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-07-21 17:22:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-21 17:22:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-21 17:22:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-21 17:22:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-21 17:22:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-21 17:22:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-21 17:22:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-21 17:22:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-21 17:22:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-21 17:22:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-21 17:22:11,253 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-21 17:22:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-21 17:22:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 17:22:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 17:22:11,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 17:22:11,828 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 17:22:11,828 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-21 17:22:11,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:22:11 BoogieIcfgContainer [2020-07-21 17:22:11,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 17:22:11,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 17:22:11,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 17:22:11,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 17:22:11,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:22:10" (1/3) ... [2020-07-21 17:22:11,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244c1146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:22:11, skipping insertion in model container [2020-07-21 17:22:11,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:22:11" (2/3) ... [2020-07-21 17:22:11,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244c1146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:22:11, skipping insertion in model container [2020-07-21 17:22:11,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:22:11" (3/3) ... [2020-07-21 17:22:11,844 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-07-21 17:22:11,855 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 17:22:11,863 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 17:22:11,878 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 17:22:11,905 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 17:22:11,905 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 17:22:11,905 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 17:22:11,905 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 17:22:11,906 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 17:22:11,906 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 17:22:11,906 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 17:22:11,906 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 17:22:11,940 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2020-07-21 17:22:11,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-21 17:22:11,960 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:11,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:22:11,962 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:11,969 INFO L82 PathProgramCache]: Analyzing trace with hash -67309704, now seen corresponding path program 1 times [2020-07-21 17:22:11,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:11,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1075367365] [2020-07-21 17:22:11,980 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:12,192 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:22:12,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:12,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 17:22:12,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:12,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 17:22:12,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:12,333 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1075367365] [2020-07-21 17:22:12,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:12,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 17:22:12,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359852250] [2020-07-21 17:22:12,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 17:22:12,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:12,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 17:22:12,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:22:12,370 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 6 states. [2020-07-21 17:22:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:12,472 INFO L93 Difference]: Finished difference Result 352 states and 516 transitions. [2020-07-21 17:22:12,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 17:22:12,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2020-07-21 17:22:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:12,490 INFO L225 Difference]: With dead ends: 352 [2020-07-21 17:22:12,490 INFO L226 Difference]: Without dead ends: 185 [2020-07-21 17:22:12,496 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 17:22:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-07-21 17:22:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2020-07-21 17:22:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-07-21 17:22:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 240 transitions. [2020-07-21 17:22:12,567 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 240 transitions. Word has length 92 [2020-07-21 17:22:12,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:12,568 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 240 transitions. [2020-07-21 17:22:12,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 17:22:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 240 transitions. [2020-07-21 17:22:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-21 17:22:12,573 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:12,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:22:12,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:12,790 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:12,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:12,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1605649734, now seen corresponding path program 1 times [2020-07-21 17:22:12,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:12,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [648311638] [2020-07-21 17:22:12,793 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:12,919 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:22:12,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:12,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 17:22:12,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 17:22:12,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:12,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [648311638] [2020-07-21 17:22:12,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:12,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 17:22:12,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77333184] [2020-07-21 17:22:12,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 17:22:12,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:12,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 17:22:12,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:22:12,975 INFO L87 Difference]: Start difference. First operand 177 states and 240 transitions. Second operand 6 states. [2020-07-21 17:22:13,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:13,026 INFO L93 Difference]: Finished difference Result 340 states and 475 transitions. [2020-07-21 17:22:13,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 17:22:13,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2020-07-21 17:22:13,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:13,030 INFO L225 Difference]: With dead ends: 340 [2020-07-21 17:22:13,030 INFO L226 Difference]: Without dead ends: 184 [2020-07-21 17:22:13,033 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 17:22:13,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-07-21 17:22:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2020-07-21 17:22:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-07-21 17:22:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 245 transitions. [2020-07-21 17:22:13,053 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 245 transitions. Word has length 92 [2020-07-21 17:22:13,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:13,054 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 245 transitions. [2020-07-21 17:22:13,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 17:22:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 245 transitions. [2020-07-21 17:22:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-21 17:22:13,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:13,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:22:13,271 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:13,272 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:13,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:13,272 INFO L82 PathProgramCache]: Analyzing trace with hash 638333564, now seen corresponding path program 1 times [2020-07-21 17:22:13,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:13,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [517663884] [2020-07-21 17:22:13,273 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:13,390 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:22:13,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:13,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 17:22:13,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:13,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 17:22:13,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:13,440 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [517663884] [2020-07-21 17:22:13,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:13,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:22:13,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552089006] [2020-07-21 17:22:13,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:22:13,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:13,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:22:13,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:13,443 INFO L87 Difference]: Start difference. First operand 182 states and 245 transitions. Second operand 3 states. [2020-07-21 17:22:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:13,489 INFO L93 Difference]: Finished difference Result 485 states and 672 transitions. [2020-07-21 17:22:13,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:22:13,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-07-21 17:22:13,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:13,494 INFO L225 Difference]: With dead ends: 485 [2020-07-21 17:22:13,495 INFO L226 Difference]: Without dead ends: 324 [2020-07-21 17:22:13,496 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:13,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-07-21 17:22:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 323. [2020-07-21 17:22:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-21 17:22:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 436 transitions. [2020-07-21 17:22:13,532 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 436 transitions. Word has length 92 [2020-07-21 17:22:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:13,533 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 436 transitions. [2020-07-21 17:22:13,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:22:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 436 transitions. [2020-07-21 17:22:13,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-07-21 17:22:13,537 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:13,538 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:22:13,750 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:13,751 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:13,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:13,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1203890048, now seen corresponding path program 1 times [2020-07-21 17:22:13,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:13,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2076890749] [2020-07-21 17:22:13,753 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:13,871 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:22:13,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:13,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 17:22:13,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-21 17:22:13,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:13,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2076890749] [2020-07-21 17:22:13,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:13,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:22:13,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823017414] [2020-07-21 17:22:13,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:22:13,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:13,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:22:13,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:13,914 INFO L87 Difference]: Start difference. First operand 323 states and 436 transitions. Second operand 3 states. [2020-07-21 17:22:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:13,961 INFO L93 Difference]: Finished difference Result 903 states and 1253 transitions. [2020-07-21 17:22:13,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:22:13,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2020-07-21 17:22:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:13,968 INFO L225 Difference]: With dead ends: 903 [2020-07-21 17:22:13,968 INFO L226 Difference]: Without dead ends: 602 [2020-07-21 17:22:13,969 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-07-21 17:22:14,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2020-07-21 17:22:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-07-21 17:22:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 827 transitions. [2020-07-21 17:22:14,016 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 827 transitions. Word has length 147 [2020-07-21 17:22:14,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:14,017 INFO L479 AbstractCegarLoop]: Abstraction has 600 states and 827 transitions. [2020-07-21 17:22:14,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:22:14,017 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 827 transitions. [2020-07-21 17:22:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-21 17:22:14,022 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:14,022 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-21 17:22:14,236 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:14,237 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:14,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:14,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1708474421, now seen corresponding path program 1 times [2020-07-21 17:22:14,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:14,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1770802081] [2020-07-21 17:22:14,240 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:14,363 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:22:14,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:14,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 17:22:14,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-07-21 17:22:14,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:14,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1770802081] [2020-07-21 17:22:14,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:14,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 17:22:14,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517793593] [2020-07-21 17:22:14,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 17:22:14,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:14,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 17:22:14,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 17:22:14,454 INFO L87 Difference]: Start difference. First operand 600 states and 827 transitions. Second operand 5 states. [2020-07-21 17:22:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:14,976 INFO L93 Difference]: Finished difference Result 1289 states and 1853 transitions. [2020-07-21 17:22:14,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 17:22:14,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2020-07-21 17:22:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:14,985 INFO L225 Difference]: With dead ends: 1289 [2020-07-21 17:22:14,985 INFO L226 Difference]: Without dead ends: 714 [2020-07-21 17:22:14,994 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:22:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2020-07-21 17:22:15,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 713. [2020-07-21 17:22:15,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2020-07-21 17:22:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 959 transitions. [2020-07-21 17:22:15,069 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 959 transitions. Word has length 191 [2020-07-21 17:22:15,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:15,069 INFO L479 AbstractCegarLoop]: Abstraction has 713 states and 959 transitions. [2020-07-21 17:22:15,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 17:22:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 959 transitions. [2020-07-21 17:22:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-21 17:22:15,083 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:15,084 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-21 17:22:15,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:15,297 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:15,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:15,298 INFO L82 PathProgramCache]: Analyzing trace with hash -43354161, now seen corresponding path program 1 times [2020-07-21 17:22:15,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:15,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1910723642] [2020-07-21 17:22:15,300 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:15,422 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:22:15,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:15,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 17:22:15,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-07-21 17:22:15,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:15,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1910723642] [2020-07-21 17:22:15,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:15,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 17:22:15,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908481981] [2020-07-21 17:22:15,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 17:22:15,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:15,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 17:22:15,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 17:22:15,507 INFO L87 Difference]: Start difference. First operand 713 states and 959 transitions. Second operand 5 states. [2020-07-21 17:22:15,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:15,983 INFO L93 Difference]: Finished difference Result 1729 states and 2464 transitions. [2020-07-21 17:22:15,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 17:22:15,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2020-07-21 17:22:15,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:15,994 INFO L225 Difference]: With dead ends: 1729 [2020-07-21 17:22:15,994 INFO L226 Difference]: Without dead ends: 1041 [2020-07-21 17:22:16,003 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:22:16,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2020-07-21 17:22:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 878. [2020-07-21 17:22:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2020-07-21 17:22:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1136 transitions. [2020-07-21 17:22:16,082 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1136 transitions. Word has length 191 [2020-07-21 17:22:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:16,083 INFO L479 AbstractCegarLoop]: Abstraction has 878 states and 1136 transitions. [2020-07-21 17:22:16,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 17:22:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1136 transitions. [2020-07-21 17:22:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-07-21 17:22:16,090 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:16,091 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-07-21 17:22:16,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:16,306 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:16,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:16,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2143492256, now seen corresponding path program 1 times [2020-07-21 17:22:16,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:16,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1931830306] [2020-07-21 17:22:16,307 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:16,441 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:22:16,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:16,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 17:22:16,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2020-07-21 17:22:16,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:16,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1931830306] [2020-07-21 17:22:16,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:16,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:22:16,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975159746] [2020-07-21 17:22:16,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:22:16,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:16,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:22:16,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:16,490 INFO L87 Difference]: Start difference. First operand 878 states and 1136 transitions. Second operand 3 states. [2020-07-21 17:22:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:16,527 INFO L93 Difference]: Finished difference Result 1555 states and 2007 transitions. [2020-07-21 17:22:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:22:16,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2020-07-21 17:22:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:16,532 INFO L225 Difference]: With dead ends: 1555 [2020-07-21 17:22:16,532 INFO L226 Difference]: Without dead ends: 698 [2020-07-21 17:22:16,535 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:16,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2020-07-21 17:22:16,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 694. [2020-07-21 17:22:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2020-07-21 17:22:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 893 transitions. [2020-07-21 17:22:16,570 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 893 transitions. Word has length 248 [2020-07-21 17:22:16,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:16,570 INFO L479 AbstractCegarLoop]: Abstraction has 694 states and 893 transitions. [2020-07-21 17:22:16,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:22:16,570 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 893 transitions. [2020-07-21 17:22:16,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-21 17:22:16,574 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:16,574 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-21 17:22:16,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:16,790 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:16,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:16,791 INFO L82 PathProgramCache]: Analyzing trace with hash 268430800, now seen corresponding path program 1 times [2020-07-21 17:22:16,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:16,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2023398597] [2020-07-21 17:22:16,793 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:16,888 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:22:16,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:16,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 17:22:16,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-07-21 17:22:16,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:16,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2023398597] [2020-07-21 17:22:16,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:16,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 17:22:16,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624811558] [2020-07-21 17:22:16,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 17:22:16,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:16,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 17:22:16,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 17:22:16,988 INFO L87 Difference]: Start difference. First operand 694 states and 893 transitions. Second operand 5 states. [2020-07-21 17:22:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:17,414 INFO L93 Difference]: Finished difference Result 1368 states and 1773 transitions. [2020-07-21 17:22:17,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 17:22:17,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2020-07-21 17:22:17,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:17,421 INFO L225 Difference]: With dead ends: 1368 [2020-07-21 17:22:17,422 INFO L226 Difference]: Without dead ends: 694 [2020-07-21 17:22:17,425 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:22:17,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2020-07-21 17:22:17,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2020-07-21 17:22:17,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2020-07-21 17:22:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 884 transitions. [2020-07-21 17:22:17,489 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 884 transitions. Word has length 191 [2020-07-21 17:22:17,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:17,490 INFO L479 AbstractCegarLoop]: Abstraction has 694 states and 884 transitions. [2020-07-21 17:22:17,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 17:22:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 884 transitions. [2020-07-21 17:22:17,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-21 17:22:17,494 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:17,495 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-21 17:22:17,708 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:17,709 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:17,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:17,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1573800748, now seen corresponding path program 1 times [2020-07-21 17:22:17,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:17,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1915125068] [2020-07-21 17:22:17,711 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:17,816 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:22:17,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:17,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 17:22:17,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-07-21 17:22:17,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:17,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1915125068] [2020-07-21 17:22:17,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:17,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 17:22:17,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600922602] [2020-07-21 17:22:17,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 17:22:17,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:17,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 17:22:17,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 17:22:17,872 INFO L87 Difference]: Start difference. First operand 694 states and 884 transitions. Second operand 5 states. [2020-07-21 17:22:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:18,267 INFO L93 Difference]: Finished difference Result 1368 states and 1755 transitions. [2020-07-21 17:22:18,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 17:22:18,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2020-07-21 17:22:18,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:18,275 INFO L225 Difference]: With dead ends: 1368 [2020-07-21 17:22:18,275 INFO L226 Difference]: Without dead ends: 694 [2020-07-21 17:22:18,277 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:22:18,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2020-07-21 17:22:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2020-07-21 17:22:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2020-07-21 17:22:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 875 transitions. [2020-07-21 17:22:18,318 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 875 transitions. Word has length 191 [2020-07-21 17:22:18,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:18,319 INFO L479 AbstractCegarLoop]: Abstraction has 694 states and 875 transitions. [2020-07-21 17:22:18,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 17:22:18,319 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 875 transitions. [2020-07-21 17:22:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-21 17:22:18,322 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:18,322 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-21 17:22:18,536 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:18,537 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:18,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:18,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2031335058, now seen corresponding path program 1 times [2020-07-21 17:22:18,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:18,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [385094701] [2020-07-21 17:22:18,541 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:18,639 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:22:18,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:18,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 17:22:18,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-07-21 17:22:18,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:18,691 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [385094701] [2020-07-21 17:22:18,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:18,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 17:22:18,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041938952] [2020-07-21 17:22:18,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 17:22:18,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:18,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 17:22:18,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 17:22:18,693 INFO L87 Difference]: Start difference. First operand 694 states and 875 transitions. Second operand 5 states. [2020-07-21 17:22:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:19,210 INFO L93 Difference]: Finished difference Result 1577 states and 2165 transitions. [2020-07-21 17:22:19,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 17:22:19,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2020-07-21 17:22:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:19,219 INFO L225 Difference]: With dead ends: 1577 [2020-07-21 17:22:19,220 INFO L226 Difference]: Without dead ends: 903 [2020-07-21 17:22:19,223 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:22:19,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2020-07-21 17:22:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 771. [2020-07-21 17:22:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-07-21 17:22:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 953 transitions. [2020-07-21 17:22:19,282 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 953 transitions. Word has length 191 [2020-07-21 17:22:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:19,284 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 953 transitions. [2020-07-21 17:22:19,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 17:22:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 953 transitions. [2020-07-21 17:22:19,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-21 17:22:19,287 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:19,287 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-21 17:22:19,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:19,501 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:19,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:19,502 INFO L82 PathProgramCache]: Analyzing trace with hash 636687150, now seen corresponding path program 1 times [2020-07-21 17:22:19,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:19,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1475675791] [2020-07-21 17:22:19,504 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:19,622 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:22:19,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:19,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 17:22:19,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-21 17:22:19,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:19,660 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1475675791] [2020-07-21 17:22:19,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:19,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:22:19,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097099660] [2020-07-21 17:22:19,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:22:19,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:19,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:22:19,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:19,661 INFO L87 Difference]: Start difference. First operand 771 states and 953 transitions. Second operand 3 states. [2020-07-21 17:22:19,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:19,739 INFO L93 Difference]: Finished difference Result 2146 states and 2787 transitions. [2020-07-21 17:22:19,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:22:19,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2020-07-21 17:22:19,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:19,759 INFO L225 Difference]: With dead ends: 2146 [2020-07-21 17:22:19,759 INFO L226 Difference]: Without dead ends: 1396 [2020-07-21 17:22:19,763 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-07-21 17:22:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1353. [2020-07-21 17:22:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2020-07-21 17:22:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1734 transitions. [2020-07-21 17:22:19,856 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1734 transitions. Word has length 191 [2020-07-21 17:22:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:19,856 INFO L479 AbstractCegarLoop]: Abstraction has 1353 states and 1734 transitions. [2020-07-21 17:22:19,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:22:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1734 transitions. [2020-07-21 17:22:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-21 17:22:19,860 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:19,861 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-21 17:22:20,075 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:20,076 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:20,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:20,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1220627663, now seen corresponding path program 1 times [2020-07-21 17:22:20,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:20,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2136576955] [2020-07-21 17:22:20,077 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:20,167 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:22:20,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:20,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 17:22:20,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-07-21 17:22:20,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:20,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2136576955] [2020-07-21 17:22:20,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:20,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 17:22:20,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381747024] [2020-07-21 17:22:20,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 17:22:20,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:20,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 17:22:20,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:22:20,274 INFO L87 Difference]: Start difference. First operand 1353 states and 1734 transitions. Second operand 6 states. [2020-07-21 17:22:20,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:20,359 INFO L93 Difference]: Finished difference Result 2725 states and 3641 transitions. [2020-07-21 17:22:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 17:22:20,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 191 [2020-07-21 17:22:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:20,367 INFO L225 Difference]: With dead ends: 2725 [2020-07-21 17:22:20,367 INFO L226 Difference]: Without dead ends: 1393 [2020-07-21 17:22:20,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 17:22:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-07-21 17:22:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1373. [2020-07-21 17:22:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2020-07-21 17:22:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1739 transitions. [2020-07-21 17:22:20,447 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1739 transitions. Word has length 191 [2020-07-21 17:22:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:20,448 INFO L479 AbstractCegarLoop]: Abstraction has 1373 states and 1739 transitions. [2020-07-21 17:22:20,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 17:22:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1739 transitions. [2020-07-21 17:22:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-21 17:22:20,452 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:20,452 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-21 17:22:20,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:20,667 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:20,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:20,667 INFO L82 PathProgramCache]: Analyzing trace with hash 446712751, now seen corresponding path program 1 times [2020-07-21 17:22:20,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:20,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [219113160] [2020-07-21 17:22:20,668 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:20,790 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:22:20,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:20,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 17:22:20,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-21 17:22:20,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:20,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [219113160] [2020-07-21 17:22:20,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:20,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:22:20,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922132721] [2020-07-21 17:22:20,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:22:20,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:20,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:22:20,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:20,824 INFO L87 Difference]: Start difference. First operand 1373 states and 1739 transitions. Second operand 3 states. [2020-07-21 17:22:20,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:20,889 INFO L93 Difference]: Finished difference Result 2365 states and 3129 transitions. [2020-07-21 17:22:20,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:22:20,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2020-07-21 17:22:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:20,898 INFO L225 Difference]: With dead ends: 2365 [2020-07-21 17:22:20,898 INFO L226 Difference]: Without dead ends: 1375 [2020-07-21 17:22:20,904 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:20,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2020-07-21 17:22:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1373. [2020-07-21 17:22:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2020-07-21 17:22:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1723 transitions. [2020-07-21 17:22:20,982 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1723 transitions. Word has length 191 [2020-07-21 17:22:20,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:20,982 INFO L479 AbstractCegarLoop]: Abstraction has 1373 states and 1723 transitions. [2020-07-21 17:22:20,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:22:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1723 transitions. [2020-07-21 17:22:20,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-07-21 17:22:20,986 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:20,986 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-21 17:22:21,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:21,202 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:21,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:21,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1508221334, now seen corresponding path program 1 times [2020-07-21 17:22:21,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:21,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1909162151] [2020-07-21 17:22:21,203 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:21,387 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:22:21,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:21,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 17:22:21,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:21,425 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-21 17:22:21,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:21,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1909162151] [2020-07-21 17:22:21,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:21,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:22:21,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620334712] [2020-07-21 17:22:21,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:22:21,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:21,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:22:21,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:21,429 INFO L87 Difference]: Start difference. First operand 1373 states and 1723 transitions. Second operand 3 states. [2020-07-21 17:22:21,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:21,539 INFO L93 Difference]: Finished difference Result 3761 states and 5076 transitions. [2020-07-21 17:22:21,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:22:21,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2020-07-21 17:22:21,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:21,554 INFO L225 Difference]: With dead ends: 3761 [2020-07-21 17:22:21,554 INFO L226 Difference]: Without dead ends: 2410 [2020-07-21 17:22:21,561 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:21,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-07-21 17:22:21,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2398. [2020-07-21 17:22:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2398 states. [2020-07-21 17:22:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3114 transitions. [2020-07-21 17:22:21,703 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3114 transitions. Word has length 192 [2020-07-21 17:22:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:21,703 INFO L479 AbstractCegarLoop]: Abstraction has 2398 states and 3114 transitions. [2020-07-21 17:22:21,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:22:21,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3114 transitions. [2020-07-21 17:22:21,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-07-21 17:22:21,712 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:21,712 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-21 17:22:21,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:21,928 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:21,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:21,928 INFO L82 PathProgramCache]: Analyzing trace with hash -397218697, now seen corresponding path program 1 times [2020-07-21 17:22:21,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:21,929 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [741946990] [2020-07-21 17:22:21,929 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:22,054 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:22:22,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:22,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 17:22:22,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-07-21 17:22:22,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:22,134 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [741946990] [2020-07-21 17:22:22,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:22,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 17:22:22,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748995018] [2020-07-21 17:22:22,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 17:22:22,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:22,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 17:22:22,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 17:22:22,136 INFO L87 Difference]: Start difference. First operand 2398 states and 3114 transitions. Second operand 5 states. [2020-07-21 17:22:23,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:23,020 INFO L93 Difference]: Finished difference Result 7451 states and 9831 transitions. [2020-07-21 17:22:23,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 17:22:23,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2020-07-21 17:22:23,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:23,052 INFO L225 Difference]: With dead ends: 7451 [2020-07-21 17:22:23,053 INFO L226 Difference]: Without dead ends: 5073 [2020-07-21 17:22:23,063 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-21 17:22:23,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5073 states. [2020-07-21 17:22:23,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5073 to 4769. [2020-07-21 17:22:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4769 states. [2020-07-21 17:22:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4769 states to 4769 states and 6122 transitions. [2020-07-21 17:22:23,400 INFO L78 Accepts]: Start accepts. Automaton has 4769 states and 6122 transitions. Word has length 193 [2020-07-21 17:22:23,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:23,400 INFO L479 AbstractCegarLoop]: Abstraction has 4769 states and 6122 transitions. [2020-07-21 17:22:23,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 17:22:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 4769 states and 6122 transitions. [2020-07-21 17:22:23,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-07-21 17:22:23,407 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:23,407 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-21 17:22:23,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:23,622 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:23,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:23,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1815131615, now seen corresponding path program 1 times [2020-07-21 17:22:23,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:23,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [252818934] [2020-07-21 17:22:23,623 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:23,750 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:22:23,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:23,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 17:22:23,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-07-21 17:22:23,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:23,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [252818934] [2020-07-21 17:22:23,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:23,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:22:23,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810765373] [2020-07-21 17:22:23,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:22:23,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:23,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:22:23,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:23,796 INFO L87 Difference]: Start difference. First operand 4769 states and 6122 transitions. Second operand 3 states. [2020-07-21 17:22:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:24,017 INFO L93 Difference]: Finished difference Result 9907 states and 12951 transitions. [2020-07-21 17:22:24,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:22:24,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-07-21 17:22:24,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:24,047 INFO L225 Difference]: With dead ends: 9907 [2020-07-21 17:22:24,047 INFO L226 Difference]: Without dead ends: 5161 [2020-07-21 17:22:24,065 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:24,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5161 states. [2020-07-21 17:22:24,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5161 to 4737. [2020-07-21 17:22:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4737 states. [2020-07-21 17:22:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4737 states to 4737 states and 6020 transitions. [2020-07-21 17:22:24,360 INFO L78 Accepts]: Start accepts. Automaton has 4737 states and 6020 transitions. Word has length 212 [2020-07-21 17:22:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:24,361 INFO L479 AbstractCegarLoop]: Abstraction has 4737 states and 6020 transitions. [2020-07-21 17:22:24,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:22:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 4737 states and 6020 transitions. [2020-07-21 17:22:24,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-07-21 17:22:24,368 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:24,368 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-21 17:22:24,581 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:24,582 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:24,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:24,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1391086419, now seen corresponding path program 1 times [2020-07-21 17:22:24,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:24,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [50291857] [2020-07-21 17:22:24,583 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:24,736 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:22:24,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:24,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 17:22:24,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2020-07-21 17:22:24,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:24,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [50291857] [2020-07-21 17:22:24,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:24,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:22:24,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006746529] [2020-07-21 17:22:24,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:22:24,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:24,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:22:24,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:24,779 INFO L87 Difference]: Start difference. First operand 4737 states and 6020 transitions. Second operand 3 states. [2020-07-21 17:22:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:24,932 INFO L93 Difference]: Finished difference Result 7423 states and 9354 transitions. [2020-07-21 17:22:24,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:22:24,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2020-07-21 17:22:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:24,957 INFO L225 Difference]: With dead ends: 7423 [2020-07-21 17:22:24,958 INFO L226 Difference]: Without dead ends: 4756 [2020-07-21 17:22:24,968 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:24,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2020-07-21 17:22:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 4736. [2020-07-21 17:22:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4736 states. [2020-07-21 17:22:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4736 states to 4736 states and 5815 transitions. [2020-07-21 17:22:25,210 INFO L78 Accepts]: Start accepts. Automaton has 4736 states and 5815 transitions. Word has length 194 [2020-07-21 17:22:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:25,210 INFO L479 AbstractCegarLoop]: Abstraction has 4736 states and 5815 transitions. [2020-07-21 17:22:25,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:22:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 4736 states and 5815 transitions. [2020-07-21 17:22:25,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-07-21 17:22:25,217 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:25,217 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:22:25,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:25,432 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:25,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:25,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2011996507, now seen corresponding path program 1 times [2020-07-21 17:22:25,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:25,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [697493266] [2020-07-21 17:22:25,433 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:25,526 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:22:25,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:25,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 17:22:25,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-21 17:22:25,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:25,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [697493266] [2020-07-21 17:22:25,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:25,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:22:25,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250824635] [2020-07-21 17:22:25,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:22:25,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:25,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:22:25,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:25,626 INFO L87 Difference]: Start difference. First operand 4736 states and 5815 transitions. Second operand 3 states. [2020-07-21 17:22:25,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:25,887 INFO L93 Difference]: Finished difference Result 13463 states and 17538 transitions. [2020-07-21 17:22:25,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:22:25,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2020-07-21 17:22:25,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:25,930 INFO L225 Difference]: With dead ends: 13463 [2020-07-21 17:22:25,930 INFO L226 Difference]: Without dead ends: 8749 [2020-07-21 17:22:25,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8749 states. [2020-07-21 17:22:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8749 to 8733. [2020-07-21 17:22:26,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8733 states. [2020-07-21 17:22:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8733 states to 8733 states and 11220 transitions. [2020-07-21 17:22:26,535 INFO L78 Accepts]: Start accepts. Automaton has 8733 states and 11220 transitions. Word has length 211 [2020-07-21 17:22:26,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:26,536 INFO L479 AbstractCegarLoop]: Abstraction has 8733 states and 11220 transitions. [2020-07-21 17:22:26,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:22:26,536 INFO L276 IsEmpty]: Start isEmpty. Operand 8733 states and 11220 transitions. [2020-07-21 17:22:26,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-07-21 17:22:26,548 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:26,548 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:22:26,761 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:26,762 INFO L427 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:26,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:26,763 INFO L82 PathProgramCache]: Analyzing trace with hash -86547978, now seen corresponding path program 1 times [2020-07-21 17:22:26,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:26,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [517262879] [2020-07-21 17:22:26,764 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:26,894 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:22:26,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:26,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 17:22:26,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-07-21 17:22:26,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:26,937 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [517262879] [2020-07-21 17:22:26,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:26,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:22:26,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72010255] [2020-07-21 17:22:26,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:22:26,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:26,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:22:26,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:26,938 INFO L87 Difference]: Start difference. First operand 8733 states and 11220 transitions. Second operand 3 states. [2020-07-21 17:22:27,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:27,443 INFO L93 Difference]: Finished difference Result 17459 states and 22986 transitions. [2020-07-21 17:22:27,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:22:27,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-07-21 17:22:27,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:27,498 INFO L225 Difference]: With dead ends: 17459 [2020-07-21 17:22:27,498 INFO L226 Difference]: Without dead ends: 8753 [2020-07-21 17:22:27,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8753 states. [2020-07-21 17:22:28,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8753 to 8733. [2020-07-21 17:22:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8733 states. [2020-07-21 17:22:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8733 states to 8733 states and 10616 transitions. [2020-07-21 17:22:28,520 INFO L78 Accepts]: Start accepts. Automaton has 8733 states and 10616 transitions. Word has length 212 [2020-07-21 17:22:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:28,521 INFO L479 AbstractCegarLoop]: Abstraction has 8733 states and 10616 transitions. [2020-07-21 17:22:28,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:22:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 8733 states and 10616 transitions. [2020-07-21 17:22:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2020-07-21 17:22:28,538 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:28,538 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-21 17:22:28,753 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:28,754 INFO L427 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:28,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:28,754 INFO L82 PathProgramCache]: Analyzing trace with hash -379584349, now seen corresponding path program 1 times [2020-07-21 17:22:28,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:28,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [40908472] [2020-07-21 17:22:28,755 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:28,867 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:22:28,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:28,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 17:22:28,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2020-07-21 17:22:28,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:28,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [40908472] [2020-07-21 17:22:28,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:28,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:22:28,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889368619] [2020-07-21 17:22:28,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:22:28,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:28,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:22:28,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:28,919 INFO L87 Difference]: Start difference. First operand 8733 states and 10616 transitions. Second operand 3 states. [2020-07-21 17:22:29,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:29,155 INFO L93 Difference]: Finished difference Result 15464 states and 18715 transitions. [2020-07-21 17:22:29,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:22:29,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2020-07-21 17:22:29,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:29,251 INFO L225 Difference]: With dead ends: 15464 [2020-07-21 17:22:29,251 INFO L226 Difference]: Without dead ends: 6752 [2020-07-21 17:22:29,265 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:29,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2020-07-21 17:22:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 6752. [2020-07-21 17:22:29,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6752 states. [2020-07-21 17:22:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6752 states to 6752 states and 8124 transitions. [2020-07-21 17:22:29,631 INFO L78 Accepts]: Start accepts. Automaton has 6752 states and 8124 transitions. Word has length 306 [2020-07-21 17:22:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:29,632 INFO L479 AbstractCegarLoop]: Abstraction has 6752 states and 8124 transitions. [2020-07-21 17:22:29,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:22:29,632 INFO L276 IsEmpty]: Start isEmpty. Operand 6752 states and 8124 transitions. [2020-07-21 17:22:29,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2020-07-21 17:22:29,639 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:29,640 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2020-07-21 17:22:29,852 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:29,853 INFO L427 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:29,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:29,854 INFO L82 PathProgramCache]: Analyzing trace with hash 240464675, now seen corresponding path program 1 times [2020-07-21 17:22:29,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:29,854 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1407207255] [2020-07-21 17:22:29,855 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:30,015 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:22:30,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:30,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 17:22:30,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2020-07-21 17:22:30,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:30,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1407207255] [2020-07-21 17:22:30,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:30,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 17:22:30,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51588322] [2020-07-21 17:22:30,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 17:22:30,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:30,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 17:22:30,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:22:30,089 INFO L87 Difference]: Start difference. First operand 6752 states and 8124 transitions. Second operand 6 states. [2020-07-21 17:22:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:30,318 INFO L93 Difference]: Finished difference Result 11922 states and 14771 transitions. [2020-07-21 17:22:30,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 17:22:30,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 306 [2020-07-21 17:22:30,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:30,341 INFO L225 Difference]: With dead ends: 11922 [2020-07-21 17:22:30,341 INFO L226 Difference]: Without dead ends: 5192 [2020-07-21 17:22:30,354 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-21 17:22:30,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5192 states. [2020-07-21 17:22:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5192 to 4765. [2020-07-21 17:22:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4765 states. [2020-07-21 17:22:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4765 states to 4765 states and 5644 transitions. [2020-07-21 17:22:30,742 INFO L78 Accepts]: Start accepts. Automaton has 4765 states and 5644 transitions. Word has length 306 [2020-07-21 17:22:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:30,742 INFO L479 AbstractCegarLoop]: Abstraction has 4765 states and 5644 transitions. [2020-07-21 17:22:30,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 17:22:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 4765 states and 5644 transitions. [2020-07-21 17:22:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-21 17:22:30,747 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:30,748 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:22:30,961 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:30,962 INFO L427 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:30,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:30,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1721244321, now seen corresponding path program 1 times [2020-07-21 17:22:30,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:30,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [505097698] [2020-07-21 17:22:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:31,055 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:22:31,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:31,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 17:22:31,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-21 17:22:31,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:31,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [505097698] [2020-07-21 17:22:31,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:31,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:22:31,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837072573] [2020-07-21 17:22:31,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:22:31,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:31,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:22:31,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:31,098 INFO L87 Difference]: Start difference. First operand 4765 states and 5644 transitions. Second operand 3 states. [2020-07-21 17:22:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:31,330 INFO L93 Difference]: Finished difference Result 12901 states and 15584 transitions. [2020-07-21 17:22:31,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:22:31,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2020-07-21 17:22:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:31,363 INFO L225 Difference]: With dead ends: 12901 [2020-07-21 17:22:31,364 INFO L226 Difference]: Without dead ends: 8210 [2020-07-21 17:22:31,376 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8210 states. [2020-07-21 17:22:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8210 to 8206. [2020-07-21 17:22:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8206 states. [2020-07-21 17:22:31,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8206 states to 8206 states and 9703 transitions. [2020-07-21 17:22:31,754 INFO L78 Accepts]: Start accepts. Automaton has 8206 states and 9703 transitions. Word has length 213 [2020-07-21 17:22:31,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:31,755 INFO L479 AbstractCegarLoop]: Abstraction has 8206 states and 9703 transitions. [2020-07-21 17:22:31,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:22:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 8206 states and 9703 transitions. [2020-07-21 17:22:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-21 17:22:31,760 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:31,760 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:22:31,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:31,961 INFO L427 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:31,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:31,962 INFO L82 PathProgramCache]: Analyzing trace with hash 352584377, now seen corresponding path program 1 times [2020-07-21 17:22:31,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:31,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [33880077] [2020-07-21 17:22:31,963 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:32,186 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:22:32,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:32,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 17:22:32,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-07-21 17:22:32,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:32,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [33880077] [2020-07-21 17:22:32,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:32,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 17:22:32,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838423460] [2020-07-21 17:22:32,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 17:22:32,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:32,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 17:22:32,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:22:32,229 INFO L87 Difference]: Start difference. First operand 8206 states and 9703 transitions. Second operand 6 states. [2020-07-21 17:22:32,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:32,404 INFO L93 Difference]: Finished difference Result 13462 states and 16124 transitions. [2020-07-21 17:22:32,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 17:22:32,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2020-07-21 17:22:32,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:32,427 INFO L225 Difference]: With dead ends: 13462 [2020-07-21 17:22:32,427 INFO L226 Difference]: Without dead ends: 5320 [2020-07-21 17:22:32,442 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 17:22:32,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2020-07-21 17:22:32,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 5314. [2020-07-21 17:22:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5314 states. [2020-07-21 17:22:32,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5314 states to 5314 states and 6117 transitions. [2020-07-21 17:22:32,707 INFO L78 Accepts]: Start accepts. Automaton has 5314 states and 6117 transitions. Word has length 213 [2020-07-21 17:22:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:32,707 INFO L479 AbstractCegarLoop]: Abstraction has 5314 states and 6117 transitions. [2020-07-21 17:22:32,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 17:22:32,707 INFO L276 IsEmpty]: Start isEmpty. Operand 5314 states and 6117 transitions. [2020-07-21 17:22:32,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-21 17:22:32,713 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:32,713 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:22:32,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:32,927 INFO L427 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:32,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:32,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1892464406, now seen corresponding path program 2 times [2020-07-21 17:22:32,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:32,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1330217691] [2020-07-21 17:22:32,928 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:33,055 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:22:33,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:33,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 17:22:33,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-07-21 17:22:33,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:33,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1330217691] [2020-07-21 17:22:33,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:33,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 17:22:33,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678721187] [2020-07-21 17:22:33,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 17:22:33,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:33,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 17:22:33,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:22:33,111 INFO L87 Difference]: Start difference. First operand 5314 states and 6117 transitions. Second operand 6 states. [2020-07-21 17:22:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:33,265 INFO L93 Difference]: Finished difference Result 8460 states and 9830 transitions. [2020-07-21 17:22:33,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 17:22:33,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2020-07-21 17:22:33,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:33,273 INFO L225 Difference]: With dead ends: 8460 [2020-07-21 17:22:33,273 INFO L226 Difference]: Without dead ends: 1292 [2020-07-21 17:22:33,283 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 17:22:33,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2020-07-21 17:22:33,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1279. [2020-07-21 17:22:33,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2020-07-21 17:22:33,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2020-07-21 17:22:33,350 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1424 transitions. Word has length 213 [2020-07-21 17:22:33,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:33,350 INFO L479 AbstractCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2020-07-21 17:22:33,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 17:22:33,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1424 transitions. [2020-07-21 17:22:33,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2020-07-21 17:22:33,353 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:33,353 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-07-21 17:22:33,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:33,568 INFO L427 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:33,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:33,568 INFO L82 PathProgramCache]: Analyzing trace with hash -373872983, now seen corresponding path program 1 times [2020-07-21 17:22:33,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:33,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2108749785] [2020-07-21 17:22:33,569 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:33,715 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:22:33,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:33,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-21 17:22:33,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 70 proven. 66 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2020-07-21 17:22:33,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 17:22:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2020-07-21 17:22:34,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2108749785] [2020-07-21 17:22:34,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-21 17:22:34,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 11 [2020-07-21 17:22:34,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050061375] [2020-07-21 17:22:34,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 17:22:34,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:34,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 17:22:34,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-21 17:22:34,259 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. Second operand 9 states. [2020-07-21 17:22:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:35,360 INFO L93 Difference]: Finished difference Result 1358 states and 1534 transitions. [2020-07-21 17:22:35,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 17:22:35,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 267 [2020-07-21 17:22:35,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:35,365 INFO L225 Difference]: With dead ends: 1358 [2020-07-21 17:22:35,365 INFO L226 Difference]: Without dead ends: 1355 [2020-07-21 17:22:35,365 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2020-07-21 17:22:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-07-21 17:22:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1315. [2020-07-21 17:22:35,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2020-07-21 17:22:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1474 transitions. [2020-07-21 17:22:35,419 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1474 transitions. Word has length 267 [2020-07-21 17:22:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:35,419 INFO L479 AbstractCegarLoop]: Abstraction has 1315 states and 1474 transitions. [2020-07-21 17:22:35,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 17:22:35,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1474 transitions. [2020-07-21 17:22:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2020-07-21 17:22:35,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:35,422 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-07-21 17:22:35,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:35,636 INFO L427 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:35,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:35,637 INFO L82 PathProgramCache]: Analyzing trace with hash -271251823, now seen corresponding path program 1 times [2020-07-21 17:22:35,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:35,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [216686131] [2020-07-21 17:22:35,638 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:35,790 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:22:35,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:22:35,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 17:22:35,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:22:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2020-07-21 17:22:35,828 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:22:35,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [216686131] [2020-07-21 17:22:35,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:22:35,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:22:35,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350637836] [2020-07-21 17:22:35,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:22:35,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:22:35,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:22:35,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:35,829 INFO L87 Difference]: Start difference. First operand 1315 states and 1474 transitions. Second operand 3 states. [2020-07-21 17:22:35,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:22:35,889 INFO L93 Difference]: Finished difference Result 2154 states and 2428 transitions. [2020-07-21 17:22:35,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:22:35,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2020-07-21 17:22:35,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:22:35,893 INFO L225 Difference]: With dead ends: 2154 [2020-07-21 17:22:35,893 INFO L226 Difference]: Without dead ends: 1329 [2020-07-21 17:22:35,895 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:22:35,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2020-07-21 17:22:35,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1323. [2020-07-21 17:22:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1323 states. [2020-07-21 17:22:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1483 transitions. [2020-07-21 17:22:35,961 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1483 transitions. Word has length 271 [2020-07-21 17:22:35,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:22:35,961 INFO L479 AbstractCegarLoop]: Abstraction has 1323 states and 1483 transitions. [2020-07-21 17:22:35,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:22:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1483 transitions. [2020-07-21 17:22:35,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-07-21 17:22:35,963 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:22:35,963 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-07-21 17:22:36,168 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:36,169 INFO L427 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:22:36,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:22:36,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1410375831, now seen corresponding path program 1 times [2020-07-21 17:22:36,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:22:36,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [840764745] [2020-07-21 17:22:36,171 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:36,320 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:22:36,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-21 17:22:36,320 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 17:22:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 17:22:36,387 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 17:22:36,620 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 17:22:36,620 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 17:22:36,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:22:37,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:22:37 BoogieIcfgContainer [2020-07-21 17:22:37,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 17:22:37,066 INFO L168 Benchmark]: Toolchain (without parser) took 26460.29 ms. Allocated memory was 136.8 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 101.4 MB in the beginning and 220.8 MB in the end (delta: -119.4 MB). Peak memory consumption was 962.7 MB. Max. memory is 7.1 GB. [2020-07-21 17:22:37,066 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-21 17:22:37,067 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.84 ms. Allocated memory is still 136.8 MB. Free memory was 101.0 MB in the beginning and 86.0 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2020-07-21 17:22:37,067 INFO L168 Benchmark]: Boogie Preprocessor took 135.53 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 86.0 MB in the beginning and 178.0 MB in the end (delta: -91.9 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-21 17:22:37,067 INFO L168 Benchmark]: RCFGBuilder took 653.09 ms. Allocated memory is still 200.8 MB. Free memory was 177.3 MB in the beginning and 138.7 MB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 7.1 GB. [2020-07-21 17:22:37,068 INFO L168 Benchmark]: TraceAbstraction took 25227.25 ms. Allocated memory was 200.8 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 138.0 MB in the beginning and 220.8 MB in the end (delta: -82.8 MB). Peak memory consumption was 935.4 MB. Max. memory is 7.1 GB. [2020-07-21 17:22:37,069 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 437.84 ms. Allocated memory is still 136.8 MB. Free memory was 101.0 MB in the beginning and 86.0 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.53 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 86.0 MB in the beginning and 178.0 MB in the end (delta: -91.9 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 653.09 ms. Allocated memory is still 200.8 MB. Free memory was 177.3 MB in the beginning and 138.7 MB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25227.25 ms. Allocated memory was 200.8 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 138.0 MB in the beginning and 220.8 MB in the end (delta: -82.8 MB). Peak memory consumption was 935.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)=3, \old(E_M)=17, \old(local)=8, \old(M_E)=9, \old(m_i)=20, \old(m_pc)=7, \old(m_st)=11, \old(T1_E)=19, \old(t1_i)=14, \old(t1_pc)=13, \old(t1_st)=15, \old(T2_E)=10, \old(t2_i)=12, \old(t2_pc)=16, \old(t2_st)=6, \old(token)=4, 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. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.9s, OverallIterations: 27, TraceHistogramMax: 6, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7009 SDtfs, 5252 SDslu, 8587 SDs, 0 SdLazy, 2848 SolverSat, 1038 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5471 GetRequests, 5383 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8733occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 1670 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 5474 NumberOfCodeBlocks, 4246 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 5442 ConstructedInterpolants, 0 QuantifiedInterpolants, 1488280 SizeOfPredicates, 31 NumberOfNonLiveVariables, 18998 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 27 InterpolantComputations, 26 PerfectInterpolantSequences, 3559/3625 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...