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.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 16:19:18,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 16:19:18,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 16:19:18,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 16:19:18,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 16:19:18,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 16:19:18,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 16:19:18,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 16:19:18,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 16:19:18,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 16:19:18,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 16:19:18,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 16:19:18,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 16:19:18,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 16:19:18,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 16:19:18,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 16:19:18,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 16:19:18,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 16:19:18,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 16:19:18,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 16:19:18,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 16:19:18,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 16:19:18,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 16:19:18,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 16:19:18,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 16:19:18,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 16:19:18,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 16:19:18,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 16:19:18,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 16:19:18,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 16:19:18,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 16:19:18,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 16:19:18,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 16:19:18,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 16:19:18,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 16:19:18,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 16:19:18,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 16:19:18,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 16:19:18,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 16:19:18,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 16:19:18,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 16:19:18,139 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-10-02 16:19:18,160 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 16:19:18,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 16:19:18,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 16:19:18,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 16:19:18,162 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 16:19:18,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 16:19:18,163 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 16:19:18,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 16:19:18,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 16:19:18,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 16:19:18,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 16:19:18,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 16:19:18,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 16:19:18,164 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 16:19:18,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 16:19:18,165 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 16:19:18,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 16:19:18,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 16:19:18,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 16:19:18,167 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 16:19:18,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 16:19:18,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 16:19:18,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 16:19:18,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 16:19:18,168 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 16:19:18,169 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 16:19:18,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 16:19:18,169 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 16:19:18,169 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 16:19:18,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 16:19:18,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 16:19:18,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 16:19:18,239 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 16:19:18,239 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 16:19:18,240 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2019-10-02 16:19:18,299 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a58a884e8/17cea1add89841329317abb64ef0936b/FLAGf216d3fb2 [2019-10-02 16:19:18,755 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 16:19:18,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2019-10-02 16:19:18,768 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a58a884e8/17cea1add89841329317abb64ef0936b/FLAGf216d3fb2 [2019-10-02 16:19:19,113 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a58a884e8/17cea1add89841329317abb64ef0936b [2019-10-02 16:19:19,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 16:19:19,125 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 16:19:19,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 16:19:19,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 16:19:19,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 16:19:19,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:19:19" (1/1) ... [2019-10-02 16:19:19,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581c0b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:19, skipping insertion in model container [2019-10-02 16:19:19,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:19:19" (1/1) ... [2019-10-02 16:19:19,145 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 16:19:19,181 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 16:19:19,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:19:19,380 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 16:19:19,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:19:19,559 INFO L192 MainTranslator]: Completed translation [2019-10-02 16:19:19,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:19 WrapperNode [2019-10-02 16:19:19,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 16:19:19,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 16:19:19,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 16:19:19,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 16:19:19,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:19" (1/1) ... [2019-10-02 16:19:19,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:19" (1/1) ... [2019-10-02 16:19:19,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:19" (1/1) ... [2019-10-02 16:19:19,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:19" (1/1) ... [2019-10-02 16:19:19,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:19" (1/1) ... [2019-10-02 16:19:19,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:19" (1/1) ... [2019-10-02 16:19:19,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:19" (1/1) ... [2019-10-02 16:19:19,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 16:19:19,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 16:19:19,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 16:19:19,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 16:19:19,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19: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-10-02 16:19:19,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 16:19:19,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 16:19:19,696 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-02 16:19:19,696 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-02 16:19:19,697 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-02 16:19:19,697 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-02 16:19:19,697 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-02 16:19:19,697 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-02 16:19:19,697 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-02 16:19:19,697 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-02 16:19:19,698 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-02 16:19:19,698 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-02 16:19:19,699 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-02 16:19:19,699 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-02 16:19:19,701 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-02 16:19:19,701 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-02 16:19:19,702 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-02 16:19:19,702 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-02 16:19:19,702 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-02 16:19:19,702 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-02 16:19:19,703 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 16:19:19,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 16:19:19,703 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-02 16:19:19,703 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-02 16:19:19,703 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-02 16:19:19,703 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-02 16:19:19,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 16:19:19,704 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-02 16:19:19,704 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-02 16:19:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-02 16:19:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-02 16:19:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-02 16:19:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-02 16:19:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-02 16:19:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-02 16:19:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-02 16:19:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-02 16:19:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-02 16:19:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-02 16:19:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-02 16:19:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-02 16:19:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 16:19:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 16:19:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 16:19:20,286 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 16:19:20,286 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 16:19:20,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:19:20 BoogieIcfgContainer [2019-10-02 16:19:20,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 16:19:20,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 16:19:20,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 16:19:20,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 16:19:20,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 04:19:19" (1/3) ... [2019-10-02 16:19:20,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b65b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:19:20, skipping insertion in model container [2019-10-02 16:19:20,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:19:19" (2/3) ... [2019-10-02 16:19:20,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b65b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:19:20, skipping insertion in model container [2019-10-02 16:19:20,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:19:20" (3/3) ... [2019-10-02 16:19:20,298 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2019-10-02 16:19:20,309 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 16:19:20,323 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 16:19:20,340 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 16:19:20,374 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 16:19:20,374 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 16:19:20,375 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 16:19:20,375 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 16:19:20,375 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 16:19:20,375 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 16:19:20,375 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 16:19:20,376 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 16:19:20,376 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 16:19:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2019-10-02 16:19:20,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 16:19:20,415 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:20,416 INFO L411 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] [2019-10-02 16:19:20,420 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:20,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:20,428 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2019-10-02 16:19:20,430 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:20,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:20,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:20,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:20,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:20,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:20,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:20,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:20,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:20,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:20,830 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2019-10-02 16:19:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:21,476 INFO L93 Difference]: Finished difference Result 298 states and 424 transitions. [2019-10-02 16:19:21,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:21,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-02 16:19:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:21,505 INFO L225 Difference]: With dead ends: 298 [2019-10-02 16:19:21,506 INFO L226 Difference]: Without dead ends: 161 [2019-10-02 16:19:21,514 INFO L640 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-10-02 16:19:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-02 16:19:21,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2019-10-02 16:19:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-02 16:19:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2019-10-02 16:19:21,638 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 77 [2019-10-02 16:19:21,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:21,638 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2019-10-02 16:19:21,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2019-10-02 16:19:21,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 16:19:21,647 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:21,647 INFO L411 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] [2019-10-02 16:19:21,648 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:21,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:21,649 INFO L82 PathProgramCache]: Analyzing trace with hash 246293706, now seen corresponding path program 1 times [2019-10-02 16:19:21,649 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:21,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:21,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:21,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:21,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:21,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:21,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:21,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:21,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:21,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:21,791 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand 5 states. [2019-10-02 16:19:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:22,204 INFO L93 Difference]: Finished difference Result 277 states and 376 transitions. [2019-10-02 16:19:22,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:22,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-02 16:19:22,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:22,208 INFO L225 Difference]: With dead ends: 277 [2019-10-02 16:19:22,208 INFO L226 Difference]: Without dead ends: 161 [2019-10-02 16:19:22,211 INFO L640 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-10-02 16:19:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-02 16:19:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2019-10-02 16:19:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-02 16:19:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2019-10-02 16:19:22,233 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 77 [2019-10-02 16:19:22,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:22,234 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2019-10-02 16:19:22,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:22,234 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2019-10-02 16:19:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 16:19:22,236 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:22,236 INFO L411 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] [2019-10-02 16:19:22,237 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:22,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:22,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1633079116, now seen corresponding path program 1 times [2019-10-02 16:19:22,238 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:22,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:22,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:22,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:22,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:22,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:22,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:22,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:22,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:22,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:22,322 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand 5 states. [2019-10-02 16:19:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:22,692 INFO L93 Difference]: Finished difference Result 285 states and 387 transitions. [2019-10-02 16:19:22,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:22,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-02 16:19:22,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:22,696 INFO L225 Difference]: With dead ends: 285 [2019-10-02 16:19:22,697 INFO L226 Difference]: Without dead ends: 169 [2019-10-02 16:19:22,700 INFO L640 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-10-02 16:19:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-02 16:19:22,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 135. [2019-10-02 16:19:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-02 16:19:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2019-10-02 16:19:22,745 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 77 [2019-10-02 16:19:22,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:22,747 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2019-10-02 16:19:22,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:22,748 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2019-10-02 16:19:22,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 16:19:22,758 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:22,759 INFO L411 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] [2019-10-02 16:19:22,759 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:22,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:22,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2076979790, now seen corresponding path program 1 times [2019-10-02 16:19:22,760 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:22,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:22,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:22,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:22,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:22,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:22,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 16:19:22,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 16:19:22,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 16:19:22,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:22,872 INFO L87 Difference]: Start difference. First operand 135 states and 174 transitions. Second operand 6 states. [2019-10-02 16:19:22,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:22,933 INFO L93 Difference]: Finished difference Result 260 states and 348 transitions. [2019-10-02 16:19:22,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:22,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-10-02 16:19:22,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:22,935 INFO L225 Difference]: With dead ends: 260 [2019-10-02 16:19:22,936 INFO L226 Difference]: Without dead ends: 145 [2019-10-02 16:19:22,937 INFO L640 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-10-02 16:19:22,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-02 16:19:22,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2019-10-02 16:19:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-02 16:19:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 179 transitions. [2019-10-02 16:19:22,955 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 179 transitions. Word has length 77 [2019-10-02 16:19:22,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:22,956 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 179 transitions. [2019-10-02 16:19:22,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 16:19:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 179 transitions. [2019-10-02 16:19:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 16:19:22,957 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:22,958 INFO L411 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] [2019-10-02 16:19:22,958 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:22,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:22,958 INFO L82 PathProgramCache]: Analyzing trace with hash 705172492, now seen corresponding path program 1 times [2019-10-02 16:19:22,958 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:22,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:22,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:22,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:22,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:23,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:23,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 16:19:23,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:19:23,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:19:23,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:23,013 INFO L87 Difference]: Start difference. First operand 140 states and 179 transitions. Second operand 4 states. [2019-10-02 16:19:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:23,186 INFO L93 Difference]: Finished difference Result 373 states and 497 transitions. [2019-10-02 16:19:23,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:19:23,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-10-02 16:19:23,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:23,189 INFO L225 Difference]: With dead ends: 373 [2019-10-02 16:19:23,190 INFO L226 Difference]: Without dead ends: 253 [2019-10-02 16:19:23,191 INFO L640 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-10-02 16:19:23,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-02 16:19:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2019-10-02 16:19:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-02 16:19:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 316 transitions. [2019-10-02 16:19:23,218 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 316 transitions. Word has length 77 [2019-10-02 16:19:23,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:23,218 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 316 transitions. [2019-10-02 16:19:23,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:19:23,219 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 316 transitions. [2019-10-02 16:19:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 16:19:23,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:23,220 INFO L411 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] [2019-10-02 16:19:23,220 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:23,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1830432461, now seen corresponding path program 1 times [2019-10-02 16:19:23,221 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:23,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:23,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:23,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:23,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:23,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:23,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 16:19:23,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 16:19:23,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 16:19:23,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:23,327 INFO L87 Difference]: Start difference. First operand 248 states and 316 transitions. Second operand 6 states. [2019-10-02 16:19:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:23,400 INFO L93 Difference]: Finished difference Result 483 states and 633 transitions. [2019-10-02 16:19:23,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:23,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-10-02 16:19:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:23,414 INFO L225 Difference]: With dead ends: 483 [2019-10-02 16:19:23,414 INFO L226 Difference]: Without dead ends: 255 [2019-10-02 16:19:23,415 INFO L640 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-10-02 16:19:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-02 16:19:23,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2019-10-02 16:19:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-02 16:19:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 320 transitions. [2019-10-02 16:19:23,441 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 320 transitions. Word has length 77 [2019-10-02 16:19:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:23,441 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 320 transitions. [2019-10-02 16:19:23,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 16:19:23,442 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 320 transitions. [2019-10-02 16:19:23,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 16:19:23,443 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:23,443 INFO L411 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] [2019-10-02 16:19:23,443 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:23,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:23,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1762934961, now seen corresponding path program 1 times [2019-10-02 16:19:23,444 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:23,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:23,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:23,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:23,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:23,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:23,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:23,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:23,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:23,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:23,512 INFO L87 Difference]: Start difference. First operand 253 states and 320 transitions. Second operand 5 states. [2019-10-02 16:19:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:23,875 INFO L93 Difference]: Finished difference Result 587 states and 751 transitions. [2019-10-02 16:19:23,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:23,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-02 16:19:23,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:23,879 INFO L225 Difference]: With dead ends: 587 [2019-10-02 16:19:23,879 INFO L226 Difference]: Without dead ends: 355 [2019-10-02 16:19:23,880 INFO L640 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-10-02 16:19:23,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-10-02 16:19:23,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 313. [2019-10-02 16:19:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-10-02 16:19:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 384 transitions. [2019-10-02 16:19:23,908 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 384 transitions. Word has length 77 [2019-10-02 16:19:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:23,908 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 384 transitions. [2019-10-02 16:19:23,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 384 transitions. [2019-10-02 16:19:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 16:19:23,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:23,910 INFO L411 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] [2019-10-02 16:19:23,910 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:23,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:23,911 INFO L82 PathProgramCache]: Analyzing trace with hash 160293073, now seen corresponding path program 1 times [2019-10-02 16:19:23,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:23,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:23,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:23,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:23,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:23,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:23,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:23,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:23,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:23,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:23,966 INFO L87 Difference]: Start difference. First operand 313 states and 384 transitions. Second operand 5 states. [2019-10-02 16:19:24,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:24,258 INFO L93 Difference]: Finished difference Result 605 states and 746 transitions. [2019-10-02 16:19:24,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:24,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-02 16:19:24,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:24,262 INFO L225 Difference]: With dead ends: 605 [2019-10-02 16:19:24,262 INFO L226 Difference]: Without dead ends: 313 [2019-10-02 16:19:24,263 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-10-02 16:19:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-10-02 16:19:24,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2019-10-02 16:19:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-10-02 16:19:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 380 transitions. [2019-10-02 16:19:24,288 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 380 transitions. Word has length 77 [2019-10-02 16:19:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:24,288 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 380 transitions. [2019-10-02 16:19:24,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 380 transitions. [2019-10-02 16:19:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 16:19:24,289 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:24,290 INFO L411 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] [2019-10-02 16:19:24,290 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:24,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:24,290 INFO L82 PathProgramCache]: Analyzing trace with hash 222332687, now seen corresponding path program 1 times [2019-10-02 16:19:24,290 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:24,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:24,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:24,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:24,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:24,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:24,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:24,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:24,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:24,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:24,371 INFO L87 Difference]: Start difference. First operand 313 states and 380 transitions. Second operand 5 states. [2019-10-02 16:19:24,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:24,791 INFO L93 Difference]: Finished difference Result 757 states and 983 transitions. [2019-10-02 16:19:24,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 16:19:24,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-02 16:19:24,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:24,796 INFO L225 Difference]: With dead ends: 757 [2019-10-02 16:19:24,796 INFO L226 Difference]: Without dead ends: 464 [2019-10-02 16:19:24,798 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 16:19:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-10-02 16:19:24,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 384. [2019-10-02 16:19:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-10-02 16:19:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 463 transitions. [2019-10-02 16:19:24,834 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 463 transitions. Word has length 77 [2019-10-02 16:19:24,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:24,834 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 463 transitions. [2019-10-02 16:19:24,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:24,835 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 463 transitions. [2019-10-02 16:19:24,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 16:19:24,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:24,836 INFO L411 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] [2019-10-02 16:19:24,836 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:24,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:24,837 INFO L82 PathProgramCache]: Analyzing trace with hash 362881297, now seen corresponding path program 1 times [2019-10-02 16:19:24,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:24,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:24,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:24,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:24,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:24,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:24,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:24,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:24,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:24,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:24,914 INFO L87 Difference]: Start difference. First operand 384 states and 463 transitions. Second operand 5 states. [2019-10-02 16:19:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:25,412 INFO L93 Difference]: Finished difference Result 841 states and 1082 transitions. [2019-10-02 16:19:25,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:25,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-02 16:19:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:25,418 INFO L225 Difference]: With dead ends: 841 [2019-10-02 16:19:25,418 INFO L226 Difference]: Without dead ends: 480 [2019-10-02 16:19:25,421 INFO L640 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-10-02 16:19:25,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-10-02 16:19:25,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 415. [2019-10-02 16:19:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-10-02 16:19:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 486 transitions. [2019-10-02 16:19:25,468 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 486 transitions. Word has length 77 [2019-10-02 16:19:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:25,469 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 486 transitions. [2019-10-02 16:19:25,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 486 transitions. [2019-10-02 16:19:25,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 16:19:25,472 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:25,472 INFO L411 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] [2019-10-02 16:19:25,472 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:25,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:25,473 INFO L82 PathProgramCache]: Analyzing trace with hash -969302232, now seen corresponding path program 1 times [2019-10-02 16:19:25,473 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:25,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:25,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:25,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:25,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:25,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:25,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 16:19:25,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:19:25,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:19:25,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:25,529 INFO L87 Difference]: Start difference. First operand 415 states and 486 transitions. Second operand 5 states. [2019-10-02 16:19:25,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:25,852 INFO L93 Difference]: Finished difference Result 789 states and 934 transitions. [2019-10-02 16:19:25,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 16:19:25,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-02 16:19:25,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:25,857 INFO L225 Difference]: With dead ends: 789 [2019-10-02 16:19:25,857 INFO L226 Difference]: Without dead ends: 394 [2019-10-02 16:19:25,860 INFO L640 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-10-02 16:19:25,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-10-02 16:19:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 364. [2019-10-02 16:19:25,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-10-02 16:19:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 417 transitions. [2019-10-02 16:19:25,892 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 417 transitions. Word has length 78 [2019-10-02 16:19:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:25,893 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 417 transitions. [2019-10-02 16:19:25,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:19:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 417 transitions. [2019-10-02 16:19:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 16:19:25,894 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:25,894 INFO L411 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] [2019-10-02 16:19:25,895 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:25,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:25,895 INFO L82 PathProgramCache]: Analyzing trace with hash 228867791, now seen corresponding path program 1 times [2019-10-02 16:19:25,895 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:25,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:25,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:25,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:25,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:25,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:25,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:25,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:19:25,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:19:25,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:19:25,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:19:25,946 INFO L87 Difference]: Start difference. First operand 364 states and 417 transitions. Second operand 3 states. [2019-10-02 16:19:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:26,021 INFO L93 Difference]: Finished difference Result 1024 states and 1227 transitions. [2019-10-02 16:19:26,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:19:26,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-02 16:19:26,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:26,028 INFO L225 Difference]: With dead ends: 1024 [2019-10-02 16:19:26,028 INFO L226 Difference]: Without dead ends: 680 [2019-10-02 16:19:26,030 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-02 16:19:26,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-10-02 16:19:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 676. [2019-10-02 16:19:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-10-02 16:19:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 787 transitions. [2019-10-02 16:19:26,092 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 787 transitions. Word has length 77 [2019-10-02 16:19:26,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:26,092 INFO L475 AbstractCegarLoop]: Abstraction has 676 states and 787 transitions. [2019-10-02 16:19:26,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:19:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 787 transitions. [2019-10-02 16:19:26,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-02 16:19:26,095 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:26,096 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 16:19:26,096 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:26,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:26,097 INFO L82 PathProgramCache]: Analyzing trace with hash 772889349, now seen corresponding path program 1 times [2019-10-02 16:19:26,097 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:26,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:26,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:26,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:26,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 16:19:26,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:26,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 16:19:26,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:19:26,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:19:26,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:26,177 INFO L87 Difference]: Start difference. First operand 676 states and 787 transitions. Second operand 4 states. [2019-10-02 16:19:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:26,446 INFO L93 Difference]: Finished difference Result 1722 states and 2036 transitions. [2019-10-02 16:19:26,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:19:26,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-10-02 16:19:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:26,452 INFO L225 Difference]: With dead ends: 1722 [2019-10-02 16:19:26,453 INFO L226 Difference]: Without dead ends: 805 [2019-10-02 16:19:26,459 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:26,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-10-02 16:19:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-10-02 16:19:26,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-10-02 16:19:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 897 transitions. [2019-10-02 16:19:26,518 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 897 transitions. Word has length 121 [2019-10-02 16:19:26,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:26,518 INFO L475 AbstractCegarLoop]: Abstraction has 797 states and 897 transitions. [2019-10-02 16:19:26,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:19:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 897 transitions. [2019-10-02 16:19:26,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 16:19:26,524 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:26,524 INFO L411 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, 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] [2019-10-02 16:19:26,524 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:26,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:26,525 INFO L82 PathProgramCache]: Analyzing trace with hash -797989467, now seen corresponding path program 1 times [2019-10-02 16:19:26,525 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:26,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:26,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:26,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:26,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 16:19:26,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:19:26,593 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:19:26,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:26,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 16:19:26,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:19:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 16:19:26,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:19:26,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-10-02 16:19:26,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:19:26,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:19:26,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:26,791 INFO L87 Difference]: Start difference. First operand 797 states and 897 transitions. Second operand 4 states. [2019-10-02 16:19:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:27,096 INFO L93 Difference]: Finished difference Result 1906 states and 2163 transitions. [2019-10-02 16:19:27,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:19:27,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-10-02 16:19:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:27,101 INFO L225 Difference]: With dead ends: 1906 [2019-10-02 16:19:27,101 INFO L226 Difference]: Without dead ends: 563 [2019-10-02 16:19:27,105 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:27,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-10-02 16:19:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-10-02 16:19:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-02 16:19:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 617 transitions. [2019-10-02 16:19:27,149 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 617 transitions. Word has length 176 [2019-10-02 16:19:27,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:27,149 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 617 transitions. [2019-10-02 16:19:27,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:19:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 617 transitions. [2019-10-02 16:19:27,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 16:19:27,152 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:27,152 INFO L411 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, 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] [2019-10-02 16:19:27,153 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:27,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:27,153 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2019-10-02 16:19:27,153 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:27,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:27,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:27,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:27,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 16:19:27,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:27,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 16:19:27,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 16:19:27,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 16:19:27,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:27,300 INFO L87 Difference]: Start difference. First operand 563 states and 617 transitions. Second operand 6 states. [2019-10-02 16:19:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:28,062 INFO L93 Difference]: Finished difference Result 705 states and 782 transitions. [2019-10-02 16:19:28,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 16:19:28,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-10-02 16:19:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:28,065 INFO L225 Difference]: With dead ends: 705 [2019-10-02 16:19:28,065 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 16:19:28,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 16:19:28,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 16:19:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 16:19:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 16:19:28,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 16:19:28,070 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2019-10-02 16:19:28,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:28,071 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 16:19:28,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 16:19:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 16:19:28,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 16:19:28,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 16:19:31,625 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-10-02 16:19:34,080 WARN L191 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 125 DAG size of output: 57 [2019-10-02 16:19:34,815 WARN L191 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-10-02 16:19:35,422 WARN L191 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-10-02 16:19:36,029 WARN L191 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-10-02 16:19:36,267 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-10-02 16:19:36,832 WARN L191 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-10-02 16:19:37,400 WARN L191 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-10-02 16:19:37,531 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-10-02 16:19:38,148 WARN L191 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-10-02 16:19:38,942 WARN L191 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-10-02 16:19:39,111 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-10-02 16:19:39,663 WARN L191 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-10-02 16:19:41,867 WARN L191 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 127 DAG size of output: 72 [2019-10-02 16:19:42,408 WARN L191 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-10-02 16:19:43,945 WARN L191 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 126 DAG size of output: 65 [2019-10-02 16:19:45,077 WARN L191 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2019-10-02 16:19:46,205 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-10-02 16:19:46,792 WARN L191 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-10-02 16:19:48,207 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-10-02 16:19:48,523 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-10-02 16:19:49,994 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 134 DAG size of output: 58 [2019-10-02 16:19:50,245 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-10-02 16:19:51,664 WARN L191 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-10-02 16:19:52,101 WARN L191 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-10-02 16:19:52,676 WARN L191 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-10-02 16:19:54,098 WARN L191 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-10-02 16:19:54,220 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-10-02 16:19:54,340 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-10-02 16:19:54,647 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-10-02 16:19:55,744 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-10-02 16:19:56,235 WARN L191 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-10-02 16:19:56,743 WARN L191 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-10-02 16:19:57,103 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-10-02 16:19:58,787 WARN L191 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-10-02 16:19:59,184 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-10-02 16:20:00,122 WARN L191 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2019-10-02 16:20:00,526 WARN L191 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-10-02 16:20:01,110 WARN L191 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-10-02 16:20:02,796 WARN L191 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 126 DAG size of output: 65 [2019-10-02 16:20:03,791 WARN L191 SmtUtils]: Spent 992.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2019-10-02 16:20:04,277 WARN L191 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-10-02 16:20:04,746 WARN L191 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-10-02 16:20:04,867 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-10-02 16:20:05,173 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-10-02 16:20:05,296 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-10-02 16:20:05,695 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-10-02 16:20:05,780 INFO L443 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2019-10-02 16:20:05,781 INFO L439 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse15 (<= 2 ~t1_st~0)) (.cse11 (= 1 ~E_M~0)) (.cse14 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (= ~T1_E~0 1)) (.cse1 (= ~T1_E~0 0)) (.cse2 (= 1 ~E_1~0)) (.cse5 (= 0 ~E_1~0)) (.cse6 (not .cse12)) (.cse7 (= 0 ~E_M~0)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (= 0 ~M_E~0)) (.cse4 (<= 2 ~m_st~0)) (.cse13 (= 1 ~m_pc~0)) (.cse10 (= 1 ~M_E~0))) (and (let ((.cse3 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~token~0)) .cse4 .cse5 .cse6 .cse7 (not (<= ~token~0 .cse3)) .cse8 .cse9 .cse10)) (or .cse11 .cse0 .cse1 .cse5 (= 0 ~t1_st~0) .cse7 .cse12 .cse9 .cse13 .cse10 (not (= |old(~t1_st~0)| 0))) (or .cse11 .cse14 .cse0 .cse1 .cse15 .cse5 .cse7 .cse12 .cse9 .cse13 .cse10) (or .cse15 .cse11 .cse14 .cse0 .cse1 (not (<= ~token~0 ~local~0)) .cse5 .cse6 (not (<= ~local~0 ~token~0)) .cse7 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse4 .cse13 .cse10)))) [2019-10-02 16:20:05,781 INFO L443 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2019-10-02 16:20:05,781 INFO L439 ceAbstractionStarter]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse15 (<= 2 ~m_st~0)) (.cse11 (not (= ~E_M~0 0))) (.cse12 (not (= ~E_M~0 1)))) (let ((.cse14 (and .cse15 .cse11 .cse12)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (<= ~local~0 |old(~token~0)|))) (.cse17 (= |old(~t1_pc~0)| 1)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse7 (= ~T1_E~0 1)) (.cse8 (= 1 ~E_1~0)) (.cse9 (= 0 ~E_1~0)) (.cse10 (= ~m_st~0 0)) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse13 (= 0 |old(~E_M~0)|)) (.cse18 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 .cse11 (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0) .cse12) .cse13 .cse14) (or .cse6 .cse7 .cse0 .cse8 .cse9 (and .cse15 .cse16) .cse13 .cse17 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse0 .cse8 .cse14 .cse9 .cse13 .cse3 .cse4 .cse18 .cse5) (or .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~m_st~0)|)) .cse8 .cse9 (and .cse10 (<= ~token~0 ~local~0) .cse16 (<= ~local~0 ~token~0)) .cse13 .cse18)))) [2019-10-02 16:20:05,781 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-10-02 16:20:05,782 INFO L439 ceAbstractionStarter]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse3 (= |old(~t1_pc~0)| 1)) (.cse18 (= 1 ~t1_pc~0))) (let ((.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (<= ~local~0 |old(~token~0)|))) (.cse12 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse11 (not .cse18)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse7 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse8 (= 1 ~E_1~0)) (.cse9 (= 0 ~E_1~0)) (.cse16 (not .cse3)) (.cse10 (= 0 |old(~E_M~0)|)) (.cse17 (not (<= 2 |old(~m_st~0)|))) (.cse19 (<= 2 ~m_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (= 0 ~M_E~0)) (.cse15 (= 1 ~m_pc~0)) (.cse5 (= 1 ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~m_st~0)|)) .cse8 .cse9 .cse10 (and .cse11 (= ~m_st~0 0) .cse12 .cse13 .cse14) .cse15) (or .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse18 .cse19 .cse12 .cse13 .cse14) .cse9 .cse10) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse3 .cse17 .cse4 .cse5 (and .cse11 .cse19 .cse13)) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse16 .cse10 .cse17 (and .cse18 .cse19 .cse13) .cse4 .cse15 .cse5)))) [2019-10-02 16:20:05,782 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-10-02 16:20:05,782 INFO L439 ceAbstractionStarter]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse11 (= 1 ~m_pc~0)) (.cse3 (= |old(~t1_pc~0)| 1)) (.cse0 (= ~T1_E~0 0)) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (<= ~local~0 |old(~token~0)|))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse7 (= ~T1_E~0 1)) (.cse8 (= 1 ~E_1~0)) (.cse13 (= 1 ~t1_pc~0)) (.cse14 (<= 2 ~m_st~0)) (.cse15 (= ~E_M~0 |old(~E_M~0)|)) (.cse9 (= 0 ~E_1~0)) (.cse10 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~m_st~0)|)) .cse8 .cse9 .cse10 .cse11) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse12 (and .cse13 .cse14 .cse15) .cse4 .cse11 .cse5) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse3 .cse12 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse13 .cse14 (<= ~token~0 ~local~0) .cse15 (<= ~local~0 ~token~0)) .cse9 .cse10))) [2019-10-02 16:20:05,782 INFO L443 ceAbstractionStarter]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2019-10-02 16:20:05,782 INFO L439 ceAbstractionStarter]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse11 (= 1 ~t1_pc~0)) (.cse7 (= ~T1_E~0 1)) (.cse18 (<= 2 ~m_st~0)) (.cse19 (not (= ~E_M~0 0))) (.cse0 (= ~T1_E~0 0)) (.cse20 (not (= ~E_M~0 1)))) (let ((.cse15 (= 1 ~m_pc~0)) (.cse3 (= |old(~t1_pc~0)| 1)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (<= ~local~0 |old(~token~0)|))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse17 (and .cse11 (not .cse7) .cse18 .cse19 (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (not .cse0) (not (= ~E_1~0 0)) .cse20)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse8 (= 1 ~E_1~0)) (.cse9 (= 0 ~E_1~0)) (.cse10 (= 0 |old(~E_M~0)|)) (.cse12 (= ~m_st~0 0)) (.cse13 (<= 2 ~t1_st~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~m_st~0)|)) .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 (<= ~token~0 ~local~0) .cse14 (<= ~local~0 ~token~0)) .cse15) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse16 .cse17 .cse4 .cse15 .cse5) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse3 .cse16 (and .cse11 .cse18 .cse13 .cse14) .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 (and .cse11 .cse18 .cse19 .cse13 .cse20) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse19 .cse13 (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0) .cse20))))) [2019-10-02 16:20:05,782 INFO L439 ceAbstractionStarter]: At program point L99(line 99) the Hoare annotation is: (let ((.cse11 (= 1 ~m_pc~0)) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (not (<= ~local~0 |old(~token~0)|))) (.cse12 (= 1 ~t1_pc~0)) (.cse13 (<= 2 ~m_st~0)) (.cse14 (not (= ~E_M~0 0))) (.cse6 (= 1 |old(~E_M~0)|)) (.cse7 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse8 (= 1 ~E_1~0)) (.cse9 (= 0 ~E_1~0)) (.cse10 (= 0 |old(~E_M~0)|)) (.cse3 (= |old(~t1_pc~0)| 1)) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~m_st~0)|)) .cse8 .cse9 .cse10 .cse11) (or .cse6 .cse7 .cse0 .cse8 .cse9 (and .cse12 .cse13 .cse14) .cse10 .cse15 .cse4 .cse11 .cse5) (or .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse12 .cse13 .cse14 (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0))) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse3 .cse15 .cse4 .cse5))) [2019-10-02 16:20:05,783 INFO L443 ceAbstractionStarter]: For program point L99-1(line 99) no Hoare annotation was computed. [2019-10-02 16:20:05,783 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 321) no Hoare annotation was computed. [2019-10-02 16:20:05,783 INFO L443 ceAbstractionStarter]: For program point L315(line 315) no Hoare annotation was computed. [2019-10-02 16:20:05,783 INFO L443 ceAbstractionStarter]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2019-10-02 16:20:05,783 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2019-10-02 16:20:05,783 INFO L439 ceAbstractionStarter]: At program point L307(line 307) the Hoare annotation is: (let ((.cse14 (<= 2 ~m_st~0)) (.cse4 (= 0 ~t1_st~0)) (.cse24 (= ~m_st~0 0)) (.cse15 (<= 2 ~t1_st~0)) (.cse6 (= ~t1_pc~0 1)) (.cse25 (+ ~local~0 1))) (let ((.cse20 (not (<= .cse25 ~token~0))) (.cse12 (not .cse6)) (.cse22 (not (<= ~token~0 .cse25))) (.cse9 (= 1 ~M_E~0)) (.cse21 (and .cse24 .cse15)) (.cse16 (not (<= 2 |old(~t1_st~0)|))) (.cse23 (and .cse14 .cse4)) (.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse2 (= ~T1_E~0 0)) (.cse17 (not (<= ~token~0 ~local~0))) (.cse18 (not (<= ~local~0 ~token~0))) (.cse7 (= 0 ~M_E~0)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse0 (= 1 ~E_M~0)) (.cse1 (= ~T1_E~0 1)) (.cse19 (not (= 0 |old(~m_st~0)|))) (.cse11 (= 1 ~E_1~0)) (.cse3 (= 0 ~E_1~0)) (.cse5 (= 0 ~E_M~0)) (.cse8 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse11 .cse3 .cse12 .cse5 .cse13 .cse7 .cse14 .cse8 .cse9) (or .cse15 .cse0 .cse16 .cse1 .cse2 .cse17 .cse3 .cse12 .cse18 .cse5 .cse7 .cse9) (or .cse0 .cse1 .cse2 .cse14 .cse11 .cse3 .cse5 .cse13 .cse7 .cse8) (or .cse2 .cse12 .cse7 .cse0 .cse16 .cse19 .cse1 .cse11 .cse20 .cse21 .cse3 .cse5 .cse22) (or .cse0 .cse16 .cse19 .cse1 .cse2 .cse11 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse2 .cse11 .cse20 .cse14 .cse3 .cse12 .cse5 .cse22 .cse13 .cse7 .cse9) (or .cse0 .cse16 .cse1 .cse2 .cse15 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse16 .cse1 .cse2 .cse11 (and .cse14 .cse15) .cse3 .cse5 .cse13 .cse7) (or .cse2 .cse17 .cse18 .cse21 .cse7 .cse0 .cse16 .cse1 .cse19 .cse11 .cse3 .cse5 .cse8) (or .cse0 .cse1 .cse2 .cse23 .cse11 .cse3 .cse5 .cse6 .cse13 .cse7 .cse10) (or .cse2 .cse23 .cse17 .cse18 .cse13 .cse7 .cse10 .cse0 .cse1 .cse11 .cse3 .cse5) (or .cse2 .cse17 .cse18 .cse6 .cse7 .cse10 (and .cse24 .cse4) .cse0 .cse1 .cse19 .cse11 .cse3 .cse5 .cse8)))) [2019-10-02 16:20:05,784 INFO L439 ceAbstractionStarter]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse26 (= ~m_st~0 0)) (.cse12 (<= 2 ~t1_st~0)) (.cse27 (+ ~local~0 1)) (.cse7 (= ~t1_pc~0 1)) (.cse1 (= ~T1_E~0 1)) (.cse11 (not (= ~m_pc~0 1))) (.cse2 (= ~T1_E~0 0)) (.cse21 (<= 2 ~m_st~0)) (.cse18 (= 0 ~t1_st~0))) (let ((.cse3 (and .cse21 .cse18)) (.cse20 (and (not .cse1) .cse21 .cse11 (not .cse2) (not (= ~E_M~0 1)))) (.cse15 (not .cse7)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse17 (= 1 ~M_E~0)) (.cse23 (not (<= .cse27 ~token~0))) (.cse25 (not (<= ~token~0 .cse27))) (.cse24 (and .cse26 .cse12)) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (not (<= ~token~0 ~local~0))) (.cse16 (not (<= ~local~0 ~token~0))) (.cse9 (= 0 ~M_E~0)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse0 (= 1 ~E_M~0)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse4 (= 1 ~E_1~0)) (.cse5 (= 0 ~E_1~0)) (.cse6 (= 0 ~E_M~0)) (.cse19 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse13 .cse1 .cse2 .cse14 .cse5 .cse15 .cse16 .cse6 .cse9 .cse17) (or .cse0 .cse1 .cse2 .cse5 .cse18 .cse6 .cse7 .cse9 .cse19 .cse17 .cse10) (or .cse0 .cse13 .cse1 .cse2 .cse20 .cse4 .cse5 .cse6 .cse8 (and .cse21 .cse12) .cse9) (or .cse2 .cse20 .cse3 .cse14 .cse16 .cse8 .cse9 .cse10 .cse0 .cse1 .cse4 .cse5 .cse6) (or .cse1 .cse2 .cse4 .cse21 .cse5 .cse15 .cse6 .cse8 .cse9 .cse19 .cse17) (or .cse2 .cse15 .cse9 .cse0 .cse13 .cse22 .cse1 .cse4 .cse23 .cse24 .cse5 .cse6 .cse25) (or .cse0 .cse13 .cse22 .cse1 .cse2 .cse4 .cse5 .cse24 .cse6 .cse7 .cse9 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse5 .cse6 .cse8 .cse9 .cse19) (or .cse0 .cse13 .cse1 .cse2 .cse12 .cse5 .cse6 .cse7 .cse9 .cse19 .cse17) (or .cse2 .cse26 .cse15 .cse8 .cse9 .cse21 .cse17 .cse1 .cse4 .cse23 .cse5 .cse6 .cse25) (or .cse2 .cse14 .cse16 .cse24 .cse9 .cse0 .cse13 .cse1 .cse22 .cse4 .cse5 .cse6 .cse19) (or .cse2 .cse14 .cse16 .cse7 .cse9 .cse10 (and .cse26 .cse18) .cse0 .cse1 .cse22 .cse4 .cse5 .cse6 .cse19)))) [2019-10-02 16:20:05,784 INFO L443 ceAbstractionStarter]: For program point L307-1(line 307) no Hoare annotation was computed. [2019-10-02 16:20:05,784 INFO L439 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse14 (<= 2 ~m_st~0)) (.cse4 (= 0 ~t1_st~0)) (.cse24 (= ~m_st~0 0)) (.cse15 (<= 2 ~t1_st~0)) (.cse6 (= ~t1_pc~0 1)) (.cse25 (+ ~local~0 1))) (let ((.cse20 (not (<= .cse25 ~token~0))) (.cse12 (not .cse6)) (.cse22 (not (<= ~token~0 .cse25))) (.cse9 (= 1 ~M_E~0)) (.cse21 (and .cse24 .cse15)) (.cse16 (not (<= 2 |old(~t1_st~0)|))) (.cse23 (and .cse14 .cse4)) (.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse2 (= ~T1_E~0 0)) (.cse17 (not (<= ~token~0 ~local~0))) (.cse18 (not (<= ~local~0 ~token~0))) (.cse7 (= 0 ~M_E~0)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse0 (= 1 ~E_M~0)) (.cse1 (= ~T1_E~0 1)) (.cse19 (not (= 0 |old(~m_st~0)|))) (.cse11 (= 1 ~E_1~0)) (.cse3 (= 0 ~E_1~0)) (.cse5 (= 0 ~E_M~0)) (.cse8 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse11 .cse3 .cse12 .cse5 .cse13 .cse7 .cse14 .cse8 .cse9) (or .cse15 .cse0 .cse16 .cse1 .cse2 .cse17 .cse3 .cse12 .cse18 .cse5 .cse7 .cse9) (or .cse0 .cse1 .cse2 .cse14 .cse11 .cse3 .cse5 .cse13 .cse7 .cse8) (or .cse2 .cse12 .cse7 .cse0 .cse16 .cse19 .cse1 .cse11 .cse20 .cse21 .cse3 .cse5 .cse22) (or .cse0 .cse16 .cse19 .cse1 .cse2 .cse11 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse2 .cse11 .cse20 .cse14 .cse3 .cse12 .cse5 .cse22 .cse13 .cse7 .cse9) (or .cse0 .cse16 .cse1 .cse2 .cse15 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse16 .cse1 .cse2 .cse11 (and .cse14 .cse15) .cse3 .cse5 .cse13 .cse7) (or .cse2 .cse17 .cse18 .cse21 .cse7 .cse0 .cse16 .cse1 .cse19 .cse11 .cse3 .cse5 .cse8) (or .cse0 .cse1 .cse2 .cse23 .cse11 .cse3 .cse5 .cse6 .cse13 .cse7 .cse10) (or .cse2 .cse23 .cse17 .cse18 .cse13 .cse7 .cse10 .cse0 .cse1 .cse11 .cse3 .cse5) (or .cse2 .cse17 .cse18 .cse6 .cse7 .cse10 (and .cse24 .cse4) .cse0 .cse1 .cse19 .cse11 .cse3 .cse5 .cse8)))) [2019-10-02 16:20:05,784 INFO L443 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2019-10-02 16:20:05,784 INFO L446 ceAbstractionStarter]: At program point L190(lines 177 192) the Hoare annotation is: true [2019-10-02 16:20:05,784 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2019-10-02 16:20:05,784 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 187) no Hoare annotation was computed. [2019-10-02 16:20:05,785 INFO L446 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2019-10-02 16:20:05,785 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 188) no Hoare annotation was computed. [2019-10-02 16:20:05,785 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2019-10-02 16:20:05,785 INFO L443 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2019-10-02 16:20:05,785 INFO L446 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2019-10-02 16:20:05,785 INFO L443 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2019-10-02 16:20:05,786 INFO L439 ceAbstractionStarter]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse1 (= ~T1_E~0 1)) (.cse2 (= ~T1_E~0 0)) (.cse4 (= 0 ~E_1~0)) (.cse10 (not .cse15)) (.cse8 (= 0 ~M_E~0)) (.cse16 (= 1 ~M_E~0)) (.cse21 (+ ~local~0 1))) (let ((.cse13 (not (<= .cse21 ~token~0))) (.cse14 (not (<= ~token~0 .cse21))) (.cse18 (or .cse1 .cse2 .cse4 .cse10 .cse8 .cse16)) (.cse7 (not (<= 2 ~m_st~0))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse19 (not (<= ~token~0 ~local~0))) (.cse20 (not (<= ~local~0 ~token~0))) (.cse5 (= is_transmit1_triggered_~__retres1~1 0)) (.cse17 (not (= ~t1_st~0 0))) (.cse0 (= 1 ~E_M~0)) (.cse12 (not (= 0 ~m_st~0))) (.cse3 (= 1 ~E_1~0)) (.cse6 (= 0 ~E_M~0)) (.cse9 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse2 .cse10 .cse5 .cse8 .cse0 .cse11 .cse12 .cse1 .cse3 .cse13 .cse4 .cse6 .cse14) (or .cse0 .cse5 .cse11 .cse1 .cse2 .cse4 .cse6 .cse15 .cse8 .cse9 .cse16) (or .cse0 .cse11 .cse12 .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse5 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse4 .cse6 .cse15 .cse7 .cse8 .cse17) (or .cse18 .cse12 .cse3 .cse13 .cse5 .cse6 .cse14) (or .cse2 .cse19 .cse10 .cse20 .cse5 .cse8 .cse16 .cse0 .cse3 .cse11 .cse1 .cse4 .cse6) (or .cse2 .cse19 .cse20 .cse7 .cse8 .cse17 .cse0 .cse1 .cse3 .cse4 .cse6 .cse5) (or .cse18 .cse3 .cse6 .cse5 .cse7) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse15 .cse5 .cse8 .cse9 .cse16 .cse17) (or .cse2 .cse5 .cse19 .cse20 .cse8 .cse0 .cse11 .cse1 .cse12 .cse3 .cse4 .cse6 .cse9) (or .cse2 .cse19 .cse20 .cse15 .cse5 .cse8 .cse17 .cse0 .cse1 .cse12 .cse3 .cse4 .cse6 .cse9))))) [2019-10-02 16:20:05,786 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 139) no Hoare annotation was computed. [2019-10-02 16:20:05,786 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 142) no Hoare annotation was computed. [2019-10-02 16:20:05,786 INFO L443 ceAbstractionStarter]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2019-10-02 16:20:05,786 INFO L443 ceAbstractionStarter]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2019-10-02 16:20:05,786 INFO L443 ceAbstractionStarter]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2019-10-02 16:20:05,786 INFO L443 ceAbstractionStarter]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2019-10-02 16:20:05,787 INFO L439 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse14 (not (<= ~token~0 ~local~0))) (.cse15 (not (<= ~local~0 ~token~0))) (.cse6 (not (= 0 ~m_st~0))) (.cse12 (= 1 ~m_pc~0)) (.cse5 (not (<= 2 ~t1_st~0))) (.cse4 (= 1 |old(~E_M~0)|)) (.cse7 (= |old(~T1_E~0)| 1)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse9 (= 0 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_M~0)|)) (.cse1 (= ~t1_pc~0 1)) (.cse17 (not (<= 2 ~m_st~0))) (.cse10 (and (= ~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)|))) (.cse2 (= 0 |old(~M_E~0)|)) (.cse3 (= 1 |old(~M_E~0)|)) (.cse16 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0 1))) (or .cse10 .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 (not (<= .cse13 ~token~0)) .cse8 .cse9 (not (<= ~token~0 .cse13)) .cse11)) (or .cse0 .cse14 .cse15 .cse1 .cse2 .cse3 .cse16 .cse4 .cse7 .cse6 .cse8 .cse9 .cse11 .cse10 .cse12) (or .cse4 .cse7 .cse0 .cse8 .cse9 .cse11 .cse17 .cse10 .cse2 .cse12 .cse3) (or .cse0 .cse14 .cse15 .cse17 .cse2 .cse3 .cse16 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse11 .cse10 .cse12) (or .cse4 .cse5 .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse17 .cse2 .cse3) (or .cse4 .cse7 .cse0 .cse8 .cse9 .cse11 .cse1 .cse17 .cse10 .cse2 .cse3 .cse16))) [2019-10-02 16:20:05,787 INFO L443 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2019-10-02 16:20:05,787 INFO L443 ceAbstractionStarter]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2019-10-02 16:20:05,787 INFO L443 ceAbstractionStarter]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2019-10-02 16:20:05,787 INFO L443 ceAbstractionStarter]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2019-10-02 16:20:05,788 INFO L439 ceAbstractionStarter]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (= ~T1_E~0 0) (not (<= ~token~0 ~local~0)) (not (<= ~local~0 ~token~0)) (= ~t1_pc~0 1) (= 0 ~M_E~0) (= 1 ~M_E~0) (not (= |old(~t1_st~0)| 0)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 |old(~m_st~0)|)) (= 1 ~E_1~0) (= 0 ~E_1~0) (= 0 ~E_M~0) (and (= ~m_st~0 0) (= 0 ~t1_st~0)) (= 1 ~m_pc~0)) [2019-10-02 16:20:05,788 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2019-10-02 16:20:05,788 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and (not (= 1 ~t1_pc~0)) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:20:05,788 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2019-10-02 16:20:05,788 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2019-10-02 16:20:05,788 INFO L443 ceAbstractionStarter]: For program point L468(line 468) no Hoare annotation was computed. [2019-10-02 16:20:05,788 INFO L439 ceAbstractionStarter]: At program point L467(line 467) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and (not (= 1 ~t1_pc~0)) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:20:05,789 INFO L439 ceAbstractionStarter]: At program point L467-1(line 467) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and (not (= 1 ~t1_pc~0)) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:20:05,789 INFO L443 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2019-10-02 16:20:05,789 INFO L443 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-10-02 16:20:05,789 INFO L446 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2019-10-02 16:20:05,789 INFO L443 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2019-10-02 16:20:05,789 INFO L443 ceAbstractionStarter]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2019-10-02 16:20:05,789 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-02 16:20:05,790 INFO L439 ceAbstractionStarter]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse14 (+ |old(~local~0)| 1))) (let ((.cse9 (= 1 |old(~m_pc~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse10 (= ~t1_pc~0 1)) (.cse1 (= 0 ~M_E~0)) (.cse2 (= 1 ~M_E~0)) (.cse3 (= 1 ~E_M~0)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (= ~T1_E~0 1)) (.cse6 (= 1 |old(~E_1~0)|)) (.cse11 (not (<= .cse14 |old(~token~0)|))) (.cse7 (= 0 |old(~E_1~0)|)) (.cse8 (= 0 ~E_M~0)) (.cse12 (not (<= |old(~token~0)| .cse14)))) (and (or .cse0 (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse3 .cse4 .cse5 .cse0 .cse6 .cse7 .cse8 .cse10 .cse1 .cse9 .cse2) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12 .cse8 .cse9) (or .cse3 .cse5 .cse0 .cse6 .cse7 .cse8 .cse10 .cse1 .cse9 .cse2 (not (= |old(~t1_st~0)| 0))) (or .cse0 (not .cse10) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 (let ((.cse13 (+ ~local~0 1))) (and (<= ~token~0 .cse13) (<= 2 ~t1_st~0) (= |old(~token~0)| ~token~0) (<= .cse13 ~token~0) (= ~E_1~0 |old(~E_1~0)|))) .cse7 .cse8 .cse12)))) [2019-10-02 16:20:05,790 INFO L439 ceAbstractionStarter]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0))) (let ((.cse18 (= 0 ~t1_st~0)) (.cse13 (<= 2 ~m_st~0)) (.cse14 (<= 2 ~t1_st~0)) (.cse15 (not (= ~E_1~0 1))) (.cse19 (not .cse0)) (.cse16 (not (= ~E_1~0 0)))) (let ((.cse1 (and .cse13 .cse14 .cse15 .cse19 .cse16)) (.cse2 (and .cse13 .cse18 .cse15 .cse19 (<= ~token~0 ~local~0) .cse16 (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (= 1 ~E_M~0)) (.cse8 (= ~T1_E~0 1)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_1~0)|)) (.cse12 (= 0 ~E_M~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= 0 ~M_E~0)) (.cse17 (= 1 |old(~m_pc~0)|)) (.cse5 (= 1 ~M_E~0))) (and (let ((.cse10 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= .cse10 |old(~token~0)|)) .cse11 .cse12 (not (<= |old(~token~0)| .cse10)))) (or .cse6 .cse7 .cse8 .cse0 .cse9 (and .cse13 .cse14 .cse15 .cse16) .cse11 .cse12 .cse3 .cse4 .cse17 .cse5) (or .cse0 .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse17) (or .cse6 .cse8 .cse0 .cse9 (and .cse13 .cse18 .cse15 .cse16) .cse11 .cse12 .cse3 .cse4 .cse17 .cse5 (not (= |old(~t1_st~0)| 0))))))) [2019-10-02 16:20:05,790 INFO L439 ceAbstractionStarter]: At program point L61(line 61) the Hoare annotation is: (let ((.cse9 (= 1 |old(~m_pc~0)|)) (.cse3 (= 1 ~E_M~0)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse6 (= 1 |old(~E_1~0)|)) (.cse7 (= 0 |old(~E_1~0)|)) (.cse10 (= ~t1_pc~0 1)) (.cse8 (= 0 ~E_M~0)) (.cse1 (= 0 ~M_E~0)) (.cse2 (= 1 ~M_E~0))) (and (or .cse0 (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse3 .cse4 .cse5 .cse0 .cse6 .cse7 .cse8 .cse10 .cse1 .cse9 .cse2) (or .cse3 .cse5 .cse0 .cse6 .cse7 .cse8 .cse10 .cse1 .cse9 .cse2 (not (= |old(~t1_st~0)| 0))) (let ((.cse11 (+ |old(~local~0)| 1))) (or .cse3 .cse4 .cse5 .cse0 .cse6 (not (<= .cse11 |old(~token~0)|)) .cse7 (not .cse10) .cse8 (not (<= |old(~token~0)| .cse11)) .cse1 .cse2)))) [2019-10-02 16:20:05,791 INFO L439 ceAbstractionStarter]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse19 (+ |old(~local~0)| 1)) (.cse17 (= ~t1_pc~0 1))) (let ((.cse12 (= 1 |old(~m_pc~0)|)) (.cse0 (not (= ~m_pc~0 1))) (.cse1 (= ~T1_E~0 0)) (.cse13 (not .cse17)) (.cse2 (= 0 ~M_E~0)) (.cse3 (= 1 ~M_E~0)) (.cse4 (= 1 ~E_M~0)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (= ~T1_E~0 1)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse7 (not (<= .cse19 |old(~token~0)|))) (.cse14 (<= 2 ~t1_st~0)) (.cse15 (= |old(~token~0)| ~token~0)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse9 (= 0 |old(~E_1~0)|)) (.cse11 (= 0 ~E_M~0)) (.cse10 (not (<= |old(~token~0)| .cse19)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) .cse2 .cse3 (and .cse14 .cse0 .cse15 .cse16 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12) (or .cse4 .cse6 .cse1 .cse8 .cse9 .cse11 .cse17 (and (= 0 ~t1_st~0) .cse0 .cse16) .cse2 .cse12 .cse3 (not (= |old(~t1_st~0)| 0))) (or .cse4 .cse5 .cse6 .cse1 .cse8 .cse9 .cse11 .cse17 .cse2 .cse12 .cse3 (and .cse14 .cse0 .cse16)) (or .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 (let ((.cse18 (+ ~local~0 1))) (and (<= ~token~0 .cse18) .cse14 .cse15 (<= .cse18 ~token~0) .cse16)) .cse9 .cse11 .cse10)))) [2019-10-02 16:20:05,791 INFO L439 ceAbstractionStarter]: At program point L51(line 51) the Hoare annotation is: (let ((.cse20 (+ |old(~local~0)| 1)) (.cse7 (= ~t1_pc~0 1)) (.cse2 (= ~T1_E~0 1)) (.cse8 (<= 2 ~t1_st~0)) (.cse9 (not (= ~m_pc~0 1))) (.cse3 (= ~T1_E~0 0)) (.cse18 (<= ~token~0 ~local~0)) (.cse10 (not (= ~E_1~0 0))) (.cse13 (= 1 ~M_E~0)) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse16 (and (= 1 ~t1_pc~0) (not .cse2) (not (= ~M_E~0 0)) .cse8 .cse9 (not .cse3) .cse18 .cse10 (not .cse13) .cse19 (not (= ~E_M~0 1)))) (.cse14 (not .cse7)) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse15 (not (<= .cse20 |old(~token~0)|))) (.cse17 (not (<= |old(~token~0)| .cse20))) (.cse0 (= 1 ~E_M~0)) (.cse4 (= 1 |old(~E_1~0)|)) (.cse5 (= 0 |old(~E_1~0)|)) (.cse6 (= 0 ~E_M~0)) (.cse11 (= 0 ~M_E~0)) (.cse12 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10) .cse11 .cse12 .cse13) (or .cse3 .cse14 .cse11 .cse13 .cse0 .cse1 .cse2 .cse15 .cse4 .cse16 .cse5 .cse17 .cse6 .cse12) (or .cse3 (not (<= |old(~token~0)| |old(~local~0)|)) .cse14 (not (<= |old(~local~0)| |old(~token~0)|)) .cse11 .cse13 .cse0 .cse1 .cse2 .cse4 .cse5 .cse16 .cse6 .cse12) (or .cse3 .cse14 .cse11 .cse13 .cse0 (and .cse8 .cse18 .cse10 .cse19) .cse1 .cse2 .cse4 .cse15 .cse5 .cse6 .cse17) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (= 0 ~t1_st~0) .cse9 .cse10) .cse11 .cse12 .cse13 (not (= |old(~t1_st~0)| 0)))))) [2019-10-02 16:20:05,791 INFO L443 ceAbstractionStarter]: For program point L51-1(line 51) no Hoare annotation was computed. [2019-10-02 16:20:05,791 INFO L439 ceAbstractionStarter]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse19 (+ |old(~local~0)| 1)) (.cse17 (= ~t1_pc~0 1))) (let ((.cse12 (= 1 |old(~m_pc~0)|)) (.cse0 (not (= ~m_pc~0 1))) (.cse1 (= ~T1_E~0 0)) (.cse13 (not .cse17)) (.cse2 (= 0 ~M_E~0)) (.cse3 (= 1 ~M_E~0)) (.cse4 (= 1 ~E_M~0)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (= ~T1_E~0 1)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse7 (not (<= .cse19 |old(~token~0)|))) (.cse14 (<= 2 ~t1_st~0)) (.cse15 (= |old(~token~0)| ~token~0)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse9 (= 0 |old(~E_1~0)|)) (.cse11 (= 0 ~E_M~0)) (.cse10 (not (<= |old(~token~0)| .cse19)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 (not (<= |old(~token~0)| |old(~local~0)|)) .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) .cse2 .cse3 (and .cse14 .cse0 .cse15 .cse16 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12) (or .cse4 .cse6 .cse1 .cse8 .cse9 .cse11 .cse17 (and (= 0 ~t1_st~0) .cse0 .cse16) .cse2 .cse12 .cse3 (not (= |old(~t1_st~0)| 0))) (or .cse4 .cse5 .cse6 .cse1 .cse8 .cse9 .cse11 .cse17 .cse2 .cse12 .cse3 (and .cse14 .cse0 .cse16)) (or .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 (let ((.cse18 (+ ~local~0 1))) (and (<= ~token~0 .cse18) .cse14 .cse15 (<= .cse18 ~token~0) .cse16)) .cse9 .cse11 .cse10)))) [2019-10-02 16:20:05,791 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-10-02 16:20:05,791 INFO L443 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2019-10-02 16:20:05,792 INFO L439 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse13 (not (<= 2 ~m_st~0))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse1 (= ~T1_E~0 0)) (.cse15 (not (<= ~token~0 ~local~0))) (.cse16 (not (<= ~local~0 ~token~0))) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= 0 |old(~M_E~0)|)) (.cse4 (= 1 |old(~M_E~0)|)) (.cse17 (not (= ~t1_st~0 0))) (.cse5 (= 1 ~E_M~0)) (.cse7 (= ~T1_E~0 1)) (.cse8 (not (= 0 ~m_st~0))) (.cse10 (= 1 ~E_1~0)) (.cse11 (= 0 ~E_1~0)) (.cse12 (= 0 ~E_M~0)) (.cse0 (= ~M_E~0 |old(~M_E~0)|)) (.cse14 (= 1 ~m_pc~0))) (and (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= .cse9 ~token~0)) .cse10 .cse11 (not (<= ~token~0 .cse9)) .cse12)) (or .cse5 .cse6 .cse7 .cse1 .cse10 .cse11 .cse0 .cse12 .cse13 .cse3 .cse4) (or .cse5 .cse7 .cse1 .cse10 .cse11 .cse12 .cse13 .cse0 .cse3 .cse14 .cse4) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse10 .cse11 .cse0 .cse12 .cse14) (or .cse1 .cse15 .cse16 .cse13 .cse3 .cse4 .cse17 .cse5 .cse7 .cse10 .cse11 .cse0 .cse12) (or .cse5 .cse7 .cse1 .cse10 .cse11 .cse12 .cse2 .cse13 .cse0 .cse3 .cse4 .cse17) (or .cse1 .cse15 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse0 .cse14) (or .cse1 .cse15 .cse16 .cse2 .cse3 .cse4 .cse17 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse0 .cse14))) [2019-10-02 16:20:05,792 INFO L443 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2019-10-02 16:20:05,792 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 16:20:05,792 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~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)|) (= |old(~token~0)| ~token~0)) [2019-10-02 16:20:05,792 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:20:05,793 INFO L439 ceAbstractionStarter]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse25 (= |old(~t1_pc~0)| 1)) (.cse32 (+ |old(~local~0)| 1)) (.cse9 (= 1 ~t1_pc~0))) (let ((.cse19 (= ~m_st~0 0)) (.cse26 (not .cse9)) (.cse11 (<= 2 ~t1_st~0)) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse18 (not (= 0 |old(~m_st~0)|))) (.cse28 (not (<= .cse32 |old(~token~0)|))) (.cse29 (not (<= |old(~token~0)| .cse32))) (.cse20 (not (= ~m_pc~0 1))) (.cse24 (= 1 |old(~m_pc~0)|)) (.cse3 (= ~T1_E~0 0)) (.cse16 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse6 (not .cse25)) (.cse17 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse14 (= 0 ~M_E~0)) (.cse15 (= 1 ~M_E~0)) (.cse30 (not (= |old(~t1_st~0)| 0))) (.cse0 (= 1 |old(~E_M~0)|)) (.cse2 (= ~T1_E~0 1)) (.cse4 (= 1 |old(~E_1~0)|)) (.cse5 (= 0 |old(~E_1~0)|)) (.cse10 (<= 2 ~m_st~0)) (.cse31 (= 0 ~t1_st~0)) (.cse21 (= |old(~token~0)| ~token~0)) (.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse22 (<= ~token~0 ~local~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse23 (<= ~local~0 ~token~0)) (.cse7 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (or .cse3 .cse16 .cse6 .cse17 .cse14 .cse15 .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse7 (and .cse9 .cse19 .cse11 .cse20 .cse21 .cse12 .cse22 .cse13 .cse23) .cse24) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse25 (and .cse26 .cse10 .cse20 .cse12 .cse13) .cse8 .cse14 .cse24 .cse15) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse20 .cse12 .cse13) .cse14 .cse24 .cse15) (or (let ((.cse27 (+ ~local~0 1))) (and .cse9 (<= ~token~0 .cse27) .cse19 .cse11 .cse21 (<= .cse27 ~token~0) .cse12 .cse13)) .cse3 .cse6 .cse14 .cse15 .cse0 .cse1 .cse2 .cse18 .cse28 .cse4 .cse5 .cse29 .cse7) (or .cse3 .cse16 .cse17 .cse25 .cse14 .cse15 .cse30 .cse0 .cse2 .cse18 .cse4 .cse5 .cse7 (and .cse26 .cse19 .cse31 .cse20 .cse21 .cse12 .cse22 .cse13 .cse23) .cse24) (or .cse3 .cse25 .cse14 .cse15 .cse0 .cse1 .cse18 .cse2 .cse4 .cse5 (and .cse26 .cse19 .cse11 .cse20 .cse12 .cse13) .cse7 .cse24) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse25 .cse8 (and .cse26 .cse10 .cse31 .cse12 .cse13) .cse14 .cse15 .cse30) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse26 .cse10 .cse11 .cse12 .cse13) .cse7 .cse25 .cse8 .cse14 .cse15) (or .cse3 .cse14 .cse15 .cse0 .cse1 .cse2 .cse18 .cse28 .cse4 .cse5 .cse29 .cse7 .cse20 .cse24) (or .cse3 .cse16 .cse6 .cse17 .cse8 .cse14 .cse15 .cse30 .cse0 .cse2 .cse4 .cse5 (and .cse9 .cse10 .cse31 .cse21 .cse12 .cse22 .cse13 .cse23) .cse7)))) [2019-10-02 16:20:05,793 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 220) no Hoare annotation was computed. [2019-10-02 16:20:05,793 INFO L443 ceAbstractionStarter]: For program point L205(lines 205 209) no Hoare annotation was computed. [2019-10-02 16:20:05,793 INFO L443 ceAbstractionStarter]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2019-10-02 16:20:05,793 INFO L443 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-10-02 16:20:05,794 INFO L439 ceAbstractionStarter]: At program point L201(line 201) the Hoare annotation is: (let ((.cse5 (= 1 ~M_E~0)) (.cse8 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0))) (let ((.cse38 (not .cse0)) (.cse45 (= 1 ~t1_pc~0)) (.cse41 (not .cse8)) (.cse37 (not (= ~M_E~0 0))) (.cse17 (not (= ~E_1~0 0))) (.cse43 (not .cse5)) (.cse15 (not (= ~E_1~0 1))) (.cse44 (not (= ~E_M~0 1))) (.cse42 (not (= ~E_M~0 0)))) (let ((.cse2 (= |old(~t1_pc~0)| 1)) (.cse24 (= ~m_st~0 0)) (.cse27 (<= ~token~0 ~local~0)) (.cse39 (and (and .cse38 .cse45 .cse41 .cse37 .cse17 .cse43 .cse15 .cse44) .cse42)) (.cse36 (<= 2 ~t1_st~0)) (.cse28 (<= ~local~0 ~token~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse26 (= |old(~token~0)| ~token~0)) (.cse23 (not .cse45)) (.cse14 (<= 2 ~m_st~0)) (.cse25 (= 0 ~t1_st~0)) (.cse18 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse13 (and .cse41 .cse23 .cse14 .cse37 .cse42 .cse25 .cse15 .cse38 .cse17 .cse43 .cse18 .cse44)) (.cse29 (and .cse24 .cse27 .cse39 .cse36 .cse28 .cse16 .cse26)) (.cse21 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse22 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (not (= |old(~t1_st~0)| 0))) (.cse20 (and .cse27 .cse14 .cse39 .cse25 .cse28)) (.cse32 (not .cse2)) (.cse9 (and .cse14 .cse39 .cse36)) (.cse31 (let ((.cse40 (+ ~local~0 1))) (and (<= ~token~0 .cse40) .cse24 (<= .cse40 ~token~0) .cse39 .cse36))) (.cse30 (not (= 0 |old(~m_st~0)|))) (.cse19 (= 1 |old(~m_pc~0)|)) (.cse1 (and .cse14 .cse39 .cse16)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (= 0 ~M_E~0)) (.cse35 (and .cse23 .cse14 .cse37 .cse36 .cse15 .cse38 .cse17 .cse18)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse33 (not (<= 2 |old(~t1_st~0)|))) (.cse10 (= 1 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_1~0)|)) (.cse12 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (and .cse14 .cse15 .cse16 .cse17 .cse18) .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19) (or .cse0 .cse20 .cse1 .cse21 .cse22 .cse2 .cse4 (and .cse23 .cse24 .cse25 .cse15 .cse16 .cse26 .cse27 .cse17 .cse18 .cse28) .cse5 .cse6 .cse7 .cse29 .cse8 .cse30 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse19) (or .cse0 .cse1 .cse32 .cse3 .cse4 .cse5 .cse7 .cse33 .cse8 .cse10 .cse9 .cse11 .cse12) (or .cse0 .cse20 .cse1 .cse21 .cse32 .cse22 .cse4 .cse5 .cse7 .cse29 .cse33 .cse8 .cse30 .cse10 .cse9 .cse11 .cse12 .cse31 .cse19) (or .cse0 .cse20 .cse1 .cse21 .cse32 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9 .cse11 .cse12 .cse31) (or .cse7 .cse8 .cse0 .cse10 .cse1 .cse11 .cse32 .cse12 .cse3 .cse4 .cse19 .cse5) (let ((.cse34 (+ |old(~local~0)| 1))) (or .cse0 .cse20 .cse1 .cse32 .cse4 .cse5 .cse7 .cse33 .cse8 .cse30 (not (<= .cse34 |old(~token~0)|)) .cse10 .cse9 .cse11 (not (<= |old(~token~0)| .cse34)) .cse12 .cse31)) (or .cse0 .cse1 .cse2 .cse35 .cse4 .cse5 .cse7 .cse33 .cse30 .cse8 .cse10 .cse11 .cse12 (and .cse23 .cse24 .cse36 .cse15 .cse16 .cse17 .cse18) .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse35 .cse5 .cse7 .cse33 .cse8 .cse10 .cse11 .cse12)))))) [2019-10-02 16:20:05,794 INFO L439 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (let ((.cse11 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0))) (let ((.cse31 (not .cse0)) (.cse33 (= 1 ~t1_pc~0)) (.cse30 (not .cse11)) (.cse4 (not (= ~E_1~0 0))) (.cse2 (not (= ~E_1~0 1))) (.cse32 (not (= ~E_M~0 1)))) (let ((.cse26 (<= ~token~0 ~local~0)) (.cse27 (<= ~local~0 ~token~0)) (.cse29 (and (and .cse31 .cse33 .cse30 .cse4 .cse2 .cse32) (not (= ~E_M~0 0)))) (.cse3 (not (= ~m_pc~0 1))) (.cse25 (not .cse33)) (.cse1 (<= 2 ~m_st~0)) (.cse9 (= 1 ~M_E~0)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse24 (= |old(~t1_pc~0)| 1))) (let ((.cse16 (not .cse24)) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse20 (not (= |old(~t1_st~0)| 0))) (.cse28 (and .cse30 .cse25 .cse1 (not (= ~M_E~0 0)) .cse2 .cse31 .cse4 (not .cse9) .cse5 .cse32)) (.cse6 (and .cse1 .cse29 .cse3)) (.cse17 (and .cse26 .cse1 .cse29 .cse27)) (.cse18 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse19 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse8 (= 0 ~M_E~0)) (.cse10 (= 1 |old(~E_M~0)|)) (.cse21 (not (<= 2 |old(~t1_st~0)|))) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse12 (= 1 |old(~E_1~0)|)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse14 (= 0 |old(~E_M~0)|)) (.cse15 (= 1 |old(~m_pc~0)|))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse10 .cse11 .cse0 .cse12 .cse6 .cse13 .cse16 .cse14 .cse7 .cse8 .cse15 .cse9) (or .cse0 .cse6 .cse17 .cse18 .cse16 .cse19 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse23 (+ |old(~local~0)| 1))) (or .cse0 .cse6 .cse17 .cse16 .cse8 .cse9 .cse10 .cse21 .cse11 .cse22 (not (<= .cse23 |old(~token~0)|)) .cse12 .cse13 (not (<= |old(~token~0)| .cse23)) .cse14)) (or .cse0 .cse6 .cse17 .cse18 .cse19 .cse24 .cse8 (and .cse25 (= ~m_st~0 0) .cse2 .cse3 (= |old(~token~0)| ~token~0) .cse26 .cse4 .cse5 .cse27) .cse9 .cse20 .cse10 .cse11 .cse22 .cse12 .cse28 .cse13 .cse14 .cse15) (or .cse10 .cse21 .cse11 .cse0 .cse12 .cse6 .cse13 .cse14 .cse7 .cse8 .cse9) (or .cse0 .cse6 .cse24 .cse8 .cse9 .cse10 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse6 .cse24 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse28 .cse13 .cse14) (or .cse0 .cse6 .cse17 .cse18 .cse19 .cse8 .cse9 .cse10 .cse21 .cse11 .cse22 .cse12 .cse13 .cse14 .cse15)))))) [2019-10-02 16:20:05,795 INFO L439 ceAbstractionStarter]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse5 (= 1 ~M_E~0)) (.cse8 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0))) (let ((.cse38 (not .cse0)) (.cse45 (= 1 ~t1_pc~0)) (.cse41 (not .cse8)) (.cse37 (not (= ~M_E~0 0))) (.cse17 (not (= ~E_1~0 0))) (.cse43 (not .cse5)) (.cse15 (not (= ~E_1~0 1))) (.cse44 (not (= ~E_M~0 1))) (.cse42 (not (= ~E_M~0 0)))) (let ((.cse2 (= |old(~t1_pc~0)| 1)) (.cse24 (= ~m_st~0 0)) (.cse27 (<= ~token~0 ~local~0)) (.cse39 (and (and .cse38 .cse45 .cse41 .cse37 .cse17 .cse43 .cse15 .cse44) .cse42)) (.cse36 (<= 2 ~t1_st~0)) (.cse28 (<= ~local~0 ~token~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse26 (= |old(~token~0)| ~token~0)) (.cse23 (not .cse45)) (.cse14 (<= 2 ~m_st~0)) (.cse25 (= 0 ~t1_st~0)) (.cse18 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse13 (and .cse41 .cse23 .cse14 .cse37 .cse42 .cse25 .cse15 .cse38 .cse17 .cse43 .cse18 .cse44)) (.cse29 (and .cse24 .cse27 .cse39 .cse36 .cse28 .cse16 .cse26)) (.cse21 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse22 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (not (= |old(~t1_st~0)| 0))) (.cse20 (and .cse27 .cse14 .cse39 .cse25 .cse28)) (.cse32 (not .cse2)) (.cse9 (and .cse14 .cse39 .cse36)) (.cse31 (let ((.cse40 (+ ~local~0 1))) (and (<= ~token~0 .cse40) .cse24 (<= .cse40 ~token~0) .cse39 .cse36))) (.cse30 (not (= 0 |old(~m_st~0)|))) (.cse19 (= 1 |old(~m_pc~0)|)) (.cse1 (and .cse14 .cse39 .cse16)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (= 0 ~M_E~0)) (.cse35 (and .cse23 .cse14 .cse37 .cse36 .cse15 .cse38 .cse17 .cse18)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse33 (not (<= 2 |old(~t1_st~0)|))) (.cse10 (= 1 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_1~0)|)) (.cse12 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (and .cse14 .cse15 .cse16 .cse17 .cse18) .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19) (or .cse0 .cse20 .cse1 .cse21 .cse22 .cse2 .cse4 (and .cse23 .cse24 .cse25 .cse15 .cse16 .cse26 .cse27 .cse17 .cse18 .cse28) .cse5 .cse6 .cse7 .cse29 .cse8 .cse30 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse19) (or .cse0 .cse1 .cse32 .cse3 .cse4 .cse5 .cse7 .cse33 .cse8 .cse10 .cse9 .cse11 .cse12) (or .cse0 .cse20 .cse1 .cse21 .cse32 .cse22 .cse4 .cse5 .cse7 .cse29 .cse33 .cse8 .cse30 .cse10 .cse9 .cse11 .cse12 .cse31 .cse19) (or .cse0 .cse20 .cse1 .cse21 .cse32 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9 .cse11 .cse12 .cse31) (or .cse7 .cse8 .cse0 .cse10 .cse1 .cse11 .cse32 .cse12 .cse3 .cse4 .cse19 .cse5) (let ((.cse34 (+ |old(~local~0)| 1))) (or .cse0 .cse20 .cse1 .cse32 .cse4 .cse5 .cse7 .cse33 .cse8 .cse30 (not (<= .cse34 |old(~token~0)|)) .cse10 .cse9 .cse11 (not (<= |old(~token~0)| .cse34)) .cse12 .cse31)) (or .cse0 .cse1 .cse2 .cse35 .cse4 .cse5 .cse7 .cse33 .cse30 .cse8 .cse10 .cse11 .cse12 (and .cse23 .cse24 .cse36 .cse15 .cse16 .cse17 .cse18) .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse35 .cse5 .cse7 .cse33 .cse8 .cse10 .cse11 .cse12)))))) [2019-10-02 16:20:05,795 INFO L443 ceAbstractionStarter]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2019-10-02 16:20:05,795 INFO L439 ceAbstractionStarter]: At program point L216(line 216) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse28 (= 1 ~t1_pc~0)) (.cse9 (= ~T1_E~0 1)) (.cse19 (not (= ~E_1~0 0))) (.cse6 (= 1 ~M_E~0)) (.cse17 (not (= ~E_1~0 1)))) (let ((.cse27 (and (and (not .cse0) .cse28 (not .cse9) (not (= ~M_E~0 0)) .cse19 (not .cse6) .cse17 (not (= ~E_M~0 1))) (not (= ~E_M~0 0)))) (.cse24 (<= 2 ~t1_st~0)) (.cse18 (not (= ~m_pc~0 1))) (.cse3 (= |old(~t1_pc~0)| 1))) (let ((.cse21 (not .cse3)) (.cse4 (and (<= ~token~0 ~local~0) .cse27 .cse24 (<= ~local~0 ~token~0) .cse18 (= |old(~token~0)| ~token~0))) (.cse10 (not (= 0 |old(~m_st~0)|))) (.cse16 (not .cse28)) (.cse20 (= ~E_M~0 |old(~E_M~0)|)) (.cse22 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse2 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse7 (not (= |old(~t1_st~0)| 0))) (.cse11 (let ((.cse26 (+ ~local~0 1))) (and (<= ~token~0 .cse26) (<= .cse26 ~token~0) .cse27 .cse24))) (.cse8 (= 1 |old(~E_M~0)|)) (.cse12 (= 1 |old(~E_1~0)|)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse14 (= 0 |old(~E_M~0)|)) (.cse25 (not (<= 2 |old(~m_st~0)|))) (.cse5 (= 0 ~M_E~0)) (.cse15 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and .cse16 (= 0 ~t1_st~0) .cse17 .cse18 .cse19 .cse20)) (let ((.cse23 (+ |old(~local~0)| 1))) (or .cse0 .cse21 .cse5 .cse6 .cse8 .cse22 .cse9 .cse10 .cse11 (not (<= .cse23 |old(~token~0)|)) .cse12 .cse13 (not (<= |old(~token~0)| .cse23)) .cse14)) (or .cse0 .cse1 .cse21 .cse2 .cse4 .cse5 .cse6 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse3 .cse5 .cse6 .cse8 .cse22 .cse10 .cse9 (and .cse16 .cse24 .cse17 .cse18 .cse19 .cse20) .cse12 .cse13 .cse14 .cse15) (or .cse8 .cse9 .cse0 .cse12 .cse13 .cse14 .cse3 .cse25 .cse5 .cse6 .cse7) (or .cse8 .cse22 .cse9 .cse0 .cse12 .cse13 .cse14 .cse25 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (or .cse8 .cse9 .cse0 .cse12 .cse13 .cse14 .cse25 .cse5 .cse15 .cse6))))) [2019-10-02 16:20:05,796 INFO L443 ceAbstractionStarter]: For program point L210(lines 200 238) no Hoare annotation was computed. [2019-10-02 16:20:05,796 INFO L439 ceAbstractionStarter]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse5 (= 1 ~M_E~0)) (.cse8 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0))) (let ((.cse38 (not .cse0)) (.cse45 (= 1 ~t1_pc~0)) (.cse41 (not .cse8)) (.cse37 (not (= ~M_E~0 0))) (.cse17 (not (= ~E_1~0 0))) (.cse43 (not .cse5)) (.cse15 (not (= ~E_1~0 1))) (.cse44 (not (= ~E_M~0 1))) (.cse42 (not (= ~E_M~0 0)))) (let ((.cse2 (= |old(~t1_pc~0)| 1)) (.cse24 (= ~m_st~0 0)) (.cse27 (<= ~token~0 ~local~0)) (.cse39 (and (and .cse38 .cse45 .cse41 .cse37 .cse17 .cse43 .cse15 .cse44) .cse42)) (.cse36 (<= 2 ~t1_st~0)) (.cse28 (<= ~local~0 ~token~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse26 (= |old(~token~0)| ~token~0)) (.cse23 (not .cse45)) (.cse14 (<= 2 ~m_st~0)) (.cse25 (= 0 ~t1_st~0)) (.cse18 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse13 (and .cse41 .cse23 .cse14 .cse37 .cse42 .cse25 .cse15 .cse38 .cse17 .cse43 .cse18 .cse44)) (.cse29 (and .cse24 .cse27 .cse39 .cse36 .cse28 .cse16 .cse26)) (.cse21 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse22 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (not (= |old(~t1_st~0)| 0))) (.cse20 (and .cse27 .cse14 .cse39 .cse25 .cse28)) (.cse32 (not .cse2)) (.cse9 (and .cse14 .cse39 .cse36)) (.cse31 (let ((.cse40 (+ ~local~0 1))) (and (<= ~token~0 .cse40) .cse24 (<= .cse40 ~token~0) .cse39 .cse36))) (.cse30 (not (= 0 |old(~m_st~0)|))) (.cse19 (= 1 |old(~m_pc~0)|)) (.cse1 (and .cse14 .cse39 .cse16)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (= 0 ~M_E~0)) (.cse35 (and .cse23 .cse14 .cse37 .cse36 .cse15 .cse38 .cse17 .cse18)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse33 (not (<= 2 |old(~t1_st~0)|))) (.cse10 (= 1 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_1~0)|)) (.cse12 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (and .cse14 .cse15 .cse16 .cse17 .cse18) .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse19) (or .cse0 .cse20 .cse1 .cse21 .cse22 .cse2 .cse4 (and .cse23 .cse24 .cse25 .cse15 .cse16 .cse26 .cse27 .cse17 .cse18 .cse28) .cse5 .cse6 .cse7 .cse29 .cse8 .cse30 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse19) (or .cse0 .cse1 .cse32 .cse3 .cse4 .cse5 .cse7 .cse33 .cse8 .cse10 .cse9 .cse11 .cse12) (or .cse0 .cse20 .cse1 .cse21 .cse32 .cse22 .cse4 .cse5 .cse7 .cse29 .cse33 .cse8 .cse30 .cse10 .cse9 .cse11 .cse12 .cse31 .cse19) (or .cse0 .cse20 .cse1 .cse21 .cse32 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9 .cse11 .cse12 .cse31) (or .cse7 .cse8 .cse0 .cse10 .cse1 .cse11 .cse32 .cse12 .cse3 .cse4 .cse19 .cse5) (let ((.cse34 (+ |old(~local~0)| 1))) (or .cse0 .cse20 .cse1 .cse32 .cse4 .cse5 .cse7 .cse33 .cse8 .cse30 (not (<= .cse34 |old(~token~0)|)) .cse10 .cse9 .cse11 (not (<= |old(~token~0)| .cse34)) .cse12 .cse31)) (or .cse0 .cse1 .cse2 .cse35 .cse4 .cse5 .cse7 .cse33 .cse30 .cse8 .cse10 .cse11 .cse12 (and .cse23 .cse24 .cse36 .cse15 .cse16 .cse17 .cse18) .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse35 .cse5 .cse7 .cse33 .cse8 .cse10 .cse11 .cse12)))))) [2019-10-02 16:20:05,796 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 234) no Hoare annotation was computed. [2019-10-02 16:20:05,796 INFO L446 ceAbstractionStarter]: At program point L399(lines 388 401) the Hoare annotation is: true [2019-10-02 16:20:05,796 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 397) no Hoare annotation was computed. [2019-10-02 16:20:05,797 INFO L446 ceAbstractionStarter]: At program point L390(line 390) the Hoare annotation is: true [2019-10-02 16:20:05,797 INFO L443 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2019-10-02 16:20:05,797 INFO L443 ceAbstractionStarter]: For program point L390-1(line 390) no Hoare annotation was computed. [2019-10-02 16:20:05,797 INFO L446 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2019-10-02 16:20:05,797 INFO L443 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2019-10-02 16:20:05,797 INFO L443 ceAbstractionStarter]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2019-10-02 16:20:05,797 INFO L446 ceAbstractionStarter]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2019-10-02 16:20:05,797 INFO L439 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse14 (not (<= ~token~0 ~local~0))) (.cse15 (not (<= ~local~0 ~token~0))) (.cse6 (not (= 0 ~m_st~0))) (.cse12 (= 1 ~m_pc~0)) (.cse5 (not (<= 2 ~t1_st~0))) (.cse4 (= 1 |old(~E_M~0)|)) (.cse7 (= |old(~T1_E~0)| 1)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse9 (= 0 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_M~0)|)) (.cse1 (= ~t1_pc~0 1)) (.cse17 (not (<= 2 ~m_st~0))) (.cse10 (and (= ~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)|))) (.cse2 (= 0 |old(~M_E~0)|)) (.cse3 (= 1 |old(~M_E~0)|)) (.cse16 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0 1))) (or .cse10 .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 (not (<= .cse13 ~token~0)) .cse8 .cse9 (not (<= ~token~0 .cse13)) .cse11)) (or .cse0 .cse14 .cse15 .cse1 .cse2 .cse3 .cse16 .cse4 .cse7 .cse6 .cse8 .cse9 .cse11 .cse10 .cse12) (or .cse4 .cse7 .cse0 .cse8 .cse9 .cse11 .cse17 .cse10 .cse2 .cse12 .cse3) (or .cse0 .cse14 .cse15 .cse17 .cse2 .cse3 .cse16 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse11 .cse10 .cse12) (or .cse4 .cse5 .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse17 .cse2 .cse3) (or .cse4 .cse7 .cse0 .cse8 .cse9 .cse11 .cse1 .cse17 .cse10 .cse2 .cse3 .cse16))) [2019-10-02 16:20:05,798 INFO L443 ceAbstractionStarter]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2019-10-02 16:20:05,798 INFO L443 ceAbstractionStarter]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2019-10-02 16:20:05,798 INFO L443 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2019-10-02 16:20:05,798 INFO L443 ceAbstractionStarter]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2019-10-02 16:20:05,798 INFO L443 ceAbstractionStarter]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2019-10-02 16:20:05,798 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-10-02 16:20:05,798 INFO L439 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (= ~m_st~0 0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= |old(~T1_E~0)| ~T1_E~0)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~E_M~0 |old(~E_M~0)|))) (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (and .cse0 .cse1 (<= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5 .cse6) (= 0 |old(~E_M~0)|) (and .cse0 .cse1 (= 0 ~t1_st~0) .cse2 (= |old(~token~0)| ~token~0) .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:20:05,799 INFO L439 ceAbstractionStarter]: At program point L411(line 411) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and (not (= 1 ~t1_pc~0)) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:20:05,799 INFO L443 ceAbstractionStarter]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2019-10-02 16:20:05,799 INFO L439 ceAbstractionStarter]: At program point L411-1(line 411) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and (not (= 1 ~t1_pc~0)) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:20:05,799 INFO L439 ceAbstractionStarter]: At program point L440(line 440) the Hoare annotation is: (let ((.cse17 (not (= ~E_1~0 1))) (.cse12 (not (= ~T1_E~0 1))) (.cse13 (= |old(~T1_E~0)| ~T1_E~0)) (.cse14 (= 1 ~t1_pc~0)) (.cse15 (not (= 1 ~M_E~0))) (.cse16 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse18 (not (= ~E_M~0 1)))) (let ((.cse6 (= ~m_st~0 0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse11 (= 0 ~t1_st~0)) (.cse5 (and (not (= ~E_M~0 0)) (and .cse17 (and .cse12 .cse13 (and .cse14 .cse15 .cse16) .cse18)))) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse12 .cse13 (and (not .cse14) .cse15 .cse16) .cse17 .cse18)) (.cse7 (<= 2 ~t1_st~0)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 .cse2 .cse3) (= |old(~T1_E~0)| 0) (let ((.cse4 (+ ~local~0 1))) (and (<= ~token~0 .cse4) .cse5 .cse6 (<= .cse4 ~token~0) .cse7)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse5 .cse6 .cse8 .cse7 .cse9 .cse3 .cse10) (and .cse6 .cse1 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse3) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse5 .cse8 .cse0 .cse11 .cse9) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse6 .cse8 .cse1 .cse11 .cse2 .cse9 .cse3 .cse10) (and .cse0 .cse1 .cse11 .cse2) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and .cse5 .cse0 .cse7) (and .cse0 .cse1 .cse7 .cse2) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:20:05,800 INFO L439 ceAbstractionStarter]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse1 (not (= ~M_E~0 0))) (.cse3 (not (= ~E_1~0 0))) (.cse4 (not (= ~E_1~0 1))) (.cse16 (= 1 ~t1_pc~0))) (let ((.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse6 (not (= ~m_pc~0 1))) (.cse12 (= |old(~token~0)| ~token~0)) (.cse9 (not .cse16)) (.cse2 (<= 2 ~m_st~0)) (.cse11 (= 0 ~t1_st~0)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse10 (= ~m_st~0 0)) (.cse8 (<= 2 ~t1_st~0)) (.cse7 (and (and (and .cse16 (not (= ~T1_E~0 0)) (not (= ~T1_E~0 1)) .cse0 .cse1 .cse3 (not (= ~E_M~0 1))) .cse4) (not (= ~E_M~0 0))))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse6) (not (<= |old(~token~0)| |old(~local~0)|)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse2 .cse8 .cse7) (and .cse9 .cse10 .cse1 .cse8 .cse4 .cse6 .cse0 .cse3 .cse5) (= 1 |old(~E_1~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse9 .cse10 .cse1 .cse11 .cse4 .cse6 .cse12 .cse0 .cse13 .cse3 .cse5 .cse14) (and .cse13 .cse2 .cse11 .cse7 .cse14) (and .cse10 .cse13 .cse8 .cse7 .cse14 .cse6 .cse12) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (let ((.cse15 (+ ~local~0 1))) (and (<= ~token~0 .cse15) .cse10 (<= .cse15 ~token~0) .cse8 .cse7)) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:20:05,800 INFO L439 ceAbstractionStarter]: At program point L432(line 432) the Hoare annotation is: (let ((.cse17 (not (= ~E_1~0 1))) (.cse12 (not (= ~T1_E~0 1))) (.cse13 (= |old(~T1_E~0)| ~T1_E~0)) (.cse14 (= 1 ~t1_pc~0)) (.cse15 (not (= 1 ~M_E~0))) (.cse16 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse18 (not (= ~E_M~0 1)))) (let ((.cse6 (= ~m_st~0 0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse11 (= 0 ~t1_st~0)) (.cse5 (and (not (= ~E_M~0 0)) (and .cse17 (and .cse12 .cse13 (and .cse14 .cse15 .cse16) .cse18)))) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse12 .cse13 (and (not .cse14) .cse15 .cse16) .cse17 .cse18)) (.cse7 (<= 2 ~t1_st~0)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 .cse2 .cse3) (= |old(~T1_E~0)| 0) (let ((.cse4 (+ ~local~0 1))) (and (<= ~token~0 .cse4) .cse5 .cse6 (<= .cse4 ~token~0) .cse7)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse5 .cse6 .cse8 .cse7 .cse9 .cse3 .cse10) (and .cse6 .cse1 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse3) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse5 .cse8 .cse0 .cse11 .cse9) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse6 .cse8 .cse1 .cse11 .cse2 .cse9 .cse3 .cse10) (and .cse0 .cse1 .cse11 .cse2) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and .cse5 .cse0 .cse7) (and .cse0 .cse1 .cse7 .cse2) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:20:05,800 INFO L439 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (let ((.cse17 (not (= ~E_1~0 1))) (.cse12 (not (= ~T1_E~0 1))) (.cse13 (= |old(~T1_E~0)| ~T1_E~0)) (.cse14 (= 1 ~t1_pc~0)) (.cse15 (not (= 1 ~M_E~0))) (.cse16 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse18 (not (= ~E_M~0 1)))) (let ((.cse6 (= ~m_st~0 0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse11 (= 0 ~t1_st~0)) (.cse5 (and (not (= ~E_M~0 0)) (and .cse17 (and .cse12 .cse13 (and .cse14 .cse15 .cse16) .cse18)))) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse12 .cse13 (and (not .cse14) .cse15 .cse16) .cse17 .cse18)) (.cse7 (<= 2 ~t1_st~0)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 .cse2 .cse3) (= |old(~T1_E~0)| 0) (let ((.cse4 (+ ~local~0 1))) (and (<= ~token~0 .cse4) .cse5 .cse6 (<= .cse4 ~token~0) .cse7)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse5 .cse6 .cse8 .cse7 .cse9 .cse3 .cse10) (and .cse6 .cse1 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse3) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse5 .cse8 .cse0 .cse11 .cse9) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse6 .cse8 .cse1 .cse11 .cse2 .cse9 .cse3 .cse10) (and .cse0 .cse1 .cse11 .cse2) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and .cse5 .cse0 .cse7) (and .cse0 .cse1 .cse7 .cse2) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:20:05,801 INFO L439 ceAbstractionStarter]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse17 (not (= ~E_1~0 1))) (.cse12 (not (= ~T1_E~0 1))) (.cse13 (= |old(~T1_E~0)| ~T1_E~0)) (.cse14 (= 1 ~t1_pc~0)) (.cse15 (not (= 1 ~M_E~0))) (.cse16 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse18 (not (= ~E_M~0 1)))) (let ((.cse6 (= ~m_st~0 0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse11 (= 0 ~t1_st~0)) (.cse5 (and (not (= ~E_M~0 0)) (and .cse17 (and .cse12 .cse13 (and .cse14 .cse15 .cse16) .cse18)))) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse12 .cse13 (and (not .cse14) .cse15 .cse16) .cse17 .cse18)) (.cse7 (<= 2 ~t1_st~0)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 .cse2 .cse3) (= |old(~T1_E~0)| 0) (let ((.cse4 (+ ~local~0 1))) (and (<= ~token~0 .cse4) .cse5 .cse6 (<= .cse4 ~token~0) .cse7)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse5 .cse6 .cse8 .cse7 .cse9 .cse3 .cse10) (and .cse6 .cse1 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse3) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse5 .cse8 .cse0 .cse11 .cse9) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse6 .cse8 .cse1 .cse11 .cse2 .cse9 .cse3 .cse10) (and .cse0 .cse1 .cse11 .cse2) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and .cse5 .cse0 .cse7) (and .cse0 .cse1 .cse7 .cse2) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:20:05,801 INFO L439 ceAbstractionStarter]: At program point L426(line 426) the Hoare annotation is: (let ((.cse17 (not (= ~E_1~0 1))) (.cse12 (not (= ~T1_E~0 1))) (.cse13 (= |old(~T1_E~0)| ~T1_E~0)) (.cse14 (= 1 ~t1_pc~0)) (.cse15 (not (= 1 ~M_E~0))) (.cse16 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse18 (not (= ~E_M~0 1)))) (let ((.cse6 (= ~m_st~0 0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse11 (= 0 ~t1_st~0)) (.cse5 (and (not (= ~E_M~0 0)) (and .cse17 (and .cse12 .cse13 (and .cse14 .cse15 .cse16) .cse18)))) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse12 .cse13 (and (not .cse14) .cse15 .cse16) .cse17 .cse18)) (.cse7 (<= 2 ~t1_st~0)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 .cse2 .cse3) (= |old(~T1_E~0)| 0) (let ((.cse4 (+ ~local~0 1))) (and (<= ~token~0 .cse4) .cse5 .cse6 (<= .cse4 ~token~0) .cse7)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse5 .cse6 .cse8 .cse7 .cse9 .cse3 .cse10) (and .cse6 .cse1 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse3) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse5 .cse8 .cse0 .cse11 .cse9) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse6 .cse8 .cse1 .cse11 .cse2 .cse9 .cse3 .cse10) (and .cse0 .cse1 .cse11 .cse2) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and .cse5 .cse0 .cse7) (and .cse0 .cse1 .cse7 .cse2) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:20:05,801 INFO L443 ceAbstractionStarter]: For program point L426-1(line 426) no Hoare annotation was computed. [2019-10-02 16:20:05,802 INFO L439 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse17 (not (= ~E_1~0 1))) (.cse12 (not (= ~T1_E~0 1))) (.cse13 (= |old(~T1_E~0)| ~T1_E~0)) (.cse14 (= 1 ~t1_pc~0)) (.cse15 (not (= 1 ~M_E~0))) (.cse16 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse18 (not (= ~E_M~0 1)))) (let ((.cse6 (= ~m_st~0 0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse11 (= 0 ~t1_st~0)) (.cse5 (and (not (= ~E_M~0 0)) (and .cse17 (and .cse12 .cse13 (and .cse14 .cse15 .cse16) .cse18)))) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse12 .cse13 (and (not .cse14) .cse15 .cse16) .cse17 .cse18)) (.cse7 (<= 2 ~t1_st~0)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 .cse2 .cse3) (= |old(~T1_E~0)| 0) (let ((.cse4 (+ ~local~0 1))) (and (<= ~token~0 .cse4) .cse5 .cse6 (<= .cse4 ~token~0) .cse7)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse5 .cse6 .cse8 .cse7 .cse9 .cse3 .cse10) (and .cse6 .cse1 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse3) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse5 .cse8 .cse0 .cse11 .cse9) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse6 .cse8 .cse1 .cse11 .cse2 .cse9 .cse3 .cse10) (and .cse0 .cse1 .cse11 .cse2) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and .cse5 .cse0 .cse7) (and .cse0 .cse1 .cse7 .cse2) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:20:05,802 INFO L443 ceAbstractionStarter]: For program point L422-1(line 422) no Hoare annotation was computed. [2019-10-02 16:20:05,802 INFO L439 ceAbstractionStarter]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse17 (not (= ~E_1~0 1))) (.cse12 (not (= ~T1_E~0 1))) (.cse13 (= |old(~T1_E~0)| ~T1_E~0)) (.cse14 (= 1 ~t1_pc~0)) (.cse15 (not (= 1 ~M_E~0))) (.cse16 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse18 (not (= ~E_M~0 1)))) (let ((.cse6 (= ~m_st~0 0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse11 (= 0 ~t1_st~0)) (.cse5 (and (not (= ~E_M~0 0)) (and .cse17 (and .cse12 .cse13 (and .cse14 .cse15 .cse16) .cse18)))) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse12 .cse13 (and (not .cse14) .cse15 .cse16) .cse17 .cse18)) (.cse7 (<= 2 ~t1_st~0)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 .cse2 .cse3) (= |old(~T1_E~0)| 0) (let ((.cse4 (+ ~local~0 1))) (and (<= ~token~0 .cse4) .cse5 .cse6 (<= .cse4 ~token~0) .cse7)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse5 .cse6 .cse8 .cse7 .cse9 .cse3 .cse10) (and .cse6 .cse1 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse3) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse5 .cse8 .cse0 .cse11 .cse9) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse6 .cse8 .cse1 .cse11 .cse2 .cse9 .cse3 .cse10) (and .cse0 .cse1 .cse11 .cse2) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and .cse5 .cse0 .cse7) (and .cse0 .cse1 .cse7 .cse2) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:20:05,802 INFO L439 ceAbstractionStarter]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and (not (= 1 ~t1_pc~0)) (= ~m_st~0 0) (= 0 ~t1_st~0) (not (= ~m_pc~0 1)) (= |old(~token~0)| ~token~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (<= ~token~0 ~local~0) (= ~E_M~0 |old(~E_M~0)|) (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:20:05,803 INFO L439 ceAbstractionStarter]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse6 (= ~m_st~0 0)) (.cse1 (not (= ~m_pc~0 1))) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~E_M~0 |old(~E_M~0)|))) (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and .cse0 (<= 2 ~m_st~0) .cse1 .cse2 .cse3 .cse4 .cse5) (= 0 |old(~E_1~0)|) (and .cse0 .cse6 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5) (= 0 |old(~E_M~0)|) (and .cse0 .cse6 (= 0 ~t1_st~0) .cse1 (= |old(~token~0)| ~token~0) .cse2 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:20:05,803 INFO L439 ceAbstractionStarter]: At program point L412(line 412) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (= ~m_st~0 0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= |old(~T1_E~0)| ~T1_E~0)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~E_M~0 |old(~E_M~0)|))) (or (= |old(~T1_E~0)| 0) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (and .cse0 .cse1 (<= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5 .cse6) (= 0 |old(~E_M~0)|) (and .cse0 .cse1 (= 0 ~t1_st~0) .cse2 (= |old(~token~0)| ~token~0) .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0)) (= 1 |old(~m_pc~0)|))) [2019-10-02 16:20:05,803 INFO L439 ceAbstractionStarter]: At program point L441(line 441) the Hoare annotation is: (let ((.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse1 (not (= ~M_E~0 0))) (.cse3 (not (= ~E_1~0 0))) (.cse4 (not (= ~E_1~0 1))) (.cse16 (= 1 ~t1_pc~0))) (let ((.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse6 (not (= ~m_pc~0 1))) (.cse12 (= |old(~token~0)| ~token~0)) (.cse9 (not .cse16)) (.cse2 (<= 2 ~m_st~0)) (.cse11 (= 0 ~t1_st~0)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse10 (= ~m_st~0 0)) (.cse8 (<= 2 ~t1_st~0)) (.cse7 (and (and (and .cse16 (not (= ~T1_E~0 0)) (not (= ~T1_E~0 1)) .cse0 .cse1 .cse3 (not (= ~E_M~0 1))) .cse4) (not (= ~E_M~0 0))))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse6) (not (<= |old(~token~0)| |old(~local~0)|)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse2 .cse8 .cse7) (and .cse9 .cse10 .cse1 .cse8 .cse4 .cse6 .cse0 .cse3 .cse5) (= 1 |old(~E_1~0)|) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (and .cse9 .cse10 .cse1 .cse11 .cse4 .cse6 .cse12 .cse0 .cse13 .cse3 .cse5 .cse14) (and .cse13 .cse2 .cse11 .cse7 .cse14) (and .cse10 .cse13 .cse8 .cse7 .cse14 .cse6 .cse12) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (let ((.cse15 (+ ~local~0 1))) (and (<= ~token~0 .cse15) .cse10 (<= .cse15 ~token~0) .cse8 .cse7)) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:20:05,803 INFO L443 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2019-10-02 16:20:05,804 INFO L439 ceAbstractionStarter]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse17 (not (= ~E_1~0 1))) (.cse12 (not (= ~T1_E~0 1))) (.cse13 (= |old(~T1_E~0)| ~T1_E~0)) (.cse14 (= 1 ~t1_pc~0)) (.cse15 (not (= 1 ~M_E~0))) (.cse16 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse18 (not (= ~E_M~0 1)))) (let ((.cse6 (= ~m_st~0 0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse11 (= 0 ~t1_st~0)) (.cse5 (and (not (= ~E_M~0 0)) (and .cse17 (and .cse12 .cse13 (and .cse14 .cse15 .cse16) .cse18)))) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse12 .cse13 (and (not .cse14) .cse15 .cse16) .cse17 .cse18)) (.cse7 (<= 2 ~t1_st~0)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 .cse2 .cse3) (= |old(~T1_E~0)| 0) (let ((.cse4 (+ ~local~0 1))) (and (<= ~token~0 .cse4) .cse5 .cse6 (<= .cse4 ~token~0) .cse7)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse5 .cse6 .cse8 .cse7 .cse9 .cse3 .cse10) (and .cse6 .cse1 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse3) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse5 .cse8 .cse0 .cse11 .cse9) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse6 .cse8 .cse1 .cse11 .cse2 .cse9 .cse3 .cse10) (and .cse0 .cse1 .cse11 .cse2) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and .cse5 .cse0 .cse7) (and .cse0 .cse1 .cse7 .cse2) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:20:05,804 INFO L443 ceAbstractionStarter]: For program point L435(line 435) no Hoare annotation was computed. [2019-10-02 16:20:05,804 INFO L439 ceAbstractionStarter]: At program point L431(line 431) the Hoare annotation is: (let ((.cse17 (not (= ~E_1~0 1))) (.cse12 (not (= ~T1_E~0 1))) (.cse13 (= |old(~T1_E~0)| ~T1_E~0)) (.cse14 (= 1 ~t1_pc~0)) (.cse15 (not (= 1 ~M_E~0))) (.cse16 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)))) (.cse18 (not (= ~E_M~0 1)))) (let ((.cse6 (= ~m_st~0 0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse11 (= 0 ~t1_st~0)) (.cse5 (and (not (= ~E_M~0 0)) (and .cse17 (and .cse12 .cse13 (and .cse14 .cse15 .cse16) .cse18)))) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse12 .cse13 (and (not .cse14) .cse15 .cse16) .cse17 .cse18)) (.cse7 (<= 2 ~t1_st~0)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 .cse2 .cse3) (= |old(~T1_E~0)| 0) (let ((.cse4 (+ ~local~0 1))) (and (<= ~token~0 .cse4) .cse5 .cse6 (<= .cse4 ~token~0) .cse7)) (not (<= |old(~token~0)| |old(~local~0)|)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_1~0)|) (and .cse5 .cse6 .cse8 .cse7 .cse9 .cse3 .cse10) (and .cse6 .cse1 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse3) (not (<= |old(~local~0)| |old(~token~0)|)) (and .cse5 .cse8 .cse0 .cse11 .cse9) (= |old(~t1_pc~0)| 1) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse6 .cse8 .cse1 .cse11 .cse2 .cse9 .cse3 .cse10) (and .cse0 .cse1 .cse11 .cse2) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and .cse5 .cse0 .cse7) (and .cse0 .cse1 .cse7 .cse2) (= 1 |old(~m_pc~0)|)))) [2019-10-02 16:20:05,804 INFO L439 ceAbstractionStarter]: At program point L456(lines 403 461) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (not (= ~M_E~0 0)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= |old(~local~0)| |old(~token~0)|)) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2019-10-02 16:20:05,804 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-02 16:20:05,804 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 454) no Hoare annotation was computed. [2019-10-02 16:20:05,805 INFO L439 ceAbstractionStarter]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0 1)) (.cse20 (+ ~local~0 1))) (let ((.cse12 (not (<= .cse20 ~token~0))) (.cse13 (not (<= ~token~0 .cse20))) (.cse17 (not (= 0 ~m_st~0))) (.cse5 (= 1 ~E_1~0)) (.cse8 (not (<= 2 ~m_st~0))) (.cse16 (not (= ~t1_st~0 0))) (.cse15 (= 1 ~m_pc~0)) (.cse0 (= 1 ~E_M~0)) (.cse2 (not (<= 2 ~t1_st~0))) (.cse3 (= ~T1_E~0 1)) (.cse4 (= ~T1_E~0 0)) (.cse18 (not (<= ~token~0 ~local~0))) (.cse6 (= 0 ~E_1~0)) (.cse10 (not .cse14)) (.cse19 (not (<= ~local~0 ~token~0))) (.cse7 (= 0 ~E_M~0)) (.cse1 (= 0 is_master_triggered_~__retres1~0)) (.cse9 (= 0 ~M_E~0)) (.cse11 (= 1 ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse4 .cse0 .cse10 .cse8 .cse1 .cse9 .cse11 .cse3 .cse5 .cse12 .cse6 .cse7 .cse13) (or .cse0 .cse3 .cse4 .cse1 .cse6 .cse7 .cse14 .cse9 .cse15 .cse11 .cse16) (or .cse3 .cse4 .cse1 .cse5 .cse6 .cse10 .cse7 .cse8 .cse9 .cse15 .cse11) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse1 .cse15) (or .cse4 .cse10 .cse1 .cse9 .cse0 .cse2 .cse17 .cse3 .cse5 .cse12 .cse6 .cse7 .cse13) (or .cse0 .cse2 .cse17 .cse3 .cse4 .cse5 .cse1 .cse6 .cse7 .cse14 .cse9 .cse15) (or .cse4 .cse18 .cse19 .cse8 .cse9 .cse16 .cse1 .cse0 .cse3 .cse5 .cse6 .cse7) (or .cse4 .cse1 .cse18 .cse19 .cse9 .cse0 .cse2 .cse3 .cse17 .cse5 .cse6 .cse7 .cse15) (or .cse4 .cse1 .cse18 .cse19 .cse14 .cse9 .cse16 .cse0 .cse3 .cse17 .cse5 .cse6 .cse7 .cse15) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse1 .cse7 .cse14 .cse8 .cse9 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse1 .cse6 .cse7 .cse14 .cse9 .cse15 .cse11) (or .cse0 .cse2 .cse3 .cse4 .cse18 .cse6 .cse10 .cse19 .cse7 .cse1 .cse9 .cse11)))) [2019-10-02 16:20:05,805 INFO L443 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2019-10-02 16:20:05,805 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2019-10-02 16:20:05,805 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 123) no Hoare annotation was computed. [2019-10-02 16:20:05,805 INFO L443 ceAbstractionStarter]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2019-10-02 16:20:05,805 INFO L443 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2019-10-02 16:20:05,806 INFO L446 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2019-10-02 16:20:05,806 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:20:05,806 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~T1_E~0 1)) (not (= 1 ~t1_pc~0)) (= ~m_st~0 0) (not (= ~M_E~0 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)) (<= ~token~0 ~local~0) (not (= ~E_1~0 0)) (not (= 1 ~M_E~0)) (<= ~local~0 ~token~0) (not (= ~E_M~0 1))) [2019-10-02 16:20:05,806 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 16:20:05,806 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 16:20:05,806 INFO L443 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2019-10-02 16:20:05,806 INFO L443 ceAbstractionStarter]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2019-10-02 16:20:05,807 INFO L439 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse5 (not (= ~t1_st~0 0))) (.cse1 (not (<= ~token~0 ~local~0))) (.cse2 (not (<= ~local~0 ~token~0))) (.cse3 (= ~t1_pc~0 1)) (.cse9 (not (= 0 ~m_st~0))) (.cse13 (= 1 ~m_pc~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse15 (not (<= 2 ~t1_st~0))) (.cse8 (= |old(~T1_E~0)| 1)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse10 (= 1 |old(~E_1~0)|)) (.cse6 (and (= ~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)|))) (.cse11 (= 0 |old(~E_1~0)|)) (.cse12 (= 0 |old(~E_M~0)|)) (.cse14 (not (<= 2 ~m_st~0))) (.cse4 (= 0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse7 .cse8 .cse0 .cse6 .cse10 .cse11 .cse12 .cse3 .cse14 .cse4 .cse5) (or .cse7 .cse15 .cse9 .cse8 .cse0 .cse10 .cse11 .cse6 .cse12 .cse3 .cse4 .cse13) (or .cse0 .cse6 .cse1 .cse2 .cse14 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse6 .cse4 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse16 (+ ~local~0 1))) (or .cse0 (not .cse3) .cse4 .cse7 .cse15 .cse9 .cse8 .cse10 (not (<= .cse16 ~token~0)) .cse6 .cse11 .cse12 (not (<= ~token~0 .cse16)))) (or .cse7 .cse8 .cse0 .cse6 .cse10 .cse11 .cse12 .cse14 .cse4 .cse13) (or .cse7 .cse15 .cse8 .cse0 .cse10 .cse6 .cse11 .cse12 .cse14 .cse4))) [2019-10-02 16:20:05,807 INFO L443 ceAbstractionStarter]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2019-10-02 16:20:05,807 INFO L443 ceAbstractionStarter]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2019-10-02 16:20:05,807 INFO L443 ceAbstractionStarter]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2019-10-02 16:20:05,807 INFO L443 ceAbstractionStarter]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2019-10-02 16:20:05,807 INFO L443 ceAbstractionStarter]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2019-10-02 16:20:05,807 INFO L446 ceAbstractionStarter]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: true [2019-10-02 16:20:05,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 04:20:05 BoogieIcfgContainer [2019-10-02 16:20:05,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 16:20:05,886 INFO L168 Benchmark]: Toolchain (without parser) took 46760.80 ms. Allocated memory was 133.2 MB in the beginning and 661.1 MB in the end (delta: 528.0 MB). Free memory was 89.6 MB in the beginning and 350.6 MB in the end (delta: -261.0 MB). Peak memory consumption was 537.7 MB. Max. memory is 7.1 GB. [2019-10-02 16:20:05,887 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 107.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 16:20:05,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.21 ms. Allocated memory was 133.2 MB in the beginning and 197.7 MB in the end (delta: 64.5 MB). Free memory was 89.1 MB in the beginning and 172.8 MB in the end (delta: -83.7 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2019-10-02 16:20:05,888 INFO L168 Benchmark]: Boogie Preprocessor took 48.56 ms. Allocated memory is still 197.7 MB. Free memory was 172.8 MB in the beginning and 171.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-10-02 16:20:05,889 INFO L168 Benchmark]: RCFGBuilder took 676.10 ms. Allocated memory is still 197.7 MB. Free memory was 171.0 MB in the beginning and 139.9 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. [2019-10-02 16:20:05,890 INFO L168 Benchmark]: TraceAbstraction took 45593.72 ms. Allocated memory was 197.7 MB in the beginning and 661.1 MB in the end (delta: 463.5 MB). Free memory was 139.9 MB in the beginning and 350.6 MB in the end (delta: -210.6 MB). Peak memory consumption was 523.6 MB. Max. memory is 7.1 GB. [2019-10-02 16:20:05,893 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.23 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 107.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 433.21 ms. Allocated memory was 133.2 MB in the beginning and 197.7 MB in the end (delta: 64.5 MB). Free memory was 89.1 MB in the beginning and 172.8 MB in the end (delta: -83.7 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.56 ms. Allocated memory is still 197.7 MB. Free memory was 172.8 MB in the beginning and 171.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 676.10 ms. Allocated memory is still 197.7 MB. Free memory was 171.0 MB in the beginning and 139.9 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45593.72 ms. Allocated memory was 197.7 MB in the beginning and 661.1 MB in the end (delta: 463.5 MB). Free memory was 139.9 MB in the beginning and 350.6 MB in the end (delta: -210.6 MB). Peak memory consumption was 523.6 MB. 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: 177]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == 0 || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || (((((((((((!(T1_E == 1) && !(1 == t1_pc)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_M == 1))) && (((((((((((T1_E == 0 || ((((2 <= m_st && !(E_1 == 1)) && !(m_pc == 1)) && !(E_1 == 0)) && E_M == \old(E_M))) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || ((((token <= local && 2 <= m_st) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 0 == t1_st) && local <= token)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || \old(t1_pc) == 1) || 0 == M_E) || (((((((((!(1 == t1_pc) && m_st == 0) && 0 == t1_st) && !(E_1 == 1)) && !(m_pc == 1)) && \old(token) == token) && token <= local) && !(E_1 == 0)) && E_M == \old(E_M)) && local <= token)) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || ((((((m_st == 0 && token <= local) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st) && local <= token) && !(m_pc == 1)) && \old(token) == token)) || T1_E == 1) || !(0 == \old(m_st))) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || (((((((((((!(T1_E == 1) && !(1 == t1_pc)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_M == 1))) || ((((token <= local + 1 && m_st == 0) && local + 1 <= token) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st)) || 1 == \old(m_pc))) && ((((((((((((T1_E == 0 || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || !(\old(t1_pc) == 1)) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M))) && ((((((((((((((((((T1_E == 0 || ((((token <= local && 2 <= m_st) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 0 == t1_st) && local <= token)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || !(\old(token) <= \old(local))) || !(\old(t1_pc) == 1)) || !(\old(local) <= \old(token))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || ((((((m_st == 0 && token <= local) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st) && local <= token) && !(m_pc == 1)) && \old(token) == token)) || !(2 <= \old(t1_st))) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M)) || ((((token <= local + 1 && m_st == 0) && local + 1 <= token) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st)) || 1 == \old(m_pc))) && ((((((((((((((((T1_E == 0 || ((((token <= local && 2 <= m_st) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 0 == t1_st) && local <= token)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || !(\old(token) <= \old(local))) || !(\old(t1_pc) == 1)) || !(\old(local) <= \old(token))) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_1)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M)) || ((((token <= local + 1 && m_st == 0) && local + 1 <= token) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st))) && (((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || 0 == \old(E_1)) || !(\old(t1_pc) == 1)) || 0 == \old(E_M)) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && ((((((((((((((((T1_E == 0 || ((((token <= local && 2 <= m_st) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 0 == t1_st) && local <= token)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || !(\old(t1_pc) == 1)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || T1_E == 1) || !(0 == \old(m_st))) || !(\old(local) + 1 <= \old(token))) || 1 == \old(E_1)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st)) || 0 == \old(E_1)) || !(\old(token) <= \old(local) + 1)) || 0 == \old(E_M)) || ((((token <= local + 1 && m_st == 0) && local + 1 <= token) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st))) && ((((((((((((((T1_E == 0 || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || \old(t1_pc) == 1) || (((((((!(1 == t1_pc) && 2 <= m_st) && !(M_E == 0)) && 2 <= t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && E_M == \old(E_M))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(0 == \old(m_st))) || T1_E == 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || ((((((!(1 == t1_pc) && m_st == 0) && 2 <= t1_st) && !(E_1 == 1)) && !(m_pc == 1)) && !(E_1 == 0)) && E_M == \old(E_M))) || 1 == \old(m_pc))) && ((((((((((((T1_E == 0 || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || 0 == M_E) || (((((((!(1 == t1_pc) && 2 <= m_st) && !(M_E == 0)) && 2 <= t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && E_M == \old(E_M))) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1 == E_M || 0 == __retres1) || !(2 <= t1_st)) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == E_M) || !(2 <= m_st)) || 0 == M_E) && ((((((((((((T1_E == 0 || 1 == E_M) || !(t1_pc == 1)) || !(2 <= m_st)) || 0 == __retres1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || !(local + 1 <= token)) || 0 == E_1) || 0 == E_M) || !(token <= local + 1))) && ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == m_pc) || 1 == M_E) || !(t1_st == 0))) && ((((((((((T1_E == 1 || T1_E == 0) || 0 == __retres1) || 1 == E_1) || 0 == E_1) || !(t1_pc == 1)) || 0 == E_M) || !(2 <= m_st)) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == E_M) || !(2 <= m_st)) || 0 == M_E) || 0 == __retres1) || 1 == m_pc)) && ((((((((((((T1_E == 0 || !(t1_pc == 1)) || 0 == __retres1) || 0 == M_E) || 1 == E_M) || !(2 <= t1_st)) || !(0 == m_st)) || T1_E == 1) || 1 == E_1) || !(local + 1 <= token)) || 0 == E_1) || 0 == E_M) || !(token <= local + 1))) && (((((((((((1 == E_M || !(2 <= t1_st)) || !(0 == m_st)) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == m_pc)) && (((((((((((T1_E == 0 || !(token <= local)) || !(local <= token)) || !(2 <= m_st)) || 0 == M_E) || !(t1_st == 0)) || 0 == __retres1) || 1 == E_M) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == E_M)) && ((((((((((((T1_E == 0 || 0 == __retres1) || !(token <= local)) || !(local <= token)) || 0 == M_E) || 1 == E_M) || !(2 <= t1_st)) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 1 == m_pc)) && (((((((((((((T1_E == 0 || 0 == __retres1) || !(token <= local)) || !(local <= token)) || t1_pc == 1) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 1 == m_pc)) && ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == __retres1) || 0 == E_M) || t1_pc == 1) || !(2 <= m_st)) || 0 == M_E) || !(t1_st == 0))) && ((((((((((1 == E_M || !(2 <= t1_st)) || T1_E == 1) || T1_E == 0) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((((1 == E_M || !(2 <= t1_st)) || T1_E == 1) || T1_E == 0) || !(token <= local)) || 0 == E_1) || !(t1_pc == 1)) || !(local <= token)) || 0 == E_M) || 0 == __retres1) || 0 == M_E) || 1 == M_E) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == 0 || ((((2 <= m_st && 2 <= t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0))) || ((((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && token <= local) && !(E_1 == 0)) && local <= token)) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || !(\old(local) + 1 <= \old(token))) || 0 == \old(E_1)) || 0 == E_M) || !(\old(token) <= \old(local) + 1)) && (((((((((((1 == E_M || !(2 <= \old(t1_st))) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || (((2 <= m_st && 2 <= t1_st) && !(E_1 == 1)) && !(E_1 == 0))) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && (((((((((((((T1_E == 0 || ((((2 <= m_st && 2 <= t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0))) || !(\old(token) <= \old(local))) || ((((((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && token <= local) && !(E_1 == 0)) && local <= token)) || !(\old(local) <= \old(token))) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || (((2 <= m_st && 0 == t1_st) && !(E_1 == 1)) && !(E_1 == 0))) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || !(\old(t1_st) == 0)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == 0 || !(\old(token) <= local)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || ((((m_st == 0 && !(E_M == 0)) && token <= \old(token) + 1) && local + 1 <= token) && !(E_M == 1))) || 0 == \old(E_M)) || ((2 <= m_st && !(E_M == 0)) && !(E_M == 1))) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || (2 <= m_st && E_M == \old(E_M))) || 0 == \old(E_M)) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E)) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || ((2 <= m_st && !(E_M == 0)) && !(E_M == 1))) || 0 == E_1) || 0 == \old(E_M)) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((((((T1_E == 0 || !(\old(token) <= local)) || !(local <= \old(token))) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || 0 == E_1) || (((m_st == 0 && token <= local) && E_M == \old(E_M)) && local <= token)) || 0 == \old(E_M)) || 1 == m_pc) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == 0 || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || (((((((((((!(T1_E == 1) && !(1 == t1_pc)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_M == 1))) && (((((((((((T1_E == 0 || ((((2 <= m_st && !(E_1 == 1)) && !(m_pc == 1)) && !(E_1 == 0)) && E_M == \old(E_M))) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && ((((((((((((((((((((T1_E == 0 || ((((token <= local && 2 <= m_st) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 0 == t1_st) && local <= token)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || \old(t1_pc) == 1) || 0 == M_E) || (((((((((!(1 == t1_pc) && m_st == 0) && 0 == t1_st) && !(E_1 == 1)) && !(m_pc == 1)) && \old(token) == token) && token <= local) && !(E_1 == 0)) && E_M == \old(E_M)) && local <= token)) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || ((((((m_st == 0 && token <= local) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st) && local <= token) && !(m_pc == 1)) && \old(token) == token)) || T1_E == 1) || !(0 == \old(m_st))) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || (((((((((((!(T1_E == 1) && !(1 == t1_pc)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && 0 == t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && E_M == \old(E_M)) && !(E_M == 1))) || ((((token <= local + 1 && m_st == 0) && local + 1 <= token) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st)) || 1 == \old(m_pc))) && ((((((((((((T1_E == 0 || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || !(\old(t1_pc) == 1)) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M))) && ((((((((((((((((((T1_E == 0 || ((((token <= local && 2 <= m_st) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 0 == t1_st) && local <= token)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || !(\old(token) <= \old(local))) || !(\old(t1_pc) == 1)) || !(\old(local) <= \old(token))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || ((((((m_st == 0 && token <= local) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st) && local <= token) && !(m_pc == 1)) && \old(token) == token)) || !(2 <= \old(t1_st))) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M)) || ((((token <= local + 1 && m_st == 0) && local + 1 <= token) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st)) || 1 == \old(m_pc))) && ((((((((((((((((T1_E == 0 || ((((token <= local && 2 <= m_st) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 0 == t1_st) && local <= token)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || !(\old(token) <= \old(local))) || !(\old(t1_pc) == 1)) || !(\old(local) <= \old(token))) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || 1 == \old(E_1)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M)) || ((((token <= local + 1 && m_st == 0) && local + 1 <= token) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st))) && (((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || 0 == \old(E_1)) || !(\old(t1_pc) == 1)) || 0 == \old(E_M)) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && ((((((((((((((((T1_E == 0 || ((((token <= local && 2 <= m_st) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 0 == t1_st) && local <= token)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || !(\old(t1_pc) == 1)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || T1_E == 1) || !(0 == \old(m_st))) || !(\old(local) + 1 <= \old(token))) || 1 == \old(E_1)) || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st)) || 0 == \old(E_1)) || !(\old(token) <= \old(local) + 1)) || 0 == \old(E_M)) || ((((token <= local + 1 && m_st == 0) && local + 1 <= token) && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && 2 <= t1_st))) && ((((((((((((((T1_E == 0 || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || \old(t1_pc) == 1) || (((((((!(1 == t1_pc) && 2 <= m_st) && !(M_E == 0)) && 2 <= t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && E_M == \old(E_M))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || !(0 == \old(m_st))) || T1_E == 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || ((((((!(1 == t1_pc) && m_st == 0) && 2 <= t1_st) && !(E_1 == 1)) && !(m_pc == 1)) && !(E_1 == 0)) && E_M == \old(E_M))) || 1 == \old(m_pc))) && ((((((((((((T1_E == 0 || ((2 <= m_st && (((((((!(T1_E == 0) && 1 == t1_pc) && !(T1_E == 1)) && !(M_E == 0)) && !(E_1 == 0)) && !(1 == M_E)) && !(E_1 == 1)) && !(E_M == 1)) && !(E_M == 0)) && !(m_pc == 1))) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || 0 == M_E) || (((((((!(1 == t1_pc) && 2 <= m_st) && !(M_E == 0)) && 2 <= t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && E_M == \old(E_M))) || 1 == M_E) || 1 == \old(E_M)) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == 0 || !(\old(token) <= local)) || !(local <= \old(token))) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token <= local) && E_M == \old(E_M)) && local <= token)) || 1 == m_pc) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || !(2 <= \old(m_st))) || ((((((((1 == t1_pc && !(T1_E == 1)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && !(E_M == 1))) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || (((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && E_M == \old(E_M))) || 0 == M_E) || 1 == M_E)) && (((((((((((((T1_E == 0 || !(\old(token) <= local)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || ((((((((1 == t1_pc && !(T1_E == 1)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(E_1 == 0)) && !(E_M == 1))) || 0 == M_E) || ((((1 == t1_pc && 2 <= m_st) && !(E_M == 0)) && 2 <= t1_st) && !(E_M == 1))) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || ((((((1 == t1_pc && m_st == 0) && !(E_M == 0)) && 2 <= t1_st) && token <= \old(token) + 1) && local + 1 <= token) && !(E_M == 1))) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == 0 || !(\old(token) <= local)) || !(local <= \old(token))) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || 1 == m_pc) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || !(2 <= \old(m_st))) || ((1 == t1_pc && 2 <= m_st) && E_M == \old(E_M))) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || \old(t1_pc) == 1) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E)) && (((((((((((T1_E == 0 || !(\old(token) <= local)) || !(local <= \old(token))) || !(2 <= \old(m_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_1) || ((((1 == t1_pc && 2 <= m_st) && token <= local) && E_M == \old(E_M)) && local <= token)) || 0 == E_1) || 0 == \old(E_M)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= m_st && (((!(T1_E == 1) && \old(T1_E) == T1_E) && (!(1 == t1_pc) && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_1 == 1)) && !(E_M == 1)) && E_M == \old(E_M)) && !(m_pc == 1)) || \old(T1_E) == 0) || ((((token <= local + 1 && !(E_M == 0) && !(E_1 == 1) && ((!(T1_E == 1) && \old(T1_E) == T1_E) && (1 == t1_pc && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 1)) && m_st == 0) && local + 1 <= token) && 2 <= t1_st)) || !(\old(token) <= \old(local))) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_1)) || (((((((!(E_M == 0) && !(E_1 == 1) && ((!(T1_E == 1) && \old(T1_E) == T1_E) && (1 == t1_pc && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 1)) && m_st == 0) && token <= local) && 2 <= t1_st) && local <= token) && !(m_pc == 1)) && \old(token) == token)) || ((((m_st == 0 && (((!(T1_E == 1) && \old(T1_E) == T1_E) && (!(1 == t1_pc) && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_1 == 1)) && !(E_M == 1)) && 2 <= t1_st) && E_M == \old(E_M)) && !(m_pc == 1))) || (((!(E_M == 0) && !(E_1 == 1) && ((!(T1_E == 1) && \old(T1_E) == T1_E) && (1 == t1_pc && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 1)) && 2 <= m_st) && !(m_pc == 1))) || !(\old(local) <= \old(token))) || (((((!(E_M == 0) && !(E_1 == 1) && ((!(T1_E == 1) && \old(T1_E) == T1_E) && (1 == t1_pc && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 1)) && token <= local) && 2 <= m_st) && 0 == t1_st) && local <= token)) || \old(t1_pc) == 1) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || (((((((m_st == 0 && token <= local) && (((!(T1_E == 1) && \old(T1_E) == T1_E) && (!(1 == t1_pc) && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_1 == 1)) && !(E_M == 1)) && 0 == t1_st) && E_M == \old(E_M)) && local <= token) && !(m_pc == 1)) && \old(token) == token)) || (((2 <= m_st && (((!(T1_E == 1) && \old(T1_E) == T1_E) && (!(1 == t1_pc) && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_1 == 1)) && !(E_M == 1)) && 0 == t1_st) && E_M == \old(E_M))) || 0 == \old(E_1)) || 0 == \old(E_M)) || (((!(E_M == 0) && !(E_1 == 1) && ((!(T1_E == 1) && \old(T1_E) == T1_E) && (1 == t1_pc && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 1)) && 2 <= m_st) && 2 <= t1_st)) || (((2 <= m_st && (((!(T1_E == 1) && \old(T1_E) == T1_E) && (!(1 == t1_pc) && !(1 == M_E)) && (!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_1 == 1)) && !(E_M == 1)) && 2 <= t1_st) && E_M == \old(E_M))) || 1 == \old(m_pc) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == 0 || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || 1 == \old(m_pc)) && ((((((((((1 == E_M || !(2 <= \old(t1_st))) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && (((((((((((T1_E == 0 || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || T1_E == 1) || !(\old(local) + 1 <= \old(token))) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(\old(token) <= \old(local) + 1)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || !(\old(t1_st) == 0))) && ((((((((((((T1_E == 0 || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || !(\old(local) + 1 <= \old(token))) || ((((token <= local + 1 && 2 <= t1_st) && \old(token) == token) && local + 1 <= token) && E_1 == \old(E_1))) || 0 == \old(E_1)) || 0 == E_M) || !(\old(token) <= \old(local) + 1)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || __retres1 == 0) || 0 == E_M) || !(2 <= m_st)) || 0 == M_E) || 1 == m_pc) && ((((((((((((T1_E == 0 || !(t1_pc == 1)) || __retres1 == 0) || 0 == M_E) || 1 == E_M) || !(2 <= t1_st)) || !(0 == m_st)) || T1_E == 1) || 1 == E_1) || !(local + 1 <= token)) || 0 == E_1) || 0 == E_M) || !(token <= local + 1))) && ((((((((((1 == E_M || __retres1 == 0) || !(2 <= t1_st)) || T1_E == 1) || T1_E == 0) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((((1 == E_M || !(2 <= t1_st)) || !(0 == m_st)) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || __retres1 == 0) || 0 == M_E) || 1 == m_pc)) && ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == E_1) || __retres1 == 0) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || !(2 <= m_st)) || 0 == M_E) || !(t1_st == 0))) && (((((((((((T1_E == 1 || T1_E == 0) || 0 == E_1) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || !(0 == m_st)) || 1 == E_1) || !(local + 1 <= token)) || __retres1 == 0) || 0 == E_M) || !(token <= local + 1))) && ((((((((((((T1_E == 0 || !(token <= local)) || !(t1_pc == 1)) || !(local <= token)) || __retres1 == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || 1 == E_1) || !(2 <= t1_st)) || T1_E == 1) || 0 == E_1) || 0 == E_M)) && (((((((((((T1_E == 0 || !(token <= local)) || !(local <= token)) || !(2 <= m_st)) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == E_M) || __retres1 == 0)) && (((((((((T1_E == 1 || T1_E == 0) || 0 == E_1) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || 1 == E_1) || 0 == E_M) || __retres1 == 0) || !(2 <= m_st))) && (((((((((1 == E_M || !(2 <= t1_st)) || T1_E == 1) || T1_E == 0) || 1 == E_1) || __retres1 == 0) || 0 == E_1) || 0 == E_M) || !(2 <= m_st)) || 0 == M_E)) && ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || __retres1 == 0) || 0 == M_E) || 1 == m_pc) || 1 == M_E) || !(t1_st == 0))) && ((((((((((((T1_E == 0 || __retres1 == 0) || !(token <= local)) || !(local <= token)) || 0 == M_E) || 1 == E_M) || !(2 <= t1_st)) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 1 == m_pc)) && (((((((((((((T1_E == 0 || !(token <= local)) || !(local <= token)) || t1_pc == 1) || __retres1 == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 1 == m_pc) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((((((((\old(T1_E) == 0 || !(M_E == 0)) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || \old(t1_pc) == 1) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((((((((!(m_pc == 1) || T1_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || T1_E == 1) || !(\old(local) + 1 <= \old(token))) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(\old(token) <= \old(local) + 1)) || 0 == E_M) || 1 == \old(m_pc)) && (((((((((((((T1_E == 0 || !(\old(token) <= \old(local))) || !(t1_pc == 1)) || !(\old(local) <= \old(token))) || 0 == M_E) || 1 == M_E) || (((((2 <= t1_st && !(m_pc == 1)) && \old(token) == token) && E_1 == \old(E_1)) && token <= local) && local <= token)) || 1 == E_M) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || ((0 == t1_st && !(m_pc == 1)) && E_1 == \old(E_1))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || !(\old(t1_st) == 0))) && (((((((((((1 == E_M || !(2 <= \old(t1_st))) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || ((2 <= t1_st && !(m_pc == 1)) && E_1 == \old(E_1)))) && ((((((((((((T1_E == 0 || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(2 <= \old(t1_st))) || T1_E == 1) || 1 == \old(E_1)) || !(\old(local) + 1 <= \old(token))) || ((((token <= local + 1 && 2 <= t1_st) && \old(token) == token) && local + 1 <= token) && E_1 == \old(E_1))) || 0 == \old(E_1)) || 0 == E_M) || !(\old(token) <= \old(local) + 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. SAFE Result, 45.4s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 37.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 2989 SDtfs, 3416 SDslu, 3009 SDs, 0 SdLazy, 2671 SolverSat, 1050 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 242 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=797occurred in iteration=13, 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: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 327 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 2040 PreInvPairs, 2575 NumberOfFragments, 22337 HoareAnnotationTreeSize, 2040 FomulaSimplifications, 147625 FormulaSimplificationTreeSizeReduction, 3.2s HoareSimplificationTime, 62 FomulaSimplificationsInter, 103692 FormulaSimplificationTreeSizeReductionInter, 34.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1574 NumberOfCodeBlocks, 1574 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1558 ConstructedInterpolants, 0 QuantifiedInterpolants, 260954 SizeOfPredicates, 0 NumberOfNonLiveVariables, 703 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 345/350 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...