/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 02:41:36,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 02:41:36,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 02:41:36,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 02:41:36,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 02:41:36,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 02:41:36,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 02:41:36,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 02:41:36,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 02:41:36,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 02:41:36,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 02:41:36,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 02:41:36,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 02:41:36,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 02:41:36,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 02:41:36,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 02:41:36,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 02:41:36,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 02:41:36,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 02:41:36,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 02:41:36,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 02:41:36,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 02:41:36,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 02:41:36,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 02:41:36,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 02:41:36,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 02:41:36,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 02:41:36,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 02:41:36,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 02:41:36,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 02:41:36,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 02:41:36,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 02:41:36,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 02:41:36,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 02:41:36,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 02:41:36,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 02:41:36,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 02:41:36,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 02:41:36,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 02:41:36,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 02:41:36,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 02:41:36,228 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 02:41:36,240 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 02:41:36,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 02:41:36,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 02:41:36,242 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 02:41:36,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 02:41:36,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 02:41:36,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 02:41:36,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 02:41:36,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 02:41:36,244 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 02:41:36,244 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 02:41:36,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 02:41:36,245 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 02:41:36,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 02:41:36,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 02:41:36,245 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 02:41:36,246 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 02:41:36,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 02:41:36,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 02:41:36,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 02:41:36,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 02:41:36,247 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 02:41:36,247 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 02:41:36,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 02:41:36,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 02:41:36,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 02:41:36,718 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 02:41:36,719 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 02:41:36,720 INFO L432 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-10-24 02:41:36,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429fb2a10/5a065fb4d7d74d35a9e0b84cb7d3719c/FLAGe4d485fc1 [2020-10-24 02:41:37,492 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 02:41:37,493 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-10-24 02:41:37,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429fb2a10/5a065fb4d7d74d35a9e0b84cb7d3719c/FLAGe4d485fc1 [2020-10-24 02:41:37,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429fb2a10/5a065fb4d7d74d35a9e0b84cb7d3719c [2020-10-24 02:41:37,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 02:41:37,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 02:41:37,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 02:41:37,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 02:41:37,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 02:41:37,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:41:37" (1/1) ... [2020-10-24 02:41:37,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a5d40e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:37, skipping insertion in model container [2020-10-24 02:41:37,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:41:37" (1/1) ... [2020-10-24 02:41:37,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 02:41:37,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 02:41:38,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:41:38,135 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 02:41:38,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:41:38,209 INFO L208 MainTranslator]: Completed translation [2020-10-24 02:41:38,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:38 WrapperNode [2020-10-24 02:41:38,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 02:41:38,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 02:41:38,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 02:41:38,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 02:41:38,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:38" (1/1) ... [2020-10-24 02:41:38,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:38" (1/1) ... [2020-10-24 02:41:38,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:38" (1/1) ... [2020-10-24 02:41:38,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:38" (1/1) ... [2020-10-24 02:41:38,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:38" (1/1) ... [2020-10-24 02:41:38,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:38" (1/1) ... [2020-10-24 02:41:38,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:38" (1/1) ... [2020-10-24 02:41:38,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 02:41:38,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 02:41:38,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 02:41:38,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 02:41:38,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:38" (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-10-24 02:41:38,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 02:41:38,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 02:41:38,367 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 02:41:38,368 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-10-24 02:41:38,368 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-10-24 02:41:38,368 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-10-24 02:41:38,368 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-10-24 02:41:38,368 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-10-24 02:41:38,369 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-10-24 02:41:38,369 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-10-24 02:41:38,369 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-10-24 02:41:38,369 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-10-24 02:41:38,369 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-10-24 02:41:38,370 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-10-24 02:41:38,370 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-10-24 02:41:38,370 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-10-24 02:41:38,370 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-10-24 02:41:38,370 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-10-24 02:41:38,371 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-10-24 02:41:38,371 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-10-24 02:41:38,371 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-10-24 02:41:38,371 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-10-24 02:41:38,371 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-10-24 02:41:38,372 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 02:41:38,372 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 02:41:38,372 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 02:41:38,372 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 02:41:38,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 02:41:38,373 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-10-24 02:41:38,373 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-10-24 02:41:38,373 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-10-24 02:41:38,373 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-10-24 02:41:38,373 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-10-24 02:41:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 02:41:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-10-24 02:41:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-10-24 02:41:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-10-24 02:41:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-10-24 02:41:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-10-24 02:41:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-10-24 02:41:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-10-24 02:41:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-10-24 02:41:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-10-24 02:41:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-10-24 02:41:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-10-24 02:41:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-10-24 02:41:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-10-24 02:41:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-10-24 02:41:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-10-24 02:41:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 02:41:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 02:41:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 02:41:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 02:41:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 02:41:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 02:41:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 02:41:39,435 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 02:41:39,436 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-10-24 02:41:39,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:41:39 BoogieIcfgContainer [2020-10-24 02:41:39,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 02:41:39,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 02:41:39,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 02:41:39,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 02:41:39,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:41:37" (1/3) ... [2020-10-24 02:41:39,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@835e94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:41:39, skipping insertion in model container [2020-10-24 02:41:39,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:38" (2/3) ... [2020-10-24 02:41:39,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@835e94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:41:39, skipping insertion in model container [2020-10-24 02:41:39,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:41:39" (3/3) ... [2020-10-24 02:41:39,452 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-10-24 02:41:39,465 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 02:41:39,472 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 02:41:39,488 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 02:41:39,525 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 02:41:39,526 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 02:41:39,526 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 02:41:39,526 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 02:41:39,526 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 02:41:39,527 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 02:41:39,527 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 02:41:39,527 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 02:41:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states. [2020-10-24 02:41:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-10-24 02:41:39,584 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:39,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:39,586 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:39,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:39,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1129586116, now seen corresponding path program 1 times [2020-10-24 02:41:39,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:39,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1911025559] [2020-10-24 02:41:39,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:41:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:41:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:41:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:41:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:41:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:41:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:41:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:41:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:41:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:41:40,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1911025559] [2020-10-24 02:41:40,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:41:40,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-24 02:41:40,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535100975] [2020-10-24 02:41:40,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 02:41:40,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:40,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 02:41:40,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:41:40,373 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 8 states. [2020-10-24 02:41:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:43,323 INFO L93 Difference]: Finished difference Result 704 states and 942 transitions. [2020-10-24 02:41:43,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 02:41:43,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 143 [2020-10-24 02:41:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:43,346 INFO L225 Difference]: With dead ends: 704 [2020-10-24 02:41:43,347 INFO L226 Difference]: Without dead ends: 439 [2020-10-24 02:41:43,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:41:43,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-10-24 02:41:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 282. [2020-10-24 02:41:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-10-24 02:41:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 344 transitions. [2020-10-24 02:41:43,571 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 344 transitions. Word has length 143 [2020-10-24 02:41:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:43,572 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 344 transitions. [2020-10-24 02:41:43,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 02:41:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 344 transitions. [2020-10-24 02:41:43,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-10-24 02:41:43,578 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:43,578 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:43,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 02:41:43,579 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:43,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:43,580 INFO L82 PathProgramCache]: Analyzing trace with hash -671587876, now seen corresponding path program 1 times [2020-10-24 02:41:43,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:43,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [248691364] [2020-10-24 02:41:43,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:41:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:41:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:41:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:41:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:41:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:41:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:41:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:41:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:41:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:41:43,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [248691364] [2020-10-24 02:41:43,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:41:43,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-24 02:41:43,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259276646] [2020-10-24 02:41:43,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 02:41:43,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:43,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 02:41:43,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:41:43,953 INFO L87 Difference]: Start difference. First operand 282 states and 344 transitions. Second operand 8 states. [2020-10-24 02:41:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:46,521 INFO L93 Difference]: Finished difference Result 670 states and 856 transitions. [2020-10-24 02:41:46,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 02:41:46,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 143 [2020-10-24 02:41:46,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:46,528 INFO L225 Difference]: With dead ends: 670 [2020-10-24 02:41:46,528 INFO L226 Difference]: Without dead ends: 438 [2020-10-24 02:41:46,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:41:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-10-24 02:41:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 281. [2020-10-24 02:41:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2020-10-24 02:41:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 342 transitions. [2020-10-24 02:41:46,618 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 342 transitions. Word has length 143 [2020-10-24 02:41:46,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:46,619 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 342 transitions. [2020-10-24 02:41:46,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 02:41:46,619 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 342 transitions. [2020-10-24 02:41:46,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-10-24 02:41:46,623 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:46,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:46,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 02:41:46,623 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:46,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:46,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1212829316, now seen corresponding path program 1 times [2020-10-24 02:41:46,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:46,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [743452066] [2020-10-24 02:41:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:46,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:46,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:41:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:46,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:41:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:46,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:41:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:46,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:41:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:46,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:41:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:46,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:41:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:46,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:41:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:46,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:46,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:41:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:46,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:41:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:41:47,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [743452066] [2020-10-24 02:41:47,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:41:47,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-24 02:41:47,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973066438] [2020-10-24 02:41:47,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:41:47,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:47,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:41:47,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:41:47,028 INFO L87 Difference]: Start difference. First operand 281 states and 342 transitions. Second operand 7 states. [2020-10-24 02:41:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:50,452 INFO L93 Difference]: Finished difference Result 1007 states and 1307 transitions. [2020-10-24 02:41:50,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 02:41:50,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2020-10-24 02:41:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:50,460 INFO L225 Difference]: With dead ends: 1007 [2020-10-24 02:41:50,460 INFO L226 Difference]: Without dead ends: 780 [2020-10-24 02:41:50,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:41:50,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2020-10-24 02:41:50,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 528. [2020-10-24 02:41:50,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2020-10-24 02:41:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 650 transitions. [2020-10-24 02:41:50,621 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 650 transitions. Word has length 143 [2020-10-24 02:41:50,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:50,622 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 650 transitions. [2020-10-24 02:41:50,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:41:50,622 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 650 transitions. [2020-10-24 02:41:50,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2020-10-24 02:41:50,627 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:50,628 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:50,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 02:41:50,628 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:50,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:50,629 INFO L82 PathProgramCache]: Analyzing trace with hash 441216868, now seen corresponding path program 1 times [2020-10-24 02:41:50,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:50,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1119757485] [2020-10-24 02:41:50,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:41:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:41:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:41:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:41:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:41:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:41:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:41:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:41:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:41:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:51,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-10-24 02:41:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:51,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:41:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:51,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:51,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:41:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:51,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:41:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:51,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:51,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2020-10-24 02:41:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-10-24 02:41:51,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1119757485] [2020-10-24 02:41:51,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:41:51,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-24 02:41:51,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832538089] [2020-10-24 02:41:51,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:41:51,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:51,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:41:51,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:41:51,304 INFO L87 Difference]: Start difference. First operand 528 states and 650 transitions. Second operand 10 states. [2020-10-24 02:41:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:56,909 INFO L93 Difference]: Finished difference Result 2275 states and 3121 transitions. [2020-10-24 02:41:56,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 02:41:56,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 222 [2020-10-24 02:41:56,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:56,926 INFO L225 Difference]: With dead ends: 2275 [2020-10-24 02:41:56,927 INFO L226 Difference]: Without dead ends: 1802 [2020-10-24 02:41:56,931 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=241, Invalid=515, Unknown=0, NotChecked=0, Total=756 [2020-10-24 02:41:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-10-24 02:41:57,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1057. [2020-10-24 02:41:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2020-10-24 02:41:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1351 transitions. [2020-10-24 02:41:57,254 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1351 transitions. Word has length 222 [2020-10-24 02:41:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:57,255 INFO L481 AbstractCegarLoop]: Abstraction has 1057 states and 1351 transitions. [2020-10-24 02:41:57,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:41:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1351 transitions. [2020-10-24 02:41:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2020-10-24 02:41:57,261 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:57,262 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:57,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 02:41:57,262 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:57,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:57,263 INFO L82 PathProgramCache]: Analyzing trace with hash -775451900, now seen corresponding path program 1 times [2020-10-24 02:41:57,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:57,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1675724702] [2020-10-24 02:41:57,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:41:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:41:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:41:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:41:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:41:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:41:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:41:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:41:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:41:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-10-24 02:41:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:41:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:41:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:41:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2020-10-24 02:41:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2020-10-24 02:41:57,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1675724702] [2020-10-24 02:41:57,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:41:57,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-24 02:41:57,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132611062] [2020-10-24 02:41:57,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:41:57,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:57,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:41:57,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:41:57,689 INFO L87 Difference]: Start difference. First operand 1057 states and 1351 transitions. Second operand 9 states. [2020-10-24 02:42:00,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:00,813 INFO L93 Difference]: Finished difference Result 2590 states and 3407 transitions. [2020-10-24 02:42:00,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 02:42:00,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 222 [2020-10-24 02:42:00,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:00,827 INFO L225 Difference]: With dead ends: 2590 [2020-10-24 02:42:00,827 INFO L226 Difference]: Without dead ends: 1586 [2020-10-24 02:42:00,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2020-10-24 02:42:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2020-10-24 02:42:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1049. [2020-10-24 02:42:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2020-10-24 02:42:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1338 transitions. [2020-10-24 02:42:01,148 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1338 transitions. Word has length 222 [2020-10-24 02:42:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:01,149 INFO L481 AbstractCegarLoop]: Abstraction has 1049 states and 1338 transitions. [2020-10-24 02:42:01,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:42:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1338 transitions. [2020-10-24 02:42:01,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-10-24 02:42:01,159 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:01,160 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:42:01,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 02:42:01,160 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:01,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:01,161 INFO L82 PathProgramCache]: Analyzing trace with hash -485958965, now seen corresponding path program 1 times [2020-10-24 02:42:01,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:01,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1673410690] [2020-10-24 02:42:01,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:42:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:42:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:42:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:42:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:42:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:42:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:42:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:42:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-10-24 02:42:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:42:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:42:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-10-24 02:42:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-10-24 02:42:01,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1673410690] [2020-10-24 02:42:01,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:42:01,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-24 02:42:01,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835426404] [2020-10-24 02:42:01,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:42:01,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:01,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:42:01,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:42:01,653 INFO L87 Difference]: Start difference. First operand 1049 states and 1338 transitions. Second operand 10 states. [2020-10-24 02:42:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:06,875 INFO L93 Difference]: Finished difference Result 4554 states and 6617 transitions. [2020-10-24 02:42:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 02:42:06,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 227 [2020-10-24 02:42:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:06,907 INFO L225 Difference]: With dead ends: 4554 [2020-10-24 02:42:06,908 INFO L226 Difference]: Without dead ends: 3559 [2020-10-24 02:42:06,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=241, Invalid=515, Unknown=0, NotChecked=0, Total=756 [2020-10-24 02:42:06,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2020-10-24 02:42:07,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 2134. [2020-10-24 02:42:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2134 states. [2020-10-24 02:42:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 2849 transitions. [2020-10-24 02:42:07,636 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 2849 transitions. Word has length 227 [2020-10-24 02:42:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:07,636 INFO L481 AbstractCegarLoop]: Abstraction has 2134 states and 2849 transitions. [2020-10-24 02:42:07,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:42:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 2849 transitions. [2020-10-24 02:42:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-10-24 02:42:07,644 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:07,644 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:42:07,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 02:42:07,645 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:07,645 INFO L82 PathProgramCache]: Analyzing trace with hash -7167836, now seen corresponding path program 1 times [2020-10-24 02:42:07,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:07,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [796642407] [2020-10-24 02:42:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:42:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:42:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:42:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:42:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:42:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:42:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:42:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:42:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-10-24 02:42:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:42:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:42:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:07,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:08,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-10-24 02:42:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:08,077 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-24 02:42:08,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [796642407] [2020-10-24 02:42:08,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:42:08,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-24 02:42:08,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053432314] [2020-10-24 02:42:08,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:42:08,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:08,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:42:08,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:42:08,082 INFO L87 Difference]: Start difference. First operand 2134 states and 2849 transitions. Second operand 11 states. [2020-10-24 02:42:13,154 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-24 02:42:19,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:19,061 INFO L93 Difference]: Finished difference Result 11370 states and 16175 transitions. [2020-10-24 02:42:19,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-10-24 02:42:19,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2020-10-24 02:42:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:19,131 INFO L225 Difference]: With dead ends: 11370 [2020-10-24 02:42:19,131 INFO L226 Difference]: Without dead ends: 9288 [2020-10-24 02:42:19,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=566, Invalid=2296, Unknown=0, NotChecked=0, Total=2862 [2020-10-24 02:42:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9288 states. [2020-10-24 02:42:21,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9288 to 7079. [2020-10-24 02:42:21,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7079 states. [2020-10-24 02:42:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7079 states to 7079 states and 9448 transitions. [2020-10-24 02:42:21,372 INFO L78 Accepts]: Start accepts. Automaton has 7079 states and 9448 transitions. Word has length 232 [2020-10-24 02:42:21,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:21,373 INFO L481 AbstractCegarLoop]: Abstraction has 7079 states and 9448 transitions. [2020-10-24 02:42:21,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:42:21,373 INFO L276 IsEmpty]: Start isEmpty. Operand 7079 states and 9448 transitions. [2020-10-24 02:42:21,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2020-10-24 02:42:21,384 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:21,385 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:42:21,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 02:42:21,385 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:21,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:21,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1250168170, now seen corresponding path program 1 times [2020-10-24 02:42:21,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:21,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [736588840] [2020-10-24 02:42:21,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:42:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:42:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:42:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:42:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:42:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:42:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:42:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:42:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-10-24 02:42:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:42:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:42:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:42:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-24 02:42:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-10-24 02:42:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:42:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:42:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:42:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-24 02:42:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2020-10-24 02:42:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 37 proven. 22 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-10-24 02:42:21,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [736588840] [2020-10-24 02:42:21,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:21,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:42:21,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280569630] [2020-10-24 02:42:21,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:42:21,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:21,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:42:21,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:42:21,920 INFO L87 Difference]: Start difference. First operand 7079 states and 9448 transitions. Second operand 12 states. [2020-10-24 02:42:22,819 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-24 02:42:22,945 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-24 02:42:23,076 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-24 02:42:23,206 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-24 02:42:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:28,437 INFO L93 Difference]: Finished difference Result 16749 states and 23458 transitions. [2020-10-24 02:42:28,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 02:42:28,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 288 [2020-10-24 02:42:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:28,506 INFO L225 Difference]: With dead ends: 16749 [2020-10-24 02:42:28,506 INFO L226 Difference]: Without dead ends: 9723 [2020-10-24 02:42:28,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=224, Invalid=532, Unknown=0, NotChecked=0, Total=756 [2020-10-24 02:42:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9723 states. [2020-10-24 02:42:30,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9723 to 7281. [2020-10-24 02:42:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7281 states. [2020-10-24 02:42:30,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7281 states to 7281 states and 9629 transitions. [2020-10-24 02:42:30,702 INFO L78 Accepts]: Start accepts. Automaton has 7281 states and 9629 transitions. Word has length 288 [2020-10-24 02:42:30,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:30,703 INFO L481 AbstractCegarLoop]: Abstraction has 7281 states and 9629 transitions. [2020-10-24 02:42:30,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:42:30,703 INFO L276 IsEmpty]: Start isEmpty. Operand 7281 states and 9629 transitions. [2020-10-24 02:42:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2020-10-24 02:42:30,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:30,716 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:42:30,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 02:42:30,716 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:30,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:30,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1377316729, now seen corresponding path program 1 times [2020-10-24 02:42:30,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:30,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1889773134] [2020-10-24 02:42:30,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:30,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:30,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:42:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:30,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:42:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:30,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:42:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:30,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:42:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:30,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:42:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:30,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:42:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:30,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:30,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:30,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:42:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:30,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:42:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:30,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-10-24 02:42:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:30,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:42:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:30,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:30,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:42:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2020-10-24 02:42:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:42:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:42:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 02:42:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 02:42:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2020-10-24 02:42:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,245 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-10-24 02:42:31,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1889773134] [2020-10-24 02:42:31,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:42:31,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-24 02:42:31,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856377105] [2020-10-24 02:42:31,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:42:31,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:31,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:42:31,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:42:31,248 INFO L87 Difference]: Start difference. First operand 7281 states and 9629 transitions. Second operand 11 states. [2020-10-24 02:42:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:40,170 INFO L93 Difference]: Finished difference Result 21182 states and 29885 transitions. [2020-10-24 02:42:40,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 02:42:40,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 288 [2020-10-24 02:42:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:40,251 INFO L225 Difference]: With dead ends: 21182 [2020-10-24 02:42:40,252 INFO L226 Difference]: Without dead ends: 13954 [2020-10-24 02:42:40,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2020-10-24 02:42:40,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13954 states. [2020-10-24 02:42:43,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13954 to 11031. [2020-10-24 02:42:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11031 states. [2020-10-24 02:42:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11031 states to 11031 states and 14339 transitions. [2020-10-24 02:42:43,273 INFO L78 Accepts]: Start accepts. Automaton has 11031 states and 14339 transitions. Word has length 288 [2020-10-24 02:42:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:43,274 INFO L481 AbstractCegarLoop]: Abstraction has 11031 states and 14339 transitions. [2020-10-24 02:42:43,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:42:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 11031 states and 14339 transitions. [2020-10-24 02:42:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2020-10-24 02:42:43,290 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:43,290 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:42:43,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 02:42:43,291 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:43,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:43,291 INFO L82 PathProgramCache]: Analyzing trace with hash -52384026, now seen corresponding path program 1 times [2020-10-24 02:42:43,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:43,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1281487346] [2020-10-24 02:42:43,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:42:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:42:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:42:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:42:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:42:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:42:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:42:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:42:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-10-24 02:42:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:42:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:42:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-10-24 02:42:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:42:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:42:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 02:42:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 02:42:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2020-10-24 02:42:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2020-10-24 02:42:43,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1281487346] [2020-10-24 02:42:43,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:42:43,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-24 02:42:43,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274309732] [2020-10-24 02:42:43,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:42:43,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:43,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:42:43,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:42:43,731 INFO L87 Difference]: Start difference. First operand 11031 states and 14339 transitions. Second operand 11 states. [2020-10-24 02:42:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:55,332 INFO L93 Difference]: Finished difference Result 31906 states and 44428 transitions. [2020-10-24 02:42:55,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 02:42:55,332 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 288 [2020-10-24 02:42:55,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:55,436 INFO L225 Difference]: With dead ends: 31906 [2020-10-24 02:42:55,436 INFO L226 Difference]: Without dead ends: 20928 [2020-10-24 02:42:55,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2020-10-24 02:42:55,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20928 states. [2020-10-24 02:43:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20928 to 16117. [2020-10-24 02:43:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16117 states. [2020-10-24 02:43:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16117 states to 16117 states and 20623 transitions. [2020-10-24 02:43:00,214 INFO L78 Accepts]: Start accepts. Automaton has 16117 states and 20623 transitions. Word has length 288 [2020-10-24 02:43:00,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:43:00,215 INFO L481 AbstractCegarLoop]: Abstraction has 16117 states and 20623 transitions. [2020-10-24 02:43:00,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:43:00,215 INFO L276 IsEmpty]: Start isEmpty. Operand 16117 states and 20623 transitions. [2020-10-24 02:43:00,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2020-10-24 02:43:00,242 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:43:00,242 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:43:00,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 02:43:00,243 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:43:00,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:43:00,243 INFO L82 PathProgramCache]: Analyzing trace with hash 254318487, now seen corresponding path program 1 times [2020-10-24 02:43:00,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:43:00,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [924649591] [2020-10-24 02:43:00,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:43:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:43:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:43:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:43:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:43:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:43:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:43:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:43:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:43:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:43:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:43:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:43:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-10-24 02:43:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:43:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:43:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:43:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:43:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:43:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-10-24 02:43:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2020-10-24 02:43:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2020-10-24 02:43:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:43:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:43:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:43:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 02:43:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 02:43:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2020-10-24 02:43:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2020-10-24 02:43:00,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [924649591] [2020-10-24 02:43:00,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:43:00,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 02:43:00,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426049989] [2020-10-24 02:43:00,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:43:00,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:43:00,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:43:00,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:43:00,901 INFO L87 Difference]: Start difference. First operand 16117 states and 20623 transitions. Second operand 11 states. [2020-10-24 02:43:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:43:15,689 INFO L93 Difference]: Finished difference Result 32636 states and 42916 transitions. [2020-10-24 02:43:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-10-24 02:43:15,690 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 323 [2020-10-24 02:43:15,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:43:15,948 INFO L225 Difference]: With dead ends: 32636 [2020-10-24 02:43:15,948 INFO L226 Difference]: Without dead ends: 21861 [2020-10-24 02:43:16,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=808, Invalid=2614, Unknown=0, NotChecked=0, Total=3422 [2020-10-24 02:43:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21861 states. [2020-10-24 02:43:20,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21861 to 16761. [2020-10-24 02:43:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16761 states. [2020-10-24 02:43:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16761 states to 16761 states and 21063 transitions. [2020-10-24 02:43:20,873 INFO L78 Accepts]: Start accepts. Automaton has 16761 states and 21063 transitions. Word has length 323 [2020-10-24 02:43:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:43:20,874 INFO L481 AbstractCegarLoop]: Abstraction has 16761 states and 21063 transitions. [2020-10-24 02:43:20,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:43:20,874 INFO L276 IsEmpty]: Start isEmpty. Operand 16761 states and 21063 transitions. [2020-10-24 02:43:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2020-10-24 02:43:20,897 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:43:20,897 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:43:20,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 02:43:20,898 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:43:20,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:43:20,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1518201429, now seen corresponding path program 1 times [2020-10-24 02:43:20,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:43:20,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [904108155] [2020-10-24 02:43:20,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:43:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:43:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:43:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:43:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:43:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:43:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:43:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:43:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:43:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:43:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:43:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:43:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-10-24 02:43:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:43:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:43:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:43:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:43:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:43:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2020-10-24 02:43:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2020-10-24 02:43:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2020-10-24 02:43:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:43:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:43:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:43:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 02:43:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 02:43:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2020-10-24 02:43:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2020-10-24 02:43:21,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [904108155] [2020-10-24 02:43:21,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:43:21,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:43:21,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150852523] [2020-10-24 02:43:21,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:43:21,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:43:21,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:43:21,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:43:21,355 INFO L87 Difference]: Start difference. First operand 16761 states and 21063 transitions. Second operand 12 states. [2020-10-24 02:43:23,383 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-24 02:43:37,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:43:37,152 INFO L93 Difference]: Finished difference Result 32104 states and 41167 transitions. [2020-10-24 02:43:37,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2020-10-24 02:43:37,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 323 [2020-10-24 02:43:37,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:43:37,233 INFO L225 Difference]: With dead ends: 32104 [2020-10-24 02:43:37,234 INFO L226 Difference]: Without dead ends: 20695 [2020-10-24 02:43:37,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=810, Invalid=3612, Unknown=0, NotChecked=0, Total=4422 [2020-10-24 02:43:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20695 states. [2020-10-24 02:43:42,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20695 to 17065. [2020-10-24 02:43:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17065 states. [2020-10-24 02:43:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17065 states to 17065 states and 20931 transitions. [2020-10-24 02:43:42,054 INFO L78 Accepts]: Start accepts. Automaton has 17065 states and 20931 transitions. Word has length 323 [2020-10-24 02:43:42,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:43:42,055 INFO L481 AbstractCegarLoop]: Abstraction has 17065 states and 20931 transitions. [2020-10-24 02:43:42,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:43:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 17065 states and 20931 transitions. [2020-10-24 02:43:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2020-10-24 02:43:42,074 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:43:42,074 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:43:42,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 02:43:42,075 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:43:42,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:43:42,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1163647285, now seen corresponding path program 1 times [2020-10-24 02:43:42,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:43:42,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [592184799] [2020-10-24 02:43:42,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:43:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:43:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:43:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:43:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:43:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:43:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:43:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:43:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:43:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:43:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:43:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:43:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-10-24 02:43:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-10-24 02:43:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-10-24 02:43:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:43:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:43:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:43:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:43:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 02:43:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2020-10-24 02:43:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:43:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:43:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:43:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 02:43:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 02:43:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2020-10-24 02:43:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:43:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2020-10-24 02:43:42,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [592184799] [2020-10-24 02:43:42,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:43:42,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-24 02:43:42,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596396488] [2020-10-24 02:43:42,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 02:43:42,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:43:42,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 02:43:42,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:43:42,664 INFO L87 Difference]: Start difference. First operand 17065 states and 20931 transitions. Second operand 13 states. [2020-10-24 02:43:43,060 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2020-10-24 02:44:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:44:02,986 INFO L93 Difference]: Finished difference Result 52751 states and 68370 transitions. [2020-10-24 02:44:02,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2020-10-24 02:44:02,988 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 330 [2020-10-24 02:44:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:44:03,166 INFO L225 Difference]: With dead ends: 52751 [2020-10-24 02:44:03,167 INFO L226 Difference]: Without dead ends: 35738 [2020-10-24 02:44:03,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1196, Invalid=5284, Unknown=0, NotChecked=0, Total=6480 [2020-10-24 02:44:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35738 states. [2020-10-24 02:44:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35738 to 27514. [2020-10-24 02:44:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27514 states. [2020-10-24 02:44:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27514 states to 27514 states and 33098 transitions. [2020-10-24 02:44:11,434 INFO L78 Accepts]: Start accepts. Automaton has 27514 states and 33098 transitions. Word has length 330 [2020-10-24 02:44:11,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:44:11,434 INFO L481 AbstractCegarLoop]: Abstraction has 27514 states and 33098 transitions. [2020-10-24 02:44:11,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 02:44:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 27514 states and 33098 transitions. [2020-10-24 02:44:11,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2020-10-24 02:44:11,449 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:44:11,449 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:44:11,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 02:44:11,450 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:44:11,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:44:11,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2104056100, now seen corresponding path program 1 times [2020-10-24 02:44:11,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:44:11,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1192860301] [2020-10-24 02:44:11,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:44:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:44:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:44:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:44:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:44:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:44:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:44:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:44:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:44:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:44:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:44:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:44:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-10-24 02:44:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-10-24 02:44:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-10-24 02:44:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:44:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:44:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:44:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:44:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:44:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2020-10-24 02:44:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:44:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:44:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:44:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 02:44:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 02:44:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2020-10-24 02:44:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:44:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 53 proven. 12 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2020-10-24 02:44:11,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1192860301] [2020-10-24 02:44:11,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:44:11,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 02:44:11,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979200184] [2020-10-24 02:44:11,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 02:44:11,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:44:11,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 02:44:11,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:44:11,965 INFO L87 Difference]: Start difference. First operand 27514 states and 33098 transitions. Second operand 13 states. [2020-10-24 02:44:12,427 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2020-10-24 02:44:17,641 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-24 02:44:19,587 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-10-24 02:44:20,802 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-24 02:44:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:44:43,326 INFO L93 Difference]: Finished difference Result 92430 states and 118467 transitions. [2020-10-24 02:44:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2020-10-24 02:44:43,327 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 329 [2020-10-24 02:44:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:44:43,723 INFO L225 Difference]: With dead ends: 92430 [2020-10-24 02:44:43,723 INFO L226 Difference]: Without dead ends: 64968 [2020-10-24 02:44:44,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1293, Invalid=6189, Unknown=0, NotChecked=0, Total=7482 [2020-10-24 02:44:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64968 states. [2020-10-24 02:44:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64968 to 53213. [2020-10-24 02:44:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53213 states. [2020-10-24 02:45:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53213 states to 53213 states and 63248 transitions. [2020-10-24 02:45:00,124 INFO L78 Accepts]: Start accepts. Automaton has 53213 states and 63248 transitions. Word has length 329 [2020-10-24 02:45:00,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:45:00,125 INFO L481 AbstractCegarLoop]: Abstraction has 53213 states and 63248 transitions. [2020-10-24 02:45:00,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 02:45:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 53213 states and 63248 transitions. [2020-10-24 02:45:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2020-10-24 02:45:00,143 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:45:00,144 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:45:00,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 02:45:00,144 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:45:00,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:45:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1688027972, now seen corresponding path program 1 times [2020-10-24 02:45:00,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:45:00,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [695564970] [2020-10-24 02:45:00,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:45:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:45:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:45:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:45:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:45:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:45:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:45:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:45:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:45:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:45:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:45:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:45:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-10-24 02:45:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-10-24 02:45:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-10-24 02:45:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:45:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:45:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:45:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:45:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:45:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2020-10-24 02:45:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:45:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:45:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:45:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 02:45:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 02:45:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:00,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2020-10-24 02:45:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 53 proven. 11 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2020-10-24 02:45:01,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [695564970] [2020-10-24 02:45:01,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:45:01,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:45:01,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705687357] [2020-10-24 02:45:01,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:45:01,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:45:01,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:45:01,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:45:01,010 INFO L87 Difference]: Start difference. First operand 53213 states and 63248 transitions. Second operand 12 states. [2020-10-24 02:45:01,968 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-24 02:45:02,097 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-24 02:45:02,284 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-24 02:45:02,478 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-24 02:45:02,649 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-24 02:45:24,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:45:24,662 INFO L93 Difference]: Finished difference Result 114781 states and 139706 transitions. [2020-10-24 02:45:24,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 02:45:24,662 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 329 [2020-10-24 02:45:24,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:45:25,161 INFO L225 Difference]: With dead ends: 114781 [2020-10-24 02:45:25,161 INFO L226 Difference]: Without dead ends: 61621 [2020-10-24 02:45:25,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2020-10-24 02:45:25,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61621 states. [2020-10-24 02:45:40,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61621 to 51813. [2020-10-24 02:45:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51813 states. [2020-10-24 02:45:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51813 states to 51813 states and 60528 transitions. [2020-10-24 02:45:41,096 INFO L78 Accepts]: Start accepts. Automaton has 51813 states and 60528 transitions. Word has length 329 [2020-10-24 02:45:41,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:45:41,097 INFO L481 AbstractCegarLoop]: Abstraction has 51813 states and 60528 transitions. [2020-10-24 02:45:41,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:45:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 51813 states and 60528 transitions. [2020-10-24 02:45:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2020-10-24 02:45:41,125 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:45:41,126 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:45:41,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 02:45:41,126 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:45:41,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:45:41,126 INFO L82 PathProgramCache]: Analyzing trace with hash 599072793, now seen corresponding path program 1 times [2020-10-24 02:45:41,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:45:41,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1052448058] [2020-10-24 02:45:41,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:45:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:45:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:45:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:45:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:45:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:45:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:45:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:45:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:45:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:45:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:45:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-10-24 02:45:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:45:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 02:45:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-10-24 02:45:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-10-24 02:45:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-10-24 02:45:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2020-10-24 02:45:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:45:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:45:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:45:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2020-10-24 02:45:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-10-24 02:45:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2020-10-24 02:45:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:45:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2020-10-24 02:45:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2020-10-24 02:45:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2020-10-24 02:45:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2020-10-24 02:45:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:45:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:45:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:45:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:45:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 02:45:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2020-10-24 02:45:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:45:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:45:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:45:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:45:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-24 02:45:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2020-10-24 02:45:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:45:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:45:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:45:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 02:45:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 02:45:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 507 [2020-10-24 02:45:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 90 proven. 15 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2020-10-24 02:45:41,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1052448058] [2020-10-24 02:45:41,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:45:41,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 02:45:41,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307223464] [2020-10-24 02:45:41,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 02:45:41,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:45:41,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 02:45:41,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:45:41,877 INFO L87 Difference]: Start difference. First operand 51813 states and 60528 transitions. Second operand 15 states. [2020-10-24 02:45:43,404 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-24 02:45:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:45:51,882 INFO L93 Difference]: Finished difference Result 63498 states and 74165 transitions. [2020-10-24 02:45:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-10-24 02:45:51,883 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 535 [2020-10-24 02:45:51,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:45:51,937 INFO L225 Difference]: With dead ends: 63498 [2020-10-24 02:45:51,937 INFO L226 Difference]: Without dead ends: 11739 [2020-10-24 02:45:52,061 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=754, Invalid=2326, Unknown=0, NotChecked=0, Total=3080 [2020-10-24 02:45:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11739 states. [2020-10-24 02:45:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11739 to 9748. [2020-10-24 02:45:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9748 states. [2020-10-24 02:45:54,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9748 states to 9748 states and 10991 transitions. [2020-10-24 02:45:54,939 INFO L78 Accepts]: Start accepts. Automaton has 9748 states and 10991 transitions. Word has length 535 [2020-10-24 02:45:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:45:54,940 INFO L481 AbstractCegarLoop]: Abstraction has 9748 states and 10991 transitions. [2020-10-24 02:45:54,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 02:45:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 9748 states and 10991 transitions. [2020-10-24 02:45:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2020-10-24 02:45:54,945 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:45:54,945 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 02:45:54,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 02:45:54,945 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:45:54,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:45:54,946 INFO L82 PathProgramCache]: Analyzing trace with hash -909172723, now seen corresponding path program 1 times [2020-10-24 02:45:54,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:45:54,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [542634820] [2020-10-24 02:45:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:45:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:45:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:45:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:45:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:45:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:45:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:45:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:45:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:45:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:45:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:45:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:45:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-10-24 02:45:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-10-24 02:45:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-10-24 02:45:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 02:45:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:45:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:45:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:45:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:45:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 02:45:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2020-10-24 02:45:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:45:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:45:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:45:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:45:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-24 02:45:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2020-10-24 02:45:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:45:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:45:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:45:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 02:45:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 02:45:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2020-10-24 02:45:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:45:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 81 proven. 16 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2020-10-24 02:45:55,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [542634820] [2020-10-24 02:45:55,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:45:55,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 02:45:55,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570249862] [2020-10-24 02:45:55,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 02:45:55,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:45:55,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 02:45:55,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:45:55,546 INFO L87 Difference]: Start difference. First operand 9748 states and 10991 transitions. Second operand 15 states. [2020-10-24 02:46:01,607 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-24 02:46:01,997 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-24 02:46:07,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:46:07,504 INFO L93 Difference]: Finished difference Result 20371 states and 23712 transitions. [2020-10-24 02:46:07,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-10-24 02:46:07,505 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 396 [2020-10-24 02:46:07,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:46:07,536 INFO L225 Difference]: With dead ends: 20371 [2020-10-24 02:46:07,537 INFO L226 Difference]: Without dead ends: 11185 [2020-10-24 02:46:07,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1012, Invalid=3148, Unknown=0, NotChecked=0, Total=4160 [2020-10-24 02:46:07,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11185 states. [2020-10-24 02:46:10,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11185 to 9241. [2020-10-24 02:46:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9241 states. [2020-10-24 02:46:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9241 states to 9241 states and 10366 transitions. [2020-10-24 02:46:10,177 INFO L78 Accepts]: Start accepts. Automaton has 9241 states and 10366 transitions. Word has length 396 [2020-10-24 02:46:10,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:46:10,177 INFO L481 AbstractCegarLoop]: Abstraction has 9241 states and 10366 transitions. [2020-10-24 02:46:10,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 02:46:10,177 INFO L276 IsEmpty]: Start isEmpty. Operand 9241 states and 10366 transitions. [2020-10-24 02:46:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2020-10-24 02:46:10,180 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:46:10,180 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:46:10,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 02:46:10,181 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:46:10,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:46:10,181 INFO L82 PathProgramCache]: Analyzing trace with hash -103460588, now seen corresponding path program 1 times [2020-10-24 02:46:10,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:46:10,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [798176142] [2020-10-24 02:46:10,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:46:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:46:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:46:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:46:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:46:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:46:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:46:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:46:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:46:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:46:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:46:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:46:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-10-24 02:46:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-10-24 02:46:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-10-24 02:46:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 02:46:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:46:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:46:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:46:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:46:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 02:46:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2020-10-24 02:46:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:46:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:46:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:46:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:46:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 02:46:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2020-10-24 02:46:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:46:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:46:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:46:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 02:46:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 02:46:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:10,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2020-10-24 02:46:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 55 proven. 1 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2020-10-24 02:46:11,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [798176142] [2020-10-24 02:46:11,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:46:11,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 02:46:11,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048969911] [2020-10-24 02:46:11,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 02:46:11,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:46:11,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 02:46:11,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-10-24 02:46:11,006 INFO L87 Difference]: Start difference. First operand 9241 states and 10366 transitions. Second operand 14 states. [2020-10-24 02:46:16,390 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-24 02:46:25,770 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-10-24 02:46:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:46:34,661 INFO L93 Difference]: Finished difference Result 41446 states and 47705 transitions. [2020-10-24 02:46:34,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2020-10-24 02:46:34,662 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 397 [2020-10-24 02:46:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:46:34,779 INFO L225 Difference]: With dead ends: 41446 [2020-10-24 02:46:34,779 INFO L226 Difference]: Without dead ends: 32949 [2020-10-24 02:46:34,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2130 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=987, Invalid=5333, Unknown=0, NotChecked=0, Total=6320 [2020-10-24 02:46:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32949 states. [2020-10-24 02:46:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32949 to 26308. [2020-10-24 02:46:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26308 states. [2020-10-24 02:46:42,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26308 states to 26308 states and 29968 transitions. [2020-10-24 02:46:42,832 INFO L78 Accepts]: Start accepts. Automaton has 26308 states and 29968 transitions. Word has length 397 [2020-10-24 02:46:42,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:46:42,832 INFO L481 AbstractCegarLoop]: Abstraction has 26308 states and 29968 transitions. [2020-10-24 02:46:42,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 02:46:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 26308 states and 29968 transitions. [2020-10-24 02:46:42,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2020-10-24 02:46:42,837 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:46:42,838 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:46:42,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-24 02:46:42,838 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:46:42,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:46:42,838 INFO L82 PathProgramCache]: Analyzing trace with hash -656205460, now seen corresponding path program 1 times [2020-10-24 02:46:42,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:46:42,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [472341799] [2020-10-24 02:46:42,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:46:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,127 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-24 02:46:43,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:46:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-24 02:46:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:46:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-24 02:46:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 02:46:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 02:46:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:46:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:46:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:46:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-24 02:46:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:46:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-10-24 02:46:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-10-24 02:46:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-10-24 02:46:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 02:46:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:46:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:46:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:46:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:46:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 02:46:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2020-10-24 02:46:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:46:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:46:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:46:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:46:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 02:46:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2020-10-24 02:46:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:46:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:46:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 02:46:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 02:46:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 02:46:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2020-10-24 02:46:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:46:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2020-10-24 02:46:43,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [472341799] [2020-10-24 02:46:43,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:46:43,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:46:43,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560429089] [2020-10-24 02:46:43,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:46:43,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:46:43,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:46:43,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:46:43,497 INFO L87 Difference]: Start difference. First operand 26308 states and 29968 transitions. Second operand 10 states. [2020-10-24 02:46:56,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:46:56,178 INFO L93 Difference]: Finished difference Result 55866 states and 64476 transitions. [2020-10-24 02:46:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 02:46:56,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 401 [2020-10-24 02:46:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:46:56,295 INFO L225 Difference]: With dead ends: 55866 [2020-10-24 02:46:56,295 INFO L226 Difference]: Without dead ends: 30332 [2020-10-24 02:46:56,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2020-10-24 02:46:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30332 states. [2020-10-24 02:47:04,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30332 to 26341. [2020-10-24 02:47:04,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26341 states. [2020-10-24 02:47:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26341 states to 26341 states and 30033 transitions. [2020-10-24 02:47:04,616 INFO L78 Accepts]: Start accepts. Automaton has 26341 states and 30033 transitions. Word has length 401 [2020-10-24 02:47:04,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:47:04,617 INFO L481 AbstractCegarLoop]: Abstraction has 26341 states and 30033 transitions. [2020-10-24 02:47:04,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:47:04,617 INFO L276 IsEmpty]: Start isEmpty. Operand 26341 states and 30033 transitions. [2020-10-24 02:47:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2020-10-24 02:47:04,621 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:47:04,622 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:47:04,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-24 02:47:04,622 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:47:04,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:47:04,622 INFO L82 PathProgramCache]: Analyzing trace with hash 582467571, now seen corresponding path program 1 times [2020-10-24 02:47:04,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:47:04,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1480260191] [2020-10-24 02:47:04,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:47:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 02:47:04,649 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 02:47:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 02:47:04,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 02:47:04,926 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 02:47:04,926 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 02:47:04,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-24 02:47:05,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:47:05 BoogieIcfgContainer [2020-10-24 02:47:05,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 02:47:05,311 INFO L168 Benchmark]: Toolchain (without parser) took 327483.93 ms. Allocated memory was 152.0 MB in the beginning and 6.1 GB in the end (delta: 5.9 GB). Free memory was 127.7 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.7 GB. Max. memory is 8.0 GB. [2020-10-24 02:47:05,312 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 152.0 MB. Free memory is still 127.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 02:47:05,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.70 ms. Allocated memory is still 152.0 MB. Free memory was 127.1 MB in the beginning and 113.3 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-10-24 02:47:05,313 INFO L168 Benchmark]: Boogie Preprocessor took 59.70 ms. Allocated memory is still 152.0 MB. Free memory was 113.3 MB in the beginning and 111.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 02:47:05,313 INFO L168 Benchmark]: RCFGBuilder took 1167.73 ms. Allocated memory is still 152.0 MB. Free memory was 110.9 MB in the beginning and 101.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 8.0 GB. [2020-10-24 02:47:05,314 INFO L168 Benchmark]: TraceAbstraction took 325865.71 ms. Allocated memory was 152.0 MB in the beginning and 6.1 GB in the end (delta: 5.9 GB). Free memory was 100.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.7 GB. Max. memory is 8.0 GB. [2020-10-24 02:47:05,317 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 152.0 MB. Free memory is still 127.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 372.70 ms. Allocated memory is still 152.0 MB. Free memory was 127.1 MB in the beginning and 113.3 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 59.70 ms. Allocated memory is still 152.0 MB. Free memory was 113.3 MB in the beginning and 111.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1167.73 ms. Allocated memory is still 152.0 MB. Free memory was 110.9 MB in the beginning and 101.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 325865.71 ms. Allocated memory was 152.0 MB in the beginning and 6.1 GB in the end (delta: 5.9 GB). Free memory was 100.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.7 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L16] int m_pc = 0; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=72, E_2=63, E_M=57, local=70, M_E=60, m_i=52, m_pc=0, m_st=55, T1_E=49, t1_i=68, t1_pc=65, t1_st=50, T2_E=69, t2_i=51, t2_pc=64, t2_st=54, token=73] [L17] int t1_pc = 0; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=72, E_2=63, E_M=57, local=70, M_E=60, m_i=52, m_pc=0, m_st=55, T1_E=49, t1_i=68, t1_pc=0, t1_st=50, T2_E=69, t2_i=51, t2_pc=64, t2_st=54, token=73] [L18] int t2_pc = 0; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=72, E_2=63, E_M=57, local=70, M_E=60, m_i=52, m_pc=0, m_st=55, T1_E=49, t1_i=68, t1_pc=0, t1_st=50, T2_E=69, t2_i=51, t2_pc=0, t2_st=54, token=73] [L19] int m_st ; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=72, E_2=63, E_M=57, local=70, M_E=60, m_i=52, m_pc=0, m_st=0, T1_E=49, t1_i=68, t1_pc=0, t1_st=50, T2_E=69, t2_i=51, t2_pc=0, t2_st=54, token=73] [L20] int t1_st ; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=72, E_2=63, E_M=57, local=70, M_E=60, m_i=52, m_pc=0, m_st=0, T1_E=49, t1_i=68, t1_pc=0, t1_st=0, T2_E=69, t2_i=51, t2_pc=0, t2_st=54, token=73] [L21] int t2_st ; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=72, E_2=63, E_M=57, local=70, M_E=60, m_i=52, m_pc=0, m_st=0, T1_E=49, t1_i=68, t1_pc=0, t1_st=0, T2_E=69, t2_i=51, t2_pc=0, t2_st=0, token=73] [L22] int m_i ; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=72, E_2=63, E_M=57, local=70, M_E=60, m_i=0, m_pc=0, m_st=0, T1_E=49, t1_i=68, t1_pc=0, t1_st=0, T2_E=69, t2_i=51, t2_pc=0, t2_st=0, token=73] [L23] int t1_i ; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=72, E_2=63, E_M=57, local=70, M_E=60, m_i=0, m_pc=0, m_st=0, T1_E=49, t1_i=0, t1_pc=0, t1_st=0, T2_E=69, t2_i=51, t2_pc=0, t2_st=0, token=73] [L24] int t2_i ; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=72, E_2=63, E_M=57, local=70, M_E=60, m_i=0, m_pc=0, m_st=0, T1_E=49, t1_i=0, t1_pc=0, t1_st=0, T2_E=69, t2_i=0, t2_pc=0, t2_st=0, token=73] [L25] int M_E = 2; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=72, E_2=63, E_M=57, local=70, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=49, t1_i=0, t1_pc=0, t1_st=0, T2_E=69, t2_i=0, t2_pc=0, t2_st=0, token=73] [L26] int T1_E = 2; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=72, E_2=63, E_M=57, local=70, 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=69, t2_i=0, t2_pc=0, t2_st=0, token=73] [L27] int T2_E = 2; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=72, E_2=63, E_M=57, local=70, 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=73] [L28] int E_M = 2; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=72, E_2=63, E_M=2, local=70, 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=73] [L29] int E_1 = 2; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=2, E_2=63, E_M=2, local=70, 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=73] [L30] int E_2 = 2; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=2, E_2=2, E_M=2, local=70, 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=73] [L35] int token ; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=2, E_2=2, E_M=2, local=70, 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] [L37] int local ; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, 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] [L602] 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] [L606] 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] [L516] m_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L517] t1_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L518] 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] [L606] 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] [L607] 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] [L543] int kernel_st ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L544] 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] [L545] int tmp___0 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] 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] [L550] 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] [L551] 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] [L235] COND TRUE m_i == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L236] 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] [L240] COND TRUE t1_i == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L241] 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] [L245] COND TRUE t2_i == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L246] 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] [L551] 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] [L552] 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] [L348] 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] [L353] 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] [L358] 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] [L363] 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] [L368] 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] [L373] 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] [L552] 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] [L553] 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] [L421] 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] [L422] int tmp___0 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L423] 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] [L427] 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] [L167] 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] [L170] 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] [L180] __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] [L182] 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] [L427] 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] [L427] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L429] 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] [L435] 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] [L186] 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] [L189] 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] [L199] __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] [L201] 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] [L435] 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] [L435] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L437] 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] [L443] 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] [L205] 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] [L208] 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] [L218] __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] [L220] 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] [L443] 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] [L443] tmp___1 = is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_transmit2_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L445] 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] [L553] 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] [L554] 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] [L386] 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] [L391] 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] [L396] 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] [L401] 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] [L406] 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] [L411] 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] [L554] 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] [L557] 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] [L560] 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] [L561] 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] [L281] 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] [L285] 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] [L288] 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] [L255] 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] [L258] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L259] __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] [L276] 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] [L288] 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] [L288] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L290] 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] [L295] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L296] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L297] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L298] 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] [L309] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L310] int tmp_ndt_2; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L311] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L312] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L314] 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] [L315] 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] [L98] 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] [L109] 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] [L111] t1_pc = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L112] 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] [L315] 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] [L323] COND TRUE t2_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L324] int tmp_ndt_3; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L325] tmp_ndt_3 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L326] COND TRUE \read(tmp_ndt_3) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L328] 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] [L329] 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] [L134] 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] [L145] 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] [L147] t2_pc = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=0] [L148] 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] [L329] 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] [L285] 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] [L288] 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] [L255] 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] [L258] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L259] __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] [L276] 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] [L288] 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] [L288] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L290] 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] [L295] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L296] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L297] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L298] COND TRUE \read(tmp_ndt_1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L300] 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] [L301] 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] [L40] int tmp_var = __VERIFIER_nondet_int(); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L42] 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] [L53] 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] [L56] token = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __VERIFIER_nondet_int()=-1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L57] local = token VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L58] 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] [L59] 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] [L459] 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] [L421] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L422] int tmp___0 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L423] 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] [L427] 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] [L167] 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] [L170] 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] [L180] __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] [L182] 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] [L427] 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] [L427] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_master_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=-1] [L429] 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] [L435] 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] [L186] 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] [L189] 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] [L190] COND TRUE E_1 == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L191] __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] [L201] 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] [L435] 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] [L435] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit1_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=-1] [L437] COND TRUE \read(tmp___0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=-1] [L438] 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] [L443] 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] [L205] 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] [L208] 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] [L209] 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] [L218] __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] [L220] 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] [L443] 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] [L443] tmp___1 = is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit2_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=-1] [L445] 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] [L459] 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] [L59] 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] [L60] E_1 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L61] m_pc = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L62] 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] [L301] 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] [L309] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=-1] [L310] int tmp_ndt_2; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_3=1, token=-1] [L311] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=-1] [L312] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=-1] [L314] 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] [L315] 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] [L98] 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] [L101] 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] [L117] token += 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L118] 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] [L119] 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] [L459] 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] [L421] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L422] int tmp___0 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L423] 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] [L427] 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] [L167] 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] [L170] 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] [L171] 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] [L180] __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] [L182] 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] [L427] 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] [L427] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_master_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L429] 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] [L435] 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] [L186] 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] [L189] 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] [L190] 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] [L199] __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] [L201] 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] [L435] 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] [L435] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_transmit1_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=0] [L437] 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] [L443] 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] [L205] 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] [L208] 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] [L209] COND TRUE E_2 == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L210] __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] [L220] 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] [L443] 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] [L443] tmp___1 = is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_transmit2_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, tmp___1=1, token=0] [L445] COND TRUE \read(tmp___1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, tmp___1=1, token=0] [L446] 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] [L459] 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] [L119] 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] [L120] 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] [L109] 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] [L111] t1_pc = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L112] 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] [L315] 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] [L323] COND TRUE t2_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L324] int tmp_ndt_3; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L325] tmp_ndt_3 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L326] COND TRUE \read(tmp_ndt_3) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L328] 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] [L329] 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] [L134] 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] [L137] 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] [L153] token += 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L154] 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] [L155] 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] [L459] 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] [L421] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L422] int tmp___0 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L423] 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] [L427] 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] [L167] 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] [L170] 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] [L171] COND TRUE E_M == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L172] __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] [L182] 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] [L427] 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] [L427] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_master_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=1] [L429] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=1] [L430] 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] [L435] 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] [L186] 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] [L189] 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] [L190] 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] [L199] __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] [L201] 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] [L435] 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] [L435] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_transmit1_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=1] [L437] 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] [L443] 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] [L205] 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] [L208] 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] [L209] 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] [L218] __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] [L220] 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] [L443] 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] [L443] tmp___1 = is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_transmit2_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=1] [L445] 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] [L459] 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] [L155] 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] [L156] 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] [L145] 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] [L147] t2_pc = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L148] 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] [L329] 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] [L285] 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] [L288] 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] [L255] 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] [L258] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L259] __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] [L276] 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] [L288] 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] [L288] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L290] 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] [L295] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L296] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L297] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L298] COND TRUE \read(tmp_ndt_1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L300] 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] [L301] 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] [L40] int tmp_var = __VERIFIER_nondet_int(); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, __VERIFIER_nondet_int()=5, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L42] 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] [L45] 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] [L67] 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] [L72] 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] [L73] 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] 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] [L80] 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] [L81] 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] [L12] CALL reach_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] [L3] __assert_fail("0", "token_ring.02.cil-2.c", 3, "reach_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 24 procedures, 296 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 325.4s, OverallIterations: 20, TraceHistogramMax: 7, AutomataDifference: 228.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7263 SDtfs, 53648 SDslu, 3053 SDs, 0 SdLazy, 46046 SolverSat, 14852 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 62.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2035 GetRequests, 1231 SyntacticMatches, 3 SemanticMatches, 801 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14129 ImplicationChecksByTransitivity, 35.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53213occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 85.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 68742 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 5961 NumberOfCodeBlocks, 5961 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5540 ConstructedInterpolants, 0 QuantifiedInterpolants, 3927928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 3174/3259 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...