/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-7d8eed3 [2020-11-07 06:52:07,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:52:07,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:52:07,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:52:07,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:52:07,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:52:07,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:52:07,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:52:07,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:52:07,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:52:07,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:52:07,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:52:07,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:52:07,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:52:07,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:52:07,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:52:07,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:52:07,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:52:07,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:52:07,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:52:07,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:52:07,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:52:07,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:52:07,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:52:07,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:52:07,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:52:07,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:52:07,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:52:07,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:52:07,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:52:07,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:52:07,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:52:07,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:52:07,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:52:07,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:52:07,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:52:07,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:52:07,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:52:07,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:52:07,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:52:07,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:52:07,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 06:52:07,920 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:52:07,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:52:07,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:52:07,922 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:52:07,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:52:07,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:52:07,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:52:07,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:52:07,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:52:07,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:52:07,923 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:52:07,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:52:07,924 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:52:07,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:52:07,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:52:07,924 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:52:07,924 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:52:07,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:52:07,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:52:07,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:52:07,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:52:07,925 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:52:07,926 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-11-07 06:52:08,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:52:08,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:52:08,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:52:08,329 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:52:08,329 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:52:08,330 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-11-07 06:52:08,415 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e75aba6de/36b71f12b8844530bf616eefc521eae5/FLAGa45c77de8 [2020-11-07 06:52:08,970 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:52:08,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-11-07 06:52:08,986 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e75aba6de/36b71f12b8844530bf616eefc521eae5/FLAGa45c77de8 [2020-11-07 06:52:09,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e75aba6de/36b71f12b8844530bf616eefc521eae5 [2020-11-07 06:52:09,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:52:09,333 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:52:09,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:52:09,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:52:09,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:52:09,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:52:09" (1/1) ... [2020-11-07 06:52:09,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e23fb94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:09, skipping insertion in model container [2020-11-07 06:52:09,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:52:09" (1/1) ... [2020-11-07 06:52:09,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:52:09,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:52:09,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:52:09,620 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:52:09,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:52:09,738 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:52:09,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:09 WrapperNode [2020-11-07 06:52:09,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:52:09,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:52:09,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:52:09,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:52:09,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:09" (1/1) ... [2020-11-07 06:52:09,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:09" (1/1) ... [2020-11-07 06:52:09,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:09" (1/1) ... [2020-11-07 06:52:09,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:09" (1/1) ... [2020-11-07 06:52:09,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:09" (1/1) ... [2020-11-07 06:52:09,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:09" (1/1) ... [2020-11-07 06:52:09,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:09" (1/1) ... [2020-11-07 06:52:09,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:52:09,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:52:09,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:52:09,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:52:09,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:52:09,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:52:09,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:52:09,958 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:52:09,958 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-11-07 06:52:09,958 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-11-07 06:52:09,958 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-11-07 06:52:09,959 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-11-07 06:52:09,959 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-11-07 06:52:09,959 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-11-07 06:52:09,960 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-11-07 06:52:09,960 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-11-07 06:52:09,960 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-11-07 06:52:09,960 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-11-07 06:52:09,961 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-11-07 06:52:09,961 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-11-07 06:52:09,961 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-11-07 06:52:09,962 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-11-07 06:52:09,962 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-11-07 06:52:09,962 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-11-07 06:52:09,963 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-11-07 06:52:09,964 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-11-07 06:52:09,964 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-11-07 06:52:09,967 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-11-07 06:52:09,967 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:52:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:52:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:52:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:52:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:52:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-11-07 06:52:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-11-07 06:52:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-11-07 06:52:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-11-07 06:52:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-11-07 06:52:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:52:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-11-07 06:52:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-11-07 06:52:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-11-07 06:52:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-11-07 06:52:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-11-07 06:52:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-11-07 06:52:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-11-07 06:52:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-11-07 06:52:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-11-07 06:52:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-11-07 06:52:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-11-07 06:52:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-11-07 06:52:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-11-07 06:52:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-11-07 06:52:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-11-07 06:52:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:52:09,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:52:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:52:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:52:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:52:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:52:09,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:52:10,901 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:52:10,901 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-11-07 06:52:10,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:52:10 BoogieIcfgContainer [2020-11-07 06:52:10,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:52:10,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:52:10,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:52:10,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:52:10,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:52:09" (1/3) ... [2020-11-07 06:52:10,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39867bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:52:10, skipping insertion in model container [2020-11-07 06:52:10,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:09" (2/3) ... [2020-11-07 06:52:10,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39867bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:52:10, skipping insertion in model container [2020-11-07 06:52:10,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:52:10" (3/3) ... [2020-11-07 06:52:10,913 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-11-07 06:52:10,928 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:52:10,933 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:52:10,945 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:52:10,968 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:52:10,969 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:52:10,969 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:52:10,969 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:52:10,969 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:52:10,969 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:52:10,970 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:52:10,970 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:52:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states. [2020-11-07 06:52:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-11-07 06:52:11,013 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:11,015 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-11-07 06:52:11,015 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:11,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:11,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1129586116, now seen corresponding path program 1 times [2020-11-07 06:52:11,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:11,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1164749601] [2020-11-07 06:52:11,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,465 WARN L194 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-11-07 06:52:11,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:52:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:52:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:52:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:52:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:52:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:52:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:52:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:52:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:52:11,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1164749601] [2020-11-07 06:52:11,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:11,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 06:52:11,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926777898] [2020-11-07 06:52:11,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:52:11,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:11,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:52:11,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:52:11,768 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 8 states. [2020-11-07 06:52:12,253 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-07 06:52:14,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:14,922 INFO L93 Difference]: Finished difference Result 704 states and 942 transitions. [2020-11-07 06:52:14,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:52:14,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 143 [2020-11-07 06:52:14,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:14,946 INFO L225 Difference]: With dead ends: 704 [2020-11-07 06:52:14,946 INFO L226 Difference]: Without dead ends: 439 [2020-11-07 06:52:14,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:52:14,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-11-07 06:52:15,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 282. [2020-11-07 06:52:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-11-07 06:52:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 344 transitions. [2020-11-07 06:52:15,115 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 344 transitions. Word has length 143 [2020-11-07 06:52:15,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:15,116 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 344 transitions. [2020-11-07 06:52:15,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:52:15,117 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 344 transitions. [2020-11-07 06:52:15,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-11-07 06:52:15,121 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:15,121 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-11-07 06:52:15,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:52:15,121 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:15,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:15,122 INFO L82 PathProgramCache]: Analyzing trace with hash -671587876, now seen corresponding path program 1 times [2020-11-07 06:52:15,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:15,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [985312977] [2020-11-07 06:52:15,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:15,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:15,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:52:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:15,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:52:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:15,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:52:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:15,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:52:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:15,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:52:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:15,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:52:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:15,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:15,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:15,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:52:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:15,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:52:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:52:15,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [985312977] [2020-11-07 06:52:15,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:15,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 06:52:15,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027350645] [2020-11-07 06:52:15,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:52:15,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:15,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:52:15,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:52:15,473 INFO L87 Difference]: Start difference. First operand 282 states and 344 transitions. Second operand 8 states. [2020-11-07 06:52:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:17,982 INFO L93 Difference]: Finished difference Result 670 states and 856 transitions. [2020-11-07 06:52:17,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:52:17,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 143 [2020-11-07 06:52:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:17,996 INFO L225 Difference]: With dead ends: 670 [2020-11-07 06:52:17,997 INFO L226 Difference]: Without dead ends: 438 [2020-11-07 06:52:18,007 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-11-07 06:52:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-11-07 06:52:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 281. [2020-11-07 06:52:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2020-11-07 06:52:18,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 342 transitions. [2020-11-07 06:52:18,108 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 342 transitions. Word has length 143 [2020-11-07 06:52:18,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:18,109 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 342 transitions. [2020-11-07 06:52:18,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:52:18,109 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 342 transitions. [2020-11-07 06:52:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-11-07 06:52:18,111 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:18,112 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-11-07 06:52:18,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:52:18,112 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:18,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:18,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1212829316, now seen corresponding path program 1 times [2020-11-07 06:52:18,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:18,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1873741611] [2020-11-07 06:52:18,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:18,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:18,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:52:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:18,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:52:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:18,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:52:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:18,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:52:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:18,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:52:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:18,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:52:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:18,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:18,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:18,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:52:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:18,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:52:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:52:18,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1873741611] [2020-11-07 06:52:18,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:18,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 06:52:18,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518196861] [2020-11-07 06:52:18,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:52:18,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:18,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:52:18,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:52:18,496 INFO L87 Difference]: Start difference. First operand 281 states and 342 transitions. Second operand 7 states. [2020-11-07 06:52:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:21,564 INFO L93 Difference]: Finished difference Result 1007 states and 1307 transitions. [2020-11-07 06:52:21,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 06:52:21,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2020-11-07 06:52:21,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:21,576 INFO L225 Difference]: With dead ends: 1007 [2020-11-07 06:52:21,578 INFO L226 Difference]: Without dead ends: 780 [2020-11-07 06:52:21,580 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-11-07 06:52:21,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2020-11-07 06:52:21,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 528. [2020-11-07 06:52:21,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2020-11-07 06:52:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 650 transitions. [2020-11-07 06:52:21,757 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 650 transitions. Word has length 143 [2020-11-07 06:52:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:21,762 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 650 transitions. [2020-11-07 06:52:21,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:52:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 650 transitions. [2020-11-07 06:52:21,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2020-11-07 06:52:21,769 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:21,770 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-11-07 06:52:21,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:52:21,770 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:21,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:21,771 INFO L82 PathProgramCache]: Analyzing trace with hash 441216868, now seen corresponding path program 1 times [2020-11-07 06:52:21,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:21,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [722003207] [2020-11-07 06:52:21,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:21,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:21,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:52:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:52:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:52:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:52:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:52:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:52:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:52:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:52:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-11-07 06:52:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:52:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:52:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2020-11-07 06:52:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-11-07 06:52:22,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [722003207] [2020-11-07 06:52:22,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:22,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 06:52:22,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568235452] [2020-11-07 06:52:22,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:52:22,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:22,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:52:22,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:52:22,454 INFO L87 Difference]: Start difference. First operand 528 states and 650 transitions. Second operand 10 states. [2020-11-07 06:52:27,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:27,847 INFO L93 Difference]: Finished difference Result 2275 states and 3121 transitions. [2020-11-07 06:52:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 06:52:27,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 222 [2020-11-07 06:52:27,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:27,862 INFO L225 Difference]: With dead ends: 2275 [2020-11-07 06:52:27,863 INFO L226 Difference]: Without dead ends: 1802 [2020-11-07 06:52:27,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=515, Unknown=0, NotChecked=0, Total=756 [2020-11-07 06:52:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-11-07 06:52:28,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1057. [2020-11-07 06:52:28,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2020-11-07 06:52:28,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1351 transitions. [2020-11-07 06:52:28,153 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1351 transitions. Word has length 222 [2020-11-07 06:52:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:28,154 INFO L481 AbstractCegarLoop]: Abstraction has 1057 states and 1351 transitions. [2020-11-07 06:52:28,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:52:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1351 transitions. [2020-11-07 06:52:28,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2020-11-07 06:52:28,159 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:28,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] [2020-11-07 06:52:28,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:52:28,160 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:28,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:28,161 INFO L82 PathProgramCache]: Analyzing trace with hash -775451900, now seen corresponding path program 1 times [2020-11-07 06:52:28,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:28,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [823998615] [2020-11-07 06:52:28,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:52:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:52:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:52:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:52:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:52:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:52:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:52:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:52:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-11-07 06:52:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:52:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:52:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2020-11-07 06:52:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2020-11-07 06:52:28,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [823998615] [2020-11-07 06:52:28,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:28,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 06:52:28,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721199593] [2020-11-07 06:52:28,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:52:28,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:28,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:52:28,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:52:28,524 INFO L87 Difference]: Start difference. First operand 1057 states and 1351 transitions. Second operand 9 states. [2020-11-07 06:52:31,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:31,406 INFO L93 Difference]: Finished difference Result 2590 states and 3407 transitions. [2020-11-07 06:52:31,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 06:52:31,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 222 [2020-11-07 06:52:31,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:31,418 INFO L225 Difference]: With dead ends: 2590 [2020-11-07 06:52:31,418 INFO L226 Difference]: Without dead ends: 1586 [2020-11-07 06:52:31,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2020-11-07 06:52:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2020-11-07 06:52:31,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1049. [2020-11-07 06:52:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2020-11-07 06:52:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1338 transitions. [2020-11-07 06:52:31,758 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1338 transitions. Word has length 222 [2020-11-07 06:52:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:31,758 INFO L481 AbstractCegarLoop]: Abstraction has 1049 states and 1338 transitions. [2020-11-07 06:52:31,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:52:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1338 transitions. [2020-11-07 06:52:31,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-11-07 06:52:31,763 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:31,763 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-11-07 06:52:31,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:52:31,764 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:31,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:31,764 INFO L82 PathProgramCache]: Analyzing trace with hash -485958965, now seen corresponding path program 1 times [2020-11-07 06:52:31,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:31,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [297132050] [2020-11-07 06:52:31,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:52:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:52:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:52:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:52:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:52:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:52:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:32,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:32,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:52:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:32,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:52:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:32,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-11-07 06:52:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:32,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:52:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:32,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:32,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:52:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:32,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:32,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:32,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-11-07 06:52:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-11-07 06:52:32,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [297132050] [2020-11-07 06:52:32,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:32,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 06:52:32,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702108503] [2020-11-07 06:52:32,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:52:32,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:32,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:52:32,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:52:32,241 INFO L87 Difference]: Start difference. First operand 1049 states and 1338 transitions. Second operand 10 states. [2020-11-07 06:52:37,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:37,196 INFO L93 Difference]: Finished difference Result 4554 states and 6617 transitions. [2020-11-07 06:52:37,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 06:52:37,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 227 [2020-11-07 06:52:37,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:37,223 INFO L225 Difference]: With dead ends: 4554 [2020-11-07 06:52:37,223 INFO L226 Difference]: Without dead ends: 3559 [2020-11-07 06:52:37,233 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-11-07 06:52:37,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2020-11-07 06:52:37,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 2134. [2020-11-07 06:52:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2134 states. [2020-11-07 06:52:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 2849 transitions. [2020-11-07 06:52:37,874 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 2849 transitions. Word has length 227 [2020-11-07 06:52:37,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:37,875 INFO L481 AbstractCegarLoop]: Abstraction has 2134 states and 2849 transitions. [2020-11-07 06:52:37,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:52:37,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 2849 transitions. [2020-11-07 06:52:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2020-11-07 06:52:37,885 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:37,886 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-11-07 06:52:37,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:52:37,886 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:37,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:37,886 INFO L82 PathProgramCache]: Analyzing trace with hash -7167836, now seen corresponding path program 1 times [2020-11-07 06:52:37,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:37,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [191869806] [2020-11-07 06:52:37,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:52:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:52:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:52:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:52:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:52:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:52:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:52:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:52:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-11-07 06:52:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:52:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:52:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-11-07 06:52:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 06:52:38,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [191869806] [2020-11-07 06:52:38,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:38,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 06:52:38,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204873797] [2020-11-07 06:52:38,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:52:38,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:38,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:52:38,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:52:38,260 INFO L87 Difference]: Start difference. First operand 2134 states and 2849 transitions. Second operand 11 states. [2020-11-07 06:52:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:48,895 INFO L93 Difference]: Finished difference Result 11370 states and 16175 transitions. [2020-11-07 06:52:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-11-07 06:52:48,896 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2020-11-07 06:52:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:48,955 INFO L225 Difference]: With dead ends: 11370 [2020-11-07 06:52:48,956 INFO L226 Difference]: Without dead ends: 9288 [2020-11-07 06:52:48,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=566, Invalid=2296, Unknown=0, NotChecked=0, Total=2862 [2020-11-07 06:52:48,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9288 states. [2020-11-07 06:52:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9288 to 7079. [2020-11-07 06:52:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7079 states. [2020-11-07 06:52:51,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7079 states to 7079 states and 9448 transitions. [2020-11-07 06:52:51,206 INFO L78 Accepts]: Start accepts. Automaton has 7079 states and 9448 transitions. Word has length 232 [2020-11-07 06:52:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:51,207 INFO L481 AbstractCegarLoop]: Abstraction has 7079 states and 9448 transitions. [2020-11-07 06:52:51,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:52:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand 7079 states and 9448 transitions. [2020-11-07 06:52:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2020-11-07 06:52:51,220 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:51,221 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-11-07 06:52:51,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:52:51,221 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:51,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:51,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1250168170, now seen corresponding path program 1 times [2020-11-07 06:52:51,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:51,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1173477316] [2020-11-07 06:52:51,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:52:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:52:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:52:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:52:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:52:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:52:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:52:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:52:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-11-07 06:52:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:52:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:52:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:52:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-07 06:52:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-11-07 06:52:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:52:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:52:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:52:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-07 06:52:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2020-11-07 06:52:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:51,675 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 37 proven. 22 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-11-07 06:52:51,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1173477316] [2020-11-07 06:52:51,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:52:51,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:52:51,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417614270] [2020-11-07 06:52:51,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:52:51,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:51,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:52:51,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:52:51,678 INFO L87 Difference]: Start difference. First operand 7079 states and 9448 transitions. Second operand 12 states. [2020-11-07 06:52:52,626 WARN L194 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-07 06:52:52,744 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-07 06:52:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:58,134 INFO L93 Difference]: Finished difference Result 16749 states and 23458 transitions. [2020-11-07 06:52:58,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 06:52:58,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 288 [2020-11-07 06:52:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:58,201 INFO L225 Difference]: With dead ends: 16749 [2020-11-07 06:52:58,201 INFO L226 Difference]: Without dead ends: 9723 [2020-11-07 06:52:58,259 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-11-07 06:52:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9723 states. [2020-11-07 06:53:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9723 to 7281. [2020-11-07 06:53:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7281 states. [2020-11-07 06:53:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7281 states to 7281 states and 9629 transitions. [2020-11-07 06:53:00,202 INFO L78 Accepts]: Start accepts. Automaton has 7281 states and 9629 transitions. Word has length 288 [2020-11-07 06:53:00,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:00,203 INFO L481 AbstractCegarLoop]: Abstraction has 7281 states and 9629 transitions. [2020-11-07 06:53:00,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:53:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 7281 states and 9629 transitions. [2020-11-07 06:53:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2020-11-07 06:53:00,213 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:00,214 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-11-07 06:53:00,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:53:00,214 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:00,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:00,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1377316729, now seen corresponding path program 1 times [2020-11-07 06:53:00,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:00,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1624614269] [2020-11-07 06:53:00,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:53:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:53:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:53:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:53:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:53:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:53:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:53:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:53:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:53:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:53:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-11-07 06:53:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:53:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:53:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:53:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:53:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2020-11-07 06:53:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:53:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:53:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 06:53:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:53:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2020-11-07 06:53:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:00,790 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-11-07 06:53:00,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1624614269] [2020-11-07 06:53:00,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:53:00,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 06:53:00,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561880721] [2020-11-07 06:53:00,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:53:00,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:00,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:53:00,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:53:00,798 INFO L87 Difference]: Start difference. First operand 7281 states and 9629 transitions. Second operand 11 states. [2020-11-07 06:53:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:09,153 INFO L93 Difference]: Finished difference Result 21182 states and 29885 transitions. [2020-11-07 06:53:09,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 06:53:09,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 288 [2020-11-07 06:53:09,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:09,229 INFO L225 Difference]: With dead ends: 21182 [2020-11-07 06:53:09,229 INFO L226 Difference]: Without dead ends: 13954 [2020-11-07 06:53:09,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 06:53:09,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13954 states. [2020-11-07 06:53:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13954 to 11031. [2020-11-07 06:53:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11031 states. [2020-11-07 06:53:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11031 states to 11031 states and 14339 transitions. [2020-11-07 06:53:12,242 INFO L78 Accepts]: Start accepts. Automaton has 11031 states and 14339 transitions. Word has length 288 [2020-11-07 06:53:12,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:12,243 INFO L481 AbstractCegarLoop]: Abstraction has 11031 states and 14339 transitions. [2020-11-07 06:53:12,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:53:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 11031 states and 14339 transitions. [2020-11-07 06:53:12,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2020-11-07 06:53:12,255 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:12,256 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-11-07 06:53:12,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 06:53:12,256 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:12,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:12,257 INFO L82 PathProgramCache]: Analyzing trace with hash -52384026, now seen corresponding path program 1 times [2020-11-07 06:53:12,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:12,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [783464067] [2020-11-07 06:53:12,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:53:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:53:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:53:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:53:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:53:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:53:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:53:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:53:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:53:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:53:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-11-07 06:53:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:53:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:53:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:53:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:53:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-11-07 06:53:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:53:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:53:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 06:53:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:53:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2020-11-07 06:53:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2020-11-07 06:53:12,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [783464067] [2020-11-07 06:53:12,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:53:12,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 06:53:12,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441518544] [2020-11-07 06:53:12,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:53:12,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:12,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:53:12,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:53:12,661 INFO L87 Difference]: Start difference. First operand 11031 states and 14339 transitions. Second operand 11 states. [2020-11-07 06:53:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:23,322 INFO L93 Difference]: Finished difference Result 31906 states and 44428 transitions. [2020-11-07 06:53:23,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 06:53:23,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 288 [2020-11-07 06:53:23,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:23,422 INFO L225 Difference]: With dead ends: 31906 [2020-11-07 06:53:23,422 INFO L226 Difference]: Without dead ends: 20928 [2020-11-07 06:53:23,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 06:53:23,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20928 states. [2020-11-07 06:53:28,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20928 to 16117. [2020-11-07 06:53:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16117 states. [2020-11-07 06:53:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16117 states to 16117 states and 20623 transitions. [2020-11-07 06:53:28,265 INFO L78 Accepts]: Start accepts. Automaton has 16117 states and 20623 transitions. Word has length 288 [2020-11-07 06:53:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:28,266 INFO L481 AbstractCegarLoop]: Abstraction has 16117 states and 20623 transitions. [2020-11-07 06:53:28,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:53:28,266 INFO L276 IsEmpty]: Start isEmpty. Operand 16117 states and 20623 transitions. [2020-11-07 06:53:28,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2020-11-07 06:53:28,287 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:28,287 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-07 06:53:28,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 06:53:28,288 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:28,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:28,288 INFO L82 PathProgramCache]: Analyzing trace with hash 254318487, now seen corresponding path program 1 times [2020-11-07 06:53:28,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:28,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1863764434] [2020-11-07 06:53:28,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:53:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:53:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:53:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:53:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:53:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:53:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:53:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:53:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:53:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:53:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-11-07 06:53:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:53:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:53:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:53:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:53:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-11-07 06:53:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2020-11-07 06:53:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2020-11-07 06:53:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:53:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:53:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 06:53:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:53:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2020-11-07 06:53:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2020-11-07 06:53:28,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1863764434] [2020-11-07 06:53:28,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:53:28,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 06:53:28,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851424293] [2020-11-07 06:53:28,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:53:28,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:28,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:53:28,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:53:28,733 INFO L87 Difference]: Start difference. First operand 16117 states and 20623 transitions. Second operand 11 states. [2020-11-07 06:53:43,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:43,341 INFO L93 Difference]: Finished difference Result 32636 states and 42916 transitions. [2020-11-07 06:53:43,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-11-07 06:53:43,342 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 323 [2020-11-07 06:53:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:43,434 INFO L225 Difference]: With dead ends: 32636 [2020-11-07 06:53:43,435 INFO L226 Difference]: Without dead ends: 21861 [2020-11-07 06:53:43,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=808, Invalid=2614, Unknown=0, NotChecked=0, Total=3422 [2020-11-07 06:53:43,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21861 states. [2020-11-07 06:53:48,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21861 to 16761. [2020-11-07 06:53:48,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16761 states. [2020-11-07 06:53:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16761 states to 16761 states and 21063 transitions. [2020-11-07 06:53:48,267 INFO L78 Accepts]: Start accepts. Automaton has 16761 states and 21063 transitions. Word has length 323 [2020-11-07 06:53:48,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:48,268 INFO L481 AbstractCegarLoop]: Abstraction has 16761 states and 21063 transitions. [2020-11-07 06:53:48,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:53:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 16761 states and 21063 transitions. [2020-11-07 06:53:48,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2020-11-07 06:53:48,287 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:48,288 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-11-07 06:53:48,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 06:53:48,288 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:48,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:48,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1518201429, now seen corresponding path program 1 times [2020-11-07 06:53:48,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:48,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [891371244] [2020-11-07 06:53:48,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:53:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:53:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:53:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:53:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:53:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:53:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:53:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:53:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:53:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:53:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-11-07 06:53:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:53:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:53:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:53:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:53:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2020-11-07 06:53:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2020-11-07 06:53:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2020-11-07 06:53:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:53:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:53:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 06:53:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:53:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2020-11-07 06:53:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2020-11-07 06:53:48,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [891371244] [2020-11-07 06:53:48,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:53:48,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:53:48,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566495039] [2020-11-07 06:53:48,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:53:48,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:48,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:53:48,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:53:48,728 INFO L87 Difference]: Start difference. First operand 16761 states and 21063 transitions. Second operand 12 states. [2020-11-07 06:54:03,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:54:03,986 INFO L93 Difference]: Finished difference Result 32104 states and 41167 transitions. [2020-11-07 06:54:03,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2020-11-07 06:54:03,987 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 323 [2020-11-07 06:54:03,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:54:04,079 INFO L225 Difference]: With dead ends: 32104 [2020-11-07 06:54:04,079 INFO L226 Difference]: Without dead ends: 20695 [2020-11-07 06:54:04,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=810, Invalid=3612, Unknown=0, NotChecked=0, Total=4422 [2020-11-07 06:54:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20695 states. [2020-11-07 06:54:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20695 to 17065. [2020-11-07 06:54:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17065 states. [2020-11-07 06:54:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17065 states to 17065 states and 20931 transitions. [2020-11-07 06:54:08,892 INFO L78 Accepts]: Start accepts. Automaton has 17065 states and 20931 transitions. Word has length 323 [2020-11-07 06:54:08,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:54:08,893 INFO L481 AbstractCegarLoop]: Abstraction has 17065 states and 20931 transitions. [2020-11-07 06:54:08,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:54:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 17065 states and 20931 transitions. [2020-11-07 06:54:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2020-11-07 06:54:08,907 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:54:08,908 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-11-07 06:54:08,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 06:54:08,908 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:54:08,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:54:08,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1163647285, now seen corresponding path program 1 times [2020-11-07 06:54:08,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:54:08,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [515130710] [2020-11-07 06:54:08,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:54:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:54:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:54:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:54:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:54:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:54:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:54:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:54:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:54:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:54:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:54:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:54:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-11-07 06:54:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-11-07 06:54:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-11-07 06:54:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:54:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:54:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:54:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:54:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:54:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2020-11-07 06:54:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:54:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:54:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:54:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 06:54:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 06:54:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2020-11-07 06:54:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2020-11-07 06:54:09,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [515130710] [2020-11-07 06:54:09,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:54:09,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 06:54:09,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289945479] [2020-11-07 06:54:09,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:54:09,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:54:09,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:54:09,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:54:09,435 INFO L87 Difference]: Start difference. First operand 17065 states and 20931 transitions. Second operand 13 states. [2020-11-07 06:54:09,835 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2020-11-07 06:54:21,309 WARN L194 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-11-07 06:54:29,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:54:29,798 INFO L93 Difference]: Finished difference Result 52751 states and 68370 transitions. [2020-11-07 06:54:29,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2020-11-07 06:54:29,799 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 330 [2020-11-07 06:54:29,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:54:29,956 INFO L225 Difference]: With dead ends: 52751 [2020-11-07 06:54:29,956 INFO L226 Difference]: Without dead ends: 35738 [2020-11-07 06:54:30,032 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-11-07 06:54:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35738 states. [2020-11-07 06:54:38,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35738 to 27514. [2020-11-07 06:54:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27514 states. [2020-11-07 06:54:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27514 states to 27514 states and 33098 transitions. [2020-11-07 06:54:38,236 INFO L78 Accepts]: Start accepts. Automaton has 27514 states and 33098 transitions. Word has length 330 [2020-11-07 06:54:38,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:54:38,237 INFO L481 AbstractCegarLoop]: Abstraction has 27514 states and 33098 transitions. [2020-11-07 06:54:38,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:54:38,237 INFO L276 IsEmpty]: Start isEmpty. Operand 27514 states and 33098 transitions. [2020-11-07 06:54:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2020-11-07 06:54:38,253 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:54:38,254 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-11-07 06:54:38,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 06:54:38,254 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:54:38,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:54:38,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2104056100, now seen corresponding path program 1 times [2020-11-07 06:54:38,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:54:38,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [695924309] [2020-11-07 06:54:38,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:54:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:54:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:54:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:54:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:54:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:54:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:54:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:54:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:54:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:54:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:54:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:54:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-11-07 06:54:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-11-07 06:54:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-11-07 06:54:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:54:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:54:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:54:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:54:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:54:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2020-11-07 06:54:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:54:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:54:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:54:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 06:54:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:54:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2020-11-07 06:54:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:54:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 53 proven. 12 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2020-11-07 06:54:38,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [695924309] [2020-11-07 06:54:38,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:54:38,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 06:54:38,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165606390] [2020-11-07 06:54:38,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:54:38,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:54:38,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:54:38,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:54:38,887 INFO L87 Difference]: Start difference. First operand 27514 states and 33098 transitions. Second operand 13 states. [2020-11-07 06:54:39,283 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2020-11-07 06:55:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:55:10,511 INFO L93 Difference]: Finished difference Result 92430 states and 118467 transitions. [2020-11-07 06:55:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2020-11-07 06:55:10,512 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 329 [2020-11-07 06:55:10,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:55:11,133 INFO L225 Difference]: With dead ends: 92430 [2020-11-07 06:55:11,133 INFO L226 Difference]: Without dead ends: 64968 [2020-11-07 06:55:11,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1293, Invalid=6189, Unknown=0, NotChecked=0, Total=7482 [2020-11-07 06:55:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64968 states. [2020-11-07 06:55:27,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64968 to 53213. [2020-11-07 06:55:27,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53213 states. [2020-11-07 06:55:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53213 states to 53213 states and 63248 transitions. [2020-11-07 06:55:27,588 INFO L78 Accepts]: Start accepts. Automaton has 53213 states and 63248 transitions. Word has length 329 [2020-11-07 06:55:27,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:55:27,589 INFO L481 AbstractCegarLoop]: Abstraction has 53213 states and 63248 transitions. [2020-11-07 06:55:27,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:55:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 53213 states and 63248 transitions. [2020-11-07 06:55:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2020-11-07 06:55:27,601 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:55:27,601 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-11-07 06:55:27,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 06:55:27,602 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:55:27,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:55:27,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1688027972, now seen corresponding path program 1 times [2020-11-07 06:55:27,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:55:27,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1596040130] [2020-11-07 06:55:27,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:55:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:55:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:55:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:55:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:55:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:55:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:55:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:55:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:55:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:55:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:55:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:55:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2020-11-07 06:55:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-11-07 06:55:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2020-11-07 06:55:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:55:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:55:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:55:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:55:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:55:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2020-11-07 06:55:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:55:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:55:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:55:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 06:55:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:55:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:27,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2020-11-07 06:55:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:55:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 53 proven. 11 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2020-11-07 06:55:28,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1596040130] [2020-11-07 06:55:28,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:55:28,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:55:28,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357441716] [2020-11-07 06:55:28,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:55:28,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:55:28,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:55:28,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:55:28,324 INFO L87 Difference]: Start difference. First operand 53213 states and 63248 transitions. Second operand 12 states. [2020-11-07 06:55:29,379 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-07 06:55:29,729 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-07 06:55:53,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:55:53,231 INFO L93 Difference]: Finished difference Result 114781 states and 139706 transitions. [2020-11-07 06:55:53,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 06:55:53,232 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 329 [2020-11-07 06:55:53,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:55:53,522 INFO L225 Difference]: With dead ends: 114781 [2020-11-07 06:55:53,523 INFO L226 Difference]: Without dead ends: 61621 [2020-11-07 06:55:54,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2020-11-07 06:55:54,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61621 states. [2020-11-07 06:56:09,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61621 to 51813. [2020-11-07 06:56:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51813 states. [2020-11-07 06:56:09,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51813 states to 51813 states and 60528 transitions. [2020-11-07 06:56:09,673 INFO L78 Accepts]: Start accepts. Automaton has 51813 states and 60528 transitions. Word has length 329 [2020-11-07 06:56:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:56:09,673 INFO L481 AbstractCegarLoop]: Abstraction has 51813 states and 60528 transitions. [2020-11-07 06:56:09,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:56:09,680 INFO L276 IsEmpty]: Start isEmpty. Operand 51813 states and 60528 transitions. [2020-11-07 06:56:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2020-11-07 06:56:09,886 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:56:09,887 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-11-07 06:56:09,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 06:56:09,887 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:56:09,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:56:09,888 INFO L82 PathProgramCache]: Analyzing trace with hash -909172723, now seen corresponding path program 1 times [2020-11-07 06:56:09,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:56:09,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [393406833] [2020-11-07 06:56:09,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:56:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:56:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:56:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:56:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:56:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:56:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:56:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:56:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:56:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:56:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:56:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:56:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-11-07 06:56:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-11-07 06:56:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-11-07 06:56:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 06:56:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:56:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:56:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:56:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:56:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:56:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2020-11-07 06:56:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:56:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:56:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:56:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:56:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-07 06:56:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2020-11-07 06:56:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:56:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:56:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:56:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 06:56:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:56:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2020-11-07 06:56:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:56:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 81 proven. 16 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2020-11-07 06:56:10,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [393406833] [2020-11-07 06:56:10,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:56:10,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 06:56:10,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469345373] [2020-11-07 06:56:10,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 06:56:10,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:56:10,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 06:56:10,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:56:10,665 INFO L87 Difference]: Start difference. First operand 51813 states and 60528 transitions. Second operand 15 states. [2020-11-07 06:56:46,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:56:46,458 INFO L93 Difference]: Finished difference Result 113457 states and 136299 transitions. [2020-11-07 06:56:46,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2020-11-07 06:56:46,458 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 396 [2020-11-07 06:56:46,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:56:46,772 INFO L225 Difference]: With dead ends: 113457 [2020-11-07 06:56:46,772 INFO L226 Difference]: Without dead ends: 66277 [2020-11-07 06:56:47,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2386 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1580, Invalid=5560, Unknown=0, NotChecked=0, Total=7140 [2020-11-07 06:56:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66277 states. [2020-11-07 06:57:03,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66277 to 53358. [2020-11-07 06:57:03,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53358 states. [2020-11-07 06:57:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53358 states to 53358 states and 61740 transitions. [2020-11-07 06:57:03,549 INFO L78 Accepts]: Start accepts. Automaton has 53358 states and 61740 transitions. Word has length 396 [2020-11-07 06:57:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:57:03,550 INFO L481 AbstractCegarLoop]: Abstraction has 53358 states and 61740 transitions. [2020-11-07 06:57:03,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 06:57:03,550 INFO L276 IsEmpty]: Start isEmpty. Operand 53358 states and 61740 transitions. [2020-11-07 06:57:03,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2020-11-07 06:57:03,573 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:57:03,574 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 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, 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, 1, 1] [2020-11-07 06:57:03,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 06:57:03,574 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:57:03,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:57:03,575 INFO L82 PathProgramCache]: Analyzing trace with hash -911204863, now seen corresponding path program 1 times [2020-11-07 06:57:03,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:57:03,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [297510886] [2020-11-07 06:57:03,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:57:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:03,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:57:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:03,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:57:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:03,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:57:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:03,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:57:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:03,968 WARN L194 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-11-07 06:57:03,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:57:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:03,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:57:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:03,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:57:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:03,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:57:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:03,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:57:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:03,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:57:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-07 06:57:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:57:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-07 06:57:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-07 06:57:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 06:57:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2020-11-07 06:57:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 06:57:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-11-07 06:57:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:57:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:57:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-07 06:57:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-11-07 06:57:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2020-11-07 06:57:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2020-11-07 06:57:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:57:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2020-11-07 06:57:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2020-11-07 06:57:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:57:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:57:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:57:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:57:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:57:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2020-11-07 06:57:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:57:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:57:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:57:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:57:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:57:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 426 [2020-11-07 06:57:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:57:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:57:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:57:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 06:57:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:57:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 484 [2020-11-07 06:57:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 67 proven. 12 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2020-11-07 06:57:04,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [297510886] [2020-11-07 06:57:04,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:57:04,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 06:57:04,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210019854] [2020-11-07 06:57:04,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 06:57:04,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:57:04,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 06:57:04,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:57:04,668 INFO L87 Difference]: Start difference. First operand 53358 states and 61740 transitions. Second operand 15 states. [2020-11-07 06:57:13,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:57:13,964 INFO L93 Difference]: Finished difference Result 64413 states and 74622 transitions. [2020-11-07 06:57:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-11-07 06:57:13,970 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 512 [2020-11-07 06:57:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:57:14,013 INFO L225 Difference]: With dead ends: 64413 [2020-11-07 06:57:14,013 INFO L226 Difference]: Without dead ends: 11109 [2020-11-07 06:57:14,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=754, Invalid=2326, Unknown=0, NotChecked=0, Total=3080 [2020-11-07 06:57:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11109 states. [2020-11-07 06:57:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11109 to 9241. [2020-11-07 06:57:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9241 states. [2020-11-07 06:57:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9241 states to 9241 states and 10366 transitions. [2020-11-07 06:57:16,924 INFO L78 Accepts]: Start accepts. Automaton has 9241 states and 10366 transitions. Word has length 512 [2020-11-07 06:57:16,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:57:16,925 INFO L481 AbstractCegarLoop]: Abstraction has 9241 states and 10366 transitions. [2020-11-07 06:57:16,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 06:57:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 9241 states and 10366 transitions. [2020-11-07 06:57:16,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2020-11-07 06:57:16,928 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:57:16,928 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-11-07 06:57:16,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 06:57:16,928 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:57:16,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:57:16,929 INFO L82 PathProgramCache]: Analyzing trace with hash -103460588, now seen corresponding path program 1 times [2020-11-07 06:57:16,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:57:16,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1613103833] [2020-11-07 06:57:16,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:57:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:57:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:57:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:57:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:57:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:57:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:57:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:57:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:57:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:57:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:57:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:57:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-11-07 06:57:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-11-07 06:57:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-11-07 06:57:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 06:57:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:57:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:57:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:57:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:57:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:57:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2020-11-07 06:57:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:57:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:57:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:57:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:57:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:57:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2020-11-07 06:57:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:57:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:57:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:57:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 06:57:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:57:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2020-11-07 06:57:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 55 proven. 1 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2020-11-07 06:57:17,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1613103833] [2020-11-07 06:57:17,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:57:17,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 06:57:17,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239287765] [2020-11-07 06:57:17,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 06:57:17,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:57:17,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 06:57:17,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:57:17,617 INFO L87 Difference]: Start difference. First operand 9241 states and 10366 transitions. Second operand 14 states. [2020-11-07 06:57:39,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:57:39,525 INFO L93 Difference]: Finished difference Result 41446 states and 47705 transitions. [2020-11-07 06:57:39,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2020-11-07 06:57:39,526 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 397 [2020-11-07 06:57:39,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:57:39,621 INFO L225 Difference]: With dead ends: 41446 [2020-11-07 06:57:39,621 INFO L226 Difference]: Without dead ends: 32949 [2020-11-07 06:57:39,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2130 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=987, Invalid=5333, Unknown=0, NotChecked=0, Total=6320 [2020-11-07 06:57:39,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32949 states. [2020-11-07 06:57:47,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32949 to 26308. [2020-11-07 06:57:47,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26308 states. [2020-11-07 06:57:47,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26308 states to 26308 states and 29968 transitions. [2020-11-07 06:57:47,839 INFO L78 Accepts]: Start accepts. Automaton has 26308 states and 29968 transitions. Word has length 397 [2020-11-07 06:57:47,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:57:47,840 INFO L481 AbstractCegarLoop]: Abstraction has 26308 states and 29968 transitions. [2020-11-07 06:57:47,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 06:57:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 26308 states and 29968 transitions. [2020-11-07 06:57:47,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2020-11-07 06:57:47,843 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:57:47,844 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-11-07 06:57:47,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 06:57:47,844 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:57:47,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:57:47,844 INFO L82 PathProgramCache]: Analyzing trace with hash -656205460, now seen corresponding path program 1 times [2020-11-07 06:57:47,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:57:47,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [20063378] [2020-11-07 06:57:47,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:57:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:47,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:57:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:57:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:57:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-07 06:57:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-07 06:57:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-11-07 06:57:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:57:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:57:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:57:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-11-07 06:57:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:57:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-11-07 06:57:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-11-07 06:57:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-11-07 06:57:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-11-07 06:57:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:57:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:57:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:57:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:57:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:57:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2020-11-07 06:57:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:57:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:57:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:57:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:57:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 06:57:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2020-11-07 06:57:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:57:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:57:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:57:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 06:57:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 06:57:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2020-11-07 06:57:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:57:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2020-11-07 06:57:48,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [20063378] [2020-11-07 06:57:48,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:57:48,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:57:48,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349584316] [2020-11-07 06:57:48,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:57:48,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:57:48,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:57:48,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:57:48,342 INFO L87 Difference]: Start difference. First operand 26308 states and 29968 transitions. Second operand 10 states. [2020-11-07 06:58:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:58:01,690 INFO L93 Difference]: Finished difference Result 55866 states and 64476 transitions. [2020-11-07 06:58:01,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 06:58:01,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 401 [2020-11-07 06:58:01,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:58:01,802 INFO L225 Difference]: With dead ends: 55866 [2020-11-07 06:58:01,802 INFO L226 Difference]: Without dead ends: 30332 [2020-11-07 06:58:01,873 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2020-11-07 06:58:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30332 states. [2020-11-07 06:58:10,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30332 to 26341. [2020-11-07 06:58:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26341 states. [2020-11-07 06:58:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26341 states to 26341 states and 30033 transitions. [2020-11-07 06:58:10,158 INFO L78 Accepts]: Start accepts. Automaton has 26341 states and 30033 transitions. Word has length 401 [2020-11-07 06:58:10,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:58:10,158 INFO L481 AbstractCegarLoop]: Abstraction has 26341 states and 30033 transitions. [2020-11-07 06:58:10,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:58:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 26341 states and 30033 transitions. [2020-11-07 06:58:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2020-11-07 06:58:10,162 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:58:10,162 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-11-07 06:58:10,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 06:58:10,162 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:58:10,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:58:10,163 INFO L82 PathProgramCache]: Analyzing trace with hash 582467571, now seen corresponding path program 1 times [2020-11-07 06:58:10,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:58:10,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1642889198] [2020-11-07 06:58:10,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:58:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 06:58:10,190 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 06:58:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 06:58:10,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 06:58:10,471 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 06:58:10,471 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 06:58:10,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 06:58:10,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:58:10 BoogieIcfgContainer [2020-11-07 06:58:10,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:58:10,807 INFO L168 Benchmark]: Toolchain (without parser) took 361474.87 ms. Allocated memory was 162.5 MB in the beginning and 7.2 GB in the end (delta: 7.0 GB). Free memory was 139.3 MB in the beginning and 3.9 GB in the end (delta: -3.7 GB). Peak memory consumption was 3.3 GB. Max. memory is 8.0 GB. [2020-11-07 06:58:10,808 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 125.8 MB. Free memory is still 108.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:58:10,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.54 ms. Allocated memory is still 162.5 MB. Free memory was 138.7 MB in the beginning and 124.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 06:58:10,812 INFO L168 Benchmark]: Boogie Preprocessor took 115.62 ms. Allocated memory is still 162.5 MB. Free memory was 124.7 MB in the beginning and 122.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 06:58:10,812 INFO L168 Benchmark]: RCFGBuilder took 1043.09 ms. Allocated memory is still 162.5 MB. Free memory was 122.4 MB in the beginning and 143.8 MB in the end (delta: -21.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:58:10,813 INFO L168 Benchmark]: TraceAbstraction took 359895.23 ms. Allocated memory was 162.5 MB in the beginning and 7.2 GB in the end (delta: 7.0 GB). Free memory was 143.3 MB in the beginning and 3.9 GB in the end (delta: -3.7 GB). Peak memory consumption was 3.3 GB. Max. memory is 8.0 GB. [2020-11-07 06:58:10,821 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.19 ms. Allocated memory is still 125.8 MB. Free memory is still 108.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 403.54 ms. Allocated memory is still 162.5 MB. Free memory was 138.7 MB in the beginning and 124.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 115.62 ms. Allocated memory is still 162.5 MB. Free memory was 124.7 MB in the beginning and 122.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1043.09 ms. Allocated memory is still 162.5 MB. Free memory was 122.4 MB in the beginning and 143.8 MB in the end (delta: -21.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 359895.23 ms. Allocated memory was 162.5 MB in the beginning and 7.2 GB in the end (delta: 7.0 GB). Free memory was 143.3 MB in the beginning and 3.9 GB in the end (delta: -3.7 GB). Peak memory consumption was 3.3 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: 359.5s, OverallIterations: 20, TraceHistogramMax: 6, AutomataDifference: 249.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7448 SDtfs, 54389 SDslu, 3253 SDs, 0 SdLazy, 48117 SolverSat, 15358 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 60.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2078 GetRequests, 1254 SyntacticMatches, 3 SemanticMatches, 821 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15469 ImplicationChecksByTransitivity, 34.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53358occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 98.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 79594 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 5938 NumberOfCodeBlocks, 5938 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5517 ConstructedInterpolants, 0 QuantifiedInterpolants, 3893704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 3091/3173 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...