/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 17:04:12,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 17:04:12,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 17:04:12,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 17:04:12,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 17:04:12,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 17:04:12,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 17:04:12,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 17:04:12,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 17:04:12,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 17:04:12,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 17:04:12,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 17:04:12,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 17:04:12,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 17:04:12,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 17:04:12,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 17:04:12,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 17:04:12,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 17:04:12,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 17:04:12,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 17:04:12,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 17:04:12,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 17:04:12,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 17:04:12,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 17:04:12,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 17:04:12,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 17:04:12,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 17:04:12,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 17:04:12,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 17:04:12,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 17:04:12,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 17:04:12,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 17:04:12,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 17:04:12,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 17:04:12,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 17:04:12,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 17:04:12,796 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 17:04:12,796 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 17:04:12,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 17:04:12,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 17:04:12,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 17:04:12,802 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-22 17:04:12,853 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 17:04:12,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 17:04:12,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 17:04:12,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 17:04:12,857 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 17:04:12,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 17:04:12,858 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 17:04:12,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 17:04:12,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 17:04:12,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 17:04:12,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 17:04:12,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 17:04:12,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 17:04:12,861 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 17:04:12,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 17:04:12,862 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 17:04:12,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 17:04:12,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 17:04:12,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 17:04:12,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 17:04:12,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 17:04:12,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 17:04:12,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 17:04:12,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 17:04:12,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 17:04:12,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 17:04:12,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 17:04:12,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 17:04:12,868 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 17:04:12,868 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-08-22 17:04:13,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 17:04:13,238 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 17:04:13,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 17:04:13,245 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 17:04:13,245 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 17:04:13,247 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-08-22 17:04:13,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65638f7ed/8342f4be865740c39312bb012b3083df/FLAG755ca35d1 [2020-08-22 17:04:13,884 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 17:04:13,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-08-22 17:04:13,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65638f7ed/8342f4be865740c39312bb012b3083df/FLAG755ca35d1 [2020-08-22 17:04:14,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65638f7ed/8342f4be865740c39312bb012b3083df [2020-08-22 17:04:14,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 17:04:14,236 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 17:04:14,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 17:04:14,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 17:04:14,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 17:04:14,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 05:04:14" (1/1) ... [2020-08-22 17:04:14,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59eb4cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14, skipping insertion in model container [2020-08-22 17:04:14,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 05:04:14" (1/1) ... [2020-08-22 17:04:14,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 17:04:14,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 17:04:14,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 17:04:14,599 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 17:04:14,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 17:04:14,771 INFO L208 MainTranslator]: Completed translation [2020-08-22 17:04:14,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14 WrapperNode [2020-08-22 17:04:14,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 17:04:14,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 17:04:14,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 17:04:14,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 17:04:14,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (1/1) ... [2020-08-22 17:04:14,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (1/1) ... [2020-08-22 17:04:14,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (1/1) ... [2020-08-22 17:04:14,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (1/1) ... [2020-08-22 17:04:14,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (1/1) ... [2020-08-22 17:04:14,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (1/1) ... [2020-08-22 17:04:14,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (1/1) ... [2020-08-22 17:04:14,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 17:04:14,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 17:04:14,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 17:04:14,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 17:04:14,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (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-08-22 17:04:14,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 17:04:14,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 17:04:14,918 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-08-22 17:04:14,918 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-08-22 17:04:14,918 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-08-22 17:04:14,918 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-08-22 17:04:14,918 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-08-22 17:04:14,918 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-08-22 17:04:14,919 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-08-22 17:04:14,919 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-08-22 17:04:14,919 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-08-22 17:04:14,919 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-08-22 17:04:14,920 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-08-22 17:04:14,920 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-08-22 17:04:14,920 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-08-22 17:04:14,928 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-08-22 17:04:14,928 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-08-22 17:04:14,929 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-08-22 17:04:14,929 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-08-22 17:04:14,929 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-08-22 17:04:14,929 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-08-22 17:04:14,929 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-08-22 17:04:14,929 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 17:04:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 17:04:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-08-22 17:04:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-08-22 17:04:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-08-22 17:04:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-08-22 17:04:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-08-22 17:04:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 17:04:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-08-22 17:04:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-08-22 17:04:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-08-22 17:04:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-08-22 17:04:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-08-22 17:04:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-08-22 17:04:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-08-22 17:04:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-08-22 17:04:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-08-22 17:04:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-08-22 17:04:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-08-22 17:04:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-08-22 17:04:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-08-22 17:04:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-08-22 17:04:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-08-22 17:04:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 17:04:14,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 17:04:14,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 17:04:15,620 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 17:04:15,620 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-08-22 17:04:15,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 05:04:15 BoogieIcfgContainer [2020-08-22 17:04:15,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 17:04:15,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 17:04:15,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 17:04:15,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 17:04:15,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 05:04:14" (1/3) ... [2020-08-22 17:04:15,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6f2fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 05:04:15, skipping insertion in model container [2020-08-22 17:04:15,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:14" (2/3) ... [2020-08-22 17:04:15,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6f2fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 05:04:15, skipping insertion in model container [2020-08-22 17:04:15,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 05:04:15" (3/3) ... [2020-08-22 17:04:15,639 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-08-22 17:04:15,653 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-08-22 17:04:15,664 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 17:04:15,682 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 17:04:15,715 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 17:04:15,716 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 17:04:15,716 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-08-22 17:04:15,716 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 17:04:15,716 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 17:04:15,716 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 17:04:15,717 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 17:04:15,717 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 17:04:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2020-08-22 17:04:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-08-22 17:04:15,766 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:15,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:04:15,767 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:15,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:15,774 INFO L82 PathProgramCache]: Analyzing trace with hash -67309704, now seen corresponding path program 1 times [2020-08-22 17:04:15,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:15,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863916473] [2020-08-22 17:04:15,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:16,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:16,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:16,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:16,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:16,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:04:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:16,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:04:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:16,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:16,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:16,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:16,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:04:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:16,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:04:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:16,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:04:16,572 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863916473] [2020-08-22 17:04:16,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:16,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-22 17:04:16,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552000261] [2020-08-22 17:04:16,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 17:04:16,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:16,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 17:04:16,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-08-22 17:04:16,606 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 14 states. [2020-08-22 17:04:19,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:19,777 INFO L93 Difference]: Finished difference Result 449 states and 710 transitions. [2020-08-22 17:04:19,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 17:04:19,780 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 92 [2020-08-22 17:04:19,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:19,802 INFO L225 Difference]: With dead ends: 449 [2020-08-22 17:04:19,803 INFO L226 Difference]: Without dead ends: 276 [2020-08-22 17:04:19,810 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2020-08-22 17:04:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-08-22 17:04:19,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 177. [2020-08-22 17:04:19,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-08-22 17:04:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 237 transitions. [2020-08-22 17:04:19,919 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 237 transitions. Word has length 92 [2020-08-22 17:04:19,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:19,920 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 237 transitions. [2020-08-22 17:04:19,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 17:04:19,920 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 237 transitions. [2020-08-22 17:04:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-08-22 17:04:19,926 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:19,926 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:04:19,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 17:04:19,927 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:19,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:19,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2098275908, now seen corresponding path program 1 times [2020-08-22 17:04:19,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:19,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798926294] [2020-08-22 17:04:19,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:20,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:20,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:20,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:20,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:20,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:04:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:20,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:04:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:20,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:20,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:20,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:20,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:04:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:20,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:04:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:04:20,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798926294] [2020-08-22 17:04:20,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:20,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 17:04:20,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188370056] [2020-08-22 17:04:20,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 17:04:20,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:20,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 17:04:20,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:04:20,207 INFO L87 Difference]: Start difference. First operand 177 states and 237 transitions. Second operand 10 states. [2020-08-22 17:04:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:21,938 INFO L93 Difference]: Finished difference Result 425 states and 610 transitions. [2020-08-22 17:04:21,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 17:04:21,939 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-08-22 17:04:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:21,944 INFO L225 Difference]: With dead ends: 425 [2020-08-22 17:04:21,945 INFO L226 Difference]: Without dead ends: 268 [2020-08-22 17:04:21,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-08-22 17:04:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-08-22 17:04:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 177. [2020-08-22 17:04:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-08-22 17:04:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2020-08-22 17:04:21,991 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 92 [2020-08-22 17:04:21,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:21,991 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2020-08-22 17:04:21,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 17:04:21,992 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2020-08-22 17:04:21,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-08-22 17:04:21,996 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:21,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:04:21,996 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 17:04:21,997 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:21,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:21,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1653808840, now seen corresponding path program 1 times [2020-08-22 17:04:21,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:21,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854605665] [2020-08-22 17:04:21,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:22,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:22,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:22,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:22,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:22,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:04:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:22,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:04:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:22,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:22,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:22,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:22,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:04:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:22,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:04:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:04:22,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854605665] [2020-08-22 17:04:22,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:22,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 17:04:22,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505000362] [2020-08-22 17:04:22,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 17:04:22,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:22,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 17:04:22,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:04:22,248 INFO L87 Difference]: Start difference. First operand 177 states and 234 transitions. Second operand 10 states. [2020-08-22 17:04:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:24,503 INFO L93 Difference]: Finished difference Result 504 states and 747 transitions. [2020-08-22 17:04:24,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-22 17:04:24,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-08-22 17:04:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:24,509 INFO L225 Difference]: With dead ends: 504 [2020-08-22 17:04:24,509 INFO L226 Difference]: Without dead ends: 347 [2020-08-22 17:04:24,511 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-08-22 17:04:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-08-22 17:04:24,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 213. [2020-08-22 17:04:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-08-22 17:04:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 274 transitions. [2020-08-22 17:04:24,554 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 274 transitions. Word has length 92 [2020-08-22 17:04:24,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:24,554 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 274 transitions. [2020-08-22 17:04:24,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 17:04:24,555 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 274 transitions. [2020-08-22 17:04:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-08-22 17:04:24,557 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:24,557 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:04:24,557 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 17:04:24,558 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:24,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:24,558 INFO L82 PathProgramCache]: Analyzing trace with hash -550041895, now seen corresponding path program 1 times [2020-08-22 17:04:24,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:24,559 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218141450] [2020-08-22 17:04:24,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:04:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:04:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:04:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:04:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:04:24,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218141450] [2020-08-22 17:04:24,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:24,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 17:04:24,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444978281] [2020-08-22 17:04:24,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 17:04:24,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:24,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 17:04:24,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:04:24,846 INFO L87 Difference]: Start difference. First operand 213 states and 274 transitions. Second operand 10 states. [2020-08-22 17:04:26,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:26,867 INFO L93 Difference]: Finished difference Result 586 states and 840 transitions. [2020-08-22 17:04:26,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 17:04:26,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-08-22 17:04:26,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:26,879 INFO L225 Difference]: With dead ends: 586 [2020-08-22 17:04:26,880 INFO L226 Difference]: Without dead ends: 393 [2020-08-22 17:04:26,882 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2020-08-22 17:04:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-08-22 17:04:26,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 249. [2020-08-22 17:04:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2020-08-22 17:04:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 312 transitions. [2020-08-22 17:04:26,967 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 312 transitions. Word has length 92 [2020-08-22 17:04:26,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:26,968 INFO L479 AbstractCegarLoop]: Abstraction has 249 states and 312 transitions. [2020-08-22 17:04:26,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 17:04:26,968 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 312 transitions. [2020-08-22 17:04:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-08-22 17:04:26,982 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:26,983 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:04:26,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 17:04:26,983 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:26,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:26,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1219969707, now seen corresponding path program 1 times [2020-08-22 17:04:26,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:26,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111263490] [2020-08-22 17:04:26,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:04:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:04:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:04:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:04:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:04:27,263 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111263490] [2020-08-22 17:04:27,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:27,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 17:04:27,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390663413] [2020-08-22 17:04:27,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 17:04:27,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:27,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 17:04:27,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:04:27,267 INFO L87 Difference]: Start difference. First operand 249 states and 312 transitions. Second operand 10 states. [2020-08-22 17:04:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:29,337 INFO L93 Difference]: Finished difference Result 663 states and 922 transitions. [2020-08-22 17:04:29,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-22 17:04:29,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-08-22 17:04:29,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:29,343 INFO L225 Difference]: With dead ends: 663 [2020-08-22 17:04:29,343 INFO L226 Difference]: Without dead ends: 434 [2020-08-22 17:04:29,345 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-08-22 17:04:29,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-08-22 17:04:29,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 282. [2020-08-22 17:04:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-08-22 17:04:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 345 transitions. [2020-08-22 17:04:29,404 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 345 transitions. Word has length 92 [2020-08-22 17:04:29,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:29,405 INFO L479 AbstractCegarLoop]: Abstraction has 282 states and 345 transitions. [2020-08-22 17:04:29,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 17:04:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 345 transitions. [2020-08-22 17:04:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-08-22 17:04:29,407 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:29,407 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:04:29,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 17:04:29,408 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:29,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:29,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1929357560, now seen corresponding path program 1 times [2020-08-22 17:04:29,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:29,409 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835242800] [2020-08-22 17:04:29,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:29,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:29,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:29,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:29,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:29,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:04:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:29,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:04:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:29,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:29,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:29,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:29,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:04:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:29,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:04:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:04:29,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835242800] [2020-08-22 17:04:29,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:29,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 17:04:29,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862026270] [2020-08-22 17:04:29,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 17:04:29,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:29,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 17:04:29,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:04:29,665 INFO L87 Difference]: Start difference. First operand 282 states and 345 transitions. Second operand 10 states. [2020-08-22 17:04:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:31,593 INFO L93 Difference]: Finished difference Result 674 states and 877 transitions. [2020-08-22 17:04:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-22 17:04:31,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-08-22 17:04:31,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:31,598 INFO L225 Difference]: With dead ends: 674 [2020-08-22 17:04:31,598 INFO L226 Difference]: Without dead ends: 413 [2020-08-22 17:04:31,600 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-08-22 17:04:31,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-08-22 17:04:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 287. [2020-08-22 17:04:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2020-08-22 17:04:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 347 transitions. [2020-08-22 17:04:31,636 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 347 transitions. Word has length 92 [2020-08-22 17:04:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:31,637 INFO L479 AbstractCegarLoop]: Abstraction has 287 states and 347 transitions. [2020-08-22 17:04:31,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 17:04:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 347 transitions. [2020-08-22 17:04:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-08-22 17:04:31,639 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:31,639 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:04:31,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 17:04:31,640 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:31,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1031964282, now seen corresponding path program 1 times [2020-08-22 17:04:31,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:31,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735096620] [2020-08-22 17:04:31,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:31,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:31,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:31,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:31,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:31,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:04:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:31,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:04:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:31,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:31,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:31,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:31,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:04:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:31,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:04:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:04:31,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735096620] [2020-08-22 17:04:31,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:31,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 17:04:31,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106635710] [2020-08-22 17:04:31,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 17:04:31,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:31,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 17:04:31,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:04:31,881 INFO L87 Difference]: Start difference. First operand 287 states and 347 transitions. Second operand 10 states. [2020-08-22 17:04:34,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:34,693 INFO L93 Difference]: Finished difference Result 1068 states and 1350 transitions. [2020-08-22 17:04:34,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-22 17:04:34,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-08-22 17:04:34,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:34,704 INFO L225 Difference]: With dead ends: 1068 [2020-08-22 17:04:34,704 INFO L226 Difference]: Without dead ends: 801 [2020-08-22 17:04:34,709 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-08-22 17:04:34,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2020-08-22 17:04:34,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 591. [2020-08-22 17:04:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-08-22 17:04:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 707 transitions. [2020-08-22 17:04:34,840 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 707 transitions. Word has length 92 [2020-08-22 17:04:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:34,843 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 707 transitions. [2020-08-22 17:04:34,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 17:04:34,843 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 707 transitions. [2020-08-22 17:04:34,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-08-22 17:04:34,845 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:34,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:04:34,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 17:04:34,847 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:34,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:34,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1054596536, now seen corresponding path program 1 times [2020-08-22 17:04:34,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:34,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656569003] [2020-08-22 17:04:34,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:34,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:34,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:34,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:34,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:35,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:04:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:35,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:04:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:35,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:35,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:35,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:35,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:04:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:35,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:04:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:04:35,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656569003] [2020-08-22 17:04:35,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:35,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 17:04:35,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657722608] [2020-08-22 17:04:35,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 17:04:35,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:35,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 17:04:35,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 17:04:35,060 INFO L87 Difference]: Start difference. First operand 591 states and 707 transitions. Second operand 7 states. [2020-08-22 17:04:37,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:37,300 INFO L93 Difference]: Finished difference Result 2051 states and 2640 transitions. [2020-08-22 17:04:37,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 17:04:37,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2020-08-22 17:04:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:37,316 INFO L225 Difference]: With dead ends: 2051 [2020-08-22 17:04:37,317 INFO L226 Difference]: Without dead ends: 1481 [2020-08-22 17:04:37,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-08-22 17:04:37,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2020-08-22 17:04:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1207. [2020-08-22 17:04:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2020-08-22 17:04:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1495 transitions. [2020-08-22 17:04:37,453 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1495 transitions. Word has length 92 [2020-08-22 17:04:37,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:37,454 INFO L479 AbstractCegarLoop]: Abstraction has 1207 states and 1495 transitions. [2020-08-22 17:04:37,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 17:04:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1495 transitions. [2020-08-22 17:04:37,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-08-22 17:04:37,457 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:37,458 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:04:37,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 17:04:37,459 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:37,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:37,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1357284192, now seen corresponding path program 1 times [2020-08-22 17:04:37,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:37,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484981678] [2020-08-22 17:04:37,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:04:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:04:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:04:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:04:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-08-22 17:04:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:04:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2020-08-22 17:04:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-08-22 17:04:37,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484981678] [2020-08-22 17:04:37,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:37,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 17:04:37,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084061675] [2020-08-22 17:04:37,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 17:04:37,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:37,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 17:04:37,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-08-22 17:04:37,738 INFO L87 Difference]: Start difference. First operand 1207 states and 1495 transitions. Second operand 9 states. [2020-08-22 17:04:40,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:40,660 INFO L93 Difference]: Finished difference Result 3860 states and 4987 transitions. [2020-08-22 17:04:40,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 17:04:40,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2020-08-22 17:04:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:40,686 INFO L225 Difference]: With dead ends: 3860 [2020-08-22 17:04:40,686 INFO L226 Difference]: Without dead ends: 2675 [2020-08-22 17:04:40,693 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:04:40,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2675 states. [2020-08-22 17:04:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2675 to 2303. [2020-08-22 17:04:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2303 states. [2020-08-22 17:04:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 2940 transitions. [2020-08-22 17:04:41,016 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 2940 transitions. Word has length 147 [2020-08-22 17:04:41,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:41,018 INFO L479 AbstractCegarLoop]: Abstraction has 2303 states and 2940 transitions. [2020-08-22 17:04:41,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 17:04:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2940 transitions. [2020-08-22 17:04:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-08-22 17:04:41,026 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:41,026 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:04:41,027 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 17:04:41,027 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:41,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:41,027 INFO L82 PathProgramCache]: Analyzing trace with hash 674078602, now seen corresponding path program 1 times [2020-08-22 17:04:41,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:41,028 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306454182] [2020-08-22 17:04:41,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:04:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:04:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:04:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:04:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-08-22 17:04:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:04:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2020-08-22 17:04:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:04:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-08-22 17:04:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-08-22 17:04:41,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306454182] [2020-08-22 17:04:41,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:41,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 17:04:41,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070765411] [2020-08-22 17:04:41,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 17:04:41,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:41,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 17:04:41,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:04:41,487 INFO L87 Difference]: Start difference. First operand 2303 states and 2940 transitions. Second operand 10 states. [2020-08-22 17:04:44,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:44,571 INFO L93 Difference]: Finished difference Result 6901 states and 9607 transitions. [2020-08-22 17:04:44,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-22 17:04:44,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2020-08-22 17:04:44,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:44,605 INFO L225 Difference]: With dead ends: 6901 [2020-08-22 17:04:44,605 INFO L226 Difference]: Without dead ends: 4625 [2020-08-22 17:04:44,623 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2020-08-22 17:04:44,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4625 states. [2020-08-22 17:04:45,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4625 to 4205. [2020-08-22 17:04:45,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4205 states. [2020-08-22 17:04:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4205 states to 4205 states and 5340 transitions. [2020-08-22 17:04:45,117 INFO L78 Accepts]: Start accepts. Automaton has 4205 states and 5340 transitions. Word has length 191 [2020-08-22 17:04:45,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:45,118 INFO L479 AbstractCegarLoop]: Abstraction has 4205 states and 5340 transitions. [2020-08-22 17:04:45,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 17:04:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 4205 states and 5340 transitions. [2020-08-22 17:04:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-08-22 17:04:45,130 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:45,130 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:04:45,131 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 17:04:45,131 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:45,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:45,132 INFO L82 PathProgramCache]: Analyzing trace with hash -635516700, now seen corresponding path program 1 times [2020-08-22 17:04:45,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:45,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552057020] [2020-08-22 17:04:45,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:04:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:04:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:04:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:04:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-08-22 17:04:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:04:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-08-22 17:04:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2020-08-22 17:04:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:04:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-08-22 17:04:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:04:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:04:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 17:04:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2020-08-22 17:04:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-08-22 17:04:45,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552057020] [2020-08-22 17:04:45,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:04:45,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 17:04:45,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620036306] [2020-08-22 17:04:45,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 17:04:45,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:45,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 17:04:45,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:04:45,617 INFO L87 Difference]: Start difference. First operand 4205 states and 5340 transitions. Second operand 10 states. [2020-08-22 17:04:47,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:47,933 INFO L93 Difference]: Finished difference Result 8766 states and 11212 transitions. [2020-08-22 17:04:47,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 17:04:47,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 249 [2020-08-22 17:04:47,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:47,973 INFO L225 Difference]: With dead ends: 8766 [2020-08-22 17:04:47,973 INFO L226 Difference]: Without dead ends: 4582 [2020-08-22 17:04:47,994 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-08-22 17:04:48,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4582 states. [2020-08-22 17:04:48,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4582 to 4198. [2020-08-22 17:04:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4198 states. [2020-08-22 17:04:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4198 states to 4198 states and 5326 transitions. [2020-08-22 17:04:48,441 INFO L78 Accepts]: Start accepts. Automaton has 4198 states and 5326 transitions. Word has length 249 [2020-08-22 17:04:48,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:48,441 INFO L479 AbstractCegarLoop]: Abstraction has 4198 states and 5326 transitions. [2020-08-22 17:04:48,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 17:04:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4198 states and 5326 transitions. [2020-08-22 17:04:48,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-08-22 17:04:48,449 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:48,449 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:04:48,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 17:04:48,450 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:48,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:48,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2111585836, now seen corresponding path program 1 times [2020-08-22 17:04:48,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:48,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316509556] [2020-08-22 17:04:48,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:04:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:04:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:04:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:04:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-08-22 17:04:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:04:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-08-22 17:04:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:04:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:04:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 17:04:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2020-08-22 17:04:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:48,956 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2020-08-22 17:04:48,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316509556] [2020-08-22 17:04:48,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893145910] [2020-08-22 17:04:48,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:04:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:49,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 3 conjunts are in the unsatisfiable core [2020-08-22 17:04:49,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:04:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-08-22 17:04:49,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:04:49,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2020-08-22 17:04:49,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006672587] [2020-08-22 17:04:49,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 17:04:49,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:49,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 17:04:49,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-08-22 17:04:49,352 INFO L87 Difference]: Start difference. First operand 4198 states and 5326 transitions. Second operand 3 states. [2020-08-22 17:04:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:50,483 INFO L93 Difference]: Finished difference Result 11573 states and 15836 transitions. [2020-08-22 17:04:50,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 17:04:50,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2020-08-22 17:04:50,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:50,548 INFO L225 Difference]: With dead ends: 11573 [2020-08-22 17:04:50,548 INFO L226 Difference]: Without dead ends: 7397 [2020-08-22 17:04:50,574 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-08-22 17:04:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7397 states. [2020-08-22 17:04:51,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7397 to 7377. [2020-08-22 17:04:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7377 states. [2020-08-22 17:04:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7377 states to 7377 states and 9620 transitions. [2020-08-22 17:04:51,678 INFO L78 Accepts]: Start accepts. Automaton has 7377 states and 9620 transitions. Word has length 192 [2020-08-22 17:04:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:04:51,679 INFO L479 AbstractCegarLoop]: Abstraction has 7377 states and 9620 transitions. [2020-08-22 17:04:51,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 17:04:51,679 INFO L276 IsEmpty]: Start isEmpty. Operand 7377 states and 9620 transitions. [2020-08-22 17:04:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-08-22 17:04:51,689 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:04:51,689 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:04:51,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-08-22 17:04:51,904 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:04:51,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:04:51,905 INFO L82 PathProgramCache]: Analyzing trace with hash -942091271, now seen corresponding path program 1 times [2020-08-22 17:04:51,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:04:51,905 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62453267] [2020-08-22 17:04:51,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:04:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:04:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:04:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:04:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:04:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:04:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:04:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:04:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-08-22 17:04:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:04:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:04:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:04:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-08-22 17:04:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:04:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:04:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:04:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:04:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:04:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2020-08-22 17:04:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2020-08-22 17:04:52,435 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62453267] [2020-08-22 17:04:52,435 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803237635] [2020-08-22 17:04:52,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:04:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:04:52,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 10 conjunts are in the unsatisfiable core [2020-08-22 17:04:52,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:04:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 63 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-08-22 17:04:52,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 17:04:52,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2020-08-22 17:04:52,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678725327] [2020-08-22 17:04:52,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-22 17:04:52,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:04:52,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-22 17:04:52,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-08-22 17:04:52,944 INFO L87 Difference]: Start difference. First operand 7377 states and 9620 transitions. Second operand 16 states. [2020-08-22 17:04:53,521 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-08-22 17:04:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:04:59,012 INFO L93 Difference]: Finished difference Result 14365 states and 19335 transitions. [2020-08-22 17:04:59,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-08-22 17:04:59,013 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 193 [2020-08-22 17:04:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:04:59,068 INFO L225 Difference]: With dead ends: 14365 [2020-08-22 17:04:59,068 INFO L226 Difference]: Without dead ends: 5295 [2020-08-22 17:04:59,121 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=370, Invalid=1270, Unknown=0, NotChecked=0, Total=1640 [2020-08-22 17:04:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2020-08-22 17:04:59,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 4893. [2020-08-22 17:04:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4893 states. [2020-08-22 17:05:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4893 states to 4893 states and 5904 transitions. [2020-08-22 17:05:00,013 INFO L78 Accepts]: Start accepts. Automaton has 4893 states and 5904 transitions. Word has length 193 [2020-08-22 17:05:00,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:00,014 INFO L479 AbstractCegarLoop]: Abstraction has 4893 states and 5904 transitions. [2020-08-22 17:05:00,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-22 17:05:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4893 states and 5904 transitions. [2020-08-22 17:05:00,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-08-22 17:05:00,022 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:00,023 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:05:00,236 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-08-22 17:05:00,236 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:00,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:00,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1676255660, now seen corresponding path program 1 times [2020-08-22 17:05:00,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:00,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679979259] [2020-08-22 17:05:00,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:05:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:05:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:05:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:05:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:05:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:05:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-08-22 17:05:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:05:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-08-22 17:05:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:05:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2020-08-22 17:05:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:05:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-08-22 17:05:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2020-08-22 17:05:00,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679979259] [2020-08-22 17:05:00,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263766097] [2020-08-22 17:05:00,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:05:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:00,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 3 conjunts are in the unsatisfiable core [2020-08-22 17:05:00,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:05:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-08-22 17:05:00,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:05:00,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-08-22 17:05:00,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509460659] [2020-08-22 17:05:00,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 17:05:00,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:00,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 17:05:00,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-08-22 17:05:00,824 INFO L87 Difference]: Start difference. First operand 4893 states and 5904 transitions. Second operand 3 states. [2020-08-22 17:05:01,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:01,428 INFO L93 Difference]: Finished difference Result 9748 states and 11934 transitions. [2020-08-22 17:05:01,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 17:05:01,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-08-22 17:05:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:01,459 INFO L225 Difference]: With dead ends: 9748 [2020-08-22 17:05:01,459 INFO L226 Difference]: Without dead ends: 4877 [2020-08-22 17:05:01,474 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-08-22 17:05:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4877 states. [2020-08-22 17:05:02,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4877 to 4869. [2020-08-22 17:05:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4869 states. [2020-08-22 17:05:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 5806 transitions. [2020-08-22 17:05:02,517 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 5806 transitions. Word has length 212 [2020-08-22 17:05:02,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:02,518 INFO L479 AbstractCegarLoop]: Abstraction has 4869 states and 5806 transitions. [2020-08-22 17:05:02,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 17:05:02,518 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 5806 transitions. [2020-08-22 17:05:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-08-22 17:05:02,529 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:02,530 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:05:02,744 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-08-22 17:05:02,744 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:02,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:02,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1451826661, now seen corresponding path program 1 times [2020-08-22 17:05:02,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:02,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533195419] [2020-08-22 17:05:02,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:02,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:02,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:02,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:05:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:02,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:05:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:02,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:05:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:02,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:05:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:02,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:02,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:02,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:02,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:05:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:02,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:05:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:02,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-08-22 17:05:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:02,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:05:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:02,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:03,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:03,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:03,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:03,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2020-08-22 17:05:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:03,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-08-22 17:05:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:03,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2020-08-22 17:05:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:03,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:05:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:03,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:03,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:03,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:03,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:03,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-08-22 17:05:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-08-22 17:05:03,146 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533195419] [2020-08-22 17:05:03,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998392405] [2020-08-22 17:05:03,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:05:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:03,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 2 conjunts are in the unsatisfiable core [2020-08-22 17:05:03,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:05:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-08-22 17:05:03,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:05:03,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2020-08-22 17:05:03,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647407534] [2020-08-22 17:05:03,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 17:05:03,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:03,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 17:05:03,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-08-22 17:05:03,360 INFO L87 Difference]: Start difference. First operand 4869 states and 5806 transitions. Second operand 3 states. [2020-08-22 17:05:04,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:04,457 INFO L93 Difference]: Finished difference Result 13660 states and 16775 transitions. [2020-08-22 17:05:04,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 17:05:04,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-08-22 17:05:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:04,514 INFO L225 Difference]: With dead ends: 13660 [2020-08-22 17:05:04,514 INFO L226 Difference]: Without dead ends: 8813 [2020-08-22 17:05:04,530 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-08-22 17:05:04,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8813 states. [2020-08-22 17:05:05,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8813 to 8773. [2020-08-22 17:05:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8773 states. [2020-08-22 17:05:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8773 states to 8773 states and 10568 transitions. [2020-08-22 17:05:05,371 INFO L78 Accepts]: Start accepts. Automaton has 8773 states and 10568 transitions. Word has length 212 [2020-08-22 17:05:05,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:05,372 INFO L479 AbstractCegarLoop]: Abstraction has 8773 states and 10568 transitions. [2020-08-22 17:05:05,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 17:05:05,373 INFO L276 IsEmpty]: Start isEmpty. Operand 8773 states and 10568 transitions. [2020-08-22 17:05:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-08-22 17:05:05,386 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:05,386 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:05:05,601 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:05:05,602 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:05,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:05,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1892464406, now seen corresponding path program 1 times [2020-08-22 17:05:05,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:05,603 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260919993] [2020-08-22 17:05:05,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:05:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:05:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:05:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:05:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:05:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:05:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-08-22 17:05:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-08-22 17:05:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 17:05:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:05:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-08-22 17:05:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:05:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:05,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-08-22 17:05:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-08-22 17:05:06,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260919993] [2020-08-22 17:05:06,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813303890] [2020-08-22 17:05:06,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:05:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:06,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 27 conjunts are in the unsatisfiable core [2020-08-22 17:05:06,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:05:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-08-22 17:05:06,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:05:06,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2020-08-22 17:05:06,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460476988] [2020-08-22 17:05:06,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-08-22 17:05:06,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:06,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-08-22 17:05:06,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-08-22 17:05:06,266 INFO L87 Difference]: Start difference. First operand 8773 states and 10568 transitions. Second operand 4 states. [2020-08-22 17:05:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:07,932 INFO L93 Difference]: Finished difference Result 26210 states and 35043 transitions. [2020-08-22 17:05:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 17:05:07,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2020-08-22 17:05:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:08,050 INFO L225 Difference]: With dead ends: 26210 [2020-08-22 17:05:08,050 INFO L226 Difference]: Without dead ends: 17464 [2020-08-22 17:05:08,092 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-08-22 17:05:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17464 states. [2020-08-22 17:05:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17464 to 16756. [2020-08-22 17:05:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16756 states. [2020-08-22 17:05:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16756 states to 16756 states and 21113 transitions. [2020-08-22 17:05:11,100 INFO L78 Accepts]: Start accepts. Automaton has 16756 states and 21113 transitions. Word has length 213 [2020-08-22 17:05:11,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:11,100 INFO L479 AbstractCegarLoop]: Abstraction has 16756 states and 21113 transitions. [2020-08-22 17:05:11,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-08-22 17:05:11,101 INFO L276 IsEmpty]: Start isEmpty. Operand 16756 states and 21113 transitions. [2020-08-22 17:05:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-08-22 17:05:11,124 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:11,125 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:05:11,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-08-22 17:05:11,339 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:11,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:11,340 INFO L82 PathProgramCache]: Analyzing trace with hash 407200168, now seen corresponding path program 1 times [2020-08-22 17:05:11,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:11,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776929631] [2020-08-22 17:05:11,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:05:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:05:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:05:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:05:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:05:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:05:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-08-22 17:05:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-08-22 17:05:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 17:05:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:05:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-08-22 17:05:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:05:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-08-22 17:05:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-08-22 17:05:11,622 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776929631] [2020-08-22 17:05:11,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:11,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 17:05:11,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808546511] [2020-08-22 17:05:11,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 17:05:11,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:11,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 17:05:11,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:05:11,625 INFO L87 Difference]: Start difference. First operand 16756 states and 21113 transitions. Second operand 10 states. [2020-08-22 17:05:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:14,283 INFO L93 Difference]: Finished difference Result 30738 states and 39152 transitions. [2020-08-22 17:05:14,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 17:05:14,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2020-08-22 17:05:14,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:14,369 INFO L225 Difference]: With dead ends: 30738 [2020-08-22 17:05:14,369 INFO L226 Difference]: Without dead ends: 14009 [2020-08-22 17:05:14,415 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-08-22 17:05:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14009 states. [2020-08-22 17:05:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14009 to 13487. [2020-08-22 17:05:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13487 states. [2020-08-22 17:05:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13487 states to 13487 states and 16943 transitions. [2020-08-22 17:05:16,461 INFO L78 Accepts]: Start accepts. Automaton has 13487 states and 16943 transitions. Word has length 213 [2020-08-22 17:05:16,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:16,462 INFO L479 AbstractCegarLoop]: Abstraction has 13487 states and 16943 transitions. [2020-08-22 17:05:16,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 17:05:16,462 INFO L276 IsEmpty]: Start isEmpty. Operand 13487 states and 16943 transitions. [2020-08-22 17:05:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-08-22 17:05:16,480 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:16,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-22 17:05:16,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-22 17:05:16,481 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:16,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:16,481 INFO L82 PathProgramCache]: Analyzing trace with hash 592829452, now seen corresponding path program 1 times [2020-08-22 17:05:16,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:16,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948965539] [2020-08-22 17:05:16,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:05:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:05:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:05:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:05:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:05:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:05:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-08-22 17:05:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2020-08-22 17:05:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-08-22 17:05:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:05:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-08-22 17:05:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:05:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2020-08-22 17:05:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-08-22 17:05:16,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948965539] [2020-08-22 17:05:16,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267422991] [2020-08-22 17:05:16,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:05:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:16,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 9 conjunts are in the unsatisfiable core [2020-08-22 17:05:16,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:05:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-08-22 17:05:17,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:05:17,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 12 [2020-08-22 17:05:17,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830905331] [2020-08-22 17:05:17,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 17:05:17,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:17,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 17:05:17,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-08-22 17:05:17,023 INFO L87 Difference]: Start difference. First operand 13487 states and 16943 transitions. Second operand 6 states. [2020-08-22 17:05:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:18,074 INFO L93 Difference]: Finished difference Result 22714 states and 29500 transitions. [2020-08-22 17:05:18,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 17:05:18,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2020-08-22 17:05:18,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:18,118 INFO L225 Difference]: With dead ends: 22714 [2020-08-22 17:05:18,118 INFO L226 Difference]: Without dead ends: 9248 [2020-08-22 17:05:18,158 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-08-22 17:05:18,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9248 states. [2020-08-22 17:05:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9248 to 9194. [2020-08-22 17:05:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9194 states. [2020-08-22 17:05:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9194 states to 9194 states and 11261 transitions. [2020-08-22 17:05:18,913 INFO L78 Accepts]: Start accepts. Automaton has 9194 states and 11261 transitions. Word has length 215 [2020-08-22 17:05:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:18,913 INFO L479 AbstractCegarLoop]: Abstraction has 9194 states and 11261 transitions. [2020-08-22 17:05:18,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 17:05:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 9194 states and 11261 transitions. [2020-08-22 17:05:18,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2020-08-22 17:05:18,939 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:18,940 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:05:19,153 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-08-22 17:05:19,153 INFO L427 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:19,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:19,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1952077569, now seen corresponding path program 1 times [2020-08-22 17:05:19,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:19,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070709765] [2020-08-22 17:05:19,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:05:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:05:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:05:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:05:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:05:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:05:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-08-22 17:05:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:05:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2020-08-22 17:05:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-08-22 17:05:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2020-08-22 17:05:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-08-22 17:05:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:05:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:05:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:05:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2020-08-22 17:05:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:05:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 17:05:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2020-08-22 17:05:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2020-08-22 17:05:19,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070709765] [2020-08-22 17:05:19,580 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139622509] [2020-08-22 17:05:19,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:05:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:19,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 4 conjunts are in the unsatisfiable core [2020-08-22 17:05:19,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:05:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-08-22 17:05:19,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:05:19,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 14 [2020-08-22 17:05:19,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590648245] [2020-08-22 17:05:19,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-08-22 17:05:19,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:19,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-08-22 17:05:19,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-08-22 17:05:19,818 INFO L87 Difference]: Start difference. First operand 9194 states and 11261 transitions. Second operand 4 states. [2020-08-22 17:05:20,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:20,675 INFO L93 Difference]: Finished difference Result 12391 states and 15211 transitions. [2020-08-22 17:05:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 17:05:20,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2020-08-22 17:05:20,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:20,686 INFO L225 Difference]: With dead ends: 12391 [2020-08-22 17:05:20,686 INFO L226 Difference]: Without dead ends: 2837 [2020-08-22 17:05:20,703 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-08-22 17:05:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2020-08-22 17:05:21,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2835. [2020-08-22 17:05:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2835 states. [2020-08-22 17:05:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 3190 transitions. [2020-08-22 17:05:21,019 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 3190 transitions. Word has length 266 [2020-08-22 17:05:21,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:21,020 INFO L479 AbstractCegarLoop]: Abstraction has 2835 states and 3190 transitions. [2020-08-22 17:05:21,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-08-22 17:05:21,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3190 transitions. [2020-08-22 17:05:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2020-08-22 17:05:21,026 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:21,026 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-08-22 17:05:21,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:05:21,228 INFO L427 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:21,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:21,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1326962735, now seen corresponding path program 1 times [2020-08-22 17:05:21,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:21,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342412525] [2020-08-22 17:05:21,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:05:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:05:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:05:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:05:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:05:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-08-22 17:05:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 17:05:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 17:05:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 17:05:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 17:05:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-08-22 17:05:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2020-08-22 17:05:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-08-22 17:05:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-08-22 17:05:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-08-22 17:05:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2020-08-22 17:05:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2020-08-22 17:05:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2020-08-22 17:05:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2020-08-22 17:05:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:05:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2020-08-22 17:05:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:05:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:05:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:05:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2020-08-22 17:05:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:05:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 17:05:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2020-08-22 17:05:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 49 proven. 15 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2020-08-22 17:05:21,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342412525] [2020-08-22 17:05:21,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690762096] [2020-08-22 17:05:21,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:05:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:22,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 5 conjunts are in the unsatisfiable core [2020-08-22 17:05:22,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:05:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2020-08-22 17:05:22,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:05:22,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 14 [2020-08-22 17:05:22,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641838718] [2020-08-22 17:05:22,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 17:05:22,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:22,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 17:05:22,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-08-22 17:05:22,133 INFO L87 Difference]: Start difference. First operand 2835 states and 3190 transitions. Second operand 6 states. [2020-08-22 17:05:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:22,266 INFO L93 Difference]: Finished difference Result 3853 states and 4369 transitions. [2020-08-22 17:05:22,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 17:05:22,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 374 [2020-08-22 17:05:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:22,271 INFO L225 Difference]: With dead ends: 3853 [2020-08-22 17:05:22,271 INFO L226 Difference]: Without dead ends: 1040 [2020-08-22 17:05:22,275 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-08-22 17:05:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2020-08-22 17:05:22,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 935. [2020-08-22 17:05:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2020-08-22 17:05:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1017 transitions. [2020-08-22 17:05:22,385 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1017 transitions. Word has length 374 [2020-08-22 17:05:22,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:22,386 INFO L479 AbstractCegarLoop]: Abstraction has 935 states and 1017 transitions. [2020-08-22 17:05:22,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 17:05:22,386 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1017 transitions. [2020-08-22 17:05:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2020-08-22 17:05:22,388 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:22,389 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:05:22,602 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:05:22,602 INFO L427 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:22,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:22,603 INFO L82 PathProgramCache]: Analyzing trace with hash -373872983, now seen corresponding path program 1 times [2020-08-22 17:05:22,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:22,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954525139] [2020-08-22 17:05:22,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:22,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:22,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:22,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:05:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:22,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:05:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:22,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:05:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:22,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:05:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:22,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:22,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:22,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:22,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:05:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:22,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:05:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:22,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-08-22 17:05:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:22,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-08-22 17:05:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:22,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-08-22 17:05:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-08-22 17:05:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:05:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-08-22 17:05:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:05:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:05:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:05:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-08-22 17:05:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:05:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 17:05:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2020-08-22 17:05:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-08-22 17:05:23,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954525139] [2020-08-22 17:05:23,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866263000] [2020-08-22 17:05:23,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:05:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 23 conjunts are in the unsatisfiable core [2020-08-22 17:05:23,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:05:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 70 proven. 66 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2020-08-22 17:05:23,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 17:05:23,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 14 [2020-08-22 17:05:23,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213328557] [2020-08-22 17:05:23,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 17:05:23,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 17:05:23,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-08-22 17:05:23,674 INFO L87 Difference]: Start difference. First operand 935 states and 1017 transitions. Second operand 14 states. [2020-08-22 17:05:26,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:26,678 INFO L93 Difference]: Finished difference Result 983 states and 1082 transitions. [2020-08-22 17:05:26,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-22 17:05:26,679 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 267 [2020-08-22 17:05:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:26,684 INFO L225 Difference]: With dead ends: 983 [2020-08-22 17:05:26,684 INFO L226 Difference]: Without dead ends: 980 [2020-08-22 17:05:26,686 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 335 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2020-08-22 17:05:26,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2020-08-22 17:05:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 934. [2020-08-22 17:05:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2020-08-22 17:05:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1014 transitions. [2020-08-22 17:05:26,862 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1014 transitions. Word has length 267 [2020-08-22 17:05:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:26,863 INFO L479 AbstractCegarLoop]: Abstraction has 934 states and 1014 transitions. [2020-08-22 17:05:26,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 17:05:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1014 transitions. [2020-08-22 17:05:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2020-08-22 17:05:26,867 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:26,868 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:05:27,083 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:05:27,083 INFO L427 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:27,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:27,085 INFO L82 PathProgramCache]: Analyzing trace with hash -271251823, now seen corresponding path program 1 times [2020-08-22 17:05:27,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:27,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609930974] [2020-08-22 17:05:27,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:05:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:05:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:05:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:05:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-08-22 17:05:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-08-22 17:05:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-08-22 17:05:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-08-22 17:05:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-08-22 17:05:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-08-22 17:05:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:05:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 17:05:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-08-22 17:05:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:05:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:05:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-22 17:05:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-08-22 17:05:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:05:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:05:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 17:05:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2020-08-22 17:05:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2020-08-22 17:05:27,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609930974] [2020-08-22 17:05:27,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19426496] [2020-08-22 17:05:27,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:05:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 2 conjunts are in the unsatisfiable core [2020-08-22 17:05:27,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:05:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2020-08-22 17:05:27,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:05:27,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-08-22 17:05:27,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378915443] [2020-08-22 17:05:27,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 17:05:27,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:27,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 17:05:27,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:05:27,984 INFO L87 Difference]: Start difference. First operand 934 states and 1014 transitions. Second operand 3 states. [2020-08-22 17:05:28,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:28,174 INFO L93 Difference]: Finished difference Result 1655 states and 1809 transitions. [2020-08-22 17:05:28,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 17:05:28,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2020-08-22 17:05:28,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:28,181 INFO L225 Difference]: With dead ends: 1655 [2020-08-22 17:05:28,181 INFO L226 Difference]: Without dead ends: 948 [2020-08-22 17:05:28,184 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:05:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2020-08-22 17:05:28,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 942. [2020-08-22 17:05:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2020-08-22 17:05:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1025 transitions. [2020-08-22 17:05:28,347 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1025 transitions. Word has length 271 [2020-08-22 17:05:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:28,348 INFO L479 AbstractCegarLoop]: Abstraction has 942 states and 1025 transitions. [2020-08-22 17:05:28,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 17:05:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1025 transitions. [2020-08-22 17:05:28,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-08-22 17:05:28,352 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:28,353 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:05:28,568 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:05:28,568 INFO L427 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:28,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1410375831, now seen corresponding path program 1 times [2020-08-22 17:05:28,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:28,570 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346422740] [2020-08-22 17:05:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 17:05:28,633 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 17:05:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 17:05:28,716 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 17:05:28,911 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-08-22 17:05:28,911 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 17:05:28,912 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-08-22 17:05:29,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 05:05:29 BoogieIcfgContainer [2020-08-22 17:05:29,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 17:05:29,217 INFO L168 Benchmark]: Toolchain (without parser) took 74981.16 ms. Allocated memory was 137.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 101.2 MB in the beginning and 741.0 MB in the end (delta: -639.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2020-08-22 17:05:29,218 INFO L168 Benchmark]: CDTParser took 0.69 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-08-22 17:05:29,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.44 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.0 MB in the beginning and 180.4 MB in the end (delta: -79.4 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2020-08-22 17:05:29,219 INFO L168 Benchmark]: Boogie Preprocessor took 61.68 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 177.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-08-22 17:05:29,220 INFO L168 Benchmark]: RCFGBuilder took 792.65 ms. Allocated memory is still 201.9 MB. Free memory was 177.2 MB in the beginning and 137.9 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. [2020-08-22 17:05:29,220 INFO L168 Benchmark]: TraceAbstraction took 73585.11 ms. Allocated memory was 201.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 137.2 MB in the beginning and 741.0 MB in the end (delta: -603.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2020-08-22 17:05:29,223 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.69 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 534.44 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.0 MB in the beginning and 180.4 MB in the end (delta: -79.4 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.68 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 177.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 792.65 ms. Allocated memory is still 201.9 MB. Free memory was 177.2 MB in the beginning and 137.9 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73585.11 ms. Allocated memory was 201.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 137.2 MB in the beginning and 741.0 MB in the end (delta: -603.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int t2_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int t2_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int T2_E = 2; [L26] int E_M = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; [L33] int token ; [L35] int local ; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=18, \old(m_i)=9, \old(m_pc)=15, \old(m_st)=14, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=12, \old(t1_st)=7, \old(T2_E)=17, \old(t2_i)=10, \old(t2_pc)=11, \old(t2_st)=13, \old(token)=22, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L600] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L604] CALL init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L514] m_i = 1 [L515] t1_i = 1 [L516] t2_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L604] RET init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L605] CALL start_simulation() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L541] int kernel_st ; [L542] int tmp ; [L543] int tmp___0 ; [L547] kernel_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L548] FCALL update_channels() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] CALL init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L233] COND TRUE m_i == 1 [L234] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L238] COND TRUE t1_i == 1 [L239] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L243] COND TRUE t2_i == 1 [L244] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] RET init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L346] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L351] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L356] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L361] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L366] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L371] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L551] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L168] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L187] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L206] COND FALSE !(t2_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_transmit2_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L551] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L552] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L384] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L389] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L394] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L399] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L404] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L409] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L552] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L555] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] kernel_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] CALL eval() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L279] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L274] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-2, token=0] [L313] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L96] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L107] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L109] t1_pc = 1 [L110] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L313] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-2, token=0] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-2, tmp_ndt_3=1, token=0] [L327] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L132] COND TRUE t2_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L143] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L145] t2_pc = 1 [L146] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L327] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-2, tmp_ndt_3=1, token=0] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-2, tmp_ndt_3=1, token=0] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L274] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L286] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-2, tmp_ndt_3=1, token=0] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-2, tmp_ndt_3=1, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-2, tmp_ndt_3=1, token=0] [L299] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L51] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L54] token = __VERIFIER_nondet_int() [L55] local = token [L56] E_1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L57] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L168] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_master_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=-1] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L188] COND TRUE E_1 == 1 [L189] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=1, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit1_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=-1] [L433] tmp___0 = is_transmit1_triggered() [L435] COND TRUE \read(tmp___0) [L436] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=-1] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L207] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit2_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=-1] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=-1] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L57] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L58] E_1 = 2 [L59] m_pc = 1 [L60] m_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L299] RET master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-2, tmp_ndt_3=1, token=-1] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-3, tmp_ndt_3=1, token=-1] [L313] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L96] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L99] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L115] token += 1 [L116] E_2 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L117] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L168] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L169] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, __retres1=0, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, \result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_master_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L188] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, __retres1=0, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, \result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_transmit1_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=0] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L207] COND TRUE E_2 == 1 [L208] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, __retres1=1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, \result=1, __retres1=1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_transmit2_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=0] [L441] tmp___1 = is_transmit2_triggered() [L443] COND TRUE \read(tmp___1) [L444] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=0] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L117] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L118] E_2 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L107] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L109] t1_pc = 1 [L110] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L313] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-3, tmp_ndt_3=1, token=0] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-3, tmp_ndt_3=1, token=0] [L327] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=0] [L132] COND FALSE !(t2_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=0] [L135] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=0] [L151] token += 1 [L152] E_M = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L153] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L168] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L169] COND TRUE E_M == 1 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_master_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L425] tmp = is_master_triggered() [L427] COND TRUE \read(tmp) [L428] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=1] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L188] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_transmit1_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=1] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=1] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L207] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_transmit2_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=1] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=1] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L153] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L154] E_M = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L143] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L145] t2_pc = 1 [L146] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L327] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-3, tmp_ndt_3=1, token=1] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-3, tmp_ndt_3=1, token=1] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L274] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L286] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-3, tmp_ndt_3=1, token=1] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=3, tmp_ndt_2=-3, tmp_ndt_3=1, token=1] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=4, tmp_ndt_2=-3, tmp_ndt_3=1, token=1] [L299] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L43] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L65] COND FALSE !(token != local + 2) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L70] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L71] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L76] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L77] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L78] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L79] CALL error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L10] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 181 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 73.2s, OverallIterations: 23, TraceHistogramMax: 7, AutomataDifference: 46.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4858 SDtfs, 12695 SDslu, 3617 SDs, 0 SdLazy, 19096 SolverSat, 5650 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3781 GetRequests, 3407 SyntacticMatches, 6 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16756occurred 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: 12.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 4319 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 6638 NumberOfCodeBlocks, 6638 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 6334 ConstructedInterpolants, 0 QuantifiedInterpolants, 2798600 SizeOfPredicates, 15 NumberOfNonLiveVariables, 10142 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 32 InterpolantComputations, 20 PerfectInterpolantSequences, 4286/4488 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...