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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:40:17,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:40:17,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:40:17,924 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:40:17,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:40:17,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:40:17,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:40:17,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:40:17,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:40:17,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:40:17,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:40:17,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:40:17,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:40:17,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:40:17,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:40:17,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:40:17,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:40:17,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:40:17,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:40:17,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:40:17,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:40:17,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:40:17,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:40:17,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:40:17,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:40:17,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:40:17,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:40:17,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:40:17,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:40:17,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:40:17,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:40:17,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:40:17,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:40:17,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:40:17,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:40:17,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:40:17,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:40:17,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:40:17,991 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:40:17,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:40:17,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:40:17,994 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 [2019-09-16 16:40:18,012 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:40:18,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:40:18,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:40:18,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:40:18,014 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:40:18,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:40:18,014 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:40:18,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:40:18,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:40:18,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:40:18,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:40:18,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:40:18,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:40:18,016 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:40:18,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:40:18,016 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:40:18,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:40:18,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:40:18,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:40:18,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:40:18,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:40:18,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:40:18,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:40:18,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:40:18,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:40:18,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:40:18,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:40:18,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:40:18,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:40:18,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:40:18,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:40:18,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:40:18,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:40:18,068 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:40:18,069 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-09-16 16:40:18,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4066d1e9d/b726a558ead44e599af7deffd8aeb261/FLAG637be39d2 [2019-09-16 16:40:18,651 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:40:18,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-09-16 16:40:18,669 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4066d1e9d/b726a558ead44e599af7deffd8aeb261/FLAG637be39d2 [2019-09-16 16:40:18,997 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4066d1e9d/b726a558ead44e599af7deffd8aeb261 [2019-09-16 16:40:19,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:40:19,007 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:40:19,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:40:19,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:40:19,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:40:19,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:40:18" (1/1) ... [2019-09-16 16:40:19,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6758265e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:19, skipping insertion in model container [2019-09-16 16:40:19,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:40:18" (1/1) ... [2019-09-16 16:40:19,023 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:40:19,056 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:40:19,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:40:19,495 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:40:19,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:40:19,590 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:40:19,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:19 WrapperNode [2019-09-16 16:40:19,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:40:19,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:40:19,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:40:19,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:40:19,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:19" (1/1) ... [2019-09-16 16:40:19,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:19" (1/1) ... [2019-09-16 16:40:19,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:19" (1/1) ... [2019-09-16 16:40:19,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:19" (1/1) ... [2019-09-16 16:40:19,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:19" (1/1) ... [2019-09-16 16:40:19,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:19" (1/1) ... [2019-09-16 16:40:19,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:19" (1/1) ... [2019-09-16 16:40:19,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:40:19,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:40:19,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:40:19,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:40:19,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:40:19,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:40:19,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:40:19,766 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-16 16:40:19,766 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-16 16:40:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-16 16:40:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-16 16:40:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-16 16:40:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-16 16:40:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-16 16:40:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-16 16:40:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-16 16:40:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-16 16:40:19,768 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-16 16:40:19,769 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-16 16:40:19,770 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-16 16:40:19,770 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-16 16:40:19,772 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-16 16:40:19,772 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-16 16:40:19,772 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-16 16:40:19,773 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-16 16:40:19,773 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-16 16:40:19,773 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-16 16:40:19,773 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:40:19,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:40:19,774 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-16 16:40:19,774 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-16 16:40:19,775 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-16 16:40:19,775 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-16 16:40:19,776 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-16 16:40:19,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:40:19,776 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-16 16:40:19,776 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-16 16:40:19,776 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-16 16:40:19,776 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-16 16:40:19,776 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-16 16:40:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-16 16:40:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-16 16:40:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-16 16:40:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-16 16:40:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-16 16:40:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-16 16:40:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-16 16:40:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-16 16:40:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-16 16:40:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-16 16:40:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:40:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:40:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:40:20,402 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:40:20,402 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-16 16:40:20,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:40:20 BoogieIcfgContainer [2019-09-16 16:40:20,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:40:20,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:40:20,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:40:20,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:40:20,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:40:18" (1/3) ... [2019-09-16 16:40:20,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580af638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:40:20, skipping insertion in model container [2019-09-16 16:40:20,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:19" (2/3) ... [2019-09-16 16:40:20,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580af638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:40:20, skipping insertion in model container [2019-09-16 16:40:20,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:40:20" (3/3) ... [2019-09-16 16:40:20,412 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2019-09-16 16:40:20,422 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:40:20,429 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:40:20,446 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:40:20,479 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:40:20,479 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:40:20,480 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:40:20,480 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:40:20,480 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:40:20,480 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:40:20,481 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:40:20,481 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:40:20,481 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:40:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2019-09-16 16:40:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-16 16:40:20,518 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:20,519 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:20,521 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:20,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:20,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1715943758, now seen corresponding path program 1 times [2019-09-16 16:40:20,528 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:20,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:20,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:20,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:20,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:20,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:20,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:20,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:20,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:20,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:20,943 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2019-09-16 16:40:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:21,620 INFO L93 Difference]: Finished difference Result 361 states and 528 transitions. [2019-09-16 16:40:21,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:40:21,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-16 16:40:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:21,652 INFO L225 Difference]: With dead ends: 361 [2019-09-16 16:40:21,652 INFO L226 Difference]: Without dead ends: 195 [2019-09-16 16:40:21,658 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:21,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-16 16:40:21,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2019-09-16 16:40:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-16 16:40:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2019-09-16 16:40:21,774 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 91 [2019-09-16 16:40:21,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:21,774 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2019-09-16 16:40:21,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2019-09-16 16:40:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-16 16:40:21,787 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:21,787 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:21,789 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:21,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:21,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1625083380, now seen corresponding path program 1 times [2019-09-16 16:40:21,791 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:21,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:21,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:21,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:21,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:21,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:21,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:21,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:21,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:21,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:21,993 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand 5 states. [2019-09-16 16:40:22,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:22,460 INFO L93 Difference]: Finished difference Result 338 states and 470 transitions. [2019-09-16 16:40:22,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:40:22,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-16 16:40:22,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:22,464 INFO L225 Difference]: With dead ends: 338 [2019-09-16 16:40:22,464 INFO L226 Difference]: Without dead ends: 193 [2019-09-16 16:40:22,466 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-16 16:40:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2019-09-16 16:40:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-16 16:40:22,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2019-09-16 16:40:22,489 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 91 [2019-09-16 16:40:22,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:22,490 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2019-09-16 16:40:22,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2019-09-16 16:40:22,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-16 16:40:22,493 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:22,494 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:22,494 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:22,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:22,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1453730190, now seen corresponding path program 1 times [2019-09-16 16:40:22,494 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:22,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:22,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:22,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:22,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:22,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:22,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:22,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:22,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:22,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:22,568 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 5 states. [2019-09-16 16:40:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:22,980 INFO L93 Difference]: Finished difference Result 355 states and 496 transitions. [2019-09-16 16:40:22,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:40:22,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-16 16:40:22,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:22,984 INFO L225 Difference]: With dead ends: 355 [2019-09-16 16:40:22,984 INFO L226 Difference]: Without dead ends: 210 [2019-09-16 16:40:22,985 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-16 16:40:23,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2019-09-16 16:40:23,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-16 16:40:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2019-09-16 16:40:23,011 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 91 [2019-09-16 16:40:23,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:23,011 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2019-09-16 16:40:23,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:23,011 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2019-09-16 16:40:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-16 16:40:23,013 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:23,013 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:23,014 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:23,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:23,014 INFO L82 PathProgramCache]: Analyzing trace with hash 721762764, now seen corresponding path program 1 times [2019-09-16 16:40:23,014 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:23,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:23,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:23,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:23,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:23,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:23,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:23,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:23,115 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand 5 states. [2019-09-16 16:40:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:23,527 INFO L93 Difference]: Finished difference Result 349 states and 485 transitions. [2019-09-16 16:40:23,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:40:23,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-16 16:40:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:23,530 INFO L225 Difference]: With dead ends: 349 [2019-09-16 16:40:23,531 INFO L226 Difference]: Without dead ends: 204 [2019-09-16 16:40:23,532 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:23,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-16 16:40:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2019-09-16 16:40:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-16 16:40:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2019-09-16 16:40:23,554 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 91 [2019-09-16 16:40:23,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:23,554 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2019-09-16 16:40:23,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2019-09-16 16:40:23,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-16 16:40:23,556 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:23,556 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:23,557 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:23,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:23,557 INFO L82 PathProgramCache]: Analyzing trace with hash -964417074, now seen corresponding path program 1 times [2019-09-16 16:40:23,557 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:23,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:23,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:23,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:23,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:23,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:23,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:23,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:23,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:23,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:23,655 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand 5 states. [2019-09-16 16:40:24,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:24,041 INFO L93 Difference]: Finished difference Result 351 states and 484 transitions. [2019-09-16 16:40:24,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:40:24,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-16 16:40:24,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:24,044 INFO L225 Difference]: With dead ends: 351 [2019-09-16 16:40:24,044 INFO L226 Difference]: Without dead ends: 206 [2019-09-16 16:40:24,045 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:24,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-16 16:40:24,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 165. [2019-09-16 16:40:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-16 16:40:24,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2019-09-16 16:40:24,065 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 91 [2019-09-16 16:40:24,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:24,066 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2019-09-16 16:40:24,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:24,066 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2019-09-16 16:40:24,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-16 16:40:24,067 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:24,067 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:24,068 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:24,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1018809972, now seen corresponding path program 1 times [2019-09-16 16:40:24,068 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:24,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:24,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:24,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:24,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:24,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:24,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:24,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:40:24,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:40:24,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:40:24,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:24,126 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand 4 states. [2019-09-16 16:40:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:24,336 INFO L93 Difference]: Finished difference Result 445 states and 615 transitions. [2019-09-16 16:40:24,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:40:24,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-16 16:40:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:24,339 INFO L225 Difference]: With dead ends: 445 [2019-09-16 16:40:24,340 INFO L226 Difference]: Without dead ends: 301 [2019-09-16 16:40:24,341 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:24,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-16 16:40:24,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2019-09-16 16:40:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-16 16:40:24,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 395 transitions. [2019-09-16 16:40:24,373 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 395 transitions. Word has length 91 [2019-09-16 16:40:24,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:24,373 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 395 transitions. [2019-09-16 16:40:24,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:40:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 395 transitions. [2019-09-16 16:40:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-16 16:40:24,377 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:24,378 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:24,378 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:24,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:24,378 INFO L82 PathProgramCache]: Analyzing trace with hash -207780250, now seen corresponding path program 1 times [2019-09-16 16:40:24,378 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:24,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:24,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:24,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:24,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-16 16:40:24,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:40:24,468 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-16 16:40:24,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:40:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:24,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 16:40:24,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:40:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-16 16:40:24,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:40:24,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-16 16:40:24,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:40:24,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:40:24,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:24,710 INFO L87 Difference]: Start difference. First operand 300 states and 395 transitions. Second operand 7 states. [2019-09-16 16:40:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:24,869 INFO L93 Difference]: Finished difference Result 875 states and 1233 transitions. [2019-09-16 16:40:24,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 16:40:24,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-09-16 16:40:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:24,875 INFO L225 Difference]: With dead ends: 875 [2019-09-16 16:40:24,876 INFO L226 Difference]: Without dead ends: 596 [2019-09-16 16:40:24,878 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-16 16:40:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-16 16:40:24,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 587. [2019-09-16 16:40:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-16 16:40:24,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 801 transitions. [2019-09-16 16:40:24,951 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 801 transitions. Word has length 145 [2019-09-16 16:40:24,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:24,951 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 801 transitions. [2019-09-16 16:40:24,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:40:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 801 transitions. [2019-09-16 16:40:24,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-16 16:40:24,956 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:24,956 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:24,956 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:24,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:24,957 INFO L82 PathProgramCache]: Analyzing trace with hash -402647817, now seen corresponding path program 1 times [2019-09-16 16:40:24,957 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:24,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:24,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:24,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:24,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-16 16:40:25,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:40:25,099 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-16 16:40:25,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:40:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:25,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 16:40:25,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:40:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-16 16:40:25,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:40:25,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-16 16:40:25,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:25,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:25,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:25,323 INFO L87 Difference]: Start difference. First operand 587 states and 801 transitions. Second operand 5 states. [2019-09-16 16:40:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:25,906 INFO L93 Difference]: Finished difference Result 2702 states and 4163 transitions. [2019-09-16 16:40:25,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:25,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-09-16 16:40:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:25,925 INFO L225 Difference]: With dead ends: 2702 [2019-09-16 16:40:25,925 INFO L226 Difference]: Without dead ends: 2141 [2019-09-16 16:40:25,931 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:25,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2019-09-16 16:40:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 2118. [2019-09-16 16:40:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2118 states. [2019-09-16 16:40:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 3017 transitions. [2019-09-16 16:40:26,153 INFO L78 Accepts]: Start accepts. Automaton has 2118 states and 3017 transitions. Word has length 164 [2019-09-16 16:40:26,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:26,155 INFO L475 AbstractCegarLoop]: Abstraction has 2118 states and 3017 transitions. [2019-09-16 16:40:26,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 3017 transitions. [2019-09-16 16:40:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-16 16:40:26,165 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:26,165 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:26,165 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:26,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:26,166 INFO L82 PathProgramCache]: Analyzing trace with hash 525451170, now seen corresponding path program 1 times [2019-09-16 16:40:26,166 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:26,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:26,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:26,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:26,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-16 16:40:26,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:26,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:40:26,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:40:26,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:40:26,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:26,227 INFO L87 Difference]: Start difference. First operand 2118 states and 3017 transitions. Second operand 4 states. [2019-09-16 16:40:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:26,461 INFO L93 Difference]: Finished difference Result 3863 states and 5411 transitions. [2019-09-16 16:40:26,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:40:26,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-16 16:40:26,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:26,487 INFO L225 Difference]: With dead ends: 3863 [2019-09-16 16:40:26,487 INFO L226 Difference]: Without dead ends: 1771 [2019-09-16 16:40:26,498 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2019-09-16 16:40:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1771. [2019-09-16 16:40:26,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-09-16 16:40:26,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2430 transitions. [2019-09-16 16:40:26,683 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2430 transitions. Word has length 145 [2019-09-16 16:40:26,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:26,684 INFO L475 AbstractCegarLoop]: Abstraction has 1771 states and 2430 transitions. [2019-09-16 16:40:26,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:40:26,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2430 transitions. [2019-09-16 16:40:26,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-16 16:40:26,689 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:26,690 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:26,690 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:26,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:26,691 INFO L82 PathProgramCache]: Analyzing trace with hash -940599259, now seen corresponding path program 1 times [2019-09-16 16:40:26,691 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:26,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:26,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:26,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:26,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-16 16:40:26,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:26,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:26,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:26,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:26,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:26,924 INFO L87 Difference]: Start difference. First operand 1771 states and 2430 transitions. Second operand 5 states. [2019-09-16 16:40:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:27,522 INFO L93 Difference]: Finished difference Result 4474 states and 6284 transitions. [2019-09-16 16:40:27,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:27,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-16 16:40:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:27,543 INFO L225 Difference]: With dead ends: 4474 [2019-09-16 16:40:27,543 INFO L226 Difference]: Without dead ends: 2731 [2019-09-16 16:40:27,552 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2019-09-16 16:40:27,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 2455. [2019-09-16 16:40:27,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2455 states. [2019-09-16 16:40:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2455 states and 3296 transitions. [2019-09-16 16:40:27,785 INFO L78 Accepts]: Start accepts. Automaton has 2455 states and 3296 transitions. Word has length 165 [2019-09-16 16:40:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:27,786 INFO L475 AbstractCegarLoop]: Abstraction has 2455 states and 3296 transitions. [2019-09-16 16:40:27,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 3296 transitions. [2019-09-16 16:40:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-16 16:40:27,792 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:27,793 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:27,793 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:27,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:27,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1320973991, now seen corresponding path program 1 times [2019-09-16 16:40:27,794 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:27,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:27,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:27,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:27,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-16 16:40:27,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:27,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:27,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:27,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:27,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:27,950 INFO L87 Difference]: Start difference. First operand 2455 states and 3296 transitions. Second operand 5 states. [2019-09-16 16:40:28,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:28,503 INFO L93 Difference]: Finished difference Result 4878 states and 6592 transitions. [2019-09-16 16:40:28,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:40:28,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-16 16:40:28,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:28,523 INFO L225 Difference]: With dead ends: 4878 [2019-09-16 16:40:28,523 INFO L226 Difference]: Without dead ends: 2455 [2019-09-16 16:40:28,533 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:28,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2019-09-16 16:40:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2455. [2019-09-16 16:40:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2455 states. [2019-09-16 16:40:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2455 states and 3260 transitions. [2019-09-16 16:40:28,725 INFO L78 Accepts]: Start accepts. Automaton has 2455 states and 3260 transitions. Word has length 165 [2019-09-16 16:40:28,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:28,726 INFO L475 AbstractCegarLoop]: Abstraction has 2455 states and 3260 transitions. [2019-09-16 16:40:28,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:28,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 3260 transitions. [2019-09-16 16:40:28,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-16 16:40:28,732 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:28,732 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:28,732 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:28,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:28,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2125621302, now seen corresponding path program 1 times [2019-09-16 16:40:28,733 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:28,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:28,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:28,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:28,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 16:40:28,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:28,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:28,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:28,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:28,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:28,813 INFO L87 Difference]: Start difference. First operand 2455 states and 3260 transitions. Second operand 5 states. [2019-09-16 16:40:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:29,752 INFO L93 Difference]: Finished difference Result 5359 states and 7656 transitions. [2019-09-16 16:40:29,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:29,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-16 16:40:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:29,781 INFO L225 Difference]: With dead ends: 5359 [2019-09-16 16:40:29,782 INFO L226 Difference]: Without dead ends: 2936 [2019-09-16 16:40:29,795 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:29,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2019-09-16 16:40:30,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2732. [2019-09-16 16:40:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2732 states. [2019-09-16 16:40:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 3547 transitions. [2019-09-16 16:40:30,027 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 3547 transitions. Word has length 165 [2019-09-16 16:40:30,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:30,028 INFO L475 AbstractCegarLoop]: Abstraction has 2732 states and 3547 transitions. [2019-09-16 16:40:30,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3547 transitions. [2019-09-16 16:40:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-16 16:40:30,033 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:30,033 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:30,034 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:30,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:30,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1978488323, now seen corresponding path program 1 times [2019-09-16 16:40:30,034 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:30,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:30,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:30,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:30,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-16 16:40:30,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:30,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:40:30,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:40:30,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:40:30,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:30,085 INFO L87 Difference]: Start difference. First operand 2732 states and 3547 transitions. Second operand 4 states. [2019-09-16 16:40:30,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:30,408 INFO L93 Difference]: Finished difference Result 5434 states and 7045 transitions. [2019-09-16 16:40:30,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:40:30,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-16 16:40:30,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:30,433 INFO L225 Difference]: With dead ends: 5434 [2019-09-16 16:40:30,433 INFO L226 Difference]: Without dead ends: 2724 [2019-09-16 16:40:30,448 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2019-09-16 16:40:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 2724. [2019-09-16 16:40:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2724 states. [2019-09-16 16:40:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 3528 transitions. [2019-09-16 16:40:30,731 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 3528 transitions. Word has length 145 [2019-09-16 16:40:30,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:30,732 INFO L475 AbstractCegarLoop]: Abstraction has 2724 states and 3528 transitions. [2019-09-16 16:40:30,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:40:30,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 3528 transitions. [2019-09-16 16:40:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-16 16:40:30,739 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:30,739 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:30,739 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:30,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:30,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1179059973, now seen corresponding path program 1 times [2019-09-16 16:40:30,740 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:30,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:30,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:30,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:30,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-16 16:40:30,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:30,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:30,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:30,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:30,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:30,845 INFO L87 Difference]: Start difference. First operand 2724 states and 3528 transitions. Second operand 5 states. [2019-09-16 16:40:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:31,554 INFO L93 Difference]: Finished difference Result 6021 states and 8084 transitions. [2019-09-16 16:40:31,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:31,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-09-16 16:40:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:31,577 INFO L225 Difference]: With dead ends: 6021 [2019-09-16 16:40:31,577 INFO L226 Difference]: Without dead ends: 3319 [2019-09-16 16:40:31,592 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2019-09-16 16:40:31,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 2903. [2019-09-16 16:40:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2903 states. [2019-09-16 16:40:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 3657 transitions. [2019-09-16 16:40:31,946 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 3657 transitions. Word has length 146 [2019-09-16 16:40:31,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:31,947 INFO L475 AbstractCegarLoop]: Abstraction has 2903 states and 3657 transitions. [2019-09-16 16:40:31,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 3657 transitions. [2019-09-16 16:40:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-16 16:40:31,952 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:31,952 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:31,952 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:31,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:31,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2002470861, now seen corresponding path program 1 times [2019-09-16 16:40:31,953 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:31,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:31,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:31,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:31,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-16 16:40:32,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:32,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:32,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:32,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:32,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:32,037 INFO L87 Difference]: Start difference. First operand 2903 states and 3657 transitions. Second operand 5 states. [2019-09-16 16:40:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:32,706 INFO L93 Difference]: Finished difference Result 6511 states and 9188 transitions. [2019-09-16 16:40:32,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:32,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-16 16:40:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:32,731 INFO L225 Difference]: With dead ends: 6511 [2019-09-16 16:40:32,732 INFO L226 Difference]: Without dead ends: 3632 [2019-09-16 16:40:32,746 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:32,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3632 states. [2019-09-16 16:40:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 3107. [2019-09-16 16:40:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3107 states. [2019-09-16 16:40:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 3107 states and 3823 transitions. [2019-09-16 16:40:33,024 INFO L78 Accepts]: Start accepts. Automaton has 3107 states and 3823 transitions. Word has length 147 [2019-09-16 16:40:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:33,025 INFO L475 AbstractCegarLoop]: Abstraction has 3107 states and 3823 transitions. [2019-09-16 16:40:33,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:33,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 3823 transitions. [2019-09-16 16:40:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-16 16:40:33,029 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:33,029 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:33,030 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:33,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:33,030 INFO L82 PathProgramCache]: Analyzing trace with hash 859968395, now seen corresponding path program 1 times [2019-09-16 16:40:33,030 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:33,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:33,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:33,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:33,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-16 16:40:33,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:33,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:40:33,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:40:33,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:40:33,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:33,126 INFO L87 Difference]: Start difference. First operand 3107 states and 3823 transitions. Second operand 6 states. [2019-09-16 16:40:33,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:33,405 INFO L93 Difference]: Finished difference Result 6120 states and 7746 transitions. [2019-09-16 16:40:33,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:33,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-09-16 16:40:33,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:33,433 INFO L225 Difference]: With dead ends: 6120 [2019-09-16 16:40:33,433 INFO L226 Difference]: Without dead ends: 3035 [2019-09-16 16:40:33,444 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:33,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2019-09-16 16:40:33,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 3025. [2019-09-16 16:40:33,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3025 states. [2019-09-16 16:40:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 3644 transitions. [2019-09-16 16:40:33,661 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 3644 transitions. Word has length 147 [2019-09-16 16:40:33,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:33,662 INFO L475 AbstractCegarLoop]: Abstraction has 3025 states and 3644 transitions. [2019-09-16 16:40:33,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:40:33,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 3644 transitions. [2019-09-16 16:40:33,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-16 16:40:33,667 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:33,667 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:33,668 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:33,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:33,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1889955460, now seen corresponding path program 1 times [2019-09-16 16:40:33,668 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:33,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:33,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:33,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:33,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:33,732 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-16 16:40:33,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:33,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:40:33,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:40:33,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:40:33,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:33,734 INFO L87 Difference]: Start difference. First operand 3025 states and 3644 transitions. Second operand 4 states. [2019-09-16 16:40:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:34,068 INFO L93 Difference]: Finished difference Result 4547 states and 5550 transitions. [2019-09-16 16:40:34,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:40:34,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-09-16 16:40:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:34,081 INFO L225 Difference]: With dead ends: 4547 [2019-09-16 16:40:34,082 INFO L226 Difference]: Without dead ends: 2563 [2019-09-16 16:40:34,089 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2019-09-16 16:40:34,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2521. [2019-09-16 16:40:34,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2019-09-16 16:40:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 2981 transitions. [2019-09-16 16:40:34,275 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 2981 transitions. Word has length 146 [2019-09-16 16:40:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:34,276 INFO L475 AbstractCegarLoop]: Abstraction has 2521 states and 2981 transitions. [2019-09-16 16:40:34,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:40:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 2981 transitions. [2019-09-16 16:40:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-16 16:40:34,284 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:34,284 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-16 16:40:34,285 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:34,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:34,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2146588841, now seen corresponding path program 1 times [2019-09-16 16:40:34,285 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:34,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:34,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:34,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:34,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-16 16:40:34,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:40:34,385 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:40:34,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:34,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-16 16:40:34,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:40:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-16 16:40:34,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:40:34,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-16 16:40:34,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:40:34,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:40:34,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:40:34,669 INFO L87 Difference]: Start difference. First operand 2521 states and 2981 transitions. Second operand 3 states. [2019-09-16 16:40:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:35,076 INFO L93 Difference]: Finished difference Result 7184 states and 8880 transitions. [2019-09-16 16:40:35,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:40:35,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-16 16:40:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:35,109 INFO L225 Difference]: With dead ends: 7184 [2019-09-16 16:40:35,109 INFO L226 Difference]: Without dead ends: 4687 [2019-09-16 16:40:35,121 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:40:35,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2019-09-16 16:40:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4680. [2019-09-16 16:40:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-16 16:40:35,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 5750 transitions. [2019-09-16 16:40:35,717 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 5750 transitions. Word has length 212 [2019-09-16 16:40:35,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:35,718 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 5750 transitions. [2019-09-16 16:40:35,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:40:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 5750 transitions. [2019-09-16 16:40:35,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-16 16:40:35,733 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:35,733 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:35,734 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:35,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:35,734 INFO L82 PathProgramCache]: Analyzing trace with hash 547975687, now seen corresponding path program 1 times [2019-09-16 16:40:35,734 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:35,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:35,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:35,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:35,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-16 16:40:35,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:40:35,831 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-16 16:40:35,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:40:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:35,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-16 16:40:35,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:40:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-16 16:40:36,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:40:36,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-09-16 16:40:36,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:40:36,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:40:36,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:36,088 INFO L87 Difference]: Start difference. First operand 4680 states and 5750 transitions. Second operand 6 states. [2019-09-16 16:40:36,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:36,503 INFO L93 Difference]: Finished difference Result 8511 states and 10779 transitions. [2019-09-16 16:40:36,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:36,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2019-09-16 16:40:36,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:36,536 INFO L225 Difference]: With dead ends: 8511 [2019-09-16 16:40:36,536 INFO L226 Difference]: Without dead ends: 3853 [2019-09-16 16:40:36,553 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2019-09-16 16:40:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3853. [2019-09-16 16:40:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3853 states. [2019-09-16 16:40:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 4588 transitions. [2019-09-16 16:40:36,929 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 4588 transitions. Word has length 213 [2019-09-16 16:40:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:36,930 INFO L475 AbstractCegarLoop]: Abstraction has 3853 states and 4588 transitions. [2019-09-16 16:40:36,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:40:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 4588 transitions. [2019-09-16 16:40:36,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-16 16:40:36,944 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:36,944 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:36,944 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:36,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:36,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1371666015, now seen corresponding path program 1 times [2019-09-16 16:40:36,945 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:36,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:36,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:36,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:36,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-09-16 16:40:37,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:40:37,106 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:40:37,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:37,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 16:40:37,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:40:37,392 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-16 16:40:37,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:40:37,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-16 16:40:37,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:40:37,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:40:37,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:37,408 INFO L87 Difference]: Start difference. First operand 3853 states and 4588 transitions. Second operand 7 states. [2019-09-16 16:40:38,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:38,831 INFO L93 Difference]: Finished difference Result 8753 states and 11140 transitions. [2019-09-16 16:40:38,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:40:38,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 256 [2019-09-16 16:40:38,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:38,856 INFO L225 Difference]: With dead ends: 8753 [2019-09-16 16:40:38,857 INFO L226 Difference]: Without dead ends: 4922 [2019-09-16 16:40:38,876 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:40:38,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4922 states. [2019-09-16 16:40:39,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4922 to 4922. [2019-09-16 16:40:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4922 states. [2019-09-16 16:40:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4922 states to 4922 states and 5888 transitions. [2019-09-16 16:40:39,342 INFO L78 Accepts]: Start accepts. Automaton has 4922 states and 5888 transitions. Word has length 256 [2019-09-16 16:40:39,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:39,342 INFO L475 AbstractCegarLoop]: Abstraction has 4922 states and 5888 transitions. [2019-09-16 16:40:39,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:40:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4922 states and 5888 transitions. [2019-09-16 16:40:39,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-16 16:40:39,362 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:39,363 INFO L407 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:39,363 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:39,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:39,364 INFO L82 PathProgramCache]: Analyzing trace with hash 870823939, now seen corresponding path program 1 times [2019-09-16 16:40:39,364 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:39,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:39,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:39,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:39,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 53 proven. 7 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2019-09-16 16:40:39,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:40:39,567 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:40:39,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:39,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 1414 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-16 16:40:39,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:40:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-09-16 16:40:39,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:40:39,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-16 16:40:39,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:40:39,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:40:39,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:40,000 INFO L87 Difference]: Start difference. First operand 4922 states and 5888 transitions. Second operand 6 states. [2019-09-16 16:40:40,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:40,658 INFO L93 Difference]: Finished difference Result 6781 states and 8201 transitions. [2019-09-16 16:40:40,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:40:40,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 373 [2019-09-16 16:40:40,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:40,668 INFO L225 Difference]: With dead ends: 6781 [2019-09-16 16:40:40,668 INFO L226 Difference]: Without dead ends: 1629 [2019-09-16 16:40:40,682 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:40:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-09-16 16:40:40,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1628. [2019-09-16 16:40:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2019-09-16 16:40:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 1843 transitions. [2019-09-16 16:40:40,813 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 1843 transitions. Word has length 373 [2019-09-16 16:40:40,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:40,814 INFO L475 AbstractCegarLoop]: Abstraction has 1628 states and 1843 transitions. [2019-09-16 16:40:40,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:40:40,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1843 transitions. [2019-09-16 16:40:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-16 16:40:40,824 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:40,825 INFO L407 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-16 16:40:40,825 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:40,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:40,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2051199517, now seen corresponding path program 1 times [2019-09-16 16:40:40,826 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:40,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:40,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:40,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:40,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 41 proven. 32 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-09-16 16:40:40,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:40:40,993 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:40:41,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:41,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-16 16:40:41,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:40:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 16:40:41,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:40:41,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2019-09-16 16:40:41,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-16 16:40:41,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-16 16:40:41,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-16 16:40:41,456 INFO L87 Difference]: Start difference. First operand 1628 states and 1843 transitions. Second operand 12 states. [2019-09-16 16:40:41,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:41,641 INFO L93 Difference]: Finished difference Result 2333 states and 2651 transitions. [2019-09-16 16:40:41,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:40:41,642 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 371 [2019-09-16 16:40:41,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:41,645 INFO L225 Difference]: With dead ends: 2333 [2019-09-16 16:40:41,645 INFO L226 Difference]: Without dead ends: 729 [2019-09-16 16:40:41,650 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-09-16 16:40:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-09-16 16:40:41,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 665. [2019-09-16 16:40:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-09-16 16:40:41,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 721 transitions. [2019-09-16 16:40:41,703 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 721 transitions. Word has length 371 [2019-09-16 16:40:41,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:41,703 INFO L475 AbstractCegarLoop]: Abstraction has 665 states and 721 transitions. [2019-09-16 16:40:41,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-16 16:40:41,704 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 721 transitions. [2019-09-16 16:40:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-16 16:40:41,709 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:41,710 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:41,710 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:41,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:41,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2108904620, now seen corresponding path program 1 times [2019-09-16 16:40:41,710 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:41,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:41,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:41,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:41,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-09-16 16:40:42,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:42,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-16 16:40:42,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:40:42,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:40:42,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:42,020 INFO L87 Difference]: Start difference. First operand 665 states and 721 transitions. Second operand 7 states. [2019-09-16 16:40:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:43,026 INFO L93 Difference]: Finished difference Result 691 states and 755 transitions. [2019-09-16 16:40:43,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 16:40:43,027 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 265 [2019-09-16 16:40:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:43,028 INFO L225 Difference]: With dead ends: 691 [2019-09-16 16:40:43,029 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 16:40:43,033 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-16 16:40:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 16:40:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 16:40:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 16:40:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 16:40:43,034 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 265 [2019-09-16 16:40:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:43,034 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 16:40:43,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:40:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 16:40:43,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 16:40:43,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-16 16:40:43,292 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 115 [2019-09-16 16:40:43,982 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 115 [2019-09-16 16:40:44,658 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2019-09-16 16:40:47,956 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 126 [2019-09-16 16:40:51,759 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 142 DAG size of output: 115 [2019-09-16 16:40:56,644 WARN L191 SmtUtils]: Spent 4.77 s on a formula simplification. DAG size of input: 218 DAG size of output: 96 [2019-09-16 16:40:57,752 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 142 DAG size of output: 115 [2019-09-16 16:40:58,771 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 111 DAG size of output: 76 [2019-09-16 16:41:00,565 WARN L191 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 123 DAG size of output: 87 [2019-09-16 16:41:02,033 WARN L191 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 115 DAG size of output: 85 [2019-09-16 16:41:02,226 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2019-09-16 16:41:03,490 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 146 DAG size of output: 119 [2019-09-16 16:41:03,679 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-09-16 16:41:03,891 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 77 [2019-09-16 16:41:04,156 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-09-16 16:41:04,507 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 1 [2019-09-16 16:41:05,185 WARN L191 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-09-16 16:41:06,218 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 118 DAG size of output: 81 [2019-09-16 16:41:07,314 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 142 DAG size of output: 115 [2019-09-16 16:41:07,954 WARN L191 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2019-09-16 16:41:09,210 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 146 DAG size of output: 119 [2019-09-16 16:41:10,737 WARN L191 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 138 DAG size of output: 93 [2019-09-16 16:41:12,151 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2019-09-16 16:41:12,497 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2019-09-16 16:41:14,144 WARN L191 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 119 DAG size of output: 84 [2019-09-16 16:41:18,107 WARN L191 SmtUtils]: Spent 3.95 s on a formula simplification. DAG size of input: 177 DAG size of output: 104 [2019-09-16 16:41:19,092 WARN L191 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 79 [2019-09-16 16:41:24,678 WARN L191 SmtUtils]: Spent 5.48 s on a formula simplification. DAG size of input: 183 DAG size of output: 109 [2019-09-16 16:41:28,581 WARN L191 SmtUtils]: Spent 3.89 s on a formula simplification. DAG size of input: 173 DAG size of output: 99 [2019-09-16 16:41:28,726 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-09-16 16:41:29,806 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 142 DAG size of output: 115 [2019-09-16 16:41:31,473 WARN L191 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 126 DAG size of output: 80 [2019-09-16 16:41:32,645 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 123 DAG size of output: 87 [2019-09-16 16:41:33,288 WARN L191 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2019-09-16 16:41:33,915 WARN L191 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-16 16:41:36,419 WARN L191 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 169 DAG size of output: 138 [2019-09-16 16:41:39,548 WARN L191 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 169 DAG size of output: 84 [2019-09-16 16:41:39,879 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2019-09-16 16:41:40,066 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-09-16 16:41:42,437 WARN L191 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 182 DAG size of output: 141 [2019-09-16 16:41:42,637 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 77 [2019-09-16 16:41:43,573 WARN L191 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 96 [2019-09-16 16:41:45,097 WARN L191 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 135 DAG size of output: 68 [2019-09-16 16:41:46,703 WARN L191 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 146 DAG size of output: 79 [2019-09-16 16:41:48,177 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 115 DAG size of output: 85 [2019-09-16 16:41:48,306 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 1 [2019-09-16 16:41:50,368 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 133 DAG size of output: 88 [2019-09-16 16:41:52,057 WARN L191 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 138 DAG size of output: 109 [2019-09-16 16:41:53,402 WARN L191 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 117 DAG size of output: 74 [2019-09-16 16:41:54,018 WARN L191 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2019-09-16 16:41:57,905 WARN L191 SmtUtils]: Spent 3.88 s on a formula simplification. DAG size of input: 173 DAG size of output: 99 [2019-09-16 16:41:58,052 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 1 [2019-09-16 16:41:58,272 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 1 [2019-09-16 16:42:01,374 WARN L191 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 193 DAG size of output: 145 [2019-09-16 16:42:01,523 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2019-09-16 16:42:01,900 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2019-09-16 16:42:06,181 WARN L191 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 253 DAG size of output: 174 [2019-09-16 16:42:07,462 WARN L191 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 112 DAG size of output: 63 [2019-09-16 16:42:09,088 WARN L191 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-09-16 16:42:10,184 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 142 DAG size of output: 115 [2019-09-16 16:42:14,580 WARN L191 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 176 DAG size of output: 86 [2019-09-16 16:42:15,254 WARN L191 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-09-16 16:42:16,183 WARN L191 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 96 [2019-09-16 16:42:18,324 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 117 DAG size of output: 80 [2019-09-16 16:42:20,532 WARN L191 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 174 DAG size of output: 134 [2019-09-16 16:42:24,820 WARN L191 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 253 DAG size of output: 174 [2019-09-16 16:42:24,825 INFO L439 ceAbstractionStarter]: At program point L95-1(lines 83 114) the Hoare annotation is: (let ((.cse29 (= 1 ~m_pc~0))) (let ((.cse27 (<= ~token~0 ~local~0)) (.cse6 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse28 (<= ~local~0 ~token~0)) (.cse23 (not (<= |old(~token~0)| ~local~0))) (.cse9 (= |old(~t1_pc~0)| 1)) (.cse24 (not (<= ~local~0 |old(~token~0)|))) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (= |old(~t1_st~0)| 0)) (.cse4 (<= 2 ~m_st~0)) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not .cse29)) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (<= 2 |old(~t2_st~0)|))) (.cse2 (= ~T2_E~0 1)) (.cse11 (= ~T2_E~0 0)) (.cse12 (= 1 ~M_E~0)) (.cse13 (= 1 ~E_M~0)) (.cse25 (not (= 0 |old(~m_st~0)|))) (.cse14 (not (= ~m_i~0 1))) (.cse30 (= 1 ~t2_pc~0)) (.cse15 (= 1 ~E_1~0)) (.cse16 (= 1 |old(~E_2~0)|)) (.cse18 (= 0 ~E_1~0)) (.cse19 (not (= 1 ~t1_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse21 (= 0 |old(~E_2~0)|)) (.cse3 (not (= 1 ~E_2~0))) (.cse26 (= ~m_st~0 0)) (.cse7 (<= 2 ~t2_st~0)) (.cse5 (not (= ~E_2~0 0)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse23 .cse24 .cse9 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 (and .cse3 .cse26 .cse27 .cse5 .cse6 .cse7 .cse8 .cse28) .cse29) (or .cse0 .cse2 .cse10 (and .cse6 .cse3 .cse4 .cse8 .cse5) .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse2 .cse23 .cse24 .cse9 .cse11 .cse12 .cse13 .cse25 .cse14 .cse30 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 (and .cse3 .cse26 .cse27 .cse5 .cse6 .cse8 .cse28) .cse29) (let ((.cse31 (= 1 ~t1_pc~0))) (or .cse0 .cse1 .cse2 .cse23 (not .cse9) .cse24 .cse10 .cse11 (and .cse31 .cse3 .cse4 .cse5 .cse7 .cse8) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and .cse31 .cse3 .cse4 (<= ~token~0 (+ |old(~token~0)| 1)) .cse5 .cse8 (<= (+ ~local~0 1) ~token~0)) .cse18 .cse19 .cse20 .cse21 .cse22)) (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse7 .cse5) .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse11 .cse12 .cse13 .cse25 .cse14 .cse30 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 (and .cse3 .cse26 .cse7 .cse5) .cse29)))) [2019-09-16 16:42:24,825 INFO L443 ceAbstractionStarter]: For program point L87(lines 87 91) no Hoare annotation was computed. [2019-09-16 16:42:24,825 INFO L439 ceAbstractionStarter]: At program point transmit1ENTRY(lines 80 115) the Hoare annotation is: (let ((.cse24 (= 1 ~m_pc~0))) (let ((.cse7 (= ~m_st~0 0)) (.cse10 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse14 (not (= 0 |old(~m_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse25 (not (<= 2 |old(~t2_st~0)|))) (.cse1 (= ~T2_E~0 1)) (.cse2 (not (<= |old(~token~0)| ~local~0))) (.cse4 (= |old(~t1_pc~0)| 1)) (.cse3 (not (<= ~local~0 |old(~token~0)|))) (.cse28 (not (<= 2 |old(~m_st~0)|))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse13 (= 1 ~E_M~0)) (.cse16 (= 1 ~t2_pc~0)) (.cse15 (not (= ~m_i~0 1))) (.cse17 (= 1 ~E_1~0)) (.cse26 (<= 2 ~m_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (= ~E_2~0 |old(~E_2~0)|)) (.cse27 (<= 2 ~t2_st~0)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse18 (= 1 |old(~E_2~0)|)) (.cse29 (not .cse24)) (.cse19 (= 0 ~E_1~0)) (.cse20 (not (= 1 ~t1_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse22 (= 0 |old(~E_2~0)|)) (.cse23 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse25 (and .cse26 .cse9 .cse10 .cse27 .cse11) .cse1 .cse4 .cse28 .cse5 .cse6 .cse13 .cse15 .cse17 .cse18 .cse29 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse25 .cse1 .cse28 .cse5 .cse6 .cse13 .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20 .cse21 .cse22 (and .cse26 .cse27 .cse9)) (or .cse0 .cse1 .cse28 .cse5 .cse6 .cse13 (and .cse26 .cse9 .cse10 .cse11) .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse25 .cse1 .cse5 .cse6 .cse13 .cse14 .cse15 .cse16 .cse17 (and .cse7 .cse27 .cse9) .cse18 .cse19 .cse20 .cse21 .cse22 .cse24) (or .cse0 .cse25 .cse1 (and .cse7 .cse8 .cse9 .cse10 .cse27 .cse11 .cse12) .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse25 .cse1 .cse2 (not .cse4) .cse3 .cse28 .cse5 .cse6 .cse13 (not .cse16) .cse15 .cse17 (and (= 1 ~t1_pc~0) .cse26 .cse8 .cse9 .cse27 .cse11 .cse12) .cse18 .cse29 .cse19 .cse20 .cse21 .cse22 .cse23)))) [2019-09-16 16:42:24,825 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-09-16 16:42:24,826 INFO L439 ceAbstractionStarter]: At program point L88(lines 83 114) the Hoare annotation is: (let ((.cse18 (= 1 ~m_pc~0))) (let ((.cse4 (= |old(~t1_pc~0)| 1)) (.cse8 (not (= 0 |old(~m_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse19 (not (<= 2 |old(~t2_st~0)|))) (.cse1 (= ~T2_E~0 1)) (.cse2 (not (<= |old(~token~0)| ~local~0))) (.cse3 (not (<= ~local~0 |old(~token~0)|))) (.cse20 (not (<= 2 |old(~m_st~0)|))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse10 (= 1 ~t2_pc~0)) (.cse9 (not (= ~m_i~0 1))) (.cse11 (= 1 ~E_1~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~m_st~0)) (.cse24 (= ~E_2~0 |old(~E_2~0)|)) (.cse23 (<= 2 ~t2_st~0)) (.cse26 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (= 1 |old(~E_2~0)|)) (.cse21 (not .cse18)) (.cse13 (= 0 ~E_1~0)) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (= 0 ~E_M~0)) (.cse16 (= 0 |old(~E_2~0)|)) (.cse17 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse19 .cse1 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 (and .cse22 .cse23 .cse24)) (or .cse0 .cse19 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and (= ~m_st~0 0) .cse23 .cse24) .cse12 .cse13 .cse14 .cse15 .cse16 .cse18) (or .cse0 .cse19 .cse1 .cse4 .cse20 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse4 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 (and .cse25 .cse22 .cse24 .cse26)) (or .cse0 .cse19 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 (not .cse10) .cse9 .cse11 (and .cse25 .cse22 (<= ~token~0 ~local~0) .cse24 .cse23 .cse26 (<= ~local~0 ~token~0)) .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-09-16 16:42:24,826 INFO L443 ceAbstractionStarter]: For program point transmit1EXIT(lines 80 115) no Hoare annotation was computed. [2019-09-16 16:42:24,826 INFO L439 ceAbstractionStarter]: At program point L109(lines 80 115) the Hoare annotation is: (let ((.cse30 (= 1 ~m_pc~0)) (.cse14 (= 1 ~t1_pc~0)) (.cse15 (not (= 1 ~E_2~0))) (.cse16 (<= 2 ~m_st~0)) (.cse17 (<= 2 ~t1_st~0)) (.cse27 (<= 2 ~t2_st~0)) (.cse18 (not (= ~E_2~0 0)))) (let ((.cse3 (not (<= |old(~token~0)| ~local~0))) (.cse4 (not (<= ~local~0 |old(~token~0)|))) (.cse26 (<= ~token~0 ~local~0)) (.cse28 (<= ~local~0 ~token~0)) (.cse25 (= ~m_st~0 0)) (.cse29 (not (= 0 |old(~m_st~0)|))) (.cse31 (= 1 ~t2_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (<= 2 |old(~t2_st~0)|))) (.cse2 (= ~T2_E~0 1)) (.cse24 (= |old(~t1_pc~0)| 1)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse6 (= ~T2_E~0 0)) (.cse7 (and .cse14 .cse15 .cse16 .cse17 .cse27 .cse18)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse10 (not (= ~m_i~0 1))) (.cse11 (= 1 ~E_1~0)) (.cse12 (= 1 |old(~E_2~0)|)) (.cse13 (not .cse30)) (.cse19 (= 0 ~E_1~0)) (.cse20 (not (= 1 ~t1_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse22 (= 0 |old(~E_2~0)|)) (.cse23 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and .cse14 .cse15 .cse16 .cse17 (<= ~token~0 (+ |old(~token~0)| 1)) .cse18 (<= (+ ~local~0 1) ~token~0)) .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 (and .cse14 .cse15 .cse25 .cse17 .cse26 .cse18 .cse27 .cse28) .cse6 .cse8 .cse9 .cse29 .cse10 .cse11 .cse12 .cse19 .cse20 .cse21 .cse22 .cse23 .cse30) (or .cse0 (and .cse14 .cse15 .cse16 .cse17 .cse18) .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse31 .cse11 .cse12 .cse13 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 (and .cse15 .cse16 .cse27 .cse18) .cse5 .cse6 .cse8 .cse9 .cse10 .cse31 .cse11 .cse12 .cse13 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse2 .cse3 .cse4 .cse24 .cse6 .cse8 .cse9 .cse29 .cse10 .cse31 .cse11 .cse12 (and .cse14 .cse15 .cse25 .cse17 .cse26 .cse18 .cse28) .cse19 .cse20 .cse21 .cse22 .cse23 .cse30) (or (and .cse15 .cse25 .cse27 .cse18) .cse0 .cse1 .cse2 .cse6 .cse8 .cse9 .cse29 .cse10 .cse31 .cse11 .cse12 .cse19 .cse20 .cse21 .cse22 .cse30) (or .cse0 .cse1 .cse2 .cse24 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse20 .cse21 .cse22 .cse23)))) [2019-09-16 16:42:24,827 INFO L439 ceAbstractionStarter]: At program point L105(line 105) the Hoare annotation is: (let ((.cse18 (= 1 ~m_pc~0))) (let ((.cse4 (= |old(~t1_pc~0)| 1)) (.cse8 (not (= 0 |old(~m_st~0)|))) (.cse25 (= 1 ~t1_pc~0)) (.cse20 (<= 2 ~m_st~0)) (.cse22 (not (= ~E_2~0 0))) (.cse21 (<= 2 ~t2_st~0)) (.cse26 (= |old(~t1_st~0)| ~t1_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse19 (not (<= 2 |old(~t2_st~0)|))) (.cse1 (= ~T2_E~0 1)) (.cse2 (not (<= |old(~token~0)| ~local~0))) (.cse3 (not (<= ~local~0 |old(~token~0)|))) (.cse23 (not (<= 2 |old(~m_st~0)|))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse10 (= 1 ~t2_pc~0)) (.cse9 (not (= ~m_i~0 1))) (.cse11 (= 1 ~E_1~0)) (.cse12 (= 1 |old(~E_2~0)|)) (.cse24 (not .cse18)) (.cse13 (= 0 ~E_1~0)) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (= 0 ~E_M~0)) (.cse16 (= 0 |old(~E_2~0)|)) (.cse17 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse19 .cse1 (and .cse20 .cse21 .cse22) .cse23 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse23 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 (and .cse25 .cse20 .cse26 .cse22)) (or .cse0 .cse19 .cse1 .cse4 .cse23 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse4 .cse23 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 (and (= ~m_st~0 0) .cse21 .cse22) .cse19 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18) (or (and .cse25 .cse20 (<= ~token~0 (+ |old(~token~0)| 1)) .cse22 .cse21 .cse26 (<= (+ ~local~0 1) ~token~0)) .cse0 .cse19 .cse1 .cse2 .cse3 .cse23 .cse5 .cse6 .cse7 (not .cse10) .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-09-16 16:42:24,827 INFO L443 ceAbstractionStarter]: For program point L105-1(line 105) no Hoare annotation was computed. [2019-09-16 16:42:24,827 INFO L443 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 440 450) no Hoare annotation was computed. [2019-09-16 16:42:24,827 INFO L439 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 440 450) the Hoare annotation is: (let ((.cse8 (= 1 ~t2_pc~0)) (.cse15 (<= 2 ~t2_st~0)) (.cse24 (= ~t1_pc~0 1)) (.cse14 (= 1 ~m_pc~0)) (.cse18 (<= 2 ~m_st~0)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse23 (= |old(~t1_st~0)| 0))) (let ((.cse5 (not .cse23)) (.cse26 (and .cse18 .cse19)) (.cse20 (not (<= 2 |old(~m_st~0)|))) (.cse16 (= 1 ~E_1~0)) (.cse22 (not .cse14)) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (<= 2 |old(~t2_st~0)|))) (.cse2 (= ~T2_E~0 1)) (.cse30 (not (<= ~token~0 ~local~0))) (.cse17 (not .cse24)) (.cse31 (not (<= ~local~0 ~token~0))) (.cse25 (and .cse15 .cse19)) (.cse3 (= ~T2_E~0 0)) (.cse4 (= 1 ~M_E~0)) (.cse6 (= 1 ~E_M~0)) (.cse28 (not .cse8)) (.cse29 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (not (= ~m_i~0 1))) (.cse9 (= 1 ~E_2~0)) (.cse10 (= 0 ~E_1~0)) (.cse11 (not (= 1 ~t1_i~0))) (.cse12 (= 0 ~E_M~0)) (.cse13 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 (= 0 ~t1_st~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 (and (= ~m_st~0 0) .cse15) .cse3 .cse4 .cse6 (not (= 0 |old(~m_st~0)|)) .cse7 .cse8 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse21 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse17 (and .cse18 .cse15 .cse19) .cse20 .cse3 .cse4 .cse6 (not (<= .cse21 ~token~0)) .cse7 .cse16 .cse22 .cse10 .cse11 (not (<= ~token~0 .cse21)) .cse12 .cse13 .cse23)) (or .cse0 .cse2 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14) (or .cse0 .cse1 .cse2 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14) (let ((.cse27 (+ ~local~0 2))) (or .cse0 .cse2 .cse26 (not (<= ~token~0 .cse27)) .cse17 .cse20 .cse3 .cse4 .cse28 .cse29 .cse7 .cse16 .cse9 .cse22 .cse10 .cse11 .cse12 .cse13 (not (<= .cse27 ~token~0)))) (or .cse26 .cse0 .cse2 .cse17 .cse20 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16 .cse22 .cse10 .cse11 .cse12 .cse13 .cse23) (or (and .cse18 .cse15) .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16 .cse22 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse30 .cse19 .cse17 .cse31 .cse3 .cse4 .cse6 .cse29 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse30 .cse17 .cse31 .cse25 .cse3 .cse4 .cse6 .cse28 .cse29 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2019-09-16 16:42:24,827 INFO L443 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 440 450) no Hoare annotation was computed. [2019-09-16 16:42:24,827 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 419) no Hoare annotation was computed. [2019-09-16 16:42:24,828 INFO L439 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0 1)) (.cse15 (= 1 ~m_pc~0)) (.cse32 (= |old(~t1_st~0)| 0)) (.cse8 (= 1 ~t2_pc~0)) (.cse38 (<= 2 ~m_st~0)) (.cse30 (= |old(~t1_st~0)| ~t1_st~0)) (.cse39 (+ ~local~0 1)) (.cse29 (= ~m_st~0 0)) (.cse21 (<= 2 ~t2_st~0))) (let ((.cse6 (and .cse29 .cse21)) (.cse25 (not (<= .cse39 ~token~0))) (.cse26 (not (<= ~token~0 .cse39))) (.cse19 (and .cse38 .cse30)) (.cse34 (and .cse21 .cse30)) (.cse36 (not .cse8)) (.cse31 (and .cse38 .cse21 .cse30)) (.cse33 (= 0 ~t1_st~0)) (.cse5 (not (= 0 |old(~m_st~0)|))) (.cse18 (not .cse32)) (.cse37 (and .cse38 .cse21)) (.cse1 (not (<= 2 |old(~t2_st~0)|))) (.cse17 (not (<= 2 |old(~m_st~0)|))) (.cse9 (= 1 ~E_1~0)) (.cse20 (not .cse15)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse27 (not (<= ~token~0 ~local~0))) (.cse23 (not .cse16)) (.cse28 (not (<= ~local~0 ~token~0))) (.cse3 (= ~T2_E~0 0)) (.cse22 (= 1 ~M_E~0)) (.cse4 (= 1 ~E_M~0)) (.cse24 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (not (= ~m_i~0 1))) (.cse10 (= 1 ~E_2~0)) (.cse11 (= 0 ~E_1~0)) (.cse12 (not (= 1 ~t1_i~0))) (.cse13 (= 0 ~E_M~0)) (.cse14 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse16 .cse17 .cse3 .cse18 .cse4 .cse19 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse22 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse23 .cse17 .cse3 .cse4 .cse24 .cse25 .cse7 .cse9 .cse10 .cse20 .cse19 .cse11 .cse12 .cse26 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse6 .cse3 .cse22 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse27 .cse28 .cse16 .cse3 .cse18 (and .cse29 .cse30) .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse23 .cse31 .cse17 .cse3 .cse22 .cse4 .cse25 .cse7 .cse9 .cse20 .cse11 .cse12 .cse26 .cse13 .cse14 .cse32) (or .cse0 .cse1 .cse2 .cse17 .cse33 .cse3 .cse18 .cse4 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse16 .cse3 .cse22 .cse18 .cse4 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse34 .cse15) (let ((.cse35 (+ ~local~0 2))) (or .cse0 .cse2 .cse19 (not (<= ~token~0 .cse35)) .cse23 .cse17 .cse3 .cse22 .cse36 .cse24 .cse7 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 (not (<= .cse35 ~token~0)))) (or .cse19 .cse0 .cse2 .cse23 .cse17 .cse3 .cse22 .cse4 .cse7 .cse8 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse32) (or .cse19 .cse0 .cse2 .cse23 .cse17 .cse3 .cse4 .cse24 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse27 .cse23 .cse28 .cse34 .cse3 .cse22 .cse4 .cse36 .cse24 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse37 .cse0 .cse1 .cse2 .cse17 .cse3 .cse22 .cse4 .cse7 .cse8 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse23 .cse17 .cse3 .cse4 .cse24 .cse7 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse31) (or .cse0 .cse31 .cse1 .cse2 .cse16 .cse17 .cse3 .cse18 .cse4 .cse7 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse33 .cse3 .cse22 .cse18 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse33 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse16 .cse3 .cse22 .cse18 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15) (or .cse0 .cse37 .cse1 .cse2 .cse17 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse27 .cse30 .cse23 .cse28 .cse3 .cse22 .cse4 .cse24 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2019-09-16 16:42:24,828 INFO L439 ceAbstractionStarter]: At program point L415-2(lines 415 419) the Hoare annotation is: (let ((.cse38 (= |old(~t1_st~0)| 0)) (.cse15 (= 1 ~m_pc~0)) (.cse40 (+ ~local~0 1)) (.cse3 (= ~t1_pc~0 1)) (.cse41 (<= 2 ~m_st~0)) (.cse33 (= ~m_st~0 0)) (.cse39 (<= 2 ~t2_st~0)) (.cse17 (= 1 ~t2_pc~0)) (.cse35 (= 0 activate_threads_~tmp~1)) (.cse34 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse24 (and .cse35 .cse34)) (.cse32 (not .cse17)) (.cse4 (and .cse35 .cse39 .cse34)) (.cse25 (and .cse33 .cse35 .cse39)) (.cse20 (and .cse41 .cse35 .cse39)) (.cse28 (not (<= ~token~0 ~local~0))) (.cse29 (not (<= ~local~0 ~token~0))) (.cse22 (not (<= 2 |old(~t1_st~0)|))) (.cse30 (and .cse41 .cse35 .cse34)) (.cse21 (not .cse3)) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse23 (and .cse41 .cse35 .cse39 .cse34)) (.cse36 (not (<= .cse40 ~token~0))) (.cse19 (not .cse15)) (.cse37 (not (<= ~token~0 .cse40))) (.cse6 (= 1 ~M_E~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (<= 2 |old(~t2_st~0)|))) (.cse2 (= ~T2_E~0 1)) (.cse5 (= ~T2_E~0 0)) (.cse7 (not .cse38)) (.cse8 (= 1 ~E_M~0)) (.cse27 (= 0 ~t1_st~0)) (.cse26 (not (= 0 |old(~m_st~0)|))) (.cse9 (not (= ~m_i~0 1))) (.cse18 (= 1 ~E_1~0)) (.cse10 (= 1 ~E_2~0)) (.cse11 (= 0 ~E_1~0)) (.cse12 (not (= 1 ~t1_i~0))) (.cse13 (= 0 ~E_M~0)) (.cse14 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse16 .cse5 .cse6 .cse8 .cse9 .cse17 .cse18 .cse19 .cse11 .cse12 .cse13 .cse14 .cse20) (or .cse0 .cse1 .cse2 .cse21 .cse16 .cse5 .cse8 .cse22 .cse9 .cse18 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 .cse23) (or .cse0 .cse2 .cse3 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse25 .cse8 .cse26 .cse9 .cse17 .cse18 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27) (or .cse24 .cse0 .cse2 .cse28 .cse21 .cse29 .cse5 .cse6 .cse8 .cse22 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse31 (+ ~local~0 2))) (or .cse30 .cse0 .cse2 (not (<= ~token~0 .cse31)) .cse21 .cse16 .cse5 .cse6 .cse32 .cse22 .cse9 .cse18 .cse10 .cse19 (and .cse33 .cse8 .cse34) .cse11 .cse12 .cse13 .cse14 (not (<= .cse31 ~token~0)))) (or .cse0 .cse2 .cse21 .cse30 .cse16 .cse5 .cse8 .cse22 .cse9 .cse17 .cse18 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse28 .cse21 .cse29 .cse5 .cse6 .cse8 .cse32 .cse22 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse5 .cse8 .cse26 .cse9 .cse17 .cse18 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse16 .cse5 .cse8 .cse9 .cse17 .cse18 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 .cse20) (or .cse0 .cse2 .cse3 .cse16 .cse5 .cse7 .cse8 .cse30 .cse9 .cse17 .cse18 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse16 .cse5 .cse7 .cse8 .cse9 .cse18 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse28 .cse29 .cse3 .cse5 .cse7 .cse8 .cse26 .cse9 .cse17 .cse18 .cse10 (and .cse33 .cse35 .cse34) .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse16 .cse5 .cse7 .cse8 .cse9 .cse17 .cse18 .cse10 .cse19 .cse27 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse21 .cse16 .cse5 .cse8 .cse22 .cse36 .cse9 .cse18 .cse10 .cse19 .cse30 .cse11 .cse12 .cse37 .cse13 .cse14) (or .cse0 .cse2 .cse21 .cse16 .cse5 .cse6 .cse8 .cse9 .cse17 .cse18 .cse19 .cse11 .cse12 .cse13 .cse14 .cse38 .cse30) (or .cse0 .cse1 .cse2 .cse21 .cse16 .cse5 .cse23 .cse6 .cse8 .cse36 .cse9 .cse18 .cse19 .cse11 .cse12 .cse37 .cse13 .cse14 .cse38) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and .cse35 .cse39)) (or .cse0 .cse1 .cse2 .cse5 .cse7 .cse8 .cse27 .cse26 .cse9 .cse17 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2019-09-16 16:42:24,828 INFO L443 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2019-09-16 16:42:24,829 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 435) no Hoare annotation was computed. [2019-09-16 16:42:24,829 INFO L439 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 406 439) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0 1)) (.cse15 (= 1 ~m_pc~0)) (.cse32 (= |old(~t1_st~0)| 0)) (.cse8 (= 1 ~t2_pc~0)) (.cse38 (<= 2 ~m_st~0)) (.cse30 (= |old(~t1_st~0)| ~t1_st~0)) (.cse39 (+ ~local~0 1)) (.cse29 (= ~m_st~0 0)) (.cse21 (<= 2 ~t2_st~0))) (let ((.cse6 (and .cse29 .cse21)) (.cse25 (not (<= .cse39 ~token~0))) (.cse26 (not (<= ~token~0 .cse39))) (.cse19 (and .cse38 .cse30)) (.cse34 (and .cse21 .cse30)) (.cse36 (not .cse8)) (.cse31 (and .cse38 .cse21 .cse30)) (.cse33 (= 0 ~t1_st~0)) (.cse5 (not (= 0 |old(~m_st~0)|))) (.cse18 (not .cse32)) (.cse37 (and .cse38 .cse21)) (.cse1 (not (<= 2 |old(~t2_st~0)|))) (.cse17 (not (<= 2 |old(~m_st~0)|))) (.cse9 (= 1 ~E_1~0)) (.cse20 (not .cse15)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse27 (not (<= ~token~0 ~local~0))) (.cse23 (not .cse16)) (.cse28 (not (<= ~local~0 ~token~0))) (.cse3 (= ~T2_E~0 0)) (.cse22 (= 1 ~M_E~0)) (.cse4 (= 1 ~E_M~0)) (.cse24 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (not (= ~m_i~0 1))) (.cse10 (= 1 ~E_2~0)) (.cse11 (= 0 ~E_1~0)) (.cse12 (not (= 1 ~t1_i~0))) (.cse13 (= 0 ~E_M~0)) (.cse14 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse16 .cse17 .cse3 .cse18 .cse4 .cse19 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse22 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse23 .cse17 .cse3 .cse4 .cse24 .cse25 .cse7 .cse9 .cse10 .cse20 .cse19 .cse11 .cse12 .cse26 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse6 .cse3 .cse22 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse27 .cse28 .cse16 .cse3 .cse18 (and .cse29 .cse30) .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse23 .cse31 .cse17 .cse3 .cse22 .cse4 .cse25 .cse7 .cse9 .cse20 .cse11 .cse12 .cse26 .cse13 .cse14 .cse32) (or .cse0 .cse1 .cse2 .cse17 .cse33 .cse3 .cse18 .cse4 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse16 .cse3 .cse22 .cse18 .cse4 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse34 .cse15) (let ((.cse35 (+ ~local~0 2))) (or .cse0 .cse2 .cse19 (not (<= ~token~0 .cse35)) .cse23 .cse17 .cse3 .cse22 .cse36 .cse24 .cse7 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 (not (<= .cse35 ~token~0)))) (or .cse19 .cse0 .cse2 .cse23 .cse17 .cse3 .cse22 .cse4 .cse7 .cse8 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14 .cse32) (or .cse19 .cse0 .cse2 .cse23 .cse17 .cse3 .cse4 .cse24 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse27 .cse23 .cse28 .cse34 .cse3 .cse22 .cse4 .cse36 .cse24 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse37 .cse0 .cse1 .cse2 .cse17 .cse3 .cse22 .cse4 .cse7 .cse8 .cse9 .cse20 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse23 .cse17 .cse3 .cse4 .cse24 .cse7 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse31) (or .cse0 .cse31 .cse1 .cse2 .cse16 .cse17 .cse3 .cse18 .cse4 .cse7 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse33 .cse3 .cse22 .cse18 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse33 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse16 .cse3 .cse22 .cse18 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15) (or .cse0 .cse37 .cse1 .cse2 .cse17 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse27 .cse30 .cse23 .cse28 .cse3 .cse22 .cse4 .cse24 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2019-09-16 16:42:24,829 INFO L443 ceAbstractionStarter]: For program point L429(line 429) no Hoare annotation was computed. [2019-09-16 16:42:24,829 INFO L443 ceAbstractionStarter]: For program point L431-2(lines 406 439) no Hoare annotation was computed. [2019-09-16 16:42:24,830 INFO L443 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 406 439) no Hoare annotation was computed. [2019-09-16 16:42:24,830 INFO L443 ceAbstractionStarter]: For program point L423(lines 423 427) no Hoare annotation was computed. [2019-09-16 16:42:24,830 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-09-16 16:42:24,830 INFO L439 ceAbstractionStarter]: At program point L423-2(lines 423 427) the Hoare annotation is: (let ((.cse20 (= ~t1_pc~0 1)) (.cse28 (= 1 ~m_pc~0)) (.cse40 (= |old(~t1_st~0)| 0)) (.cse42 (+ ~local~0 1)) (.cse24 (= ~m_st~0 0)) (.cse23 (= 1 ~t2_pc~0)) (.cse27 (= |old(~t1_st~0)| ~t1_st~0)) (.cse25 (= activate_threads_~tmp___0~0 0)) (.cse41 (<= 2 ~m_st~0)) (.cse26 (= 0 activate_threads_~tmp~1)) (.cse32 (<= 2 ~t2_st~0))) (let ((.cse30 (and .cse25 .cse41 .cse26 .cse32)) (.cse33 (and .cse25 .cse26 .cse32 .cse27)) (.cse35 (not .cse23)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse37 (and .cse25 .cse24 .cse26 .cse32)) (.cse8 (not (<= .cse42 ~token~0))) (.cse15 (not (<= ~token~0 .cse42))) (.cse38 (and .cse41 .cse25 .cse26 .cse32 .cse27)) (.cse21 (not .cse40)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse6 (and .cse41 .cse25 .cse26 .cse27)) (.cse12 (not .cse28)) (.cse36 (and .cse25 .cse26 .cse27)) (.cse18 (not (<= ~token~0 ~local~0))) (.cse2 (not .cse20)) (.cse19 (not (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse29 (not (<= 2 |old(~t2_st~0)|))) (.cse1 (= ~T2_E~0 1)) (.cse4 (= ~T2_E~0 0)) (.cse31 (= 0 ~t1_st~0)) (.cse10 (= 1 ~E_1~0)) (.cse34 (= 1 ~M_E~0)) (.cse5 (= 1 ~E_M~0)) (.cse9 (not (= ~m_i~0 1))) (.cse11 (= 1 ~E_2~0)) (.cse13 (= 0 ~E_1~0)) (.cse14 (not (= 1 ~t1_i~0))) (.cse16 (= 0 ~E_M~0)) (.cse17 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse18 .cse19 .cse20 .cse4 .cse21 .cse5 .cse22 .cse9 .cse23 .cse10 (and .cse24 .cse25 .cse26 .cse27) .cse11 .cse13 .cse14 .cse16 .cse17 .cse28) (or .cse0 .cse29 .cse1 .cse3 .cse4 .cse30 .cse5 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse29 .cse1 .cse18 .cse2 .cse19 .cse4 (and .cse10 .cse26 .cse31 .cse32) .cse33 .cse34 .cse5 .cse35 .cse7 .cse9 .cse11 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse1 .cse20 .cse4 .cse34 .cse21 .cse5 .cse9 .cse23 .cse36 .cse11 .cse13 .cse14 .cse16 .cse17 .cse28) (or .cse0 .cse29 .cse1 .cse4 .cse21 .cse5 .cse22 .cse9 .cse23 .cse10 .cse31 .cse11 .cse13 .cse14 .cse16 .cse17 .cse28) (or .cse0 .cse29 .cse37 .cse1 .cse4 .cse34 .cse5 .cse22 .cse9 .cse23 .cse10 .cse13 .cse14 .cse16 .cse17 .cse28) (or .cse0 .cse29 .cse1 .cse3 .cse4 .cse34 .cse5 .cse9 .cse23 .cse10 .cse12 .cse30 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse31 .cse29 .cse1 .cse3 .cse4 .cse21 .cse5 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse29 .cse1 .cse33 .cse20 .cse4 .cse34 .cse21 .cse5 .cse9 .cse11 .cse13 .cse14 .cse16 .cse17 .cse28) (or .cse0 .cse29 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse38) (let ((.cse39 (+ ~local~0 2))) (or (and .cse24 .cse25 .cse5 .cse27) .cse0 .cse6 .cse1 (not (<= ~token~0 .cse39)) .cse2 .cse3 .cse4 .cse34 .cse35 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 (not (<= .cse39 ~token~0)))) (or .cse0 .cse29 .cse1 .cse4 .cse5 .cse22 .cse9 .cse23 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse37 .cse28) (or .cse0 .cse6 .cse1 .cse2 .cse3 .cse4 .cse34 .cse5 .cse9 .cse23 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse40) (or .cse38 .cse0 .cse29 .cse1 .cse2 .cse3 .cse4 .cse34 .cse5 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse40) (or .cse0 .cse29 .cse1 .cse20 .cse3 .cse4 .cse21 .cse38 .cse5 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse1 .cse20 .cse3 .cse4 .cse21 .cse5 .cse6 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse29 .cse1 .cse4 .cse34 .cse21 .cse5 .cse31 .cse9 .cse23 .cse11 .cse13 .cse14 .cse16 .cse17 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5 .cse7 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse36 .cse1 .cse18 .cse2 .cse19 .cse4 (and .cse10 .cse26 .cse31) .cse34 .cse5 .cse7 .cse9 .cse23 .cse11 .cse13 .cse14 .cse16 .cse17 .cse28) (or .cse0 .cse29 .cse1 (and .cse25 .cse26 .cse32) .cse4 (and .cse26 .cse31 .cse32 .cse10) .cse34 .cse5 .cse9 .cse23 .cse11 .cse13 .cse14 .cse16 .cse17 .cse28)))) [2019-09-16 16:42:24,831 INFO L439 ceAbstractionStarter]: At program point L124(lines 119 150) the Hoare annotation is: (let ((.cse20 (= 1 ~m_pc~0)) (.cse22 (= ~t1_pc~0 1))) (let ((.cse2 (not .cse22)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (not .cse20)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse17 (not (<= |old(~token~0)| ~local~0))) (.cse18 (not (<= ~local~0 |old(~token~0)|))) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse6 (= 1 |old(~E_M~0)|)) (.cse19 (not (= 0 |old(~m_st~0)|))) (.cse8 (not (= ~m_i~0 1))) (.cse9 (= 1 |old(~t2_pc~0)|)) (.cse10 (= 1 ~E_1~0)) (.cse11 (= 1 ~E_2~0)) (.cse13 (= 0 ~E_1~0)) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (= 0 |old(~E_M~0)|)) (.cse16 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse17 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse20) (or .cse0 .cse1 .cse17 .cse18 .cse3 .cse4 .cse5 .cse21 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse22 .cse3 .cse4 .cse5 .cse21 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse23 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= .cse23 |old(~token~0)|)) .cse8 .cse10 (and (<= 2 ~m_st~0) (= |old(~token~0)| ~token~0) (= 1 ~t2_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|)) .cse11 .cse12 .cse13 .cse14 (not (<= |old(~token~0)| .cse23)) .cse15 .cse16)) (or .cse0 .cse1 .cse17 .cse18 .cse22 .cse4 .cse5 .cse21 .cse6 .cse19 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse20)))) [2019-09-16 16:42:24,831 INFO L439 ceAbstractionStarter]: At program point L145(lines 116 151) the Hoare annotation is: (let ((.cse33 (= 1 ~m_pc~0)) (.cse3 (= ~t1_pc~0 1)) (.cse19 (= ~m_st~0 0)) (.cse34 (<= ~token~0 ~local~0)) (.cse36 (<= ~local~0 ~token~0)) (.cse28 (<= 2 ~m_st~0)) (.cse23 (= 1 ~t2_pc~0)) (.cse24 (<= 2 ~t2_st~0)) (.cse25 (= |old(~t1_st~0)| ~t1_st~0)) (.cse35 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse26 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (and .cse28 .cse23 .cse24 .cse25 .cse35)) (.cse32 (and .cse19 .cse34 .cse23 .cse24 .cse25 .cse35 .cse36)) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse29 (not (<= |old(~token~0)| ~local~0))) (.cse18 (not .cse3)) (.cse30 (not (<= ~local~0 |old(~token~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (not (= |old(~t1_st~0)| 0))) (.cse8 (= 1 |old(~E_M~0)|)) (.cse9 (not (= ~m_i~0 1))) (.cse10 (= 1 |old(~t2_pc~0)|)) (.cse11 (= 1 ~E_1~0)) (.cse12 (= 1 ~E_2~0)) (.cse13 (not .cse33)) (.cse14 (= 0 ~E_1~0)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (= 0 |old(~E_M~0)|)) (.cse17 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse20 (not (= ~E_M~0 0))) (.cse21 (not (= ~E_M~0 1))) (.cse27 (+ ~local~0 1))) (or .cse0 .cse1 .cse18 (let ((.cse22 (+ ~local~0 2))) (and .cse19 .cse20 .cse21 (<= ~token~0 .cse22) .cse23 .cse24 .cse25 (<= .cse22 ~token~0))) .cse4 .cse5 .cse6 .cse8 .cse26 (not (<= .cse27 |old(~token~0)|)) .cse9 .cse11 .cse12 .cse13 .cse14 (and .cse28 .cse20 .cse21 .cse23 .cse24 .cse25) .cse15 (not (<= |old(~token~0)| .cse27)) .cse16 .cse17)) (or .cse0 .cse1 .cse29 .cse18 .cse30 .cse5 .cse6 .cse8 .cse26 .cse31 .cse32 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse33) (or .cse0 .cse1 .cse18 .cse4 .cse5 .cse6 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse32 .cse29 .cse30 .cse3 .cse5 .cse6 .cse7 .cse8 .cse31 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse33) (or .cse0 .cse1 .cse29 .cse18 .cse30 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse28 .cse34 .cse23 .cse24 .cse25 .cse35 .cse36) .cse15 .cse16 .cse17)))) [2019-09-16 16:42:24,832 INFO L443 ceAbstractionStarter]: For program point transmit2EXIT(lines 116 151) no Hoare annotation was computed. [2019-09-16 16:42:24,832 INFO L439 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: (let ((.cse20 (= 1 ~m_pc~0)) (.cse22 (= ~t1_pc~0 1))) (let ((.cse2 (not .cse22)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (not .cse20)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse17 (not (<= |old(~token~0)| ~local~0))) (.cse18 (not (<= ~local~0 |old(~token~0)|))) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse6 (= 1 |old(~E_M~0)|)) (.cse19 (not (= 0 |old(~m_st~0)|))) (.cse8 (not (= ~m_i~0 1))) (.cse9 (= 1 |old(~t2_pc~0)|)) (.cse10 (= 1 ~E_1~0)) (.cse11 (= 1 ~E_2~0)) (.cse13 (= 0 ~E_1~0)) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (= 0 |old(~E_M~0)|)) (.cse16 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse17 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse20) (or .cse0 .cse1 .cse17 .cse18 .cse3 .cse4 .cse5 .cse21 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse22 .cse3 .cse4 .cse5 .cse21 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse24 (+ ~local~0 1))) (or (let ((.cse23 (+ ~local~0 2))) (and (<= 2 ~m_st~0) (not (= ~E_M~0 0)) (<= ~token~0 .cse23) (= 1 ~t2_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (<= .cse23 ~token~0))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= .cse24 |old(~token~0)|)) .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (not (<= |old(~token~0)| .cse24)) .cse15 .cse16)) (or .cse0 .cse1 .cse17 .cse18 .cse22 .cse4 .cse5 .cse21 .cse6 .cse19 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse20)))) [2019-09-16 16:42:24,832 INFO L443 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2019-09-16 16:42:24,832 INFO L439 ceAbstractionStarter]: At program point L131-1(lines 119 150) the Hoare annotation is: (let ((.cse30 (= 1 ~m_pc~0)) (.cse32 (= ~t1_pc~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 0))) (let ((.cse31 (and (= ~m_pc~0 1) (not .cse0) (not .cse4) (not (= ~E_1~0 0)) (= 0 ~t1_st~0))) (.cse23 (not (<= |old(~token~0)| ~local~0))) (.cse24 (not (<= ~local~0 |old(~token~0)|))) (.cse33 (not (= |old(~t1_st~0)| 0))) (.cse28 (not (= 0 |old(~m_st~0)|))) (.cse18 (= ~m_st~0 0)) (.cse25 (<= ~token~0 ~local~0)) (.cse27 (<= ~local~0 ~token~0)) (.cse1 (= ~T2_E~0 1)) (.cse2 (not .cse32)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (not (= ~m_i~0 1))) (.cse29 (= 1 |old(~t2_pc~0)|)) (.cse14 (= 1 ~E_1~0)) (.cse15 (= 1 ~E_2~0)) (.cse16 (not .cse30)) (.cse19 (= 0 ~E_1~0)) (.cse20 (not (= 1 ~t1_i~0))) (.cse21 (= 0 |old(~E_M~0)|)) (.cse22 (= 0 ~E_2~0)) (.cse9 (<= 2 ~m_st~0)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse26 (= ~E_M~0 |old(~E_M~0)|))) (and (let ((.cse8 (not (= ~E_M~0 0))) (.cse11 (not (= ~E_M~0 1))) (.cse12 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11) (not (<= .cse12 |old(~token~0)|)) .cse13 .cse14 .cse15 .cse16 (let ((.cse17 (+ ~local~0 2))) (and .cse10 (<= .cse17 ~token~0) (and .cse18 .cse8) .cse11 (<= ~token~0 .cse17))) .cse19 .cse20 (not (<= |old(~token~0)| .cse12)) .cse21 .cse22)) (or .cse0 .cse1 .cse23 .cse2 .cse24 (and .cse10 .cse25 .cse26 .cse27 .cse18) .cse4 .cse5 .cse6 .cse7 .cse28 .cse13 .cse29 .cse14 .cse15 .cse19 .cse20 .cse21 .cse22 .cse30) (or .cse0 .cse1 (and .cse9 .cse31 .cse26) .cse32 .cse3 .cse4 .cse5 .cse33 .cse6 .cse13 .cse29 .cse14 .cse15 .cse16 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse23 .cse2 .cse24 .cse3 .cse4 .cse5 .cse33 .cse6 .cse13 .cse29 .cse14 .cse15 .cse16 .cse19 .cse20 (and .cse9 .cse25 .cse31 .cse26 .cse27) .cse21 .cse22) (or .cse0 .cse1 .cse23 .cse24 .cse32 .cse4 .cse5 .cse33 .cse6 .cse28 .cse13 .cse29 .cse14 (and .cse18 .cse10 .cse25 .cse26 .cse27) .cse15 .cse19 .cse20 .cse21 .cse22 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse29 .cse14 .cse15 .cse16 .cse19 .cse20 .cse21 .cse22 (and .cse9 .cse10 .cse26))))) [2019-09-16 16:42:24,833 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 127) no Hoare annotation was computed. [2019-09-16 16:42:24,833 INFO L439 ceAbstractionStarter]: At program point transmit2ENTRY(lines 116 151) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0)) (.cse24 (<= 2 ~m_st~0)) (.cse30 (= ~t1_pc~0 1)) (.cse23 (not (= ~t2_pc~0 1))) (.cse25 (<= ~token~0 ~local~0)) (.cse26 (= |old(~t1_st~0)| ~t1_st~0)) (.cse27 (= ~E_M~0 |old(~E_M~0)|)) (.cse28 (<= ~local~0 ~token~0))) (let ((.cse19 (not (<= |old(~token~0)| ~local~0))) (.cse20 (not (<= ~local~0 |old(~token~0)|))) (.cse21 (not (= 0 |old(~m_st~0)|))) (.cse18 (and .cse23 (= ~m_st~0 0) .cse25 .cse26 .cse27 .cse28)) (.cse2 (not .cse30)) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~T2_E~0 1)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse29 (not (= |old(~t1_st~0)| 0))) (.cse7 (= 1 |old(~E_M~0)|)) (.cse9 (not (= ~m_i~0 1))) (.cse10 (= 1 |old(~t2_pc~0)|)) (.cse11 (= 1 ~E_1~0)) (.cse5 (and .cse23 .cse24 .cse26 .cse27)) (.cse12 (= 1 ~E_2~0)) (.cse13 (not .cse22)) (.cse14 (= 0 ~E_1~0)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (= 0 |old(~E_M~0)|)) (.cse17 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse19 .cse2 .cse20 .cse4 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse22) (or .cse0 .cse1 .cse19 .cse2 .cse20 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) .cse3 .cse4 .cse6 .cse29 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse19 .cse20 .cse30 .cse4 .cse6 .cse29 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse22) (let ((.cse31 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (not .cse10) .cse8 (not (<= .cse31 |old(~token~0)|)) .cse9 .cse11 (and .cse24 (= |old(~token~0)| ~token~0) (= 1 ~t2_pc~0) .cse26 .cse27) .cse12 .cse13 .cse14 .cse15 (not (<= |old(~token~0)| .cse31)) .cse16 .cse17)) (or .cse0 .cse1 .cse30 .cse3 .cse4 .cse6 .cse29 .cse7 .cse9 .cse10 .cse11 .cse5 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-09-16 16:42:24,833 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-09-16 16:42:24,833 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 240 264) no Hoare annotation was computed. [2019-09-16 16:42:24,833 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 257) no Hoare annotation was computed. [2019-09-16 16:42:24,834 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 258) no Hoare annotation was computed. [2019-09-16 16:42:24,834 INFO L446 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 240 264) the Hoare annotation is: true [2019-09-16 16:42:24,834 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 259) no Hoare annotation was computed. [2019-09-16 16:42:24,834 INFO L439 ceAbstractionStarter]: At program point L261(lines 243 263) the Hoare annotation is: (let ((.cse19 (= 1 ~m_pc~0)) (.cse20 (= ~t1_pc~0 1))) (let ((.cse1 (not (<= 2 ~t2_st~0))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse11 (not (= 0 ~m_st~0))) (.cse2 (= exists_runnable_thread_~__retres1~3 1)) (.cse0 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 1)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not .cse20)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse25 (not (<= 2 ~m_st~0))) (.cse7 (= ~T2_E~0 0)) (.cse8 (= 1 ~M_E~0)) (.cse21 (not (= ~t1_st~0 0))) (.cse9 (= 1 ~E_M~0)) (.cse12 (not (= ~m_i~0 1))) (.cse22 (= 1 ~t2_pc~0)) (.cse13 (= 1 ~E_1~0)) (.cse14 (= 1 ~E_2~0)) (.cse24 (not .cse19)) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse20 .cse7 .cse2 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse3 .cse4 .cse6 .cse20 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse22 .cse13 .cse14 .cse2 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse23 (+ ~local~0 2))) (or .cse0 .cse1 .cse3 (not (<= ~token~0 .cse23)) .cse5 .cse7 .cse2 .cse8 .cse9 (not .cse22) .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse15 .cse16 .cse17 .cse18 (not (<= .cse23 ~token~0)))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse25 .cse7 .cse8 .cse21 .cse9 .cse2 .cse12 .cse13 .cse14 .cse24 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse25 .cse7 .cse8 .cse21 .cse9 .cse12 .cse22 .cse13 .cse14 .cse24 .cse15 .cse16 .cse17 .cse18)))) [2019-09-16 16:42:24,834 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 240 264) no Hoare annotation was computed. [2019-09-16 16:42:24,834 INFO L443 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 171 189) no Hoare annotation was computed. [2019-09-16 16:42:24,835 INFO L439 ceAbstractionStarter]: At program point L186(lines 174 188) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0)) (.cse18 (= ~t1_st~0 0)) (.cse20 (= 1 ~t2_pc~0)) (.cse23 (= ~t1_pc~0 1)) (.cse8 (= 1 ~E_M~0)) (.cse31 (+ ~local~0 1))) (let ((.cse26 (not (<= ~token~0 ~local~0))) (.cse27 (not (<= ~local~0 ~token~0))) (.cse1 (not (<= 2 ~t2_st~0))) (.cse9 (not (<= .cse31 ~token~0))) (.cse15 (not (<= ~token~0 .cse31))) (.cse29 (not .cse8)) (.cse3 (not .cse23)) (.cse7 (= 1 ~M_E~0)) (.cse28 (not .cse20)) (.cse19 (not (<= 2 ~t1_st~0))) (.cse25 (not (= 0 ~m_st~0))) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse4 (= is_transmit1_triggered_~__retres1~1 0)) (.cse5 (not (<= 2 ~m_st~0))) (.cse6 (= ~T2_E~0 0)) (.cse24 (not .cse18)) (.cse10 (not (= ~m_i~0 1))) (.cse11 (= 1 ~E_1~0)) (.cse21 (= 1 ~E_2~0)) (.cse12 (not .cse22)) (.cse13 (= 0 ~E_1~0)) (.cse14 (not (= 1 ~t1_i~0))) (.cse16 (= 0 ~E_M~0)) (.cse17 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse4 .cse0 .cse2 .cse3 .cse5 .cse6 .cse8 .cse19 .cse10 .cse20 .cse11 .cse21 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse4 .cse11 .cse6 .cse7 .cse8 .cse10 .cse20 .cse21 .cse13 .cse14 .cse16 .cse17 .cse22) (or .cse0 .cse1 .cse2 .cse23 .cse5 .cse6 .cse24 .cse8 .cse10 .cse11 .cse21 .cse12 .cse13 .cse14 .cse16 .cse17 .cse4) (or .cse0 .cse4 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse4 .cse23 .cse6 .cse7 .cse24 .cse8 .cse10 .cse21 .cse13 .cse14 .cse16 .cse17 .cse22) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse8 .cse4 .cse10 .cse20 .cse11 .cse21 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse6 .cse4 .cse8 .cse25 .cse10 .cse20 .cse11 .cse21 .cse13 .cse14 .cse16 .cse17 .cse22) (or .cse0 .cse2 .cse26 .cse27 .cse23 .cse6 .cse24 .cse4 .cse8 .cse25 .cse10 .cse20 .cse11 .cse21 .cse13 .cse14 .cse16 .cse17 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse4 .cse19 .cse10 .cse11 .cse21 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse4 .cse2 .cse23 .cse6 .cse7 .cse24 .cse8 .cse10 .cse20 .cse21 .cse13 .cse14 .cse16 .cse17 .cse22) (or .cse0 .cse1 .cse2 .cse6 .cse7 .cse8 .cse25 .cse10 .cse20 .cse11 .cse13 .cse14 .cse16 .cse17 .cse4 .cse22) (or .cse0 .cse4 .cse2 .cse26 .cse3 .cse27 .cse6 .cse11 .cse7 .cse8 .cse19 .cse10 .cse20 .cse21 .cse13 .cse14 .cse16 .cse17 .cse22) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse27 .cse6 .cse7 .cse8 .cse28 .cse19 .cse10 .cse4 .cse21 .cse13 .cse14 .cse16 .cse17 .cse11) (or .cse29 .cse4 .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse28 .cse19 .cse10 .cse11 .cse21 .cse12 .cse13 .cse14 .cse17) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse4) (or .cse0 .cse4 .cse2 .cse3 .cse5 .cse6 .cse8 .cse19 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse30 (+ ~local~0 2))) (or .cse29 .cse0 .cse2 (not (<= ~token~0 .cse30)) .cse3 .cse4 .cse6 .cse7 .cse28 .cse19 .cse25 .cse10 .cse11 .cse21 .cse12 .cse13 .cse14 .cse17 (not (<= .cse30 ~token~0)))) (or .cse0 .cse2 .cse4 .cse23 .cse5 .cse6 .cse24 .cse8 .cse10 .cse20 .cse11 .cse21 .cse12 .cse13 .cse14 .cse16 .cse17)))) [2019-09-16 16:42:24,835 INFO L446 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 171 189) the Hoare annotation is: true [2019-09-16 16:42:24,835 INFO L443 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 171 189) no Hoare annotation was computed. [2019-09-16 16:42:24,835 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 181) no Hoare annotation was computed. [2019-09-16 16:42:24,835 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 184) no Hoare annotation was computed. [2019-09-16 16:42:24,836 INFO L443 ceAbstractionStarter]: For program point L175-2(lines 175 184) no Hoare annotation was computed. [2019-09-16 16:42:24,836 INFO L443 ceAbstractionStarter]: For program point L382-1(lines 371 404) no Hoare annotation was computed. [2019-09-16 16:42:24,836 INFO L439 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 368 405) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0)) (.cse2 (= ~t1_pc~0 1)) (.cse24 (= |old(~T2_E~0)| ~T2_E~0)) (.cse27 (= ~M_E~0 |old(~M_E~0)|)) (.cse28 (= |old(~T1_E~0)| ~T1_E~0)) (.cse25 (= ~E_1~0 |old(~E_1~0)|)) (.cse29 (= ~E_M~0 |old(~E_M~0)|)) (.cse26 (= ~E_2~0 |old(~E_2~0)|))) (let ((.cse7 (and .cse24 .cse27 .cse28 .cse25 .cse29 .cse26)) (.cse5 (not (= ~t1_st~0 0))) (.cse21 (not (= 0 ~m_st~0))) (.cse9 (= 1 ~t2_pc~0)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse17 (not (<= 2 ~t2_st~0))) (.cse1 (= |old(~T2_E~0)| 1)) (.cse18 (not .cse2)) (.cse3 (not (<= 2 ~m_st~0))) (.cse4 (= |old(~T2_E~0)| 0)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse19 (not (<= 2 ~t1_st~0))) (.cse8 (not (= ~m_i~0 1))) (.cse10 (= 1 |old(~E_1~0)|)) (.cse11 (= 1 |old(~E_2~0)|)) (.cse12 (not .cse22)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (= 0 |old(~E_M~0)|)) (.cse16 (= 0 |old(~E_2~0)|)) (.cse20 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse7 .cse17 .cse1 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse7 .cse0 .cse1 .cse18 .cse3 .cse4 .cse6 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse20 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse1 .cse4 .cse6 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse22) (or .cse0 .cse1 (not (<= ~token~0 ~local~0)) (not (<= ~local~0 ~token~0)) .cse2 .cse4 .cse5 .cse20 .cse6 .cse21 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse22) (let ((.cse23 (+ ~local~0 1))) (or .cse0 .cse1 .cse18 .cse3 .cse4 .cse6 .cse19 (not (<= .cse23 ~token~0)) .cse8 .cse10 .cse11 .cse12 .cse20 .cse13 .cse14 (not (<= ~token~0 .cse23)) .cse15 .cse16)) (or .cse0 .cse17 .cse1 .cse18 .cse3 .cse4 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse20)))) [2019-09-16 16:42:24,836 INFO L443 ceAbstractionStarter]: For program point L372-1(lines 371 404) no Hoare annotation was computed. [2019-09-16 16:42:24,836 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 368 405) no Hoare annotation was computed. [2019-09-16 16:42:24,836 INFO L443 ceAbstractionStarter]: For program point L387-1(lines 371 404) no Hoare annotation was computed. [2019-09-16 16:42:24,837 INFO L443 ceAbstractionStarter]: For program point L377-1(lines 371 404) no Hoare annotation was computed. [2019-09-16 16:42:24,837 INFO L443 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 368 405) no Hoare annotation was computed. [2019-09-16 16:42:24,837 INFO L443 ceAbstractionStarter]: For program point L392-1(lines 371 404) no Hoare annotation was computed. [2019-09-16 16:42:24,837 INFO L443 ceAbstractionStarter]: For program point L226-1(lines 220 238) no Hoare annotation was computed. [2019-09-16 16:42:24,837 INFO L443 ceAbstractionStarter]: For program point L221-1(lines 220 238) no Hoare annotation was computed. [2019-09-16 16:42:24,837 INFO L443 ceAbstractionStarter]: For program point init_threadsEXIT(lines 217 239) no Hoare annotation was computed. [2019-09-16 16:42:24,837 INFO L439 ceAbstractionStarter]: At program point init_threadsENTRY(lines 217 239) the Hoare annotation is: (or (= ~T1_E~0 0) (= ~T2_E~0 1) (not (<= ~token~0 ~local~0)) (not (<= ~local~0 ~token~0)) (= ~t1_pc~0 1) (= ~T2_E~0 0) (= 1 ~M_E~0) (not (= |old(~t1_st~0)| 0)) (= 1 ~E_M~0) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 ~t2_pc~0) (= 1 ~E_1~0) (= 1 ~E_2~0) (= 0 ~E_1~0) (not (= 1 ~t1_i~0)) (= 0 ~E_M~0) (= 0 ~E_2~0) (and (= ~m_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)) (= 1 ~m_pc~0)) [2019-09-16 16:42:24,838 INFO L443 ceAbstractionStarter]: For program point L231-1(lines 217 239) no Hoare annotation was computed. [2019-09-16 16:42:24,838 INFO L443 ceAbstractionStarter]: For program point L593(line 593) no Hoare annotation was computed. [2019-09-16 16:42:24,838 INFO L439 ceAbstractionStarter]: At program point L592(line 592) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|) (and (not (= ~t2_pc~0 1)) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= 1 ~m_i~0)) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0))) [2019-09-16 16:42:24,838 INFO L439 ceAbstractionStarter]: At program point L592-1(line 592) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (not (= ~t2_pc~0 1)) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= 1 ~m_i~0) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= ~t1_i~0 1) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2019-09-16 16:42:24,838 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 587 598) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|) (and (not (= ~t2_pc~0 1)) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= 1 ~m_i~0)) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0))) [2019-09-16 16:42:24,839 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 587 598) no Hoare annotation was computed. [2019-09-16 16:42:24,839 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 587 598) no Hoare annotation was computed. [2019-09-16 16:42:24,839 INFO L443 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2019-09-16 16:42:24,839 INFO L443 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-09-16 16:42:24,839 INFO L446 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2019-09-16 16:42:24,839 INFO L443 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2019-09-16 16:42:24,839 INFO L443 ceAbstractionStarter]: For program point masterEXIT(lines 36 79) no Hoare annotation was computed. [2019-09-16 16:42:24,839 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-09-16 16:42:24,840 INFO L439 ceAbstractionStarter]: At program point L44(lines 39 78) the Hoare annotation is: (let ((.cse21 (= ~t1_pc~0 1))) (let ((.cse2 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse3 (not .cse21)) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse10 (= 1 ~t2_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse18 (not (<= 2 |old(~t2_st~0)|))) (.cse1 (= ~T2_E~0 1)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse22 (not (= |old(~t1_st~0)| 0))) (.cse7 (= 1 ~E_M~0)) (.cse9 (not (= ~m_i~0 1))) (.cse11 (= 1 |old(~E_1~0)|)) (.cse12 (= 1 ~E_2~0)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (= 0 ~E_M~0)) (.cse16 (= 0 ~E_2~0)) (.cse17 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse1 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse20 (+ |old(~local~0)| 2))) (or .cse0 .cse18 .cse1 (let ((.cse19 (+ ~local~0 2))) (and (= |old(~token~0)| ~token~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 .cse19) (= ~m_pc~0 1) (<= 2 ~t2_st~0) (= |old(~t1_st~0)| ~t1_st~0) (<= .cse19 ~token~0))) (not (<= |old(~token~0)| .cse20)) .cse3 .cse5 .cse6 .cse7 (not .cse10) .cse8 .cse9 .cse11 .cse12 (not .cse17) .cse13 .cse14 .cse15 .cse16 (not (<= .cse20 |old(~token~0)|)))) (or .cse0 .cse1 .cse21 .cse5 .cse6 .cse22 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse1 .cse21 .cse5 .cse6 .cse22 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-09-16 16:42:24,840 INFO L439 ceAbstractionStarter]: At program point L73(lines 36 79) the Hoare annotation is: (let ((.cse34 (= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (= ~T2_E~0 0)) (.cse13 (= 1 ~E_2~0)) (.cse26 (<= 2 ~m_st~0)) (.cse32 (<= ~token~0 ~local~0)) (.cse7 (= 1 ~M_E~0)) (.cse25 (= ~m_pc~0 1)) (.cse30 (= ~t1_pc~0 1)) (.cse24 (= 0 ~t1_st~0)) (.cse27 (not (= ~E_1~0 1))) (.cse28 (<= 2 ~t2_st~0)) (.cse1 (= ~T1_E~0 0)) (.cse29 (not (= ~E_1~0 0))) (.cse33 (<= ~local~0 ~token~0)) (.cse23 (= 1 ~t2_pc~0))) (let ((.cse9 (not .cse23)) (.cse19 (and (not .cse6) (not .cse13) .cse26 (not (= ~E_M~0 0)) (not (= 1 ~T2_E~0)) (= 1 ~m_i~0) .cse32 (not .cse7) (not (= ~E_2~0 0)) (not (= ~E_M~0 1)) .cse25 .cse23 (= ~t1_i~0 1) .cse30 .cse24 .cse27 .cse28 (not .cse1) .cse29 .cse33)) (.cse20 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse5 (not .cse30)) (.cse21 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse31 (and .cse25 .cse26 .cse27 .cse34 .cse29)) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~t2_st~0)|))) (.cse3 (= ~T2_E~0 1)) (.cse22 (not (= |old(~t1_st~0)| 0))) (.cse8 (= 1 ~E_M~0)) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~E_1~0)|)) (.cse0 (and .cse26 .cse25 .cse27 .cse28 .cse34 .cse29)) (.cse15 (= 0 |old(~E_1~0)|)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (= 0 ~E_M~0)) (.cse18 (= 0 ~E_2~0)) (.cse14 (= 1 |old(~m_pc~0)|))) (and (let ((.cse4 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~token~0)| .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not .cse14) .cse15 .cse16 .cse17 .cse18 .cse19 (not (<= .cse4 |old(~token~0)|)))) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse14) (or .cse1 .cse2 .cse3 .cse6 .cse7 .cse22 .cse8 .cse11 .cse23 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse24 .cse14) (or .cse1 .cse2 .cse3 (and .cse25 .cse26 .cse27 .cse28 .cse29) .cse6 .cse7 .cse8 .cse11 .cse23 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse14) (or .cse1 .cse3 .cse30 .cse6 .cse7 .cse22 .cse8 .cse11 .cse23 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse14 .cse31) (or (and .cse26 .cse32 .cse25 .cse24 .cse27 .cse29 .cse33) .cse1 .cse3 .cse20 .cse5 .cse21 .cse6 .cse7 .cse31 .cse8 .cse10 .cse11 .cse23 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse14) (or .cse1 .cse2 .cse3 .cse30 .cse6 .cse7 .cse22 .cse8 .cse11 .cse12 .cse13 .cse0 .cse15 .cse16 .cse17 .cse18 .cse14)))) [2019-09-16 16:42:24,841 INFO L439 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: (let ((.cse20 (= ~t1_pc~0 1))) (let ((.cse2 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse3 (not .cse20)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse10 (= 1 ~t2_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse18 (not (<= 2 |old(~t2_st~0)|))) (.cse1 (= ~T2_E~0 1)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse7 (= 1 ~E_M~0)) (.cse9 (not (= ~m_i~0 1))) (.cse11 (= 1 |old(~E_1~0)|)) (.cse12 (= 1 ~E_2~0)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (= 0 ~E_M~0)) (.cse16 (= 0 ~E_2~0)) (.cse17 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse19 (+ |old(~local~0)| 2))) (or .cse0 .cse18 .cse1 (not (<= |old(~token~0)| .cse19)) .cse3 .cse5 .cse6 .cse7 (not .cse10) .cse8 .cse9 .cse11 .cse12 (not .cse17) .cse13 .cse14 .cse15 .cse16 (not (<= .cse19 |old(~token~0)|)))) (or .cse0 .cse18 .cse1 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse20 .cse5 .cse6 .cse21 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse1 .cse20 .cse5 .cse6 .cse21 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-09-16 16:42:24,841 INFO L439 ceAbstractionStarter]: At program point L65(lines 39 78) the Hoare annotation is: (let ((.cse27 (= ~m_pc~0 1)) (.cse30 (= ~t1_pc~0 1))) (let ((.cse2 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse15 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse3 (not .cse30)) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse10 (= 1 ~t2_pc~0)) (.cse12 (not .cse27)) (.cse14 (= ~E_1~0 |old(~E_1~0)|)) (.cse25 (<= 2 ~t2_st~0)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse24 (not (<= 2 |old(~t2_st~0)|))) (.cse1 (= ~T2_E~0 1)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse29 (not (= |old(~t1_st~0)| 0))) (.cse7 (= 1 ~E_M~0)) (.cse9 (not (= ~m_i~0 1))) (.cse11 (= 1 |old(~E_1~0)|)) (.cse18 (= 1 ~E_2~0)) (.cse19 (= 0 |old(~E_1~0)|)) (.cse20 (not (= 1 ~t1_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse22 (= 0 ~E_2~0)) (.cse23 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17) .cse9 .cse11 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse28 (+ |old(~local~0)| 2))) (or .cse0 .cse24 .cse1 (let ((.cse26 (+ ~local~0 2))) (and .cse13 .cse14 (<= ~token~0 .cse26) .cse27 .cse25 .cse16 (<= .cse26 ~token~0))) (not (<= |old(~token~0)| .cse28)) .cse3 .cse5 .cse6 .cse7 (not .cse10) .cse8 .cse9 .cse11 .cse18 (not .cse23) .cse19 .cse20 .cse21 .cse22 (not (<= .cse28 |old(~token~0)|)))) (or .cse0 .cse24 .cse1 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse18 .cse19 .cse20 .cse21 .cse22 (and .cse12 .cse25 .cse14) .cse23) (or .cse0 .cse24 (= 0 ~t1_st~0) .cse1 .cse5 .cse6 .cse29 .cse7 .cse9 .cse10 .cse11 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse30 .cse5 .cse6 .cse29 .cse7 .cse9 .cse10 .cse11 (and .cse12 .cse16 .cse14) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or (and .cse12 .cse14 .cse25 .cse16) .cse0 .cse24 .cse1 .cse30 .cse5 .cse6 .cse29 .cse7 .cse9 .cse11 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)))) [2019-09-16 16:42:24,842 INFO L439 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse13 (= ~m_pc~0 1)) (.cse28 (= ~t1_pc~0 1))) (let ((.cse27 (not (= |old(~t1_st~0)| 0))) (.cse12 (<= ~token~0 ~local~0)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse24 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse4 (not .cse28)) (.cse25 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (<= 2 |old(~t2_st~0)|))) (.cse2 (= ~T2_E~0 1)) (.cse5 (= ~T2_E~0 0)) (.cse26 (not .cse13)) (.cse14 (<= 2 ~t2_st~0)) (.cse16 (not (= ~E_1~0 0))) (.cse6 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse10 (not (= ~m_i~0 1))) (.cse8 (= 1 ~t2_pc~0)) (.cse11 (= 1 |old(~E_1~0)|)) (.cse18 (= 1 ~E_2~0)) (.cse20 (= 0 |old(~E_1~0)|)) (.cse21 (not (= 1 ~t1_i~0))) (.cse22 (= 0 ~E_M~0)) (.cse23 (= 0 ~E_2~0)) (.cse19 (= 1 |old(~m_pc~0)|))) (and (let ((.cse3 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse3)) .cse4 .cse5 .cse6 .cse7 (not .cse8) .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 (not .cse19) .cse20 .cse21 .cse22 .cse23 (not (<= .cse3 |old(~token~0)|)))) (or .cse0 .cse2 .cse24 .cse4 .cse25 .cse5 .cse6 .cse7 .cse9 .cse10 .cse8 .cse11 .cse18 .cse20 .cse21 .cse22 .cse23 (and .cse26 .cse15 .cse12 .cse16 .cse17) .cse19) (or .cse0 .cse1 .cse2 .cse5 (= 0 ~t1_st~0) .cse6 .cse27 .cse7 .cse10 .cse8 .cse11 .cse18 .cse20 .cse21 .cse22 .cse23 .cse19) (or .cse0 .cse2 .cse28 .cse5 .cse6 .cse27 .cse7 .cse10 .cse8 .cse11 .cse18 .cse20 .cse21 .cse22 .cse23 (and .cse26 .cse15 .cse16) .cse19) (or .cse0 .cse1 .cse2 .cse28 .cse5 .cse6 .cse27 .cse7 .cse10 .cse11 .cse18 (and .cse26 .cse14 .cse15 .cse16) .cse20 .cse21 .cse22 .cse23 .cse19) (or .cse0 (and .cse26 .cse12 .cse14 .cse15 .cse16 .cse17) .cse1 .cse2 .cse24 .cse4 .cse25 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse18 .cse20 .cse21 .cse22 .cse23 .cse19) (or .cse0 .cse1 .cse2 .cse5 (and .cse26 .cse14 .cse16) .cse6 .cse7 .cse10 .cse8 .cse11 .cse18 .cse20 .cse21 .cse22 .cse23 .cse19)))) [2019-09-16 16:42:24,842 INFO L443 ceAbstractionStarter]: For program point L57-1(line 57) no Hoare annotation was computed. [2019-09-16 16:42:24,842 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-09-16 16:42:24,842 INFO L439 ceAbstractionStarter]: At program point masterENTRY(lines 36 79) the Hoare annotation is: (let ((.cse27 (= ~m_pc~0 1)) (.cse30 (= ~t1_pc~0 1))) (let ((.cse2 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse15 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse3 (not .cse30)) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse10 (= 1 ~t2_pc~0)) (.cse12 (not .cse27)) (.cse14 (= ~E_1~0 |old(~E_1~0)|)) (.cse25 (<= 2 ~t2_st~0)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse24 (not (<= 2 |old(~t2_st~0)|))) (.cse1 (= ~T2_E~0 1)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 1 ~M_E~0)) (.cse29 (not (= |old(~t1_st~0)| 0))) (.cse7 (= 1 ~E_M~0)) (.cse9 (not (= ~m_i~0 1))) (.cse11 (= 1 |old(~E_1~0)|)) (.cse18 (= 1 ~E_2~0)) (.cse19 (= 0 |old(~E_1~0)|)) (.cse20 (not (= 1 ~t1_i~0))) (.cse21 (= 0 ~E_M~0)) (.cse22 (= 0 ~E_2~0)) (.cse23 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17) .cse9 .cse11 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse28 (+ |old(~local~0)| 2))) (or .cse0 .cse24 .cse1 (let ((.cse26 (+ ~local~0 2))) (and .cse13 .cse14 (<= ~token~0 .cse26) .cse27 .cse25 .cse16 (<= .cse26 ~token~0))) (not (<= |old(~token~0)| .cse28)) .cse3 .cse5 .cse6 .cse7 (not .cse10) .cse8 .cse9 .cse11 .cse18 (not .cse23) .cse19 .cse20 .cse21 .cse22 (not (<= .cse28 |old(~token~0)|)))) (or .cse0 .cse24 .cse1 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse18 .cse19 .cse20 .cse21 .cse22 (and .cse12 .cse25 .cse14) .cse23) (or .cse0 .cse24 (= 0 ~t1_st~0) .cse1 .cse5 .cse6 .cse29 .cse7 .cse9 .cse10 .cse11 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse30 .cse5 .cse6 .cse29 .cse7 .cse9 .cse10 .cse11 (and .cse12 .cse16 .cse14) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or (and .cse12 .cse14 .cse25 .cse16) .cse0 .cse24 .cse1 .cse30 .cse5 .cse6 .cse29 .cse7 .cse9 .cse11 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)))) [2019-09-16 16:42:24,842 INFO L443 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 451 459) no Hoare annotation was computed. [2019-09-16 16:42:24,843 INFO L439 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 451 459) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0)) (.cse4 (= ~t1_pc~0 1))) (let ((.cse8 (not (= ~t1_st~0 0))) (.cse21 (= 1 ~t2_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (<= 2 ~t2_st~0))) (.cse2 (= ~T2_E~0 1)) (.cse18 (not .cse4)) (.cse5 (not (<= 2 ~m_st~0))) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 1 |old(~M_E~0)|)) (.cse9 (= 1 ~E_M~0)) (.cse19 (not (<= 2 ~t1_st~0))) (.cse10 (not (= ~m_i~0 1))) (.cse11 (= 1 ~E_1~0)) (.cse12 (= 1 ~E_2~0)) (.cse13 (not .cse22)) (.cse14 (= 0 ~E_1~0)) (.cse3 (= ~M_E~0 |old(~M_E~0)|)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (= 0 ~E_M~0)) (.cse17 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse20 (+ ~local~0 1))) (or .cse0 .cse2 .cse18 .cse5 .cse6 .cse7 .cse9 .cse19 (not (<= .cse20 ~token~0)) .cse10 .cse11 .cse3 .cse12 .cse13 .cse14 .cse15 (not (<= ~token~0 .cse20)) .cse16 .cse17)) (or .cse0 .cse2 .cse18 .cse5 .cse6 .cse3 .cse7 .cse9 .cse19 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse3) (or .cse0 .cse1 .cse2 .cse6 .cse7 .cse9 (not (= 0 ~m_st~0)) .cse10 .cse21 .cse11 .cse3 .cse12 .cse14 .cse15 .cse16 .cse17 .cse22) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse3 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse18 .cse5 .cse6 .cse7 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse17)))) [2019-09-16 16:42:24,843 INFO L443 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 451 459) no Hoare annotation was computed. [2019-09-16 16:42:24,843 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:42:24,843 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~token~0)| ~token~0)) [2019-09-16 16:42:24,843 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:42:24,843 INFO L446 ceAbstractionStarter]: At program point L524(lines 513 526) the Hoare annotation is: true [2019-09-16 16:42:24,844 INFO L443 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 509 527) no Hoare annotation was computed. [2019-09-16 16:42:24,844 INFO L443 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2019-09-16 16:42:24,844 INFO L446 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 509 527) the Hoare annotation is: true [2019-09-16 16:42:24,844 INFO L446 ceAbstractionStarter]: At program point L515(line 515) the Hoare annotation is: true [2019-09-16 16:42:24,844 INFO L443 ceAbstractionStarter]: For program point L515-1(line 515) no Hoare annotation was computed. [2019-09-16 16:42:24,844 INFO L443 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 509 527) no Hoare annotation was computed. [2019-09-16 16:42:24,845 INFO L439 ceAbstractionStarter]: At program point L287(line 287) the Hoare annotation is: (let ((.cse5 (= 1 ~M_E~0)) (.cse47 (= ~m_pc~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 0))) (let ((.cse42 (= 1 |old(~m_pc~0)|)) (.cse44 (+ ~local~0 2)) (.cse23 (= 1 ~t2_pc~0)) (.cse18 (= |old(~t1_pc~0)| 1)) (.cse38 (not (= ~t2_pc~0 1))) (.cse27 (not (= 1 ~E_2~0))) (.cse24 (and (and (not .cse0) (not .cse4) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0)))) (.cse45 (= ~t1_i~0 1)) (.cse46 (not (= ~E_1~0 1))) (.cse25 (not .cse47)) (.cse48 (not (= 1 ~T2_E~0))) (.cse28 (= ~E_1~0 |old(~E_1~0)|)) (.cse49 (= 1 ~m_i~0)) (.cse50 (not .cse5)) (.cse39 (= ~E_M~0 |old(~E_M~0)|)) (.cse26 (not (= ~E_M~0 1)))) (let ((.cse41 (and .cse38 .cse27 .cse24 .cse45 .cse46 .cse25 .cse48 .cse28 .cse49 .cse50 .cse39 .cse26)) (.cse40 (not (= 0 |old(~m_st~0)|))) (.cse19 (not (= |old(~t1_st~0)| 0))) (.cse2 (not .cse18)) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse20 (<= 2 ~t2_st~0)) (.cse33 (and .cse27 (and .cse45 .cse46 (and .cse47 .cse48 .cse23 .cse49 .cse24 .cse50 .cse26)))) (.cse21 (= 1 ~t1_pc~0)) (.cse29 (<= 2 ~t1_st~0)) (.cse34 (<= .cse44 ~token~0)) (.cse30 (= eval_~tmp~0 1)) (.cse35 (<= ~token~0 .cse44)) (.cse17 (not (<= 2 |old(~t2_st~0)|))) (.cse1 (= ~T2_E~0 1)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse6 (= 1 |old(~E_M~0)|)) (.cse8 (not (= ~m_i~0 1))) (.cse9 (= 1 |old(~t2_pc~0)|)) (.cse10 (= 1 |old(~E_1~0)|)) (.cse11 (= 1 |old(~E_2~0)|)) (.cse12 (not .cse42)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (= 0 |old(~E_M~0)|)) (.cse16 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse1 .cse18 .cse3 .cse4 .cse5 .cse19 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse36 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse37 (= 0 ~t1_st~0)) (.cse22 (<= ~token~0 ~local~0)) (.cse31 (<= ~local~0 ~token~0)) (.cse32 (= |old(~token~0)| ~token~0))) (or (and .cse20 .cse21 .cse22 (and (and .cse23 .cse24 .cse25 .cse26) .cse27 .cse28) .cse29 .cse30 .cse31 .cse32) .cse0 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse20 .cse33 .cse21 .cse29 .cse34 .cse30 .cse35) .cse4 .cse5 .cse19 .cse9 .cse10 (and .cse20 .cse36 (and .cse27 .cse28 (and .cse23 .cse24 .cse37 .cse25 .cse26))) .cse11 .cse14 .cse16 (not (<= |old(~local~0)| |old(~token~0)|)) .cse18 (and .cse36 (and .cse38 .cse27 .cse24 .cse37 .cse25 .cse28 .cse39)) .cse6 .cse40 .cse8 (and .cse21 .cse22 .cse29 .cse41 .cse30 .cse31 .cse32) .cse13 .cse15 .cse42)) (or .cse0 .cse17 .cse1 (and .cse20 .cse41) .cse4 .cse5 .cse6 .cse40 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse42) (or .cse0 .cse1 .cse18 .cse3 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse43 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= .cse43 |old(~token~0)|)) .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (and (and .cse20 .cse33 .cse21 .cse29) .cse34 .cse30 .cse35) (not (<= |old(~token~0)| .cse43)) .cse15 .cse16)) (or .cse0 .cse17 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))))) [2019-09-16 16:42:24,845 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 319) no Hoare annotation was computed. [2019-09-16 16:42:24,845 INFO L443 ceAbstractionStarter]: For program point evalEXIT(lines 265 329) no Hoare annotation was computed. [2019-09-16 16:42:24,845 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 291) no Hoare annotation was computed. [2019-09-16 16:42:24,846 INFO L439 ceAbstractionStarter]: At program point L309(lines 271 323) the Hoare annotation is: (let ((.cse8 (= 1 ~M_E~0)) (.cse0 (= ~T1_E~0 0)) (.cse7 (= ~T2_E~0 0)) (.cse27 (not (= ~E_M~0 0))) (.cse31 (not (= ~E_2~0 0)))) (let ((.cse66 (= 1 ~m_i~0)) (.cse22 (= ~m_pc~0 1)) (.cse65 (not (= 1 ~T2_E~0))) (.cse24 (= 1 ~t2_pc~0)) (.cse55 (and (and (not .cse0) (not .cse7) (not (= ~E_1~0 0)) .cse27) .cse31)) (.cse56 (= 0 ~t1_st~0)) (.cse67 (not .cse8)) (.cse32 (not (= ~E_M~0 1)))) (let ((.cse68 (and .cse22 .cse65 .cse24 .cse55 .cse56 .cse67 .cse32)) (.cse25 (not (= 1 ~E_2~0))) (.cse30 (= ~E_1~0 |old(~E_1~0)|)) (.cse63 (= ~t1_i~0 1)) (.cse64 (not (= ~E_1~0 1))) (.cse73 (and .cse22 .cse65 .cse24 .cse66 .cse55 .cse67 .cse32))) (let ((.cse39 (= 1 |old(~m_pc~0)|)) (.cse49 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse35 (and .cse25 .cse30 .cse63 .cse64 .cse73)) (.cse69 (+ ~local~0 2)) (.cse54 (= ~m_st~0 0)) (.cse57 (not .cse22)) (.cse50 (<= ~token~0 ~local~0)) (.cse51 (= eval_~tmp~0 1)) (.cse59 (and .cse25 .cse63 .cse68 .cse64)) (.cse52 (<= ~local~0 ~token~0)) (.cse60 (not (= ~t2_pc~0 1))) (.cse61 (= ~E_M~0 |old(~E_M~0)|)) (.cse70 (not (= eval_~tmp~0 0))) (.cse72 (+ ~local~0 1)) (.cse28 (<= 2 ~t2_st~0)) (.cse23 (= 1 ~t1_pc~0)) (.cse26 (<= 2 ~m_st~0)) (.cse58 (<= 2 ~t1_st~0)) (.cse71 (and .cse25 .cse63 .cse64 .cse73)) (.cse34 (= 1 |old(~t2_pc~0)|)) (.cse5 (= |old(~t1_pc~0)| 1))) (let ((.cse1 (not (<= 2 |old(~t2_st~0)|))) (.cse29 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (not (<= 2 |old(~t1_st~0)|))) (.cse20 (not .cse5)) (.cse11 (not .cse34)) (.cse48 (and .cse28 .cse23 .cse26 .cse58 .cse71)) (.cse40 (<= ~token~0 .cse72)) (.cse41 (<= .cse72 ~token~0)) (.cse42 (and .cse23 .cse26 .cse58 .cse71 .cse70)) (.cse38 (and .cse60 .cse22 .cse65 .cse25 .cse66 .cse55 .cse63 .cse67 .cse64 .cse61 .cse32)) (.cse47 (and .cse28 .cse23 .cse50 .cse26 .cse51 .cse59 .cse52)) (.cse36 (and .cse60 .cse25 .cse54 .cse55 .cse63 .cse64 .cse57 .cse65 .cse30 .cse67 .cse61)) (.cse37 (not (= 0 |old(~m_st~0)|))) (.cse45 (<= .cse69 ~token~0)) (.cse44 (and .cse28 .cse23 .cse58 (and (and .cse22 .cse65 .cse24 .cse54 .cse66 .cse55 .cse67 .cse32) .cse25 .cse63 .cse64) .cse70)) (.cse46 (<= ~token~0 .cse69)) (.cse2 (= ~T2_E~0 1)) (.cse3 (and .cse28 .cse35 .cse23 .cse26 .cse58)) (.cse4 (and .cse28 .cse49 (and .cse25 .cse30 .cse68) .cse26)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse33 (and .cse60 .cse22 .cse25 .cse55 .cse63 .cse64 .cse65 .cse30 .cse66 .cse67 .cse61 .cse32)) (.cse9 (not (= |old(~t1_st~0)| 0))) (.cse10 (= 1 |old(~E_M~0)|)) (.cse12 (not (= ~m_i~0 1))) (.cse13 (= 1 |old(~E_1~0)|)) (.cse14 (= 1 |old(~E_2~0)|)) (.cse15 (not .cse39)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (= 0 |old(~E_M~0)|)) (.cse19 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse6 .cse7 .cse8 .cse10 .cse11 .cse21 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32)) (or .cse0 .cse2 .cse20 .cse6 .cse7 (and .cse23 .cse29 .cse26 .cse33) .cse8 .cse10 .cse21 .cse12 .cse34 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse28 .cse35 .cse23 .cse29 .cse26)) (or .cse0 .cse1 .cse2 (and .cse28 .cse36) .cse7 .cse8 .cse10 .cse37 .cse12 .cse34 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 (and .cse28 .cse38 .cse26) .cse39) (or .cse0 .cse1 .cse2 .cse6 .cse7 .cse8 .cse10 .cse12 .cse34 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse28 .cse26 .cse33)) (let ((.cse43 (+ |old(~local~0)| 1))) (or (and .cse40 .cse41 (or .cse42 (and .cse35 .cse23 .cse29 .cse26))) .cse0 .cse2 .cse6 .cse7 .cse8 .cse21 (not (<= .cse43 |old(~token~0)|)) .cse13 .cse14 (and .cse44 .cse45 .cse46) .cse17 .cse19 .cse47 .cse20 .cse10 .cse11 .cse48 .cse12 .cse15 .cse16 (not (<= |old(~token~0)| .cse43)) .cse18)) (let ((.cse53 (= |old(~token~0)| ~token~0)) (.cse62 (and .cse60 .cse22 .cse25 .cse55 .cse63 .cse56 .cse64 .cse65 .cse66 .cse67 .cse61 .cse32))) (or .cse48 .cse0 (and .cse28 .cse49 .cse50 .cse51 .cse52 .cse53 (and (and .cse24 .cse54 .cse55 .cse56 .cse57 .cse32) .cse25 .cse30)) .cse2 (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse40 .cse41 .cse42) .cse7 (and .cse28 (and .cse25 .cse30 (and .cse24 .cse54 .cse55 .cse57 .cse32)) .cse23 .cse50 .cse58 .cse51 .cse52 .cse53) (and .cse38 .cse23 .cse26 .cse58) .cse8 .cse9 .cse34 .cse13 .cse14 (and .cse28 .cse49 .cse26 .cse59) .cse47 .cse17 .cse19 (not (<= |old(~local~0)| |old(~token~0)|)) .cse5 (and .cse23 .cse50 .cse58 .cse36 .cse51 .cse52 .cse53) .cse10 .cse37 .cse12 (and .cse50 (and .cse49 (and .cse60 .cse25 .cse54 .cse55 .cse56 .cse57 .cse30 .cse61)) .cse52 .cse53) (and .cse49 .cse62 .cse26) .cse16 .cse18 (and .cse45 .cse44 .cse46) (and .cse23 .cse62 .cse50 .cse26 .cse51 .cse52) .cse39)) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse23 .cse26 .cse58 .cse33) .cse8 .cse9 .cse10 (and (and .cse60 .cse22 .cse25 .cse55 .cse56 .cse30 .cse61) .cse49 .cse26) .cse12 .cse34 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))))))) [2019-09-16 16:42:24,846 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2019-09-16 16:42:24,846 INFO L443 ceAbstractionStarter]: For program point L276-1(lines 271 323) no Hoare annotation was computed. [2019-09-16 16:42:24,847 INFO L439 ceAbstractionStarter]: At program point L272(line 272) the Hoare annotation is: (let ((.cse8 (= 1 ~M_E~0)) (.cse0 (= ~T1_E~0 0)) (.cse7 (= ~T2_E~0 0)) (.cse27 (not (= ~E_M~0 0))) (.cse31 (not (= ~E_2~0 0)))) (let ((.cse66 (= 1 ~m_i~0)) (.cse22 (= ~m_pc~0 1)) (.cse65 (not (= 1 ~T2_E~0))) (.cse24 (= 1 ~t2_pc~0)) (.cse55 (and (and (not .cse0) (not .cse7) (not (= ~E_1~0 0)) .cse27) .cse31)) (.cse56 (= 0 ~t1_st~0)) (.cse67 (not .cse8)) (.cse32 (not (= ~E_M~0 1)))) (let ((.cse68 (and .cse22 .cse65 .cse24 .cse55 .cse56 .cse67 .cse32)) (.cse25 (not (= 1 ~E_2~0))) (.cse30 (= ~E_1~0 |old(~E_1~0)|)) (.cse63 (= ~t1_i~0 1)) (.cse64 (not (= ~E_1~0 1))) (.cse73 (and .cse22 .cse65 .cse24 .cse66 .cse55 .cse67 .cse32))) (let ((.cse39 (= 1 |old(~m_pc~0)|)) (.cse49 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse35 (and .cse25 .cse30 .cse63 .cse64 .cse73)) (.cse69 (+ ~local~0 2)) (.cse54 (= ~m_st~0 0)) (.cse57 (not .cse22)) (.cse50 (<= ~token~0 ~local~0)) (.cse51 (= eval_~tmp~0 1)) (.cse59 (and .cse25 .cse63 .cse68 .cse64)) (.cse52 (<= ~local~0 ~token~0)) (.cse60 (not (= ~t2_pc~0 1))) (.cse61 (= ~E_M~0 |old(~E_M~0)|)) (.cse70 (not (= eval_~tmp~0 0))) (.cse72 (+ ~local~0 1)) (.cse28 (<= 2 ~t2_st~0)) (.cse23 (= 1 ~t1_pc~0)) (.cse26 (<= 2 ~m_st~0)) (.cse58 (<= 2 ~t1_st~0)) (.cse71 (and .cse25 .cse63 .cse64 .cse73)) (.cse34 (= 1 |old(~t2_pc~0)|)) (.cse5 (= |old(~t1_pc~0)| 1))) (let ((.cse1 (not (<= 2 |old(~t2_st~0)|))) (.cse29 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (not (<= 2 |old(~t1_st~0)|))) (.cse20 (not .cse5)) (.cse11 (not .cse34)) (.cse48 (and .cse28 .cse23 .cse26 .cse58 .cse71)) (.cse40 (<= ~token~0 .cse72)) (.cse41 (<= .cse72 ~token~0)) (.cse42 (and .cse23 .cse26 .cse58 .cse71 .cse70)) (.cse38 (and .cse60 .cse22 .cse65 .cse25 .cse66 .cse55 .cse63 .cse67 .cse64 .cse61 .cse32)) (.cse47 (and .cse28 .cse23 .cse50 .cse26 .cse51 .cse59 .cse52)) (.cse36 (and .cse60 .cse25 .cse54 .cse55 .cse63 .cse64 .cse57 .cse65 .cse30 .cse67 .cse61)) (.cse37 (not (= 0 |old(~m_st~0)|))) (.cse45 (<= .cse69 ~token~0)) (.cse44 (and .cse28 .cse23 .cse58 (and (and .cse22 .cse65 .cse24 .cse54 .cse66 .cse55 .cse67 .cse32) .cse25 .cse63 .cse64) .cse70)) (.cse46 (<= ~token~0 .cse69)) (.cse2 (= ~T2_E~0 1)) (.cse3 (and .cse28 .cse35 .cse23 .cse26 .cse58)) (.cse4 (and .cse28 .cse49 (and .cse25 .cse30 .cse68) .cse26)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse33 (and .cse60 .cse22 .cse25 .cse55 .cse63 .cse64 .cse65 .cse30 .cse66 .cse67 .cse61 .cse32)) (.cse9 (not (= |old(~t1_st~0)| 0))) (.cse10 (= 1 |old(~E_M~0)|)) (.cse12 (not (= ~m_i~0 1))) (.cse13 (= 1 |old(~E_1~0)|)) (.cse14 (= 1 |old(~E_2~0)|)) (.cse15 (not .cse39)) (.cse16 (= 0 |old(~E_1~0)|)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (= 0 |old(~E_M~0)|)) (.cse19 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse6 .cse7 .cse8 .cse10 .cse11 .cse21 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32)) (or .cse0 .cse2 .cse20 .cse6 .cse7 (and .cse23 .cse29 .cse26 .cse33) .cse8 .cse10 .cse21 .cse12 .cse34 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse28 .cse35 .cse23 .cse29 .cse26)) (or .cse0 .cse1 .cse2 (and .cse28 .cse36) .cse7 .cse8 .cse10 .cse37 .cse12 .cse34 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 (and .cse28 .cse38 .cse26) .cse39) (or .cse0 .cse1 .cse2 .cse6 .cse7 .cse8 .cse10 .cse12 .cse34 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse28 .cse26 .cse33)) (let ((.cse43 (+ |old(~local~0)| 1))) (or (and .cse40 .cse41 (or .cse42 (and .cse35 .cse23 .cse29 .cse26))) .cse0 .cse2 .cse6 .cse7 .cse8 .cse21 (not (<= .cse43 |old(~token~0)|)) .cse13 .cse14 (and .cse44 .cse45 .cse46) .cse17 .cse19 .cse47 .cse20 .cse10 .cse11 .cse48 .cse12 .cse15 .cse16 (not (<= |old(~token~0)| .cse43)) .cse18)) (let ((.cse53 (= |old(~token~0)| ~token~0)) (.cse62 (and .cse60 .cse22 .cse25 .cse55 .cse63 .cse56 .cse64 .cse65 .cse66 .cse67 .cse61 .cse32))) (or .cse48 .cse0 (and .cse28 .cse49 .cse50 .cse51 .cse52 .cse53 (and (and .cse24 .cse54 .cse55 .cse56 .cse57 .cse32) .cse25 .cse30)) .cse2 (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse40 .cse41 .cse42) .cse7 (and .cse28 (and .cse25 .cse30 (and .cse24 .cse54 .cse55 .cse57 .cse32)) .cse23 .cse50 .cse58 .cse51 .cse52 .cse53) (and .cse38 .cse23 .cse26 .cse58) .cse8 .cse9 .cse34 .cse13 .cse14 (and .cse28 .cse49 .cse26 .cse59) .cse47 .cse17 .cse19 (not (<= |old(~local~0)| |old(~token~0)|)) .cse5 (and .cse23 .cse50 .cse58 .cse36 .cse51 .cse52 .cse53) .cse10 .cse37 .cse12 (and .cse50 (and .cse49 (and .cse60 .cse25 .cse54 .cse55 .cse56 .cse57 .cse30 .cse61)) .cse52 .cse53) (and .cse49 .cse62 .cse26) .cse16 .cse18 (and .cse45 .cse44 .cse46) (and .cse23 .cse62 .cse50 .cse26 .cse51 .cse52) .cse39)) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse23 .cse26 .cse58 .cse33) .cse8 .cse9 .cse10 (and (and .cse60 .cse22 .cse25 .cse55 .cse56 .cse30 .cse61) .cse49 .cse26) .cse12 .cse34 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))))))) [2019-09-16 16:42:24,848 INFO L439 ceAbstractionStarter]: At program point L301(line 301) the Hoare annotation is: (let ((.cse5 (= 1 ~M_E~0)) (.cse0 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse28 (not (= ~E_M~0 0))) (.cse31 (not (= ~E_2~0 0)))) (let ((.cse22 (= ~m_pc~0 1)) (.cse51 (not (= 1 ~T2_E~0))) (.cse24 (= 1 ~t2_pc~0)) (.cse52 (= 1 ~m_i~0)) (.cse42 (and (and (not .cse0) (not .cse4) (not (= ~E_1~0 0)) .cse28) .cse31)) (.cse53 (not .cse5)) (.cse32 (not (= ~E_M~0 1)))) (let ((.cse26 (not (= 1 ~E_2~0))) (.cse50 (not (= ~E_1~0 1))) (.cse38 (and .cse22 .cse51 .cse24 .cse52 .cse42 .cse53 .cse32))) (let ((.cse41 (= ~m_st~0 0)) (.cse43 (not .cse22)) (.cse29 (<= 2 ~t2_st~0)) (.cse40 (= 1 ~t1_pc~0)) (.cse25 (not (= 0 ~t1_st~0))) (.cse44 (<= ~token~0 ~local~0)) (.cse27 (<= 2 ~m_st~0)) (.cse39 (and .cse26 .cse50 .cse38)) (.cse45 (= eval_~tmp~0 1)) (.cse46 (<= ~local~0 ~token~0)) (.cse37 (= 1 |old(~m_pc~0)|)) (.cse48 (not (= ~t2_pc~0 1))) (.cse49 (= ~t1_i~0 1)) (.cse30 (= ~E_1~0 |old(~E_1~0)|)) (.cse54 (= ~E_M~0 |old(~E_M~0)|)) (.cse20 (= |old(~t1_pc~0)| 1))) (let ((.cse19 (not (<= 2 |old(~t2_st~0)|))) (.cse2 (not .cse20)) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse33 (and .cse48 .cse22 .cse26 .cse42 .cse49 .cse50 .cse51 .cse30 .cse52 .cse53 .cse54 .cse32)) (.cse12 (not .cse37)) (.cse18 (and .cse29 .cse40 .cse25 .cse44 .cse27 .cse39 .cse45 .cse46)) (.cse1 (= ~T2_E~0 1)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse9 (= 1 |old(~t2_pc~0)|)) (.cse10 (= 1 |old(~E_1~0)|)) (.cse11 (= 1 |old(~E_2~0)|)) (.cse14 (not (= 1 ~t1_i~0))) (.cse16 (= 0 |old(~E_2~0)|)) (.cse36 (and .cse48 .cse22 .cse51 .cse26 .cse52 .cse42 .cse49 .cse53 .cse50 .cse54 .cse32)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse35 (not (= 0 |old(~m_st~0)|))) (.cse8 (not (= ~m_i~0 1))) (.cse13 (= 0 |old(~E_1~0)|)) (.cse15 (= 0 |old(~E_M~0)|)) (.cse23 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse34 (and .cse48 .cse26 .cse41 .cse42 .cse49 .cse50 .cse43 .cse51 .cse30 .cse52 .cse53 .cse54 .cse32))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse17 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= .cse17 |old(~token~0)|)) .cse8 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 (not (<= |old(~token~0)| .cse17)) .cse15 .cse16)) (or .cse0 .cse19 .cse1 .cse20 .cse3 .cse4 .cse5 .cse21 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse6 (not .cse9) .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse19 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (and .cse29 .cse27 .cse33)) (or .cse0 .cse19 .cse1 (and .cse29 .cse34) .cse4 .cse5 .cse6 .cse35 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 (and .cse29 .cse36 .cse27) .cse37) (or .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse20 .cse3 .cse4 (and .cse29 (and .cse26 .cse30 .cse38) .cse23 .cse25 .cse27) .cse5 .cse21 .cse6 (and .cse23 .cse25 .cse27 .cse33) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse47 (= |old(~token~0)| ~token~0))) (or .cse0 .cse18 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse4 .cse5 .cse21 .cse9 .cse10 .cse11 (and .cse29 .cse23 .cse25 .cse27 .cse39) .cse14 .cse16 (and .cse36 .cse40 .cse25 .cse27) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse36 .cse23 .cse25 .cse27) .cse20 .cse6 .cse35 .cse8 (and .cse29 (and .cse26 .cse30 (and .cse24 .cse41 .cse42 .cse43 .cse32)) .cse23 .cse25 .cse44 .cse45 .cse46 .cse47) .cse13 .cse15 (and .cse23 .cse25 .cse44 .cse34 .cse45 .cse46 .cse47) .cse37)))))))) [2019-09-16 16:42:24,848 INFO L439 ceAbstractionStarter]: At program point evalENTRY(lines 265 329) the Hoare annotation is: (let ((.cse39 (= 1 |old(~m_pc~0)|)) (.cse30 (= 1 |old(~t2_pc~0)|)) (.cse34 (= |old(~t1_pc~0)| 1)) (.cse18 (= ~m_pc~0 1))) (let ((.cse15 (= |old(~token~0)| ~token~0)) (.cse36 (= ~m_st~0 0)) (.cse37 (not .cse18)) (.cse32 (not (= ~t2_pc~0 1))) (.cse38 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse2 (not .cse34)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not .cse30)) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse23 (not .cse39)) (.cse12 (= 1 ~t1_pc~0)) (.cse14 (<= 2 ~m_st~0)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse17 (= ~E_2~0 |old(~E_2~0)|)) (.cse19 (= 1 ~t2_pc~0)) (.cse33 (<= 2 ~t2_st~0)) (.cse20 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse28 (not (<= 2 |old(~t2_st~0)|))) (.cse31 (= 0 ~t1_st~0)) (.cse1 (= ~T2_E~0 1)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 1 ~M_E~0)) (.cse29 (not (= |old(~t1_st~0)| 0))) (.cse6 (= 1 |old(~E_M~0)|)) (.cse35 (not (= 0 |old(~m_st~0)|))) (.cse10 (not (= ~m_i~0 1))) (.cse11 (= 1 |old(~E_1~0)|)) (.cse22 (= 1 |old(~E_2~0)|)) (.cse24 (= 0 |old(~E_1~0)|)) (.cse25 (not (= 1 ~t1_i~0))) (.cse26 (= 0 |old(~E_M~0)|)) (.cse27 (= 0 |old(~E_2~0)|))) (and (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= .cse9 |old(~token~0)|)) .cse10 .cse11 (let ((.cse13 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse13) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= .cse13 ~token~0) .cse21)) .cse22 .cse23 .cse24 .cse25 (not (<= |old(~token~0)| .cse9)) .cse26 .cse27)) (or .cse0 .cse28 .cse1 .cse3 .cse4 .cse5 .cse29 .cse6 .cse10 .cse30 .cse11 .cse31 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse28 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse30 .cse11 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (and .cse32 .cse18 .cse14 .cse33 .cse16 .cse21 .cse17)) (or .cse0 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) .cse34 .cse4 .cse5 .cse29 .cse6 .cse35 .cse10 .cse30 .cse11 .cse22 .cse24 .cse25 .cse26 .cse27 (and .cse32 .cse36 .cse37 .cse15 .cse16 (<= ~token~0 ~local~0) .cse17 .cse38 .cse20 .cse21 (<= ~local~0 ~token~0)) .cse39) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse32 .cse12 .cse14 .cse16 .cse17 .cse18 .cse20 .cse21) .cse5 .cse6 .cse8 .cse10 .cse30 .cse11 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse28 .cse1 (and .cse14 .cse16 .cse17 .cse18 .cse38 .cse19 .cse33 .cse20 .cse21) .cse34 .cse3 .cse4 .cse5 .cse29 .cse6 .cse7 .cse10 .cse11 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse28 .cse1 .cse4 .cse5 .cse6 .cse35 .cse10 .cse30 .cse11 (and .cse32 .cse36 .cse37 .cse33 .cse16 .cse21 .cse17) .cse22 .cse24 .cse25 .cse26 .cse27 .cse39) (or .cse0 .cse1 .cse34 .cse3 .cse4 .cse5 .cse29 .cse6 .cse10 .cse30 .cse11 (and .cse32 .cse14 .cse16 .cse17 .cse18 .cse38 .cse20 .cse21) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse23 .cse24 (and .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse33 .cse20 .cse21) .cse25 .cse26 .cse27) (or .cse0 .cse28 .cse31 .cse1 .cse4 .cse5 .cse29 .cse6 .cse35 .cse10 .cse30 .cse11 .cse22 .cse24 .cse25 .cse26 .cse27 .cse39)))) [2019-09-16 16:42:24,848 INFO L443 ceAbstractionStarter]: For program point L281(lines 271 323) no Hoare annotation was computed. [2019-09-16 16:42:24,849 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 305) no Hoare annotation was computed. [2019-09-16 16:42:24,849 INFO L439 ceAbstractionStarter]: At program point L315(line 315) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse9 (= 1 ~M_E~0))) (let ((.cse5 (= 1 ~t1_pc~0)) (.cse7 (<= 2 ~m_st~0)) (.cse28 (<= 2 ~t1_st~0)) (.cse47 (= ~t1_i~0 1)) (.cse38 (not (= ~E_1~0 1))) (.cse49 (= 1 ~m_i~0)) (.cse50 (not .cse9)) (.cse51 (not (= ~E_M~0 1))) (.cse52 (+ ~local~0 1)) (.cse37 (= 1 |old(~m_pc~0)|)) (.cse26 (= |old(~t1_pc~0)| 1)) (.cse29 (not (= ~t2_pc~0 1))) (.cse30 (= ~m_pc~0 1)) (.cse31 (not (= 1 ~E_2~0))) (.cse32 (and (and (not .cse0) (not .cse4) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0)))) (.cse48 (not (= 1 ~T2_E~0))) (.cse33 (= ~E_1~0 |old(~E_1~0)|)) (.cse34 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse8 (and .cse29 .cse30 .cse31 .cse32 .cse48 .cse33 .cse34)) (.cse6 (= |old(~t1_st~0)| ~t1_st~0)) (.cse2 (not .cse26)) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse25 (not (<= 2 |old(~t2_st~0)|))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not .cse37)) (.cse1 (= ~T2_E~0 1)) (.cse22 (<= ~token~0 .cse52)) (.cse24 (<= .cse52 ~token~0)) (.cse23 (and .cse5 .cse7 .cse28 (and .cse31 .cse47 .cse38 (and .cse30 .cse48 (= 1 ~t2_pc~0) .cse49 .cse32 .cse50 .cse51)) (not (= eval_~tmp~0 0)))) (.cse27 (not (= |old(~t1_st~0)| 0))) (.cse13 (= 1 |old(~t2_pc~0)|)) (.cse14 (= 1 |old(~E_1~0)|)) (.cse15 (= 1 |old(~E_2~0)|)) (.cse18 (not (= 1 ~t1_i~0))) (.cse20 (= 0 |old(~E_2~0)|)) (.cse10 (= 1 |old(~E_M~0)|)) (.cse36 (not (= 0 |old(~m_st~0)|))) (.cse12 (not (= ~m_i~0 1))) (.cse17 (= 0 |old(~E_1~0)|)) (.cse35 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse19 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse21 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 (not .cse13) .cse11 (not (<= .cse21 |old(~token~0)|)) .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse22 .cse23 .cse24) (not (<= |old(~token~0)| .cse21)) .cse19 .cse20)) (or .cse0 .cse25 .cse1 .cse26 .cse3 .cse4 .cse9 .cse27 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse26 .cse3 .cse4 (and .cse5 .cse7 .cse28 .cse8) .cse9 .cse27 .cse10 (and (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) .cse35 .cse6 .cse7) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse25 .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse25 .cse1 .cse4 .cse9 .cse10 .cse36 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse37) (or .cse0 .cse25 .cse1 .cse3 .cse4 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (let ((.cse45 (= 0 ~t1_st~0))) (let ((.cse40 (= ~m_st~0 0)) (.cse41 (not .cse30)) (.cse44 (= |old(~token~0)| ~token~0)) (.cse46 (and .cse29 .cse30 .cse31 .cse32 .cse47 .cse45 .cse38 .cse48 .cse49 .cse50 .cse34 .cse51)) (.cse39 (<= ~token~0 ~local~0)) (.cse42 (= eval_~tmp~0 1)) (.cse43 (<= ~local~0 ~token~0))) (or .cse0 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse22 .cse24 .cse23) .cse4 (and (and .cse29 .cse30 .cse31 .cse32 .cse38 .cse34) .cse5 .cse7 .cse28) .cse9 .cse27 .cse13 .cse14 .cse15 .cse18 .cse20 (not (<= |old(~local~0)| |old(~token~0)|)) .cse26 (and .cse5 .cse39 .cse28 (and .cse29 .cse31 .cse40 .cse32 .cse41 .cse33 .cse34) .cse42 .cse43 .cse44) .cse10 .cse36 (and .cse35 .cse39 .cse42 (and .cse29 .cse31 .cse40 .cse32 .cse45 .cse41 .cse33 .cse34) .cse43 .cse44) .cse12 .cse17 (and .cse35 .cse46 .cse7) .cse19 (and .cse5 .cse46 .cse39 .cse7 .cse42 .cse43) .cse37))))))) [2019-09-16 16:42:24,849 INFO L443 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-09-16 16:42:24,849 INFO L443 ceAbstractionStarter]: For program point L295(lines 271 323) no Hoare annotation was computed. [2019-09-16 16:42:24,850 INFO L439 ceAbstractionStarter]: At program point L324(lines 265 329) the Hoare annotation is: (let ((.cse5 (= 1 ~M_E~0)) (.cse0 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 0)) (.cse45 (not (= ~E_M~0 0))) (.cse48 (not (= ~E_2~0 0)))) (let ((.cse39 (= ~m_pc~0 1)) (.cse53 (not (= 1 ~T2_E~0))) (.cse44 (= 1 ~t2_pc~0)) (.cse54 (= 1 ~m_i~0)) (.cse40 (and (and (not .cse0) (not .cse4) (not (= ~E_1~0 0)) .cse45) .cse48)) (.cse55 (not .cse5)) (.cse49 (not (= ~E_M~0 1)))) (let ((.cse34 (not (= 1 ~E_2~0))) (.cse47 (= ~E_1~0 |old(~E_1~0)|)) (.cse52 (= ~t1_i~0 1)) (.cse36 (not (= ~E_1~0 1))) (.cse57 (and .cse39 .cse53 .cse44 .cse54 .cse40 .cse55 .cse49)) (.cse41 (= 0 ~t1_st~0))) (let ((.cse43 (= 1 |old(~m_pc~0)|)) (.cse33 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse35 (and .cse39 .cse53 .cse44 .cse40 .cse41 .cse55 .cse49)) (.cse51 (and .cse34 .cse47 .cse52 .cse36 .cse57)) (.cse38 (not (= ~t2_pc~0 1))) (.cse42 (= ~E_M~0 |old(~E_M~0)|)) (.cse28 (= |old(~t1_pc~0)| 1)) (.cse31 (= 1 |old(~t2_pc~0)|)) (.cse56 (+ ~local~0 1)) (.cse32 (<= 2 ~t2_st~0)) (.cse17 (= 1 ~t1_pc~0)) (.cse18 (<= 2 ~m_st~0)) (.cse19 (<= 2 ~t1_st~0)) (.cse20 (and .cse34 .cse52 .cse36 .cse57))) (let ((.cse9 (and .cse32 .cse17 .cse18 .cse19 .cse20)) (.cse15 (<= ~token~0 .cse56)) (.cse16 (<= .cse56 ~token~0)) (.cse7 (not .cse31)) (.cse2 (not .cse28)) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse46 (= |old(~t1_st~0)| ~t1_st~0)) (.cse25 (not (<= 2 |old(~t2_st~0)|))) (.cse37 (not (= 0 |old(~m_st~0)|))) (.cse30 (and .cse38 .cse39 .cse53 .cse34 .cse54 .cse40 .cse52 .cse55 .cse36 .cse42 .cse49)) (.cse1 (= ~T2_E~0 1)) (.cse26 (and .cse32 .cse51 .cse17 .cse18 .cse19)) (.cse27 (and .cse32 .cse33 (and .cse34 .cse47 .cse35) .cse18)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse50 (and .cse38 .cse39 .cse34 .cse40 .cse52 .cse36 .cse53 .cse47 .cse54 .cse55 .cse42 .cse49)) (.cse29 (not (= |old(~t1_st~0)| 0))) (.cse6 (= 1 |old(~E_M~0)|)) (.cse11 (not (= ~m_i~0 1))) (.cse12 (= 1 |old(~E_1~0)|)) (.cse13 (= 1 |old(~E_2~0)|)) (.cse14 (not .cse43)) (.cse21 (= 0 |old(~E_1~0)|)) (.cse22 (not (= 1 ~t1_i~0))) (.cse23 (= 0 |old(~E_M~0)|)) (.cse24 (= 0 |old(~E_2~0)|))) (and (let ((.cse10 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= .cse10 |old(~token~0)|)) .cse11 .cse12 .cse13 .cse14 (and .cse15 .cse16 (and .cse17 .cse18 .cse19 .cse20)) .cse21 .cse22 (not (<= |old(~token~0)| .cse10)) .cse23 .cse24)) (or .cse0 .cse25 .cse1 .cse26 .cse27 .cse28 .cse3 .cse4 .cse5 .cse29 .cse6 .cse7 .cse11 .cse12 .cse13 .cse14 .cse21 .cse22 .cse23 .cse24) (or .cse9 .cse0 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse4 (and .cse30 .cse17 .cse18 .cse19) .cse5 .cse29 .cse31 .cse12 .cse13 (and .cse32 .cse33 .cse18 (and .cse34 .cse35 .cse36)) .cse22 .cse24 (and .cse17 .cse15 .cse16 .cse18 .cse19 .cse20) (not (<= |old(~local~0)| |old(~token~0)|)) .cse28 .cse6 .cse37 .cse11 .cse21 (and .cse33 (and .cse38 .cse39 .cse34 .cse40 .cse41 .cse36 .cse42) .cse18) .cse23 .cse43) (or .cse0 .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse21 .cse22 .cse23 .cse24 (and .cse39 .cse17 .cse44 .cse34 .cse18 .cse45 .cse32 .cse46 .cse47 .cse48 .cse49)) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse17 .cse46 .cse18 .cse50) .cse5 .cse6 .cse8 .cse11 .cse31 .cse12 .cse13 .cse14 .cse21 .cse22 .cse23 .cse24 (and .cse32 .cse51 .cse17 .cse46 .cse18)) (or .cse0 .cse25 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11 .cse31 .cse12 .cse13 .cse14 .cse21 .cse22 .cse23 .cse24 (and .cse32 .cse18 .cse50)) (or .cse0 .cse25 .cse1 (and .cse32 (and .cse38 .cse34 (= ~m_st~0 0) .cse40 (not .cse39) .cse47 .cse42)) .cse4 .cse5 .cse6 .cse37 .cse11 .cse31 .cse12 .cse13 .cse21 .cse22 .cse23 .cse24 (and .cse32 .cse30 .cse18) .cse43) (or .cse0 .cse1 .cse26 .cse27 .cse28 .cse3 .cse4 (and .cse17 .cse18 .cse19 .cse50) .cse5 .cse29 .cse6 (and (and .cse38 .cse39 .cse34 .cse40 .cse41 .cse47 .cse42) .cse33 .cse18) .cse11 .cse31 .cse12 .cse13 .cse14 .cse21 .cse22 .cse23 .cse24))))))) [2019-09-16 16:42:24,850 INFO L443 ceAbstractionStarter]: For program point L194-2(lines 194 203) no Hoare annotation was computed. [2019-09-16 16:42:24,850 INFO L443 ceAbstractionStarter]: For program point is_transmit2_triggeredFINAL(lines 190 208) no Hoare annotation was computed. [2019-09-16 16:42:24,851 INFO L439 ceAbstractionStarter]: At program point L205(lines 193 207) the Hoare annotation is: (let ((.cse32 (= ~t1_pc~0 1)) (.cse25 (= 1 ~E_1~0)) (.cse28 (= ~t1_st~0 0)) (.cse33 (+ ~local~0 1)) (.cse3 (= 1 ~E_M~0)) (.cse5 (= ~T1_E~0 0)) (.cse19 (= 1 ~t2_pc~0)) (.cse6 (not (= ~m_i~0 1))) (.cse7 (= ~T2_E~0 1)) (.cse8 (= 0 ~E_1~0)) (.cse9 (not (= 1 ~t1_i~0))) (.cse10 (= 0 ~E_M~0)) (.cse11 (= 0 ~E_2~0)) (.cse12 (= ~T2_E~0 0)) (.cse20 (= 1 ~m_pc~0)) (.cse13 (= 1 ~M_E~0))) (let ((.cse16 (or .cse3 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20 .cse13)) (.cse24 (not (<= .cse33 ~token~0))) (.cse27 (not (<= ~token~0 .cse33))) (.cse21 (not (<= ~token~0 ~local~0))) (.cse22 (not (<= ~local~0 ~token~0))) (.cse17 (not .cse28)) (.cse18 (not .cse25)) (.cse31 (not (= 0 ~m_st~0))) (.cse29 (not .cse3)) (.cse4 (not .cse19)) (.cse14 (not .cse32)) (.cse0 (not (<= 2 ~t1_st~0))) (.cse1 (not (<= 2 ~t2_st~0))) (.cse15 (= is_transmit2_triggered_~__retres1~2 0)) (.cse23 (not (<= 2 ~m_st~0))) (.cse2 (= 1 ~E_2~0)) (.cse26 (not .cse20))) (and (or .cse0 .cse1 (or .cse2 (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) .cse14 .cse15) (or .cse1 .cse15 .cse2 .cse16) (or .cse15 (or .cse5 .cse7 .cse12 .cse13 .cse17 .cse3 .cse18 .cse6 .cse19 .cse9 .cse10 .cse11 .cse20) .cse2 .cse21 .cse22) (or .cse5 .cse1 .cse7 .cse2 .cse14 .cse23 .cse12 .cse13 .cse3 .cse15 .cse24 .cse6 .cse25 .cse26 .cse8 .cse9 .cse27 .cse10 .cse11 .cse28) (let ((.cse30 (+ ~local~0 2))) (or .cse29 .cse5 .cse7 (not (<= ~token~0 .cse30)) .cse14 .cse12 .cse13 .cse4 .cse0 .cse31 .cse6 .cse25 .cse2 .cse26 .cse15 .cse8 .cse9 .cse11 (not (<= .cse30 ~token~0)))) (or .cse5 .cse7 .cse21 .cse22 .cse32 .cse12 .cse17 .cse3 .cse31 .cse6 .cse19 .cse25 .cse2 .cse8 .cse9 .cse10 .cse11 .cse15 .cse20) (or .cse5 .cse1 .cse7 .cse32 .cse23 .cse12 .cse17 .cse3 .cse6 .cse25 .cse2 .cse26 .cse15 .cse8 .cse9 .cse10 .cse11) (or .cse5 .cse7 .cse32 .cse23 .cse12 .cse17 .cse3 .cse15 .cse6 .cse19 .cse25 .cse2 .cse26 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse2 .cse15 .cse14 .cse16) (or .cse15 .cse1 .cse2 (or .cse5 .cse7 .cse12 .cse13 .cse17 .cse3 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20) .cse32) (or .cse5 .cse7 .cse14 .cse23 .cse12 .cse13 .cse3 .cse15 .cse6 .cse19 .cse25 .cse26 .cse8 .cse9 .cse10 .cse11 .cse28) (or .cse5 .cse1 .cse15 .cse7 .cse12 .cse13 .cse3 .cse31 .cse6 .cse19 .cse25 .cse8 .cse9 .cse10 .cse11 .cse20) (or .cse5 .cse7 .cse14 .cse23 .cse12 .cse15 .cse3 .cse0 .cse24 .cse6 .cse25 .cse2 .cse26 .cse8 .cse9 .cse27 .cse10 .cse11) (or .cse5 .cse1 .cse7 .cse14 .cse15 .cse23 .cse12 .cse3 .cse0 .cse6 .cse25 .cse2 .cse26 .cse8 .cse9 .cse10 .cse11) (or .cse15 (or .cse5 .cse7 .cse12 .cse13 .cse17 .cse3 .cse6 .cse19 .cse8 .cse9 .cse10 .cse11 .cse20) .cse2 .cse32) (or .cse15 .cse1 .cse2 .cse21 .cse14 .cse22 (or .cse5 .cse7 .cse12 .cse13 .cse17 .cse3 .cse4 .cse18 .cse6 .cse9 .cse10 .cse11)) (or .cse5 .cse1 .cse7 .cse12 .cse15 .cse3 .cse31 .cse6 .cse19 .cse25 .cse2 .cse8 .cse9 .cse10 .cse11 .cse20) (or .cse5 .cse1 .cse15 .cse7 .cse23 .cse12 .cse13 .cse3 .cse6 .cse19 .cse25 .cse26 .cse8 .cse9 .cse10 .cse11) (or .cse29 .cse5 .cse7 .cse14 .cse23 .cse12 .cse13 .cse4 .cse0 .cse6 .cse25 .cse2 .cse26 .cse15 .cse8 .cse9 .cse11) (or .cse5 .cse7 .cse14 .cse23 .cse12 .cse3 .cse15 .cse0 .cse6 .cse19 .cse25 .cse2 .cse26 .cse8 .cse9 .cse10 .cse11) (or .cse5 .cse1 .cse7 .cse15 .cse23 .cse12 .cse3 .cse6 .cse19 .cse25 .cse2 .cse26 .cse8 .cse9 .cse10 .cse11)))) [2019-09-16 16:42:24,851 INFO L446 ceAbstractionStarter]: At program point is_transmit2_triggeredENTRY(lines 190 208) the Hoare annotation is: true [2019-09-16 16:42:24,851 INFO L443 ceAbstractionStarter]: For program point is_transmit2_triggeredEXIT(lines 190 208) no Hoare annotation was computed. [2019-09-16 16:42:24,851 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 200) no Hoare annotation was computed. [2019-09-16 16:42:24,852 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 203) no Hoare annotation was computed. [2019-09-16 16:42:24,852 INFO L439 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 330 367) the Hoare annotation is: (let ((.cse22 (= 1 ~m_pc~0)) (.cse25 (= |old(~T2_E~0)| ~T2_E~0)) (.cse28 (= ~E_1~0 |old(~E_1~0)|)) (.cse30 (= ~E_2~0 |old(~E_2~0)|)) (.cse26 (= ~M_E~0 |old(~M_E~0)|)) (.cse27 (= |old(~T1_E~0)| ~T1_E~0)) (.cse29 (= ~E_M~0 |old(~E_M~0)|)) (.cse19 (= ~t1_pc~0 1))) (let ((.cse20 (not (= ~t1_st~0 0))) (.cse2 (not .cse19)) (.cse3 (not (<= 2 ~m_st~0))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse5 (and .cse25 .cse28 .cse30 .cse26 .cse27 .cse29)) (.cse13 (not .cse22)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse18 (not (<= 2 ~t2_st~0))) (.cse1 (= |old(~T2_E~0)| 1)) (.cse4 (= |old(~T2_E~0)| 0)) (.cse6 (= 1 |old(~M_E~0)|)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse21 (not (= 0 ~m_st~0))) (.cse9 (not (= ~m_i~0 1))) (.cse10 (= 1 ~t2_pc~0)) (.cse11 (= 1 |old(~E_1~0)|)) (.cse23 (and .cse25 .cse26 .cse27 .cse28 .cse29 .cse30)) (.cse12 (= 1 |old(~E_2~0)|)) (.cse14 (= 0 |old(~E_1~0)|)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (= 0 |old(~E_M~0)|)) (.cse17 (= 0 |old(~E_2~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17) (or .cse0 .cse1 (not (<= ~token~0 ~local~0)) (not (<= ~local~0 ~token~0)) .cse19 .cse4 .cse6 .cse20 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse5 .cse22) (or .cse0 .cse18 .cse1 .cse5 .cse19 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse1 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23) (or .cse0 .cse1 .cse19 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 .cse10 .cse11 .cse5 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse24 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (not (<= .cse24 ~token~0)) .cse9 .cse11 .cse5 .cse12 .cse13 .cse14 .cse15 (not (<= ~token~0 .cse24)) .cse16 .cse17)) (or .cse0 .cse18 .cse1 .cse4 .cse6 .cse7 .cse21 .cse9 .cse10 .cse11 .cse23 .cse12 .cse14 .cse15 .cse16 .cse17 .cse22)))) [2019-09-16 16:42:24,852 INFO L443 ceAbstractionStarter]: For program point L349-1(lines 333 366) no Hoare annotation was computed. [2019-09-16 16:42:24,852 INFO L443 ceAbstractionStarter]: For program point L339-1(lines 333 366) no Hoare annotation was computed. [2019-09-16 16:42:24,852 INFO L443 ceAbstractionStarter]: For program point L354-1(lines 333 366) no Hoare annotation was computed. [2019-09-16 16:42:24,853 INFO L443 ceAbstractionStarter]: For program point L344-1(lines 333 366) no Hoare annotation was computed. [2019-09-16 16:42:24,853 INFO L443 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 330 367) no Hoare annotation was computed. [2019-09-16 16:42:24,853 INFO L443 ceAbstractionStarter]: For program point L334-1(lines 333 366) no Hoare annotation was computed. [2019-09-16 16:42:24,853 INFO L443 ceAbstractionStarter]: For program point L359-1(lines 330 367) no Hoare annotation was computed. [2019-09-16 16:42:24,853 INFO L443 ceAbstractionStarter]: For program point update_channelsEXIT(lines 209 216) no Hoare annotation was computed. [2019-09-16 16:42:24,853 INFO L446 ceAbstractionStarter]: At program point update_channelsFINAL(lines 209 216) the Hoare annotation is: true [2019-09-16 16:42:24,854 INFO L439 ceAbstractionStarter]: At program point L543-1(lines 540 580) the Hoare annotation is: (let ((.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (not (= ~t2_pc~0 1))) (.cse6 (not (= 1 ~E_2~0))) (.cse10 (= |old(~T2_E~0)| ~T2_E~0)) (.cse25 (not (= 1 ~T2_E~0))) (.cse11 (not (= ~T1_E~0 0))) (.cse21 (= 1 ~t2_pc~0)) (.cse27 (not (= ~T2_E~0 0))) (.cse18 (not (= ~E_1~0 0))) (.cse22 (not (= ~E_M~0 0))) (.cse13 (not (= 1 ~M_E~0))) (.cse15 (not (= ~E_2~0 0))) (.cse23 (not (= ~E_M~0 1))) (.cse26 (= ~t1_i~0 1)) (.cse20 (not (= ~E_1~0 1))) (.cse17 (= ~m_pc~0 1))) (let ((.cse7 (= ~m_st~0 0)) (.cse8 (not .cse17)) (.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse16 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse19 (= 0 ~t1_st~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse2 (and .cse6 (and .cse10 .cse25 (and .cse17 .cse11 .cse21 .cse27 .cse18 .cse22 .cse13 .cse15) .cse23) .cse26 .cse20)) (.cse0 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 2 ~t1_st~0)) (.cse24 (and .cse10 .cse25 .cse6 .cse26 .cse20 .cse14 (and .cse5 .cse17 .cse11 .cse27 (= 1 ~m_i~0) .cse18 .cse13 .cse15) .cse23))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) .cse2 (<= .cse1 ~token~0) .cse3 .cse4)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (= |old(~T2_E~0)| 0) (and .cse16 (and .cse10 .cse6 (and .cse5 .cse17 .cse11 .cse18 .cse19 .cse13 .cse15) .cse20 .cse14) .cse3) (and .cse9 .cse16 .cse3 (and .cse6 (and .cse10 (and .cse17 .cse11 .cse21 .cse18 .cse22 .cse19 .cse13 .cse15) .cse23) .cse20)) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse5 .cse6 .cse7 .cse8 (= |old(~token~0)| ~token~0) .cse10 .cse12 (<= ~token~0 ~local~0) .cse13 .cse15 .cse16 .cse19 .cse11 .cse14 (<= ~local~0 ~token~0)) (and .cse9 .cse3 .cse24) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse9 .cse0 .cse2 .cse3 .cse4) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and .cse0 .cse3 .cse4 .cse24) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:42:24,854 INFO L439 ceAbstractionStarter]: At program point L539(line 539) the Hoare annotation is: (let ((.cse0 (not (= ~t2_pc~0 1))) (.cse1 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~E_2~0 |old(~E_2~0)|)) (.cse2 (= 0 ~t1_st~0)) (.cse5 (= |old(~T1_E~0)| ~T1_E~0)) (.cse7 (= ~E_M~0 |old(~E_M~0)|))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~t2_st~0) .cse5 .cse6 .cse7 .cse8) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (and .cse0 .cse1 .cse3 (= |old(~token~0)| ~token~0) .cse4 .cse6 (<= ~token~0 ~local~0) .cse8 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse5 .cse7 (<= ~local~0 ~token~0)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|))) [2019-09-16 16:42:24,854 INFO L443 ceAbstractionStarter]: For program point start_simulationEXIT(lines 528 586) no Hoare annotation was computed. [2019-09-16 16:42:24,855 INFO L439 ceAbstractionStarter]: At program point L537(line 537) the Hoare annotation is: (let ((.cse0 (not (= ~t2_pc~0 1))) (.cse1 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse9 (= ~E_2~0 |old(~E_2~0)|)) (.cse2 (= 0 ~t1_st~0)) (.cse5 (= ~M_E~0 |old(~M_E~0)|)) (.cse6 (= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (= ~E_M~0 |old(~E_M~0)|))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~t2_st~0) .cse5 .cse6 .cse7 .cse8 .cse9) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse0 .cse1 .cse3 (= |old(~token~0)| ~token~0) .cse4 .cse7 (<= ~token~0 ~local~0) .cse9 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse5 .cse6 .cse8 (<= ~local~0 ~token~0)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|))) [2019-09-16 16:42:24,855 INFO L439 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse3 (= 1 ~t2_pc~0)) (.cse6 (not (= ~E_M~0 0))) (.cse13 (not (= ~E_M~0 1))) (.cse17 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse18 (= 0 ~t1_st~0)) (.cse8 (not (= ~E_1~0 1))) (.cse11 (not (= ~E_1~0 0))) (.cse15 (not (= ~t2_pc~0 1))) (.cse4 (not (= 1 ~E_2~0))) (.cse0 (= ~m_pc~0 1)) (.cse14 (<= 2 ~t2_st~0)) (.cse9 (= |old(~T2_E~0)| ~T2_E~0)) (.cse10 (not (= ~T1_E~0 0))) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (not (= ~E_2~0 0)))) (or (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse2 ~token~0) .cse11 .cse12 .cse13)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse0 .cse1 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse12) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and .cse0 .cse17 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12 .cse13) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse15 .cse0 .cse4 .cse5 .cse8 .cse14 .cse9 .cse10 .cse11 .cse16 .cse12) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and .cse15 .cse0 .cse17 .cse4 .cse5 .cse18 .cse8 .cse9 .cse10 .cse11 .cse16 .cse12) (and .cse15 .cse4 (= ~m_st~0 0) (not .cse0) .cse14 .cse9 .cse10 (= ~E_1~0 |old(~E_1~0)|) .cse16 .cse12) (= 1 |old(~m_pc~0)|))) [2019-09-16 16:42:24,855 INFO L443 ceAbstractionStarter]: For program point L562(lines 562 571) no Hoare annotation was computed. [2019-09-16 16:42:24,855 INFO L439 ceAbstractionStarter]: At program point L562-1(lines 562 571) the Hoare annotation is: (let ((.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (not (= ~t2_pc~0 1))) (.cse6 (not (= 1 ~E_2~0))) (.cse9 (= |old(~T2_E~0)| ~T2_E~0)) (.cse22 (not (= 1 ~T2_E~0))) (.cse7 (= ~m_pc~0 1)) (.cse10 (not (= ~T1_E~0 0))) (.cse18 (= 1 ~t2_pc~0)) (.cse24 (not (= ~T2_E~0 0))) (.cse15 (not (= ~E_1~0 0))) (.cse19 (not (= ~E_M~0 0))) (.cse11 (not (= 1 ~M_E~0))) (.cse13 (not (= ~E_2~0 0))) (.cse20 (not (= ~E_M~0 1))) (.cse23 (= ~t1_i~0 1)) (.cse17 (not (= ~E_1~0 1)))) (let ((.cse14 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse16 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~t2_st~0)) (.cse2 (and .cse6 (and .cse9 .cse22 (and .cse7 .cse10 .cse18 .cse24 .cse15 .cse19 .cse11 .cse13) .cse20) .cse23 .cse17)) (.cse0 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 2 ~t1_st~0)) (.cse21 (and .cse9 .cse22 .cse6 .cse23 .cse17 .cse12 (and .cse5 .cse7 .cse10 .cse24 (= 1 ~m_i~0) .cse15 .cse11 .cse13) .cse20))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) .cse2 (<= .cse1 ~token~0) .cse3 .cse4)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse5 .cse6 (= ~m_st~0 0) (not .cse7) .cse8 .cse9 .cse10 (= ~E_1~0 |old(~E_1~0)|) .cse11 .cse12 .cse13) (= |old(~T2_E~0)| 0) (and .cse14 (and .cse9 .cse6 (and .cse5 .cse7 .cse10 .cse15 .cse16 .cse11 .cse13) .cse17 .cse12) .cse3) (and .cse8 .cse14 .cse3 (and .cse6 (and .cse9 (and .cse7 .cse10 .cse18 .cse15 .cse19 .cse16 .cse11 .cse13) .cse20) .cse17)) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse8 .cse3 .cse21) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse8 .cse0 .cse2 .cse3 .cse4) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and .cse0 .cse3 .cse4 .cse21) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:42:24,856 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-09-16 16:42:24,856 INFO L439 ceAbstractionStarter]: At program point L556(line 556) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse3 (= 1 ~t2_pc~0)) (.cse6 (not (= ~E_M~0 0))) (.cse13 (not (= ~E_M~0 1))) (.cse17 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse18 (= 0 ~t1_st~0)) (.cse8 (not (= ~E_1~0 1))) (.cse11 (not (= ~E_1~0 0))) (.cse15 (not (= ~t2_pc~0 1))) (.cse4 (not (= 1 ~E_2~0))) (.cse0 (= ~m_pc~0 1)) (.cse14 (<= 2 ~t2_st~0)) (.cse9 (= |old(~T2_E~0)| ~T2_E~0)) (.cse10 (not (= ~T1_E~0 0))) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (not (= ~E_2~0 0)))) (or (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse2 ~token~0) .cse11 .cse12 .cse13)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse0 .cse1 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse12) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and .cse0 .cse17 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12 .cse13) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse15 .cse0 .cse4 .cse5 .cse8 .cse14 .cse9 .cse10 .cse11 .cse16 .cse12) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and .cse15 .cse0 .cse17 .cse4 .cse5 .cse18 .cse8 .cse9 .cse10 .cse11 .cse16 .cse12) (and .cse15 .cse4 (= ~m_st~0 0) (not .cse0) .cse14 .cse9 .cse10 (= ~E_1~0 |old(~E_1~0)|) .cse16 .cse12) (= 1 |old(~m_pc~0)|))) [2019-09-16 16:42:24,856 INFO L439 ceAbstractionStarter]: At program point L581(lines 528 586) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= ~T1_E~0 0)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|)) [2019-09-16 16:42:24,856 INFO L439 ceAbstractionStarter]: At program point start_simulationENTRY(lines 528 586) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (not (= ~t2_pc~0 1)) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2019-09-16 16:42:24,857 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-09-16 16:42:24,857 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2019-09-16 16:42:24,857 INFO L443 ceAbstractionStarter]: For program point L573(line 573) no Hoare annotation was computed. [2019-09-16 16:42:24,857 INFO L439 ceAbstractionStarter]: At program point L538(line 538) the Hoare annotation is: (let ((.cse0 (not (= ~t2_pc~0 1))) (.cse1 (= ~m_st~0 0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~E_2~0 |old(~E_2~0)|)) (.cse2 (= 0 ~t1_st~0)) (.cse5 (= |old(~T1_E~0)| ~T1_E~0)) (.cse7 (= ~E_M~0 |old(~E_M~0)|))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~t2_st~0) .cse5 .cse6 .cse7 .cse8) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (and .cse0 .cse1 .cse3 (= |old(~token~0)| ~token~0) .cse4 .cse6 (<= ~token~0 ~local~0) .cse8 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse5 .cse7 (<= ~local~0 ~token~0)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (= 1 |old(~m_pc~0)|))) [2019-09-16 16:42:24,857 INFO L439 ceAbstractionStarter]: At program point L536(line 536) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (not (= ~t2_pc~0 1)) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2019-09-16 16:42:24,857 INFO L439 ceAbstractionStarter]: At program point L536-1(line 536) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (= 0 |old(~E_1~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_M~0)|) (= 0 |old(~E_2~0)|) (and (not (= ~t2_pc~0 1)) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_2~0 |old(~E_2~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2019-09-16 16:42:24,858 INFO L439 ceAbstractionStarter]: At program point L565(line 565) the Hoare annotation is: (let ((.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (not (= ~t2_pc~0 1))) (.cse6 (not (= 1 ~E_2~0))) (.cse9 (= |old(~T2_E~0)| ~T2_E~0)) (.cse22 (not (= 1 ~T2_E~0))) (.cse7 (= ~m_pc~0 1)) (.cse10 (not (= ~T1_E~0 0))) (.cse18 (= 1 ~t2_pc~0)) (.cse24 (not (= ~T2_E~0 0))) (.cse15 (not (= ~E_1~0 0))) (.cse19 (not (= ~E_M~0 0))) (.cse11 (not (= 1 ~M_E~0))) (.cse13 (not (= ~E_2~0 0))) (.cse20 (not (= ~E_M~0 1))) (.cse23 (= ~t1_i~0 1)) (.cse17 (not (= ~E_1~0 1)))) (let ((.cse14 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse16 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~t2_st~0)) (.cse2 (and .cse6 (and .cse9 .cse22 (and .cse7 .cse10 .cse18 .cse24 .cse15 .cse19 .cse11 .cse13) .cse20) .cse23 .cse17)) (.cse0 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 2 ~t1_st~0)) (.cse21 (and .cse9 .cse22 .cse6 .cse23 .cse17 .cse12 (and .cse5 .cse7 .cse10 .cse24 (= 1 ~m_i~0) .cse15 .cse11 .cse13) .cse20))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) .cse2 (<= .cse1 ~token~0) .cse3 .cse4)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse5 .cse6 (= ~m_st~0 0) (not .cse7) .cse8 .cse9 .cse10 (= ~E_1~0 |old(~E_1~0)|) .cse11 .cse12 .cse13) (= |old(~T2_E~0)| 0) (and .cse14 (and .cse9 .cse6 (and .cse5 .cse7 .cse10 .cse15 .cse16 .cse11 .cse13) .cse17 .cse12) .cse3) (and .cse8 .cse14 .cse3 (and .cse6 (and .cse9 (and .cse7 .cse10 .cse18 .cse15 .cse19 .cse16 .cse11 .cse13) .cse20) .cse17)) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse8 .cse3 .cse21) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse8 .cse0 .cse2 .cse3 .cse4) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and .cse0 .cse3 .cse4 .cse21) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:42:24,858 INFO L439 ceAbstractionStarter]: At program point L565-1(line 565) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse3 (= 1 ~t2_pc~0)) (.cse6 (not (= ~E_M~0 0))) (.cse13 (not (= ~E_M~0 1))) (.cse17 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse18 (= 0 ~t1_st~0)) (.cse8 (not (= ~E_1~0 1))) (.cse11 (not (= ~E_1~0 0))) (.cse15 (not (= ~t2_pc~0 1))) (.cse4 (not (= 1 ~E_2~0))) (.cse0 (= ~m_pc~0 1)) (.cse14 (<= 2 ~t2_st~0)) (.cse9 (= |old(~T2_E~0)| ~T2_E~0)) (.cse10 (not (= ~T1_E~0 0))) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (not (= ~E_2~0 0)))) (or (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse2 ~token~0) .cse11 .cse12 .cse13)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse0 .cse1 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse12) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and .cse0 .cse17 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12 .cse13) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse15 .cse0 .cse4 .cse5 .cse8 .cse14 .cse9 .cse10 .cse11 .cse16 .cse12) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and .cse15 .cse0 .cse17 .cse4 .cse5 .cse18 .cse8 .cse9 .cse10 .cse11 .cse16 .cse12) (and .cse15 .cse4 (= ~m_st~0 0) (not .cse0) .cse14 .cse9 .cse10 (= ~E_1~0 |old(~E_1~0)|) .cse16 .cse12) (= 1 |old(~m_pc~0)|))) [2019-09-16 16:42:24,859 INFO L439 ceAbstractionStarter]: At program point L557(line 557) the Hoare annotation is: (let ((.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (not (= ~t2_pc~0 1))) (.cse6 (not (= 1 ~E_2~0))) (.cse9 (= |old(~T2_E~0)| ~T2_E~0)) (.cse22 (not (= 1 ~T2_E~0))) (.cse7 (= ~m_pc~0 1)) (.cse10 (not (= ~T1_E~0 0))) (.cse18 (= 1 ~t2_pc~0)) (.cse24 (not (= ~T2_E~0 0))) (.cse15 (not (= ~E_1~0 0))) (.cse19 (not (= ~E_M~0 0))) (.cse11 (not (= 1 ~M_E~0))) (.cse13 (not (= ~E_2~0 0))) (.cse20 (not (= ~E_M~0 1))) (.cse23 (= ~t1_i~0 1)) (.cse17 (not (= ~E_1~0 1)))) (let ((.cse14 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse16 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~t2_st~0)) (.cse2 (and .cse6 (and .cse9 .cse22 (and .cse7 .cse10 .cse18 .cse24 .cse15 .cse19 .cse11 .cse13) .cse20) .cse23 .cse17)) (.cse0 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 2 ~t1_st~0)) (.cse21 (and .cse9 .cse22 .cse6 .cse23 .cse17 .cse12 (and .cse5 .cse7 .cse10 .cse24 (= 1 ~m_i~0) .cse15 .cse11 .cse13) .cse20))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) .cse2 (<= .cse1 ~token~0) .cse3 .cse4)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse5 .cse6 (= ~m_st~0 0) (not .cse7) .cse8 .cse9 .cse10 (= ~E_1~0 |old(~E_1~0)|) .cse11 .cse12 .cse13) (= |old(~T2_E~0)| 0) (and .cse14 (and .cse9 .cse6 (and .cse5 .cse7 .cse10 .cse15 .cse16 .cse11 .cse13) .cse17 .cse12) .cse3) (and .cse8 .cse14 .cse3 (and .cse6 (and .cse9 (and .cse7 .cse10 .cse18 .cse15 .cse19 .cse16 .cse11 .cse13) .cse20) .cse17)) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse8 .cse3 .cse21) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse8 .cse0 .cse2 .cse3 .cse4) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and .cse0 .cse3 .cse4 .cse21) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:42:24,859 INFO L439 ceAbstractionStarter]: At program point L555(line 555) the Hoare annotation is: (let ((.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (not (= ~t2_pc~0 1))) (.cse6 (not (= 1 ~E_2~0))) (.cse9 (= |old(~T2_E~0)| ~T2_E~0)) (.cse22 (not (= 1 ~T2_E~0))) (.cse7 (= ~m_pc~0 1)) (.cse10 (not (= ~T1_E~0 0))) (.cse18 (= 1 ~t2_pc~0)) (.cse24 (not (= ~T2_E~0 0))) (.cse15 (not (= ~E_1~0 0))) (.cse19 (not (= ~E_M~0 0))) (.cse11 (not (= 1 ~M_E~0))) (.cse13 (not (= ~E_2~0 0))) (.cse20 (not (= ~E_M~0 1))) (.cse23 (= ~t1_i~0 1)) (.cse17 (not (= ~E_1~0 1)))) (let ((.cse14 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse16 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~t2_st~0)) (.cse2 (and .cse6 (and .cse9 .cse22 (and .cse7 .cse10 .cse18 .cse24 .cse15 .cse19 .cse11 .cse13) .cse20) .cse23 .cse17)) (.cse0 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 2 ~t1_st~0)) (.cse21 (and .cse9 .cse22 .cse6 .cse23 .cse17 .cse12 (and .cse5 .cse7 .cse10 .cse24 (= 1 ~m_i~0) .cse15 .cse11 .cse13) .cse20))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) .cse2 (<= .cse1 ~token~0) .cse3 .cse4)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse5 .cse6 (= ~m_st~0 0) (not .cse7) .cse8 .cse9 .cse10 (= ~E_1~0 |old(~E_1~0)|) .cse11 .cse12 .cse13) (= |old(~T2_E~0)| 0) (and .cse14 (and .cse9 .cse6 (and .cse5 .cse7 .cse10 .cse15 .cse16 .cse11 .cse13) .cse17 .cse12) .cse3) (and .cse8 .cse14 .cse3 (and .cse6 (and .cse9 (and .cse7 .cse10 .cse18 .cse15 .cse19 .cse16 .cse11 .cse13) .cse20) .cse17)) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse8 .cse3 .cse21) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse8 .cse0 .cse2 .cse3 .cse4) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and .cse0 .cse3 .cse4 .cse21) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:42:24,859 INFO L439 ceAbstractionStarter]: At program point L555-1(line 555) the Hoare annotation is: (let ((.cse1 (= 1 ~t1_pc~0)) (.cse7 (<= 2 ~t1_st~0)) (.cse3 (= 1 ~t2_pc~0)) (.cse6 (not (= ~E_M~0 0))) (.cse13 (not (= ~E_M~0 1))) (.cse17 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse18 (= 0 ~t1_st~0)) (.cse8 (not (= ~E_1~0 1))) (.cse11 (not (= ~E_1~0 0))) (.cse15 (not (= ~t2_pc~0 1))) (.cse4 (not (= 1 ~E_2~0))) (.cse0 (= ~m_pc~0 1)) (.cse14 (<= 2 ~t2_st~0)) (.cse9 (= |old(~T2_E~0)| ~T2_E~0)) (.cse10 (not (= ~T1_E~0 0))) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (not (= ~E_2~0 0)))) (or (let ((.cse2 (+ ~local~0 1))) (and .cse0 .cse1 (<= ~token~0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse2 ~token~0) .cse11 .cse12 .cse13)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (= |old(~T2_E~0)| 0) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse0 .cse1 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse12) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (and .cse0 .cse17 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12 .cse13) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse15 .cse0 .cse4 .cse5 .cse8 .cse14 .cse9 .cse10 .cse11 .cse16 .cse12) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and .cse15 .cse0 .cse17 .cse4 .cse5 .cse18 .cse8 .cse9 .cse10 .cse11 .cse16 .cse12) (and .cse15 .cse4 (= ~m_st~0 0) (not .cse0) .cse14 .cse9 .cse10 (= ~E_1~0 |old(~E_1~0)|) .cse16 .cse12) (= 1 |old(~m_pc~0)|))) [2019-09-16 16:42:24,860 INFO L439 ceAbstractionStarter]: At program point L551(line 551) the Hoare annotation is: (let ((.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (not (= ~t2_pc~0 1))) (.cse6 (not (= 1 ~E_2~0))) (.cse9 (= |old(~T2_E~0)| ~T2_E~0)) (.cse22 (not (= 1 ~T2_E~0))) (.cse7 (= ~m_pc~0 1)) (.cse10 (not (= ~T1_E~0 0))) (.cse18 (= 1 ~t2_pc~0)) (.cse24 (not (= ~T2_E~0 0))) (.cse15 (not (= ~E_1~0 0))) (.cse19 (not (= ~E_M~0 0))) (.cse11 (not (= 1 ~M_E~0))) (.cse13 (not (= ~E_2~0 0))) (.cse20 (not (= ~E_M~0 1))) (.cse23 (= ~t1_i~0 1)) (.cse17 (not (= ~E_1~0 1)))) (let ((.cse14 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse16 (= 0 ~t1_st~0)) (.cse8 (<= 2 ~t2_st~0)) (.cse2 (and .cse6 (and .cse9 .cse22 (and .cse7 .cse10 .cse18 .cse24 .cse15 .cse19 .cse11 .cse13) .cse20) .cse23 .cse17)) (.cse0 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 2 ~t1_st~0)) (.cse21 (and .cse9 .cse22 .cse6 .cse23 .cse17 .cse12 (and .cse5 .cse7 .cse10 .cse24 (= 1 ~m_i~0) .cse15 .cse11 .cse13) .cse20))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) .cse2 (<= .cse1 ~token~0) .cse3 .cse4)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse5 .cse6 (= ~m_st~0 0) (not .cse7) .cse8 .cse9 .cse10 (= ~E_1~0 |old(~E_1~0)|) .cse11 .cse12 .cse13) (= |old(~T2_E~0)| 0) (and .cse14 (and .cse9 .cse6 (and .cse5 .cse7 .cse10 .cse15 .cse16 .cse11 .cse13) .cse17 .cse12) .cse3) (and .cse8 .cse14 .cse3 (and .cse6 (and .cse9 (and .cse7 .cse10 .cse18 .cse15 .cse19 .cse16 .cse11 .cse13) .cse20) .cse17)) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse8 .cse3 .cse21) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse8 .cse0 .cse2 .cse3 .cse4) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and .cse0 .cse3 .cse4 .cse21) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:42:24,860 INFO L443 ceAbstractionStarter]: For program point L551-1(line 551) no Hoare annotation was computed. [2019-09-16 16:42:24,860 INFO L439 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse5 (not (= ~t2_pc~0 1))) (.cse6 (not (= 1 ~E_2~0))) (.cse10 (= |old(~T2_E~0)| ~T2_E~0)) (.cse25 (not (= 1 ~T2_E~0))) (.cse11 (not (= ~T1_E~0 0))) (.cse21 (= 1 ~t2_pc~0)) (.cse27 (not (= ~T2_E~0 0))) (.cse18 (not (= ~E_1~0 0))) (.cse22 (not (= ~E_M~0 0))) (.cse13 (not (= 1 ~M_E~0))) (.cse15 (not (= ~E_2~0 0))) (.cse23 (not (= ~E_M~0 1))) (.cse26 (= ~t1_i~0 1)) (.cse20 (not (= ~E_1~0 1))) (.cse17 (= ~m_pc~0 1))) (let ((.cse7 (= ~m_st~0 0)) (.cse8 (not .cse17)) (.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse16 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse19 (= 0 ~t1_st~0)) (.cse9 (<= 2 ~t2_st~0)) (.cse2 (and .cse6 (and .cse10 .cse25 (and .cse17 .cse11 .cse21 .cse27 .cse18 .cse22 .cse13 .cse15) .cse23) .cse26 .cse20)) (.cse0 (= 1 ~t1_pc~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 2 ~t1_st~0)) (.cse24 (and .cse10 .cse25 .cse6 .cse26 .cse20 .cse14 (and .cse5 .cse17 .cse11 .cse27 (= 1 ~m_i~0) .cse18 .cse13 .cse15) .cse23))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) .cse2 (<= .cse1 ~token~0) .cse3 .cse4)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (= |old(~T2_E~0)| 0) (and .cse16 (and .cse10 .cse6 (and .cse5 .cse17 .cse11 .cse18 .cse19 .cse13 .cse15) .cse20 .cse14) .cse3) (and .cse9 .cse16 .cse3 (and .cse6 (and .cse10 (and .cse17 .cse11 .cse21 .cse18 .cse22 .cse19 .cse13 .cse15) .cse23) .cse20)) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (= 1 |old(~E_1~0)|) (= 1 |old(~E_2~0)|) (not (= 1 ~t1_i~0)) (= 0 |old(~E_2~0)|) (and .cse5 .cse6 .cse7 .cse8 (= |old(~token~0)| ~token~0) .cse10 .cse12 (<= ~token~0 ~local~0) .cse13 .cse15 .cse16 .cse19 .cse11 .cse14 (<= ~local~0 ~token~0)) (and .cse9 .cse3 .cse24) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse9 .cse0 .cse2 .cse3 .cse4) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and .cse0 .cse3 .cse4 .cse24) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)))) [2019-09-16 16:42:24,860 INFO L443 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2019-09-16 16:42:24,861 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2019-09-16 16:42:24,861 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 165) no Hoare annotation was computed. [2019-09-16 16:42:24,861 INFO L443 ceAbstractionStarter]: For program point L156-2(lines 156 165) no Hoare annotation was computed. [2019-09-16 16:42:24,861 INFO L443 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 152 170) no Hoare annotation was computed. [2019-09-16 16:42:24,861 INFO L443 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 152 170) no Hoare annotation was computed. [2019-09-16 16:42:24,862 INFO L439 ceAbstractionStarter]: At program point L167(lines 155 169) the Hoare annotation is: (let ((.cse21 (= 1 ~m_pc~0)) (.cse24 (= ~t1_pc~0 1)) (.cse29 (+ ~local~0 1)) (.cse27 (= ~t1_st~0 0))) (let ((.cse25 (not .cse27)) (.cse26 (not (= 0 ~m_st~0))) (.cse17 (not (<= 2 ~t2_st~0))) (.cse22 (not (<= .cse29 ~token~0))) (.cse23 (not (<= ~token~0 .cse29))) (.cse18 (not (<= ~token~0 ~local~0))) (.cse19 (not (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 ~t1_st~0))) (.cse11 (= 1 ~E_2~0)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse3 (not .cse24)) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= ~T2_E~0 0)) (.cse20 (= 1 ~M_E~0)) (.cse1 (= 0 is_master_triggered_~__retres1~0)) (.cse6 (= 1 ~E_M~0)) (.cse8 (not (= ~m_i~0 1))) (.cse9 (= 1 ~t2_pc~0)) (.cse10 (= 1 ~E_1~0)) (.cse12 (not .cse21)) (.cse13 (= 0 ~E_1~0)) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (= 0 ~E_M~0)) (.cse16 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse2 .cse18 .cse3 .cse19 .cse5 .cse20 .cse6 (not .cse9) .cse7 .cse1 .cse8 .cse11 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse1 .cse2 .cse5 .cse20 .cse6 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse21) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse22 .cse8 .cse10 .cse11 .cse12 .cse1 .cse13 .cse14 .cse23 .cse15 .cse16) (or .cse0 .cse2 .cse24 .cse5 .cse20 .cse25 .cse6 .cse1 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse21) (or .cse0 .cse17 .cse2 .cse5 .cse20 .cse6 .cse26 .cse8 .cse9 .cse10 .cse1 .cse13 .cse14 .cse15 .cse16 .cse21) (or .cse0 .cse2 .cse24 .cse4 .cse5 .cse25 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse1) (or .cse0 .cse17 .cse2 .cse4 .cse1 .cse5 .cse20 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse2 .cse24 .cse5 .cse20 .cse25 .cse6 .cse8 .cse1 .cse11 .cse13 .cse14 .cse15 .cse16 .cse21) (or .cse0 .cse1 .cse17 .cse2 .cse24 .cse4 .cse5 .cse25 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse2 .cse5 .cse6 .cse26 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse1 .cse21) (or .cse0 .cse17 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse1) (or .cse0 .cse17 .cse2 .cse3 .cse4 .cse1 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse18 .cse19 .cse24 .cse5 .cse25 .cse6 .cse26 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse21) (or .cse0 .cse17 .cse2 .cse3 .cse4 .cse1 .cse5 .cse20 .cse6 .cse22 .cse8 .cse10 .cse12 .cse13 .cse14 .cse23 .cse15 .cse16 .cse27) (let ((.cse28 (+ ~local~0 2))) (or .cse6 .cse1 .cse0 .cse2 (not (<= ~token~0 .cse28)) .cse3 .cse4 .cse5 .cse20 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (<= .cse28 ~token~0)))) (or .cse0 .cse2 .cse18 .cse3 .cse19 .cse1 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse21) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse20 .cse1 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27)))) [2019-09-16 16:42:24,862 INFO L446 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 152 170) the Hoare annotation is: true [2019-09-16 16:42:24,862 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:42:24,862 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~t2_pc~0 1)) (not (= 1 ~t1_pc~0)) (not (= ~T2_E~0 0)) (not (= ~t1_i~0 1)) (not (= 1 ~E_2~0)) (= ~m_st~0 0) (not (= 1 ~m_i~0)) (not (= ~E_M~0 0)) (= 0 ~t1_st~0) (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (not (= ~T1_E~0 0)) (not (= 1 ~T2_E~0)) (<= ~token~0 ~local~0) (not (= ~E_1~0 0)) (not (= 1 ~M_E~0)) (<= ~local~0 ~token~0) (not (= ~E_2~0 0)) (not (= ~E_M~0 1))) [2019-09-16 16:42:24,862 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:42:24,862 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:42:24,862 INFO L443 ceAbstractionStarter]: For program point L479-1(lines 463 496) no Hoare annotation was computed. [2019-09-16 16:42:24,863 INFO L443 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 460 497) no Hoare annotation was computed. [2019-09-16 16:42:24,863 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 463 496) no Hoare annotation was computed. [2019-09-16 16:42:24,863 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 463 496) no Hoare annotation was computed. [2019-09-16 16:42:24,863 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 463 496) no Hoare annotation was computed. [2019-09-16 16:42:24,863 INFO L439 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 460 497) the Hoare annotation is: (let ((.cse21 (= 1 ~m_pc~0)) (.cse2 (= ~t1_pc~0 1)) (.cse23 (= |old(~T2_E~0)| ~T2_E~0)) (.cse26 (= ~M_E~0 |old(~M_E~0)|)) (.cse27 (= |old(~T1_E~0)| ~T1_E~0)) (.cse24 (= ~E_1~0 |old(~E_1~0)|)) (.cse28 (= ~E_M~0 |old(~E_M~0)|)) (.cse25 (= ~E_2~0 |old(~E_2~0)|))) (let ((.cse5 (not (= ~t1_st~0 0))) (.cse7 (and .cse23 .cse26 .cse27 .cse24 .cse28 .cse25)) (.cse9 (= 1 ~t2_pc~0)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse17 (not (<= 2 ~t2_st~0))) (.cse1 (= |old(~T2_E~0)| 1)) (.cse18 (not .cse2)) (.cse3 (not (<= 2 ~m_st~0))) (.cse4 (= |old(~T2_E~0)| 0)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse19 (not (<= 2 ~t1_st~0))) (.cse8 (not (= ~m_i~0 1))) (.cse10 (= 1 |old(~E_1~0)|)) (.cse11 (= 1 |old(~E_2~0)|)) (.cse12 (not .cse21)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (= 0 |old(~E_M~0)|)) (.cse16 (= 0 |old(~E_2~0)|)) (.cse20 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse7 .cse17 .cse1 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse7 .cse0 .cse1 .cse18 .cse3 .cse4 .cse6 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse20 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse1 .cse4 .cse6 (not (= 0 ~m_st~0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse21) (let ((.cse22 (+ ~local~0 1))) (or .cse0 .cse1 .cse18 .cse3 .cse4 .cse6 .cse19 (not (<= .cse22 ~token~0)) .cse8 .cse10 .cse11 .cse12 .cse20 .cse13 .cse14 (not (<= ~token~0 .cse22)) .cse15 .cse16)) (or .cse0 .cse17 .cse1 .cse18 .cse3 .cse4 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse20)))) [2019-09-16 16:42:24,863 INFO L443 ceAbstractionStarter]: For program point L464-1(lines 463 496) no Hoare annotation was computed. [2019-09-16 16:42:24,863 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 460 497) no Hoare annotation was computed. [2019-09-16 16:42:24,863 INFO L443 ceAbstractionStarter]: For program point init_modelFINAL(lines 498 508) no Hoare annotation was computed. [2019-09-16 16:42:24,864 INFO L443 ceAbstractionStarter]: For program point init_modelEXIT(lines 498 508) no Hoare annotation was computed. [2019-09-16 16:42:24,864 INFO L439 ceAbstractionStarter]: At program point init_modelENTRY(lines 498 508) the Hoare annotation is: (or (= ~T1_E~0 0) (= ~T2_E~0 1) (not (<= ~token~0 ~local~0)) (not (<= ~local~0 ~token~0)) (= ~t1_pc~0 1) (= 1 |old(~t1_i~0)|) (= ~T2_E~0 0) (= 1 ~M_E~0) (= |old(~m_i~0)| 1) (not (= ~t1_st~0 0)) (= 1 ~E_M~0) (not (= 0 ~m_st~0)) (= 1 ~t2_pc~0) (= 1 ~E_1~0) (= 1 ~E_2~0) (= 0 ~E_1~0) (= 0 ~E_M~0) (= 0 ~E_2~0) (= 1 ~m_pc~0) (and (not (= ~t1_i~0 1)) (not (= 1 ~m_i~0)))) [2019-09-16 16:42:24,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:42:24 BoogieIcfgContainer [2019-09-16 16:42:24,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:42:24,954 INFO L168 Benchmark]: Toolchain (without parser) took 125947.35 ms. Allocated memory was 138.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 86.6 MB in the beginning and 1.1 GB in the end (delta: -986.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-09-16 16:42:24,955 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.9 MB. Free memory was 105.0 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:42:24,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.28 ms. Allocated memory was 138.9 MB in the beginning and 198.2 MB in the end (delta: 59.2 MB). Free memory was 86.4 MB in the beginning and 172.0 MB in the end (delta: -85.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:42:24,957 INFO L168 Benchmark]: Boogie Preprocessor took 98.77 ms. Allocated memory is still 198.2 MB. Free memory was 172.0 MB in the beginning and 169.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:42:24,957 INFO L168 Benchmark]: RCFGBuilder took 713.21 ms. Allocated memory is still 198.2 MB. Free memory was 169.1 MB in the beginning and 132.9 MB in the end (delta: 36.2 MB). Peak memory consumption was 36.2 MB. Max. memory is 7.1 GB. [2019-09-16 16:42:24,958 INFO L168 Benchmark]: TraceAbstraction took 124547.32 ms. Allocated memory was 198.2 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 132.9 MB in the beginning and 1.1 GB in the end (delta: -939.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-09-16 16:42:24,961 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 138.9 MB. Free memory was 105.0 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 583.28 ms. Allocated memory was 138.9 MB in the beginning and 198.2 MB in the end (delta: 59.2 MB). Free memory was 86.4 MB in the beginning and 172.0 MB in the end (delta: -85.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 98.77 ms. Allocated memory is still 198.2 MB. Free memory was 172.0 MB in the beginning and 169.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 713.21 ms. Allocated memory is still 198.2 MB. Free memory was 169.1 MB in the beginning and 132.9 MB in the end (delta: 36.2 MB). Peak memory consumption was 36.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 124547.32 ms. Allocated memory was 198.2 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 132.9 MB in the beginning and 1.1 GB in the end (delta: -939.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || (((!(E_M == 0) && 2 <= m_st) && \old(t1_st) == t1_st) && !(E_M == 1))) || !(local + 1 <= \old(token))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || ((((\old(t1_st) == t1_st && local + 2 <= token) && m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2)) || 0 == E_1) || !(1 == t1_i)) || !(\old(token) <= local + 1)) || 0 == \old(E_M)) || 0 == E_2) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(t1_pc == 1)) || !(local <= \old(token))) || ((((\old(t1_st) == t1_st && token <= local) && E_M == \old(E_M)) && local <= token) && m_st == 0)) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || ((2 <= m_st && (((m_pc == 1 && !(T1_E == 0)) && !(T2_E == 0)) && !(E_1 == 0)) && 0 == t1_st) && E_M == \old(E_M))) || t1_pc == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(t1_pc == 1)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || ((((2 <= m_st && token <= local) && (((m_pc == 1 && !(T1_E == 0)) && !(T2_E == 0)) && !(E_1 == 0)) && 0 == t1_st) && E_M == \old(E_M)) && local <= token)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || t1_pc == 1) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || ((((m_st == 0 && \old(t1_st) == t1_st) && token <= local) && E_M == \old(E_M)) && local <= token)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == E_2) || ((2 <= m_st && \old(t1_st) == t1_st) && E_M == \old(E_M))) - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(2 <= t1_st) || !(2 <= t2_st)) || 1 == E_2 || (((((((((1 == E_M || !(1 == t2_pc)) || T1_E == 0) || !(m_i == 1)) || T2_E == 1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || T2_E == 0) || 1 == M_E) || !(t1_pc == 1)) || __retres1 == 0) && (((!(2 <= t2_st) || __retres1 == 0) || 1 == E_2) || ((((((((((1 == E_M || T1_E == 0) || 1 == t2_pc) || !(m_i == 1)) || T2_E == 1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || T2_E == 0) || 1 == m_pc) || 1 == M_E)) && ((((__retres1 == 0 || (((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == E_1)) || !(m_i == 1)) || 1 == t2_pc) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 1 == E_2) || !(token <= local)) || !(local <= token))) && (((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || 1 == E_2) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || __retres1 == 0) || !(local + 1 <= token)) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(token <= local + 1)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || !(token <= local + 2)) || !(t1_pc == 1)) || T2_E == 0) || 1 == M_E) || !(1 == t2_pc)) || !(2 <= t1_st)) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || __retres1 == 0) || 0 == E_1) || !(1 == t1_i)) || 0 == E_2) || !(local + 2 <= token))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(token <= local)) || !(local <= token)) || t1_pc == 1) || T2_E == 0) || !(t1_st == 0)) || 1 == E_M) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || __retres1 == 0) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || t1_pc == 1) || !(2 <= m_st)) || T2_E == 0) || !(t1_st == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || __retres1 == 0) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || !(2 <= m_st)) || T2_E == 0) || !(t1_st == 0)) || 1 == E_M) || __retres1 == 0) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2)) && ((((!(2 <= t1_st) || 1 == E_2) || __retres1 == 0) || !(t1_pc == 1)) || ((((((((((1 == E_M || T1_E == 0) || 1 == t2_pc) || !(m_i == 1)) || T2_E == 1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || T2_E == 0) || 1 == m_pc) || 1 == M_E)) && ((((__retres1 == 0 || !(2 <= t2_st)) || 1 == E_2) || ((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(m_i == 1)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || t1_pc == 1)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || __retres1 == 0) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && (((((((((((((((T1_E == 0 || !(2 <= t2_st)) || __retres1 == 0) || T2_E == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || __retres1 == 0) || 1 == E_M) || !(2 <= t1_st)) || !(local + 1 <= token)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(token <= local + 1)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(t1_pc == 1)) || __retres1 == 0) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2)) && (((__retres1 == 0 || (((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) || 1 == E_2) || t1_pc == 1)) && ((((((__retres1 == 0 || !(2 <= t2_st)) || 1 == E_2) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || ((((((((((T1_E == 0 || T2_E == 1) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == E_1)) || !(m_i == 1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || T2_E == 0) || __retres1 == 0) || 1 == E_M) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((T1_E == 0 || !(2 <= t2_st)) || __retres1 == 0) || T2_E == 1) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || !(1 == t2_pc)) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || __retres1 == 0) || 0 == E_1) || !(1 == t1_i)) || 0 == E_2)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || __retres1 == 0) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || __retres1 == 0) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || T2_E == 0) || (((((1 == t1_pc && !(1 == E_2)) && 2 <= m_st) && 2 <= t1_st) && 2 <= t2_st) && !(E_2 == 0))) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || ((((((1 == t1_pc && !(1 == E_2)) && 2 <= m_st) && 2 <= t1_st) && token <= \old(token) + 1) && !(E_2 == 0)) && local + 1 <= token)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) && (((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || \old(t1_pc) == 1) || (((((((1 == t1_pc && !(1 == E_2)) && m_st == 0) && 2 <= t1_st) && token <= local) && !(E_2 == 0)) && 2 <= t2_st) && local <= token)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || ((((1 == t1_pc && !(1 == E_2)) && 2 <= m_st) && 2 <= t1_st) && !(E_2 == 0))) || T2_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || (((!(1 == E_2) && 2 <= m_st) && 2 <= t2_st) && !(E_2 == 0))) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2))) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || \old(t1_pc) == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || ((((((1 == t1_pc && !(1 == E_2)) && m_st == 0) && 2 <= t1_st) && token <= local) && !(E_2 == 0)) && local <= token)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && (((((((((((((((((((!(1 == E_2) && m_st == 0) && 2 <= t2_st) && !(E_2 == 0)) || T1_E == 0) || !(2 <= \old(t2_st))) || T2_E == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || T2_E == 0) || (((((1 == t1_pc && !(1 == E_2)) && 2 <= m_st) && 2 <= t1_st) && 2 <= t2_st) && !(E_2 == 0))) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || \old(t1_pc) == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc) && ((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || ((2 <= m_st && 2 <= t2_st) && E_2 == \old(E_2)))) && ((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || ((m_st == 0 && 2 <= t2_st) && E_2 == \old(E_2))) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || \old(t1_pc) == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || (((1 == t1_pc && 2 <= m_st) && E_2 == \old(E_2)) && \old(t1_st) == t1_st))) && (((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(m_i == 1)) || 1 == E_1) || ((((((1 == t1_pc && 2 <= m_st) && token <= local) && E_2 == \old(E_2)) && 2 <= t2_st) && \old(t1_st) == t1_st) && local <= token)) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) && ((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || ((((((\old(token) == token && E_1 == \old(E_1)) && token <= local + 2) && m_pc == 1) && 2 <= t2_st) && \old(t1_st) == t1_st) && local + 2 <= token)) || !(\old(token) <= \old(local) + 2)) || !(t1_pc == 1)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || !(\old(local) + 2 <= \old(token)))) && (((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || (((((!(1 == E_2) && 2 <= m_st) && !(E_2 == 0)) && \old(t1_pc) == t1_pc) && 2 <= t2_st) && \old(t1_st) == t1_st)) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) && (((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || \old(t1_pc) == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || (((((((!(1 == E_2) && m_st == 0) && token <= local) && !(E_2 == 0)) && \old(t1_pc) == t1_pc) && 2 <= t2_st) && \old(t1_st) == t1_st) && local <= token)) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || !(2 <= \old(m_st))) || ((((\old(t1_pc) == t1_pc && !(1 == E_2)) && 2 <= m_st) && \old(t1_st) == t1_st) && !(E_2 == 0))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || \old(t1_pc) == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0) || ((((((!(1 == E_2) && m_st == 0) && token <= local) && !(E_2 == 0)) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && local <= token)) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= local)) || !(\old(t1_pc) == 1)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || T2_E == 0) || (((((1 == t1_pc && !(1 == E_2)) && 2 <= m_st) && !(E_2 == 0)) && 2 <= t2_st) && \old(t1_st) == t1_st)) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || ((((((1 == t1_pc && !(1 == E_2)) && 2 <= m_st) && token <= \old(token) + 1) && !(E_2 == 0)) && \old(t1_st) == t1_st) && local + 1 <= token)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || \old(t1_st) == 0)) && ((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || (((!(1 == E_2) && 2 <= m_st) && 2 <= t2_st) && !(E_2 == 0))) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2))) && ((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == \old(E_2)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == \old(E_2)) || (((!(1 == E_2) && m_st == 0) && 2 <= t2_st) && !(E_2 == 0))) || 1 == m_pc) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((((((((\old(T1_E) == 0 || \old(T2_E) == 1) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || \old(t1_pc) == 1) || \old(T2_E) == 0) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(T1_E == 0)) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || 1 == \old(m_pc) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) && (((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(2 <= t1_st)) || 0 == __retres1) || !(m_i == 1)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((T1_E == 0 || !(2 <= t2_st)) || 0 == __retres1) || T2_E == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || !(2 <= t1_st)) || !(local + 1 <= token)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || !(token <= local + 1)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || 0 == __retres1) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || !(2 <= m_st)) || T2_E == 0) || !(t1_st == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && (((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(2 <= m_st)) || 0 == __retres1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(m_i == 1)) || 0 == __retres1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || 0 == __retres1) || !(2 <= t2_st)) || T2_E == 1) || t1_pc == 1) || !(2 <= m_st)) || T2_E == 0) || !(t1_st == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || T2_E == 0) || 1 == E_M) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1) || 1 == m_pc)) && (((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && ((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || 0 == __retres1) || T2_E == 0) || 1 == E_M) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || !(token <= local)) || !(local <= token)) || t1_pc == 1) || T2_E == 0) || !(t1_st == 0)) || 1 == E_M) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || 0 == __retres1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(local + 1 <= token)) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(token <= local + 1)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && ((((((((((((((((((1 == E_M || 0 == __retres1) || T1_E == 0) || T2_E == 1) || !(token <= local + 2)) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || !(local + 2 <= token))) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || 0 == __retres1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || 0 == __retres1) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || (((((!(m_pc == 1) && \old(token) == token) && E_1 == \old(E_1)) && token <= local) && \old(t1_st) == t1_st) && local <= token)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) && ((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || ((((((!(m_pc == 1) && \old(token) == token) && E_1 == \old(E_1)) && token <= local) && 2 <= t2_st) && \old(t1_st) == t1_st) && local <= token)) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || ((((((\old(token) == token && E_1 == \old(E_1)) && token <= local + 2) && m_pc == 1) && 2 <= t2_st) && \old(t1_st) == t1_st) && local + 2 <= token)) || !(\old(token) <= \old(local) + 2)) || !(t1_pc == 1)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || !(\old(local) + 2 <= \old(token)))) && (((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || ((!(m_pc == 1) && 2 <= t2_st) && E_1 == \old(E_1))) || 1 == \old(m_pc))) && ((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || 0 == t1_st) || T2_E == 1) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || ((!(m_pc == 1) && \old(t1_st) == t1_st) && E_1 == \old(E_1))) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && (((((((((((((((((((!(m_pc == 1) && E_1 == \old(E_1)) && 2 <= t2_st) && \old(t1_st) == t1_st) || T1_E == 0) || !(2 <= \old(t2_st))) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t1_pc) == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || !(2 <= \old(t1_st))) || ((((2 <= t2_st && 1 == t1_pc) && 2 <= m_st) && 2 <= t1_st) && ((!(1 == E_2) && t1_i == 1) && !(E_1 == 1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1))) || !(\old(local) + 1 <= \old(token))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || ((token <= local + 1 && local + 1 <= token) && ((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && ((!(1 == E_2) && t1_i == 1) && !(E_1 == 1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1))) || 0 == \old(E_1)) || !(1 == t1_i)) || !(\old(token) <= \old(local) + 1)) || 0 == \old(E_M)) || 0 == \old(E_2)) && (((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || ((((2 <= t2_st && (((!(1 == E_2) && E_1 == \old(E_1)) && t1_i == 1) && !(E_1 == 1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1)) && 1 == t1_pc) && 2 <= m_st) && 2 <= t1_st)) || (((2 <= t2_st && \old(t1_pc) == t1_pc) && (!(1 == E_2) && E_1 == \old(E_1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(1 == M_E)) && !(E_M == 1)) && 2 <= m_st)) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == \old(E_2))) && (((((((((((((((((((((((((((2 <= t2_st && 1 == t1_pc) && 2 <= m_st) && 2 <= t1_st) && ((!(1 == E_2) && t1_i == 1) && !(E_1 == 1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1)) || T1_E == 0) || T2_E == 1) || !(\old(token) <= \old(local))) || T2_E == 0) || (((((((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == T2_E)) && !(1 == E_2)) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_1 == 1)) && E_M == \old(E_M)) && !(E_M == 1)) && 1 == t1_pc) && 2 <= m_st) && 2 <= t1_st)) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || (((2 <= t2_st && \old(t1_pc) == t1_pc) && 2 <= m_st) && (!(1 == E_2) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1))) || !(1 == t1_i)) || 0 == \old(E_2)) || (((((1 == t1_pc && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && ((!(1 == E_2) && t1_i == 1) && !(E_1 == 1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1))) || !(\old(local) <= \old(token))) || \old(t1_pc) == 1) || 1 == \old(E_M)) || !(0 == \old(m_st))) || !(m_i == 1)) || 0 == \old(E_1)) || ((\old(t1_pc) == t1_pc && (((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(E_1 == 1)) && E_M == \old(E_M)) && 2 <= m_st)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(t1_pc) == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || ((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && !(1 == E_2)) && 2 <= m_st) && !(E_M == 0)) && 2 <= t2_st) && \old(t1_st) == t1_st) && E_1 == \old(E_1)) && !(E_2 == 0)) && !(E_M == 1)))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t1_pc) == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || (((1 == t1_pc && \old(t1_st) == t1_st) && 2 <= m_st) && ((((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_1 == 1)) && !(1 == T2_E)) && E_1 == \old(E_1)) && 1 == m_i) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_M == 1))) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || ((((2 <= t2_st && (((!(1 == E_2) && E_1 == \old(E_1)) && t1_i == 1) && !(E_1 == 1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1)) && 1 == t1_pc) && \old(t1_st) == t1_st) && 2 <= m_st))) && ((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || ((2 <= t2_st && 2 <= m_st) && ((((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_1 == 1)) && !(1 == T2_E)) && E_1 == \old(E_1)) && 1 == m_i) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_M == 1)))) && (((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || (2 <= t2_st && (((((!(t2_pc == 1) && !(1 == E_2)) && m_st == 0) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && E_1 == \old(E_1)) && E_M == \old(E_M))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || ((2 <= t2_st && (((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == T2_E)) && !(1 == E_2)) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_1 == 1)) && E_M == \old(E_M)) && !(E_M == 1)) && 2 <= m_st)) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((2 <= t2_st && (((!(1 == E_2) && E_1 == \old(E_1)) && t1_i == 1) && !(E_1 == 1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1)) && 1 == t1_pc) && 2 <= m_st) && 2 <= t1_st)) || (((2 <= t2_st && \old(t1_pc) == t1_pc) && (!(1 == E_2) && E_1 == \old(E_1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(1 == M_E)) && !(E_M == 1)) && 2 <= m_st)) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || T2_E == 0) || (((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && ((((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_1 == 1)) && !(1 == T2_E)) && E_1 == \old(E_1)) && 1 == m_i) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_M == 1))) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || ((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 0 == t1_st) && E_1 == \old(E_1)) && E_M == \old(E_M)) && \old(t1_pc) == t1_pc) && 2 <= m_st)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((2 <= m_st && m_pc == 1) && !(E_1 == 1)) && 2 <= t2_st) && \old(t1_st) == t1_st) && !(E_1 == 0)) || T1_E == 0) || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= \old(local) + 2)) || !(t1_pc == 1)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || (((((((((((((((((((!(T2_E == 0) && !(1 == E_2)) && 2 <= m_st) && !(E_M == 0)) && !(1 == T2_E)) && 1 == m_i) && token <= local) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && m_pc == 1) && 1 == t2_pc) && t1_i == 1) && t1_pc == 1) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && !(E_1 == 0)) && local <= token)) || !(\old(local) + 2 <= \old(token))) && (((((((((((((((((((((((((2 <= m_st && m_pc == 1) && !(E_1 == 1)) && 2 <= t2_st) && \old(t1_st) == t1_st) && !(E_1 == 0)) || T1_E == 0) || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || (((((((((((((((((((!(T2_E == 0) && !(1 == E_2)) && 2 <= m_st) && !(E_M == 0)) && !(1 == T2_E)) && 1 == m_i) && token <= local) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && m_pc == 1) && 1 == t2_pc) && t1_i == 1) && t1_pc == 1) && 0 == t1_st) && !(E_1 == 1)) && 2 <= t2_st) && !(T1_E == 0)) && !(E_1 == 0)) && local <= token)) || 1 == \old(m_pc))) && ((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 0 == t1_st) || 1 == \old(m_pc))) && (((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || ((((m_pc == 1 && 2 <= m_st) && !(E_1 == 1)) && 2 <= t2_st) && !(E_1 == 0))) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) || ((((m_pc == 1 && 2 <= m_st) && !(E_1 == 1)) && \old(t1_st) == t1_st) && !(E_1 == 0)))) && (((((((((((((((((((((((((2 <= m_st && token <= local) && m_pc == 1) && 0 == t1_st) && !(E_1 == 1)) && !(E_1 == 0)) && local <= token) || T1_E == 0) || T2_E == 1) || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || T2_E == 0) || 1 == M_E) || ((((m_pc == 1 && 2 <= m_st) && !(E_1 == 1)) && \old(t1_st) == t1_st) && !(E_1 == 0))) || 1 == E_M) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == t2_pc) || 1 == \old(E_1)) || 1 == E_2) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc))) && ((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == E_2) || (((((2 <= m_st && m_pc == 1) && !(E_1 == 1)) && 2 <= t2_st) && \old(t1_st) == t1_st) && !(E_1 == 0))) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == \old(m_pc)) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(t1_pc == 1)) || __retres1 == 0) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(local + 1 <= token)) || !(m_i == 1)) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(token <= local + 1)) || 0 == E_M) || 0 == E_2) || t1_st == 0) && ((((((((((((((((__retres1 == 0 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || __retres1 == 0) || 1 == E_1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || t1_pc == 1) || !(2 <= m_st)) || T2_E == 0) || !(t1_st == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || __retres1 == 0)) && ((((((((((((((((T1_E == 0 || __retres1 == 0) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && (((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || __retres1 == 0) || t1_pc == 1) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || __retres1 == 0) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || T2_E == 0) || __retres1 == 0) || 1 == E_M) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(token <= local)) || !(local <= token)) || t1_pc == 1) || T2_E == 0) || !(t1_st == 0)) || __retres1 == 0) || 1 == E_M) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || __retres1 == 0) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((T1_E == 0 || __retres1 == 0) || T2_E == 1) || t1_pc == 1) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || __retres1 == 0) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || __retres1 == 0) || T2_E == 1) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || T2_E == 0) || 1 == E_1) || 1 == M_E) || 1 == E_M) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(2 <= t1_st)) || !(m_i == 1)) || __retres1 == 0) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == E_1)) && ((((((((((((((((!(1 == E_M) || __retres1 == 0) || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || !(1 == t2_pc)) || !(2 <= t1_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_2)) && (((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || __retres1 == 0)) && (((((((((((((((((T1_E == 0 || __retres1 == 0) || T2_E == 1) || !(t1_pc == 1)) || !(2 <= m_st)) || T2_E == 0) || 1 == E_M) || !(2 <= t1_st)) || !(local + 1 <= token)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(token <= local + 1)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((((((!(1 == E_M) || T1_E == 0) || T2_E == 1) || !(token <= local + 2)) || !(t1_pc == 1)) || __retres1 == 0) || T2_E == 0) || 1 == M_E) || !(1 == t2_pc)) || !(2 <= t1_st)) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_2) || !(local + 2 <= token))) && ((((((((((((((((T1_E == 0 || T2_E == 1) || __retres1 == 0) || t1_pc == 1) || !(2 <= m_st)) || T2_E == 0) || !(t1_st == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || __retres1 == 1) || T2_E == 1) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(2 <= t1_st)) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc) && (((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(token <= local)) || !(local <= token)) || t1_pc == 1) || T2_E == 0) || __retres1 == 1) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(token <= local)) || !(local <= token)) || t1_pc == 1) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || __retres1 == 1) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && ((((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(token <= local + 2)) || !(t1_pc == 1)) || T2_E == 0) || __retres1 == 1) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(2 <= t1_st)) || !(0 == m_st)) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || !(local + 2 <= token))) && (((((((((((((((((((T1_E == 0 || !(2 <= t2_st)) || T2_E == 1) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || __retres1 == 1) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || __retres1 == 1) || T2_E == 1) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || T2_E == 0) || 1 == M_E) || 1 == E_M) || !(2 <= t1_st)) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((__retres1 == 1 || T1_E == 0) || T2_E == 1) || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || !(2 <= m_st)) || T2_E == 0) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(m_i == 1)) || 1 == t2_pc) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == E_M) || 0 == E_2) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((2 <= m_st && 1 == t2_pc) && 2 <= t2_st) && \old(t1_st) == t1_st) && E_M == \old(E_M))) || t1_pc == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == E_2) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || (((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && 2 <= t2_st) && \old(t1_st) == t1_st) && local + 2 <= token)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(local + 1 <= \old(token))) || !(m_i == 1)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || (((((2 <= m_st && !(E_M == 0)) && !(E_M == 1)) && 1 == t2_pc) && 2 <= t2_st) && \old(t1_st) == t1_st)) || !(1 == t1_i)) || !(\old(token) <= local + 1)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(t1_pc == 1)) || !(local <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(0 == \old(m_st))) || ((((((m_st == 0 && token <= local) && 1 == t2_pc) && 2 <= t2_st) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && local <= token)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || ((((2 <= m_st && 1 == t2_pc) && 2 <= t2_st) && \old(t1_st) == t1_st) && E_M == \old(E_M))) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == E_2)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((((m_st == 0 && token <= local) && 1 == t2_pc) && 2 <= t2_st) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && local <= token)) || !(\old(token) <= local)) || !(local <= \old(token))) || t1_pc == 1) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(t1_pc == 1)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || ((((((2 <= m_st && token <= local) && 1 == t2_pc) && 2 <= t2_st) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && local <= token)) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == E_2) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == E_2) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(t1_pc == 1)) || !(local <= \old(token))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc)) && (((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((T1_E == 0 || T2_E == 1) || t1_pc == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(t1_pc == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(local + 1 <= \old(token))) || !(m_i == 1)) || 1 == E_1) || ((((2 <= m_st && \old(token) == token) && 1 == t2_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M))) || 1 == E_2) || !(1 == m_pc)) || 0 == E_1) || !(1 == t1_i)) || !(\old(token) <= local + 1)) || 0 == \old(E_M)) || 0 == E_2)) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(token) <= local)) || !(local <= \old(token))) || t1_pc == 1) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == E_1) || 1 == E_2) || 0 == E_1) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == E_2) || 1 == m_pc) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || ((((2 <= t2_st && (((!(1 == E_2) && E_1 == \old(E_1)) && t1_i == 1) && !(E_1 == 1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1)) && 1 == t1_pc) && 2 <= m_st) && 2 <= t1_st)) || (((2 <= t2_st && \old(t1_pc) == t1_pc) && (!(1 == E_2) && E_1 == \old(E_1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(1 == M_E)) && !(E_M == 1)) && 2 <= m_st)) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) && ((((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(\old(t1_pc) == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || ((((((((((m_pc == 1 && 1 == t1_pc) && 1 == t2_pc) && !(1 == E_2)) && 2 <= m_st) && !(E_M == 0)) && 2 <= t2_st) && \old(t1_st) == t1_st) && E_1 == \old(E_1)) && !(E_2 == 0)) && !(E_M == 1)))) && ((((((((((((((((((T1_E == 0 || T2_E == 1) || !(\old(t1_pc) == 1)) || !(2 <= \old(m_st))) || T2_E == 0) || (((1 == t1_pc && \old(t1_st) == t1_st) && 2 <= m_st) && ((((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_1 == 1)) && !(1 == T2_E)) && E_1 == \old(E_1)) && 1 == m_i) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_M == 1))) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || ((((2 <= t2_st && (((!(1 == E_2) && E_1 == \old(E_1)) && t1_i == 1) && !(E_1 == 1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1)) && 1 == t1_pc) && \old(t1_st) == t1_st) && 2 <= m_st))) && (((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || (2 <= t2_st && (((((((((!(t2_pc == 1) && !(1 == E_2)) && m_st == 0) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_1 == 1)) && !(m_pc == 1)) && !(1 == T2_E)) && E_1 == \old(E_1)) && !(1 == M_E)) && E_M == \old(E_M))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || ((2 <= t2_st && (((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == T2_E)) && !(1 == E_2)) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_1 == 1)) && E_M == \old(E_M)) && !(E_M == 1)) && 2 <= m_st)) || 1 == \old(m_pc))) && ((((((((((((((((T1_E == 0 || !(2 <= \old(t2_st))) || T2_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || 1 == \old(E_M)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) || ((2 <= t2_st && 2 <= m_st) && ((((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_1 == 1)) && !(1 == T2_E)) && E_1 == \old(E_1)) && 1 == m_i) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_M == 1)))) && ((((((((((((((((((((((((token <= local + 1 && local + 1 <= token) && (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && ((!(1 == E_2) && t1_i == 1) && !(E_1 == 1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(tmp == 0)) || (((((((!(1 == E_2) && E_1 == \old(E_1)) && t1_i == 1) && !(E_1 == 1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1)) && 1 == t1_pc) && \old(t1_st) == t1_st) && 2 <= m_st))) || T1_E == 0) || T2_E == 1) || !(2 <= \old(m_st))) || T2_E == 0) || 1 == M_E) || !(2 <= \old(t1_st))) || !(\old(local) + 1 <= \old(token))) || 1 == \old(E_1)) || 1 == \old(E_2)) || ((((((2 <= t2_st && 1 == t1_pc) && 2 <= t1_st) && (((((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && m_st == 0) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(1 == E_2)) && t1_i == 1) && !(E_1 == 1)) && !(tmp == 0)) && local + 2 <= token) && token <= local + 2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((2 <= t2_st && 1 == t1_pc) && token <= local) && 2 <= m_st) && tmp == 1) && ((!(1 == E_2) && t1_i == 1) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && local <= token)) || !(\old(t1_pc) == 1)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || ((((2 <= t2_st && 1 == t1_pc) && 2 <= m_st) && 2 <= t1_st) && ((!(1 == E_2) && t1_i == 1) && !(E_1 == 1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1))) || !(m_i == 1)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(\old(token) <= \old(local) + 1)) || 0 == \old(E_M))) && ((((((((((((((((((((((((((((((((((2 <= t2_st && 1 == t1_pc) && 2 <= m_st) && 2 <= t1_st) && ((!(1 == E_2) && t1_i == 1) && !(E_1 == 1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1)) || T1_E == 0) || ((((((2 <= t2_st && \old(t1_pc) == t1_pc) && token <= local) && tmp == 1) && local <= token) && \old(token) == token) && ((((((1 == t2_pc && m_st == 0) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(m_pc == 1)) && !(E_M == 1)) && !(1 == E_2)) && E_1 == \old(E_1))) || T2_E == 1) || !(\old(token) <= \old(local))) || ((token <= local + 1 && local + 1 <= token) && (((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && ((!(1 == E_2) && t1_i == 1) && !(E_1 == 1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(tmp == 0))) || T2_E == 0) || (((((((2 <= t2_st && (!(1 == E_2) && E_1 == \old(E_1)) && (((1 == t2_pc && m_st == 0) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(m_pc == 1)) && !(E_M == 1)) && 1 == t1_pc) && token <= local) && 2 <= t1_st) && tmp == 1) && local <= token) && \old(token) == token)) || (((((((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == T2_E)) && !(1 == E_2)) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(1 == M_E)) && !(E_1 == 1)) && E_M == \old(E_M)) && !(E_M == 1)) && 1 == t1_pc) && 2 <= m_st) && 2 <= t1_st)) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || (((2 <= t2_st && \old(t1_pc) == t1_pc) && 2 <= m_st) && ((!(1 == E_2) && t1_i == 1) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1))) || ((((((2 <= t2_st && 1 == t1_pc) && token <= local) && 2 <= m_st) && tmp == 1) && ((!(1 == E_2) && t1_i == 1) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(1 == M_E)) && !(E_M == 1)) && !(E_1 == 1)) && local <= token)) || !(1 == t1_i)) || 0 == \old(E_2)) || !(\old(local) <= \old(token))) || \old(t1_pc) == 1) || ((((((1 == t1_pc && token <= local) && 2 <= t1_st) && (((((((((!(t2_pc == 1) && !(1 == E_2)) && m_st == 0) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_1 == 1)) && !(m_pc == 1)) && !(1 == T2_E)) && E_1 == \old(E_1)) && !(1 == M_E)) && E_M == \old(E_M)) && tmp == 1) && local <= token) && \old(token) == token)) || 1 == \old(E_M)) || !(0 == \old(m_st))) || !(m_i == 1)) || (((token <= local && \old(t1_pc) == t1_pc && ((((((!(t2_pc == 1) && !(1 == E_2)) && m_st == 0) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(m_pc == 1)) && E_1 == \old(E_1)) && E_M == \old(E_M)) && local <= token) && \old(token) == token)) || ((\old(t1_pc) == t1_pc && ((((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && !(1 == T2_E)) && 1 == m_i) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_M == 1)) && 2 <= m_st)) || 0 == \old(E_1)) || 0 == \old(E_M)) || ((local + 2 <= token && (((2 <= t2_st && 1 == t1_pc) && 2 <= t1_st) && (((((((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && m_st == 0) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1)) && !(1 == E_2)) && t1_i == 1) && !(E_1 == 1)) && !(tmp == 0)) && token <= local + 2)) || (((((1 == t1_pc && ((((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && 0 == t1_st) && !(E_1 == 1)) && !(1 == T2_E)) && 1 == m_i) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && tmp == 1) && local <= token)) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((2 <= t2_st && (((!(1 == E_2) && E_1 == \old(E_1)) && t1_i == 1) && !(E_1 == 1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && 1 == m_i) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && !(1 == M_E)) && !(E_M == 1)) && 1 == t1_pc) && 2 <= m_st) && 2 <= t1_st)) || (((2 <= t2_st && \old(t1_pc) == t1_pc) && (!(1 == E_2) && E_1 == \old(E_1)) && (((((m_pc == 1 && !(1 == T2_E)) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 0 == t1_st) && !(1 == M_E)) && !(E_M == 1)) && 2 <= m_st)) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || T2_E == 0) || (((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && ((((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && t1_i == 1) && !(E_1 == 1)) && !(1 == T2_E)) && E_1 == \old(E_1)) && 1 == m_i) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_M == 1))) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || ((((((((!(t2_pc == 1) && m_pc == 1) && !(1 == E_2)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 0 == t1_st) && E_1 == \old(E_1)) && E_M == \old(E_M)) && \old(t1_pc) == t1_pc) && 2 <= m_st)) || !(m_i == 1)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || !(1 == t1_i)) || 0 == \old(E_M)) || 0 == \old(E_2)) - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((1 == t1_pc && token <= local + 1) && ((!(1 == E_2) && ((\old(T2_E) == T2_E && !(1 == T2_E)) && ((((((m_pc == 1 && !(T1_E == 0)) && 1 == t2_pc) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && t1_i == 1) && !(E_1 == 1)) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) || \old(T1_E) == 0) || \old(T2_E) == 1) || !(\old(token) <= \old(local))) || ((((((((((!(t2_pc == 1) && !(1 == E_2)) && m_st == 0) && !(m_pc == 1)) && 2 <= t2_st) && \old(T2_E) == T2_E) && !(T1_E == 0)) && E_1 == \old(E_1)) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_2 == 0))) || \old(T2_E) == 0) || ((\old(t1_pc) == t1_pc && (((\old(T2_E) == T2_E && !(1 == E_2)) && (((((!(t2_pc == 1) && m_pc == 1) && !(T1_E == 0)) && !(E_1 == 0)) && 0 == t1_st) && !(1 == M_E)) && !(E_2 == 0)) && !(E_1 == 1)) && E_M == \old(E_M)) && 2 <= m_st)) || (((2 <= t2_st && \old(t1_pc) == t1_pc) && 2 <= m_st) && (!(1 == E_2) && (\old(T2_E) == T2_E && ((((((m_pc == 1 && !(T1_E == 0)) && 1 == t2_pc) && !(E_1 == 0)) && !(E_M == 0)) && 0 == t1_st) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && !(E_1 == 1))) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || 1 == \old(E_1)) || 1 == \old(E_2)) || !(1 == t1_i)) || 0 == \old(E_2)) || ((((((((((((((!(t2_pc == 1) && !(1 == E_2)) && m_st == 0) && !(m_pc == 1)) && \old(token) == token) && \old(T2_E) == T2_E) && E_1 == \old(E_1)) && token <= local) && !(1 == M_E)) && !(E_2 == 0)) && \old(t1_pc) == t1_pc) && 0 == t1_st) && !(T1_E == 0)) && E_M == \old(E_M)) && local <= token)) || ((2 <= t2_st && 2 <= m_st) && ((((((\old(T2_E) == T2_E && !(1 == T2_E)) && !(1 == E_2)) && t1_i == 1) && !(E_1 == 1)) && E_M == \old(E_M)) && ((((((!(t2_pc == 1) && m_pc == 1) && !(T1_E == 0)) && !(T2_E == 0)) && 1 == m_i) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || !(\old(local) <= \old(token))) || \old(t1_pc) == 1) || ((((2 <= t2_st && 1 == t1_pc) && ((!(1 == E_2) && ((\old(T2_E) == T2_E && !(1 == T2_E)) && ((((((m_pc == 1 && !(T1_E == 0)) && 1 == t2_pc) && !(T2_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1)) && t1_i == 1) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || 1 == \old(E_M)) || !(0 == \old(m_st))) || !(m_i == 1)) || (((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && ((((((\old(T2_E) == T2_E && !(1 == T2_E)) && !(1 == E_2)) && t1_i == 1) && !(E_1 == 1)) && E_M == \old(E_M)) && ((((((!(t2_pc == 1) && m_pc == 1) && !(T1_E == 0)) && !(T2_E == 0)) && 1 == m_i) && !(E_1 == 0)) && !(1 == M_E)) && !(E_2 == 0)) && !(E_M == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc) - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 174 locations, 1 error locations. SAFE Result, 124.3s OverallTime, 23 OverallIterations, 7 TraceHistogramMax, 12.6s AutomataDifference, 0.0s DeadEndRemovalTime, 101.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 5989 SDtfs, 7485 SDslu, 7462 SDs, 0 SdLazy, 5120 SolverSat, 2006 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1943 GetRequests, 1818 SyntacticMatches, 12 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4922occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 1761 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 14620 PreInvPairs, 15390 NumberOfFragments, 37532 HoareAnnotationTreeSize, 14620 FomulaSimplifications, 322014 FormulaSimplificationTreeSizeReduction, 7.4s HoareSimplificationTime, 71 FomulaSimplificationsInter, 176566 FormulaSimplificationTreeSizeReductionInter, 93.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 5650 NumberOfCodeBlocks, 5650 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 5620 ConstructedInterpolants, 0 QuantifiedInterpolants, 1569477 SizeOfPredicates, 5 NumberOfNonLiveVariables, 7239 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 30 InterpolantComputations, 23 PerfectInterpolantSequences, 3847/3948 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...